加减乘除（高精度）

注意，本题目需要输出余数别被样例骗了

#include<bits/stdc++.h> using namespace std; #define N 10005 string s1; long long s2,mod,n1[N],n2[N],ns[N]; string Div(string a,long long b){ int l1=a.length(),len; memset(ns,0,sizeof(ns)); for(int i=0;i<l1;++i) n1[i]=a[i]-'0'; len =l1; mod=0; string ans=""; for(int i=0;i<=len-1;++i){ mod=mod*10+n1[i]; ans+=mod/b+'0'; mod%=b; } for(int i=0;i<len;++i){ if(ans[i]!='0'){ ans=ans.substr(i); break; } } return ans; } int main(){ cin>>s1>>s2; cout<<Div(s1,s2)<<endl; cout<<mod<<endl; return 0; }

a = int(input()) b = int(input()) c = a//b print(c)

#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll N=1e5+5; string s; int len; ll m,n; int main(){ //第一步 输入字符串 cin>>s>>m; len=s.length(); bool flag=0; for(int i=0;i<len;i++){ n=n*10+(s[i]-'0'); if(flag0&&n/m0){ continue; } flag=1; cout<<n/m; n%=m; } if(flag==0) cout<<"0"; cout<<endl<<n; return 0; }