第二题就是个高精度除法。花15分钟写一下高精除低精就是70分啊。。。高精除高精,我们把除法变成多次减法来做。复杂度是 O(10nm) 的
#include <cstdio>
#include <cstring>
#define N 10010
char s1[N],s2[210];
int a[N],b[210],res[N];
int n,m;
void solve(){
int x=0,y=0,st=0;bool flag=0;
for(int i=1;i<=m;++i) y=y*10+b[i];
for(int i=1;i<=n;++i){
x=x*10+a[i];
res[i]=x/y;if(res[i]!=0&&!flag) st=i,flag=1;
x=x%y;
}
for(int i=st;i<=n;++i) printf("%d",res[i]);
puts("");
printf("%d\n",x);
}
inline bool jud(int st,int ed){
if(ed-st+1<m) return 0;
if(ed-st+1>m) return 1;
for(int i=st;i<=ed;++i){
if(a[i]>b[i-st+1]) return 1;
if(a[i]<b[i-st+1]) return 0;
}
}
int minus(int st,int ed){
bool flag=0;
for(int i=m;i>=0;--i){
a[i-m+ed]-=flag;
if(a[i-m+ed]<b[i]) flag=1,a[i-m+ed]=a[i-m+ed]+10-b[i];
else flag=0,a[i-m+ed]=a[i-m+ed]-b[i];
}
while(a[st]==0) st++;
return st;
}
void solve2(){
int st=1;
for(int i=m;i<=n;++i){
while(jud(st,i)) st=minus(st,i),res[i]++;
}
int x=1;while(res[x]==0) x++;
for(int i=x;i<=n;++i) printf("%d",res[i]);puts("");
for(int i=st;i<=n;++i) printf("%d",a[i]);
}
int main(){
freopen("b.in","r",stdin);
freopen("b.out","w",stdout);
scanf("%s%s",s1+1,s2+1);
n=strlen(s1+1);m=strlen(s2+1);
for(int i=1;i<=n;++i) a[i]=s1[i]-'0';
for(int i=1;i<=m;++i) b[i]=s2[i]-'0';
if(m<=9){
solve();return 0;
}
else solve2();
return 0;
}