label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
32
|
15500
|
int main()
{
int n,l;
char j[100],b[100];
char m[10]={'0','1','2','3','4','5','6','7','8','9'};
char d[100];
int nj,nb,yj,yb;
int i,ii;
scanf("%d",&n);
for(l=0;l<n;l++)
{
scanf("%s\n",j);
scanf("%s",b);
nj=0;
nb=0;
for(i=0;j[i];i++)
{ nj++;
d[i]='0';}
for(i=0;b[i];i++)
nb++;
for(i=nj-1;i>=nj-nb;i--)
b[i]=b[i-nj+nb];
for(i=0;i<nj-nb;i++)
b[i]='0';
for(i=nj-1;i>=0;i--)
{
yj=j[i]-'0';
yb=b[i]-'0';
if(yj-yb>=0)
d[i]=m[yj-yb];
if(yj-yb<0)
{ d[i]=m[yj-yb+10];
int p,pp,cp,k;
for(p=i-1;p>=0;p--)
{
if(j[p]!='0')
{ pp=p;
break;}
}
cp=j[pp]-'0';
j[pp]=m[cp-1];
for(k=i-1;k>pp;k--)
j[k]='9';
}
}
for(i=0;i<nj-1;i++)
{
ii=nj-1;
if(d[i]!='0')
{ii=i;
break;}
}
for(i=ii;i<nj-1;i++)
printf("%c",d[i]);
printf("%c\n",d[nj-1]);
}
return 0;
}
|
32
|
15501
|
void main()
{
char a[10][100],b[10][100];
int i,j,m=0,n,lena[10],lenb[10],a1[10][100]={0},b1[10][100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a[i],b[i]);
printf("\n");
lena[i]=strlen(a[i]);
lenb[i]=strlen(b[i]);
for(j=lena[i]-1;j>=0;j--)
{
a1[i][m]=a[i][j]-'0';
m++;
}
m=0;
for(j=lenb[i]-1;j>=0;j--)
{
b1[i][m]=b[i][j]-'0';
m++;
}
m=0;
for(j=0;j<lena[i];j++)
{
a1[i][j]=a1[i][j]-b1[i][j];
if(a1[i][j]<0)
{
a1[i][j]=a1[i][j]+10;
a1[i][j+1]=a1[i][j+1]-1;
}
}
for(j=lena[i]-1;j>=0;j--)
{
printf("%d",a1[i][j]);
}
printf("\n");
}
}
|
32
|
15502
|
void main()
{
int n,m,i,j,la,lb;
char a[101],b[101],c[101],r[100][101];
scanf("%d",&n);
for(m=0;m<n;m++)
{
scanf("%s %s",a,b);
la=strlen(a);
lb=strlen(b);
for(i=0;i<la-lb;i++)
c[i]='0';
c[i]=0;
strcat(c,b);
r[m][la]=0;
for(i=la-1;i>=0;i--)
{
if(a[i]>=c[i]) r[m][i]=a[i]-c[i]+'0';
else
{
r[m][i]=a[i]+10-c[i]+'0';
for(j=i-1;;j--)
{if(a[j]>'0') {a[j]--;break;}
else a[j]='9';
}
}
}
}
for(m=0;m<n;m++)
printf("%s\n",r[m]);
}
|
32
|
15503
|
int p1,p2,p3,i,n,j;
char a[1000];
char b[1000];
char c[1000];
int max(int a,int b)
{
if (a>b) return a;else return b;
}
int za(int m)
{
if (m<0) return 0;else return a[m]-'0';
}
int zb(int m)
{
if (m<0) return 0;else return b[m]-'0';
}
int main()
{
cin>>n;
for (j=1;j<=n;j++)
{
for (i=0;i<=999;i++) {a[i]='\0';b[i]='\0';c[i]='\0';}
cin>>a;
cin>>b;
p1=0;while(a[p1]!='\0')p1++;p1--;
p2=0;while(b[p2]!='\0')p2++;p2--;
c[0]=0;
for (i=0;i<=max(p1,p2)+1;i++) c[i]=za(p1-i)-zb(p2-i);
for (i=0;i<=max(p1,p2)+1;i++)
{
c[i+1]+=(c[i]+10)/10-1;
c[i]=(c[i]+10)%10;
}
p3=900;while((c[p3]==0)&&(p3>=0))p3--;
for (i=p3;i>=0;i--) cout<<(int)c[i];
if (p3<=0) cout<<0;
cout<<endl;
}
return 0;
}
|
32
|
15504
|
int main()
{
char a[100],b[100];
int n,i,j,k;
cin>>n;
for (i=1;i<=n;i++)
{
cin>>a;
cin>>b;
for (j=strlen(a)-1,k=strlen(b)-1;k>=0;j--,k--)
{
if (a[j]>=b[k])
a[j]=a[j]-b[k]+'0';
else
{
a[j]=a[j]+10-b[k]+'0';
a[j-1]--;
}
}
for (j=0;j<=strlen(a)-1;j++)
if (a[j]!='0')
{
for (k=j;k<=strlen(a)-1;k++)
cout<<a[k];
break;
}
if (j==strlen(a)&&a[j-1]=='0')
cout<<"0";
cout<<endl;
}
return 0;
}
|
32
|
15505
|
int yu(char y)
{
int b;
if (y=='0') b=0;
if (y=='1') b=1;
if (y=='2') b=2;
if (y=='3') b=3;
if (y=='4') b=4;
if (y=='5') b=5;
if (y=='6') b=6;
if (y=='7') b=7;
if (y=='8') b=8;
if (y=='9') b=9;
return (b);
}
void main()
{
char a[20][103],b[20][103];
int i,j,k,n,c[20],d[20],e[20][103],f[20][103],m;
{for (i=0;i<20;i++)
{ for(j=0;j<103;j++)
{a[i][j]='\0'; b[i][j]='\0';}}}
scanf("%d",&n);
printf("\n");
for (i=0;i<n;i++)
{scanf("%s",a[i]);printf("\n");scanf("%s",b[i]);printf("\n\n");}
{for (i=0;i<n;i++)
{for(j=0;j<(c[i]=strlen(a[i]));j++)
e[i][j]=yu(a[i][j]);
for(j=0;j<(d[i]=strlen(b[i]));j++)
f[i][j]=yu(b[i][j]);}}
for (i=0;i<n;i++)
for (j=(c[i]-1);j>=(c[i]-d[i]);j--)
{k=(j-c[i]+d[i]);
if (e[i][j]>f[i][k]) e[i][j]=(e[i][j]-f[i][k]);
else if (e[i][j]==f[i][k]) e[i][j]=0;
else if (e[i][j]<f[i][k]) {e[i][j]=(e[i][j]+10-f[i][k]);
{for (m=(j-1);e[i][m]==0;m--) e[i][m]=9;}
e[i][m]=(e[i][m]-1);}
}
for (i=0;i<n;i++)
{j=0; while (e[i][j]==0) j++;for (;j<c[i];j++) printf("%d",e[i][j]); printf("\n");}
}
|
32
|
15506
|
main()
{
int x,y,i,j,n;
char test1[100];
char test2[100];
char a[100];
char b[100];
char c[100];
scanf("%d",&n);
for(j=0;j<n;j++)
{ scanf("%s",test1);
x=strlen(test1);
for(i=0;i<x;i++)
a[i]=test1[x-i-1];
for(i=x;i<100;i++)
a[i]='0';
scanf("%s",test2);
y=strlen(test2);
for(i=0;i<y;i++)
b[i]=test2[y-i-1];
for(i=y;i<100;i++)
b[i]='0';
for(i=0;i<x;i++)
{
if(a[i]>=b[i])
c[i]=a[i]-b[i]+'0';
else
{
c[i]=a[i]-b[i]+10+'0';
a[i+1]=a[i+1]-1;
}
}
for(i=x-1;i>=0;i--)
printf("%c",c[i]);
printf("\n");
}
}
|
32
|
15507
|
int main()
{
const int ma=200,mx=50;
int i,n,k,j;
int len1[ma]={0},len2[ma]={0};
int zs1[mx][ma]={0},zs2[mx][ma]={0},ans[mx][ma]={0};
char num1[mx][ma]={0},num2[mx][ma]={0};
cin>>n;
for(k=0;k<n;k++)
{
cin.get();
cin.getline(num1[k],ma);
cin.getline(num2[k],ma);
len1[k]=strlen(num1[k]);
len2[k]=strlen(num2[k]);
}
for(k=0;k<n;k++)
{
j=0;
for(i=len1[k]-1;i>=0;i--)
zs1[k][j++]=num1[k][i]-'0';
j=0;
for(i=len2[k]-1;i>=0;i--)
zs2[k][j++]=num2[k][i]-'0';
for(i=0;i<len1[k];i++)
{
if(i<len2[k])
{
if(zs1[k][i]<zs2[k][i])
{
zs1[k][i]=zs1[k][i]+10;
zs1[k][i+1]=zs1[k][i+1]-1;
ans[k][i]=zs1[k][i]-zs2[k][i];
}
else
ans[k][i]=zs1[k][i]-zs2[k][i];
}
else
ans[k][i]=zs1[k][i]-zs2[k][i];
}
}
for(k=0;k<n;k++)
{
if(ans[k][len1[k]]==0)
len1[k]=len1[k]-1;
for(i=len1[k];i>=0;i--)
{
cout<<ans[k][i];
}
cout<<endl;
}
return 0;
}
|
32
|
15508
|
void main()
{
int n,i,j,length1,length2,cha;
scanf("%d",&n);
char beijianshu[101],jianshu[101];
for(i=0;i<n;i++)
{
scanf("%s",beijianshu);
scanf("%s",jianshu);
length1=strlen(beijianshu);
length2=strlen(jianshu);
for(j=1;j<=length2;j++)
{
cha=beijianshu[length1-j]-jianshu[length2-j];
if(cha>=0)
beijianshu[length1-j]=cha+'0';
else
{
beijianshu[length1-j-1]--;
beijianshu[length1-j]=10+cha+'0';
}
}
while(beijianshu[length1-j]<'0')
{
beijianshu[length1-j]+=10;
j++;
beijianshu[length1-j]-=1;
}
printf("%s\n",beijianshu);
}
}
|
32
|
15509
|
void main()
{
int n,i,j,k,t,r,c[100];
char a[100],b[100];
scanf("%d",&n);
while(n--)
{
scanf("%s",a);
scanf("%s",b);
r=strlen(a);
t=strlen(b);
for(i=0;i<r;i++)
a[i]=a[i]-'0';
for(i=0;i<t;i++)
b[i]=b[i]-'0';
for(i=r-1,j=t-1;j>=0;i--,j--)
{
if(a[i]>=b[j])
c[i]=a[i]-b[j];
else
{
a[i-1]=a[i-1]-1;
c[i]=a[i]+10-b[j];
}
}
for(i=0;i<r-t;i++)
c[i]=a[i];
for(i=r-1;i>0;i--)
{
if(c[i]<0)
{
c[i-1]=c[i-1]-1;
c[i]=c[i]+10;
}
}
if(c[0]>0)
printf("%d",c[0]);
for(i=1;i<r-1;i++)
printf("%d",c[i]);
printf("%d\n",c[r-1]);
}
}
|
32
|
15510
|
void main()
{
char str1[100],str2[100],a[100];
int i,l1,l2,l,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",str1,str2);
l2=strlen(str2);
l1=strlen(str1);
l=l1-l2;
for(j=l2-1;j>=0;j--)
{
if(str1[l+j]>=str2[j])
a[l+j]=str1[l+j]-str2[j];
else
{
a[l+j]=str1[l+j]+10-str2[j];
str1[l+j-1]=str1[l+j-1]-1;
}
}
for(j=0;j<l;j++)
a[j]=str1[j]-48;
for(j=0;j<l1;j++)
printf("%d",a[j]);printf("\n");
}
}
|
32
|
15511
|
void main()
{
int n,i,j,k,m[60],l[30];
char a[30][100];
scanf("%d",&n);
for(i=0;i<2*n;i++)
scanf("%s",a[i]);
for(i=0;i<2*n;i++)
m[i]=strlen(a[i]);
for(i=0;i<n;i++)
l[i]=m[2*i]-m[2*i+1];
for(i=0;i<n;i++)
{
for(j=m[2*i+1]-1;j>=0;j--)
{
if(a[2*i+1][j]<=a[2*i][j+l[i]])
a[2*i][j+l[i]]=a[2*i][j+l[i]]-a[2*i+1][j]+'0';
else
{
a[2*i][j-1+l[i]]=a[2*i][j-1+l[i]]-1;
a[2*i][j+l[i]]=a[2*i][j+l[i]]-a[2*i+1][j]+10+'0';
}
}
}
for(i=0;i<n;i++)
printf("%s\n",a[2*i]);
}
|
32
|
15512
|
void f(char a[100],char b[100])
{
int n1[100]={0},n2[100]={0},n3[100]={0};
int i,j,k,t;
// ?a[100]????n1[100]
{i=99;
while(a[i]==0)
i=i-1;}
{j=99;
while(j>=99-i)
{a[j]=a[i+j-99];j--;}}
k=0;
while(k<=98-i)
{a[k]='0';k++;}
for(t=0;t<=99;t++)
n1[t]=a[t]-48;
//?b[100]????n2[100]
{i=99;
while(b[i]==0)
i=i-1;}
{j=99;
while(j>=99-i)
{b[j]=b[i+j-99];j--;}}
k=0;
while(k<=98-i)
{b[k]='0';k++;}
for(t=0;t<=99;t++)
n2[t]=b[t]-48;
//?n1?n2?n3
i=99;
while(i>=0)
{n3[i]=n1[i]-n2[i];
i--;}
for(j=99;j>=1;j--)
{if(n3[j]<0)
{n3[j]=n3[j]+10;k=j-1;
n3[k]=n3[k]-1;
}}
j=1;
while(n3[j]==0)j++;printf("\n");
//????
i=j;
while(i<=99)
{printf("%d",n3[i]);
i++;}
for(i=0;i<100;i++){n1[i]=0;n2[i]=0;n3[i]=0;}
}
void main()
{
char tt[100][100]={0},uu[100][100]={0},tet[100][100]={0},iii[100][100]={0};
int n,i;
char a[10][100]={{0}},b[10][100]={{0}};char x[100]={0},y[100]={0},x1[100]={0},y1[100]={0};printf("%s",a[0]);
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s",a[i]);scanf("%s",b[i]);}
for(i=0;i<n;i++)
f(a[i],b[i]);
}
|
32
|
15513
|
/********************************
*????? *
* *
* Created on: 2010-12-24 *
* Author: ?? *
********************************/
int main()
{
char a[101],b[101]; //????????????????
int n;
cin>>n; //?????????
while(n>0)
{
cin.getline(a,101);
cin.getline(a,101); //???????
cin.getline(b,101);
int k=strlen(a)-1;
for(int i=strlen(b)-1;i>=0;i--) //????????????
{
if(a[k]>=b[i])
{
a[k]=a[k]-b[i]+48; //?????????????????
}
else
{
a[k]=a[k]+10-b[i]+48; //?????????
int j=1;
while(true)
{
if(a[k-j]!='0')
{
a[k-j]=a[k-j]-1;
break;
}
else
{
a[k-j]='9';
j++;
}
}
}
k--;
}
cout<<a<<endl; //????????
n--;
}
return 0;
}
|
32
|
15514
|
void turn(char str[100])
{
int n,i,t;
n=strlen(str);
for(i=0;i<=(n-1)/2;i++)
{
t=str[i];
str[i]=str[n-i-1];
str[n-i-1]=t;
}
}
int min(int x,int y)
{
int z;
if(x>=y)
z=y;
else
z=x;
return(z);
}
void miner(char str1[100],char str2[100],char str3[100])
{
int t,i,m,n;
m=strlen(str1);
n=strlen(str2);
t=min(m,n);
for(i=0;i<t;i++)
{
if(str1[i]>=str2[i])
str3[i]=str1[i]-str2[i]+48;
else
{
str3[i]=str1[i]+10-str2[i]+48;
str1[i+1]--;
str3[i+1]--;
}
}
}
void main()
{
char a[100],b[100],t[2],c[100];
int n,i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
gets(t);
gets(a);
gets(b);
turn(a);
turn(b);
strcpy(c,a);
miner(a,b,c);
turn(c);
puts(c);
}
}
|
32
|
15515
|
void main()
{
int n,m;
int i=0,j=0;
char a[100][100],b[100][100],c[100][100]={0};
int len1,len2;
scanf("%d",&n);
for(m=0;m<n;m++)
{
scanf("%s %s",a[m],b[m]);
len1=strlen(a[m]);
len2=strlen(b[m]);
for(i=len1-1,j=len2-1;i>=len1-len2,j>=0;i--,j--)
{
if(a[m][i]-b[m][j]>=0)
{
c[m][i]=a[m][i]-b[m][j]+'0';
}
else
{
a[m][i-1]=a[m][i-1]-'1'+'0';
c[m][i]=a[m][i]-b[m][j]+'0'+10;
}
}
for(i=len1-len2-1;i>=0;i--)
{
if(a[m][i]>=0)
{
c[m][i]=a[m][i];
}
else
{
a[m][i-1]=a[m][i-1]-'1'+'0';
c[m][i]=a[m][i]+'0'+10;
}
}
}
for(m=0;m<n;m++)
{
printf("%s\n",c[m]);
}
}
|
32
|
15516
|
void main()
{
int n,la,lb,length,i,s,j;
char a[100],b[100];
int aArray[100],bArray[100];
scanf("%d",&n);
for(s=1;s<=n;s++)
{
scanf("%s",a);
scanf("%s",b);
la=strlen(a);
lb=strlen(b);
length=la-lb;
for(i=0;i<la;i++)
aArray[i]=a[i]-'0';
for(i=0;i<length;i++)
bArray[i]=0;
for(i=length;i<la;i++)
bArray[i]=b[i-length]-'0';
for(i=la-1;i>=0;i--)
{
if(aArray[i]>=bArray[i])a[i]=aArray[i]-bArray[i];
if(aArray[i]<bArray[i])
{a[i]=aArray[i]+10-bArray[i];aArray[i-1]--;}
}
for(i=0;i<la;i++)
a[i]=a[i]+48;
for(i=0;i<la;i++)
{
if(a[i]!=0)
for(j=i;j<la;j++)
printf("%c",a[j]);
printf("\n");
break;
}
}
}
|
32
|
15517
|
int main()
{ int n;
cin>>n;
for(int t=0;t<n;t++)
{cin.get();
const int MAX_LEN = 200;
int an1[MAX_LEN]; int an2[MAX_LEN];
char seLine1[MAX_LEN + 1]; char seLine2[MAX_LEN + 1];
cin.getline(seLine1, MAX_LEN + 1);
cin.getline(seLine2, MAX_LEN + 1);
int nLen1 = strlen(seLine1);
int nLen2 = strlen(seLine2);
//cout<<seLine1<<endl<<seLine2<<endl;
memset(an1, 0, sizeof(an1));
memset(an2, 0,sizeof(an2));
int i, j=0;
for (i = nLen1-1; i>=0; i--)
an1[j++] = seLine1[i] - '0';
j=0;
for (i = nLen2-1; i>=0;i--)
an2[j++] = seLine2[i] - '0';
for (i = 0; i < MAX_LEN ;i++)
{
//printf("%d %d %d ",i, an1[i], an2[i]);
if(an1[i]>=an2[i])
an1[i]-=an2[i];
else{
an1[i]=10+an1[i]-an2[i];
an1[i+1]-=1;
}
//printf("aa%d %d\n", i, an1[i]);
}
i = MAX_LEN - 1;
while(an1[i]==0) i--;
//cout<<i<<endl;
for(;i >= 0; i--)
cout << an1[i];
cout << endl;
}
return 0;
}
|
32
|
15518
|
int an1[100];
int an2[100];
char szLine1[100];
char szLine2[100];
void main()
{
int n,p,i,j,nLen1,nLen2,max=0;;
scanf("%d",&n);
for(p=0;p<n;p++)
{
scanf("%s",szLine1);
scanf("%s",szLine2);
memset(an1,0,sizeof(an1));
memset(an2,0,sizeof(an2));
nLen1=strlen(szLine1);
j=0;
for(i=nLen1-1;i>=0;i--)
{
an1[j++]=szLine1[i]-'0';
}
nLen2=strlen(szLine2);
j=0;
for(i=nLen2-1;i>=0;i--)
{
an2[j++]=szLine2[i]-'0';
}
if(nLen1>nLen2)
max=nLen1-1;
else
max=nLen2;
for(i=0;i<max;i++)
{
an1[i]-=an2[i];
if(an1[i]<0)
{
an1[i]+=10;
an1[i+1]--;
}
}
for(i=max;i>=0;i--)
printf("%d",an1[i]);
printf("\n");
}
}
|
32
|
15519
|
//**************************
//* ????????? *
//* ? ????? *
//* ? ??1000012738 *
//* ? ??2010.11.20 *
//**************************
int main()
{
char a[101], b[101]; //?????????????
int c, d, n, i, j, k; //??????
cin >> n; //??????
for(i = 0; i < n; i ++)
{
cin >> a >> b; //?????
c = strlen(a); //????
d = strlen(b);
int numa[100] = {0}; //????????????
int numb[100] = {0};
k = 0; //?????
for(j = c - 1; j >=0; j --) //??????
{
numa[k ++] = a[j] - '0';
}
k = 0;
for(j = d - 1; j >= 0; j --)
{
numb[k ++] = b[j] - '0';
}
for(j = 0; j <= d; j ++) //???????
{
numa[j] -= numb[j];
if(numa[j] < 0) //????????
{
numa[j] += 10; //????
numa[j + 1] --;
}
}
j = c;
while(numa[j] == 0) //?????????0??
j --;
for( ; j >= 0; j --) //??
cout << numa[j];
cout << endl; //??
}
return 0;
}
|
32
|
15520
|
void main()
{
int n,i,j,t,len1,len2;int k=0;
char a[100],b[100],str3[100];
int c[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",a,b);
len1=strlen(a);
len2=strlen(b);
t=0;
for(j=1;j<=len2;j++)
{
c[j]=t+a[len1-j]-b[len2-j]+10*(a[len1-j]+t<b[len2-j]);
t=-1*(a[len1-j]-b[len2-j]+t<0);
}
if(len1-len2-1>=0)
{
for(j=len2+1;j<=len1;j++)
{
c[j]=t+a[len1-j]-48+10*(a[len1-j]-48+t<0);
t=-1*(a[len1-j]-48+t<0);
}
}
k=0;
for(j=len1;j>=1;j--)
{
if(c[j]==0)
k++;
else break;
}
for(j=len1-k;j>=1;j--)
printf("%d",c[j]);
printf("\n");
}
}
|
32
|
15521
|
void main()
{
int n, i, j, ta, tb, t;
char a[50][100]={""}, b[50][100]={""}, blank[3];
scanf("%d\n", &n);
for(i=0; i<n; i++)
{
gets(a[i]);
gets(b[i]);
gets(blank);
}
for(i=0; i<n; i++)
{
ta = 0;
tb = 0;
for(j=0; a[i][j]!='\0'; j++)
ta++;
for(j=0; b[i][j]!='\0'; j++)
tb++;
for(j=tb-1; j>=0; j--)
{
if(a[i][ta-tb+j]<b[i][j])
{
a[i][ta-tb+j] = a[i][ta-tb+j]+10-b[i][j]+48;
for(t=ta-tb+j-1; t>=0; t--)
{
if(a[i][t]>48)
{
a[i][t]--;
break;
}
else
{
a[i][t] = 57;
}
}
}
else
a[i][ta-tb+j] = a[i][ta-tb+j]-b[i][j]+48;
}
}
for(i=0; i<n; i++)
{
puts(a[i]);
}
}
|
32
|
15522
|
void main()
{
char a[101],b[101];
int n,i,k,j,c[101],l1,l2;
scanf("%d",&n);
for (i=0;i<n;i++)
{
for (j=0;j<=100;j++) c[j]=0;
scanf("%s",a);
scanf("%s",b);
l1=strlen(a);
l2=strlen(b);
for (j=100;j>=101-l1;j--) a[j]=a[l1-101+j]-'0';
for (j=100;j>=101-l2;j--) b[j]=b[l2-101+j]-'0';
for (j=0;j<101-l1;j++) a[j]=0;
for (j=0;j<101-l2;j++) b[j]=0;
for (j=100;j>=100-((l1>l2)?l1:l2);j--)
{
c[j]+=a[j]-b[j];
if (c[j]<0) {c[j]=c[j]+10; c[j-1]--;}
}
j=0;
while (c[j]==0) j++;
for (k=j;k<=100;k++) printf("%d",c[k]);
printf("\n");
}
}
|
32
|
15523
|
main()
{
char a[10][100],b[10][100];
int i,j,n,k,l=0;
scanf("%d",&n);
getchar();
for(i=0;i<n-1;i++)
{
gets(a[i]);
gets(b[i]);
getchar();
}
gets(a[n-1]);
gets(b[n-1]);
for(i=0;i<n;i++)
{
k=strlen(a[i]);
l=strlen(b[i]);
for(j=0;j<l;j++)
{
if(a[i][k-j-1]<b[i][l-j-1])
{
a[i][k-j-1]=a[i][k-j-1]+10-b[i][l-j-1]+'1'-1;
a[i][k-j-2]--;
}
else
a[i][k-j-1]=a[i][k-j-1]-b[i][l-j-1]+'1'-1;
}
for(j=0;j<k;j++)
printf("%c",a[i][j]);
printf("\n");
}
}
|
32
|
15524
|
/*************************
??cpp4
?????
???
2013/11/14
**************************/
int main()
{
int m, n, i, j, k , c[102]={0}, d[102]={0}, e[102]={0} ,l1, l2;
char a[102], b[102];
cin >> n;
cin.get();
for (i=1; i<=n; i++)
{
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
memset(d, 0, sizeof(d));
memset(e, 0, sizeof(e));
cin.getline(a,100);
cin.getline(b,100);
cin.get();
l1 = strlen (a);
l2 = strlen (b);
for (j = l1-1, k=0; j>=0, k<= l1-1; j--, k++)
c[k] = a[j] - '0';
for (j = l2-1, k=0; j>=0, k<= l2-1 ; j--, k++)
d[k] = b[j] -'0';
for (j=0; j<=101; j++)
{
if (c[j]<d[j])
{
e[j]= c[j]+10-d[j];
c[j+1]--;
}
else
e[j] = c[j]-d[j];
}
for(j=101; e[j]== 0 ; j--)
m=j;
for (k=m-1; k>=0; k--)
cout << e[k];
cout << endl;
}
return 0;
}
|
32
|
15525
|
int str2(char*str,int*a)
{
int length=(int)strlen(str);
int i;
for(i=0;i<length;i++)
a[length-i-1]=str[i]-'0';
return length;
}
void print_b(int*a,int length)
{
int t=length-1;
int i;
while(a[t]==0 && t>0)
t--;
for(i=t;i>=0;i--)
printf("%d",a[i]);
}
int sub_b(int*a,int alength,int*b,int blength,int*c)
{
int i;
for(i=0;i<alength;i++)
{
c[i]=a[i];
if(i<blength)
c[i]-=b[i];
}
for(i=0;i<alength;i++)
if(c[i]<0)
{
c[i+1]--;
c[i]+=10;
}
return c[alength-1]?alength:(alength-1);
}
void main()
{
char s1[M],s2[M];
int a[M],b[M],c[M];
int alength,blength,clength;
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",s1,s2);
alength=str2(s1,a);
blength=str2(s2,b);
clength=sub_b(a,alength,b,blength,c);
print_b(c,clength);
printf("\n");
}
}
|
32
|
15526
|
main()
{
int n,i,j,t,as,bs;
char a[100][100],b[100][100];
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
getchar();
}
for (i=1;i<=n;i++)
{
as=strlen(a[i]);
bs=strlen(b[i]);
for (j=0;j<as;j++)
a[i][j]-='0';
for (j=0;j<bs;j++)
b[i][j]-='0';
for (j=1;j<=bs;j++)
{
a[i][as-j]-=b[i][bs-j];
if (a[i][as-j]<0)
{
a[i][as-j-1]--;
do
a[i][as-j]+=10;
while (a[i][as-j]<0);
}
}
t=0;
while (a[i][t]==0)
t++;
for (j=t;j<as;j++)
printf("%d",a[i][j]);
printf("\n");
}
return 0;
}
|
32
|
15527
|
int main()
{
int n, num1[101], num2[101], len1, len2, m, j;
char str1[102], str2[102];
cin >> n;
cin.get();
for (int k = 1; k <= n; k++)
{
cin.getline(str1,102);
cin.getline(str2,102);
cin.get();
len1 = strlen (str1);
len2 = strlen (str2);
memset(num1, 0, sizeof(num1));
memset(num2, 0, sizeof(num2));
j = 0;
for (int i = len1 - 1; i >= 0; i--)
{
num1[j] = str1[i] - '0';
j++;
}
j = 0;
for (int i = len2 - 1; i >= 0; i--)
{
num2[j] = str2[i] - '0';
j++;
}
for (int i = 0; i < len1; i++)
{
num1[i] = num1[i] - num2[i];
if (num1[i] < 0)
{
num1[i + 1]--;
num1[i] += 10;
}
}
m = len1;
while (num1[m] == 0)
m--;
for (int i = m; i >= 0; i--)
cout << num1[i];
cout << endl;
}
return 0;
}
|
32
|
15528
|
int main()
{
int n,i;
char a[200]={'0'},b[200]={'0'};
scanf("%d",&n);
for(i=0;i<n;i++)
{
char c[200]={'0'};
int lena,lenb;
int d,j;
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
d=lena-lenb;
for(j=lena-1;j>=d;j--)
{
b[j]=b[j-d];
b[j-d]='0';
}
for(j=0;j<d;j++) b[j]='0';
for(j=lena-1;j>=0;j--)
{
if(a[j]>=b[j])
c[j]=a[j]-b[j]+'0';
else
{
c[j]=a[j]-b[j]+10+'0';
a[j-1]-=1;
}
}
for(j=0;j<lena;j++)
printf("%c",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15529
|
int main(){
int n,i,j,k,la,lb;
char a[101],b[101];
int c[101];
cin>>n;
while(n!=0){
cin>>a>>b;
la=strlen(a);
lb=strlen(b);
for(i=la-1,j=lb-1,k=0;j>=0;i--,j--,k++){
if(a[i]>=b[j]) c[k]=a[i]-b[j];
else{
c[k]=a[i]-b[j]+10;
a[i-1]=a[i-1]-1;
}
}
for(;i>=0;i--,k++)
c[k]=a[i]-'0';
for(i=k-1;i>=0;i--){
cout<<c[i];
}
cout<<endl;
n--;
}
return 0;
}
|
32
|
15530
|
int main()
{
int n,i,l,e;
char a[101],b[101];
int c[101],d[101];//??????
cin>>n;
while(n--)
{
int t;
cin>>a>>b;
for(i=0;i<=(strlen(a)-1)/2;i++)
{
t=a[i];
a[i]=a[strlen(a)-1-i];
a[strlen(a)-1-i]=t;
}
for(i=0;i<=(strlen(b)-1)/2;i++)
{
t=b[i];
b[i]=b[strlen(b)-1-i];
b[strlen(b)-1-i]=t;
}//?????
/* strrev(a);
strrev(b);????wtf???????????????
*/
for(i=0;i<(int)strlen(a);i++)//??????
c[i]=a[i]-48;
for(i=0;i<(int)strlen(b);i++)
d[i]=b[i]-48;
for(i=0;i<(int)strlen(b);i++)//???
c[i]-=d[i];
for(i=0;i<(int)strlen(a);i++)//??
if(c[i]<0)
{
c[i]+=10;
c[i+1]--;
}
l=0,e=0;
for(i=(int)strlen(a)-1;i>=0;i--)//????
{
if((c[i]==0)&&(e==0))
continue;
l++;
e=1;
}
if(l==0)
l++;
for(i=l-1;i>=0;i--)//??
cout<<c[i];
cout<<endl;
}
return 0;
}
|
32
|
15531
|
// * * * * * * * * * * * * * * *
// *???????? *
// *?????? 1300013011 *
// *???2013.11.16 *
// * * * * * * * * * * * * * * *
int main()
{
int n, i, j, k, len1, len2, num1[101] = {0}, num2[101] = {0}, num[101] = {0};
char str1[200], str2[200];
cin >> n;
cin.get();
for (i = 1; i <= n; i++)
{
memset (num1, 0, sizeof(num1));
memset (num2, 0, sizeof(num2));
memset (num, 0, sizeof(num));
cin.getline(str1, 101);
cin.getline(str2, 101);
if (i!=n)
cin.get();
len1 = strlen(str1);
len2 = strlen(str2);
for (j = 0, k = len1 - 1; k >= 0; j++, k--)
num1[j] = str1[k] - '0';
for (j = 0, k = len2 - 1; k >= 0; j++, k--)
num2[j] = str2[k] - '0';
for (j = 0; j < len1; j++)
{
if (num1[j] >= num2[j])
num[j] = num1[j] - num2[j];
else
{
num[j] = num1[j] + 10 - num2[j];
k = j + 1;
while (num1[k] == 0)
{
num1[k] = 9;
k++;
}
num1[k]--;
}
}
for (j = len1 - 1; j >= 0; j--)
{
if (num[j] != 0)
{
for (k = j; k >= 0; k--)
cout << num[k];
break;
}
}
cout << endl;
}
return 0;
}
|
32
|
15532
|
int max(int a,int b)
{
int c;
if(a>b) c=a;
else c=b;
return (c);
}
void main ()
{
char str1[100],str2[100],temp;
char c[100]={0};
int i,j,k,n,l,flag,x,y;
flag=0;
scanf("%d",&n);
for(i=0;i<100;i++)
{
c[i]='0';
str1[i]='0';
str2[i]='0';
}
for(l=0;l<n;l++)
{
for(i=0;i<100;i++)
{
c[i]='0';
str1[i]='0';
str2[i]='0';
}
scanf("%s",str1);
scanf("%s",str2);
x=strlen(str1);
y=strlen(str2);
k=max(x,y);
str1[x]='0';
str2[y]='0';
for(i=0;i<=(x-1)/2;i++)
{
c[0]=str1[i];
str1[i]=str1[x-1-i];
str1[x-1-i]=c[0];
}
for(i=0;i<=(y-1)/2;i++)
{
temp=str2[i];
str2[i]=str2[y-1-i];
str2[y-1-i]=temp;
}
for(i=0;i<k;i++)
{
if(flag==1) {str1[i]-=1;flag=0;}
if(str1[i]<str2[i]) {c[i]=10+(str1[i]-'0')-(str2[i]-'0')+'0';flag=1;}
else if(str1[i]>=str2[i]) {c[i]=(str1[i]-'0')-(str2[i]-'0')+'0';}
}
if(c[k-1]=='0')
{
for(i=0;i<=(k-2)/2;i++)
{
temp=c[i];
c[i]=c[k-2-i];
c[k-2-i]=temp;
}
for(i=0;i<k-1;i++)
{
printf("%c",c[i]);
}
printf("\n");
}
if(c[k-1]!='0')
{
for(i=0;i<=(k-1)/2;i++)
{
temp=c[i];
c[i]=c[k-1-i];
c[k-1-i]=temp;
}
for(i=0;i<k;i++)
{
printf("%c",c[i]);
}
printf("\n");
}
}
}
|
32
|
15533
|
void main()
{
int n,i,j;
char *p,*q;
char sum[20][100],da[20][100];
int c[20],d[20];
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
scanf("%s",sum[i]);
scanf("%s",da[i]);
c[i]=strlen(sum[i]);
d[i]=strlen(da[i]);
scanf("\n");
}
scanf("%s",sum[n-1]);
scanf("%s",da[n-1]);
c[n-1]=strlen(sum[n-1]);
d[n-1]=strlen(da[n-1]);
for(i=0;i<n;i++)
{
for(p=&sum[i][c[i]-1],q=&da[i][d[i]-1],j=0;j<d[i];j++,p--,q--)
if(*p>=*q)sum[i][c[i]-1-j]=*p-*q+48;
else if(*p<*q){sum[i][c[i]-1-j]=*p-*q+58;*(p-1)=*(p-1)-1;}
}
for(i=0;i<n;i++)
printf("%s\n",sum[i]);
}
|
32
|
15534
|
void jf(char *a,int n,char *b,int m)
{
int i,j,k;
for(i=m-1,j=n-1;i>=1;i--,j--)
{
if(a[j]>=b[i])
a[j]=a[j]-b[i]+'0';
else
{
a[j]=a[j]-b[i]+10+'0';
a[j-1]--;
}
}
if(n==m)
{a[0]=a[0]-b[0]+'0';
for(i=0;i<n;i++)
printf("%c",a[i]);
}
else
{
if(a[n-m]>=b[0])
a[n-m]=a[n-m]-b[0]+'0';
else
{
a[n-m]=a[n-m]-b[0]+10+'0';
a[n-m-1]--;
for(k=n-m-1;k>=0;k--)
{
if(a[k]>='0')
break;
else
{
a[k]=9+'0';
a[k-1]--;
}
}
}
for(i=0;i<n;i++)
printf("%c",a[i]);
}
}
int main()
{
int n,i;
scanf("%d",&n);
char **pp;
pp=(char**)malloc(n*sizeof(char*));
for(i=0;i<n;i++)
pp[i]=(char*)malloc(101*sizeof(char));
char **qq;
qq=(char**)malloc(n*sizeof(char*));
for(i=0;i<n;i++)
qq[i]=(char*)malloc(101*sizeof(char));
for(i=0;i<n-1;i++)
{
scanf("%s",pp[i]);
scanf("%s",qq[i]);
printf("\n");
}
scanf("%s",pp[n-1]);
scanf("%s",qq[n-1]);
int *p,*q;
p=(int*)malloc(n*sizeof(int));
q=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
p[i]=strlen(pp[i]);
q[i]=strlen(qq[i]);
}
for(i=0;i<n;i++)
{
jf(pp[i],p[i],qq[i],q[i]);
printf("\n");
}
for(i=0;i<n;i++)
free(pp[i]);
free(pp);
for(i=0;i<n;i++)
free(qq[i]);
free(qq);
free(p);
free(q);
}
|
32
|
15535
|
/*
*???
*2010 - 11 - 18
*?????1 - ?????
*/
int main()
{
int m, n;
cin >> n;
for ( m = 1; m <= n; m++ )
{
char str1[100], str2[100];
cin >> str1 >> str2;//?????????
int num1[100], num2[100];
int l1, l2, i, j;
l1 = strlen(str1);
l2 = strlen(str2);
for ( i = l1 - 1, j = 0; i >= 0; i-- )//???????int???????????
{
num1[j] = str1[i] - '0';
j++;
}
for ( i = l2 - 1, j = 0; i >= 0; i-- )
{
num2[j] = str2[i] - '0';
j++;
}
for ( i = 0; i < l2; i++ )//????
num1[i] = num1[i] - num2[i];
for ( i = 0; i < l1; i++ )//???????????1
if ( num1[i] < 0 )
{
num1[i] += 10;
num1[i + 1] -= 1;
}
if ( num1[l1 - 1] != 0 )//???????????????
for ( i = l1 - 1; i >= 0; i-- )
cout << num1[i];
else
for ( i = l1 - 2; i >= 0; i-- )
cout << num1[i];
cout << endl;
}
return 0;
}
|
32
|
15536
|
void main()
{
int n,i,j,k,l,m;
char a[50][100];
scanf("%d",&n);
for(i=0;i<=2*n-2;i=i+2)
{
scanf("%s",a[i]);
scanf("%s",a[i+1]);
printf("\n");
}
for(i=0;i<=2*n-2;i=i+2)
{
for(j=0;a[i][j]!='\0';j++)
;
for(k=0;a[i+1][k]!='\0';k++)
;
if(j>k)
{
for(l=j-1;l>=j-k;l=l-1)
a[i+1][l]=a[i+1][l-j+k];
for(l=j-k-1;l>=0;l=l-1)
a[i+1][l]=48;
for(l=j-1;l>=0;l=l-1)
{
if(a[i][l]>=a[i+1][l])a[i][l]=a[i][l]-a[i+1][l]+48;
else
{
a[i][l]=a[i][l]+10-a[i+1][l]+48;
a[i][l-1]=a[i][l-1]-1;
}
}
if(a[i][0]!=48)
for(l=0;l<=j-1;l++)printf("%c",a[i][l]);
else
{
for(l=0;a[i][l]==48;l++);
for(m=0;m<=j-1-l;m++)
{
a[i][m]=a[i][m+l];
printf("%c",a[i][m]);
}
}
printf("\n");
}
if(j<k)
{
printf("-");
for(l=k-1;l>=k-j;l=l-1)
a[i][l]=a[i][l-k+j];
for(l=k-j-1;l>=0;l=l-1)
a[i][l]=48;
for(l=k-1;l>=0;l=l-1)
{
if(a[i+1][l]>=a[i][l])a[i+1][l]=a[i+1][l]-a[i][l]+48;
else
{
a[i+1][l]=a[i+1][l]+10-a[i][l]+48;
a[i+1][l-1]=a[i+1][l-1]-1;
}
}
if(a[i+1][0]!=48)
for(l=0;l<=k-1;l++)printf("%c",a[i+1][l]);
else
{
for(l=0;a[i+1][l]==48;l++);
for(m=0;m<=k-1-l;m++)
{
a[i+1][m]=a[i+1][m+l];
printf("%c",a[i+1][m]);
}
}
printf("\n");
}
if(j==k)
{
for(l=0;l<=j-1;l++)
if(a[i][l]-a[i+1][l]!=0)break;
if(l==j)printf("0");
else
{
for(l=j;l>=1;l=l-1)
a[i][l]=a[i][l-1];
a[i][0]=49;
for(l=j;l>=1;l=l-1)
a[i+1][l]=a[i+1][l-1];
a[i+1][0]=48;
for(l=j;l>=0;l=l-1)
{
if(a[i][l]>=a[i+1][l])a[i][l]=a[i][l]-a[i+1][l]+48;
else
{
a[i][l]=a[i][l]+10-a[i+1][l]+48;
a[i][l-1]=a[i][l-1]-1;
}
}
if(a[i][0]==49)
{
if(a[i][1]!=48)
for(l=1;l<=j;l++)printf("%c",a[i][l]);
else
{
for(l=1;a[i][l]==48;l++);
for(m=0;m<=j-l;m++)
{
a[i][m]=a[i][m+l];
printf("%c",a[i][m]);
}
}
}
else
{
a[i+1][0]=49;
for(l=1;l<=j;l++)
a[i+1][l]=48;
for(l=j;l>=1;l=l-1)
{
if(a[i+1][l]>=a[i][l])a[i+1][l]=a[i+1][l]-a[i][l]+48;
else
{
a[i+1][l]=a[i+1][l]+10-a[i][l]+48;
a[i+1][l-1]=a[i+1][l-1]-1;
}
}
printf("-");
for(l=0;a[i+1][l]!=48;l++);
for(k=l+1;k<=j;k++)printf("%c",a[i+1][k]);
}
}
printf("\n");
}
}
}
|
32
|
15537
|
int main()
{
char a[100][101],b[100][101],j[100][101],A[100][101],B[100][101];
int ac,bc,i,k,c,j1,j2,sw,p,n,i2;
scanf("%d", &n);
for (i=0;i<n;i++)
{
scanf("%s%s", a[i],b[i]);
ac=strlen(a[i]);
bc=strlen(b[i]);
if (ac>bc)
{
c=ac;
for (i2=0;i2<ac-bc;i2++)
B[i][i2]='0';
B[i][i2]='\0';
strcat(B[i], b[i]);
strcpy(A[i],a[i]);
}
if (ac<bc)
{
c=bc;
for (i2=0;i2<bc-ac;i2++)
A[i][i2]='0';
A[i][i2]='\0';
strcat(A[i], a[i]);
strcpy(B[i], b[i]);
}
if (ac==bc)
{
c=ac;
strcpy(A[i],a[i]);
strcpy(B[i],b[i]);
}
sw=0;
for (i2=c-1,k=0;i2>=0;i2--,k++)
{
j1=A[i][i2]-'0';
j2=B[i][i2]-'0';
if (j1-sw-j2>=0)
{
j[i][k]=j1-sw-j2+'0';
sw=0;
}
else
{
j[i][k]=10+j1-sw-j2+'0';
sw=1;
}
}
j[i][k]='\0';
if (i!=n-1)
printf("\n");
}
for (i2=0,p=0;i2<n;i2++)
{
c=strlen(j[i2]);
for (i=c-1;j[i2][i]=='0';i--)
p+=1;
for (i=c-p-1;i>=0;i--)
{
printf("%c", j[i2][i]);
}
if (i2!=n-1)
printf("\n");
}
return 0;
}
|
32
|
15538
|
int p,len1[100];
char ans[100][100];
void minus(char c[100],char d[100])
{
int len2,i,j;
char e[100];
len1[p]=strlen(c);len2=strlen(d);
for(i=0;i<len1[p];i++) e[i]='0';
for(i=len1[p]-len2;i<len1[p];i++)
{
e[i]=d[i-len1[p]+len2];}
for(i=0;i<len1[p]-1;i++)
{
j=len1[p]-1-i;
if(c[j]>=e[j]) ans[p][j]=c[j]-e[j]+'0';
else {ans[p][j]=c[j]-e[j]+'0'+10;c[j-1]=c[j-1]-1;}
}
ans[p][0]=c[0]-e[0]+'0';
}
void main()
{
int n,i,j,k;
char a[100][100],b[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);}
for(p=0;p<n;p++)
{
minus(a[p],b[p]);
k=0;
for(i=0;i<100;i++)
{
if(ans[p][i]=='0') k=k+1;
else break;
}
for(j=k;j<len1[p];j++)
printf("%c",ans[p][j]);
printf("\n");
}
}
|
32
|
15539
|
int main()
{
int n,i=0,A[50][105]={0},B[50][105]={0},k,j;
char a[50][105],b[50][105];
cin>>n;
while(i<n)
{
cin.get();
cin>>a[i];
cin.get();
cin>>b[i];
cin.get();
k=0;
j=0;
for(k=strlen(a[i])-1; k>=0;k--)
{
A[i][j]=a[i][k]-'0';
j++;
}
j=0;
for(k=strlen(b[i])-1;k>=0;k--)
{
B[i][j]=b[i][k]-'0';
j++;
}
for(j=0;j<105;j++)
{
A[i][j]=A[i][j]-B[i][j];
if(A[i][j]<0)
{
A[i][j]=A[i][j]+10;
A[i][j+1]=A[i][j+1]-1;
}
}
j=104;
while(A[i][j]==0)
j--;
for(k=j;k>=0;k--)
cout<<A[i][k];
cout<<endl;
i++;
}
return 0;
}
|
32
|
15540
|
int main()
{
int n,i,s,j,k,t,sum=0,c[200]={0},d[200]={0},e[200]={0};
char a[200]={0},b[200]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
s=strlen(a);
t=strlen(b);
int e[200]={0},c[200]={0},d[200]={0};
for(j=0;j<s;j++) c[j]=a[s-j-1]-48;
for(j=0;j<t;j++) d[j]=b[t-j-1]-48;
for(j=0;j<s;j++)
{
if(c[j]-d[j]>=0) e[j]=c[j]-d[j];
else {e[j]=10+c[j]-d[j]; c[j+1]--;}
}
for(j=s-1;j>=0;j--)
{
if(e[j]!=0) {k=j;break;}
}
for(j=k;j>=0;j--)
{
printf("%d",e[j]);
}
for(j=0;j<=s-1;j++){if(e[j]==0) sum++;}
if(sum==s) printf("0");
printf("\n");
}
return 0;
}
|
32
|
15541
|
int main()
{
int a[100], b[100], len1, len2, i, j, n, k;
char a1[101], b1[101];
cin >> n;
for(k = 0; k < n; k++)
{
cin.get();
cin.getline(a1, 101);
cin.getline(b1, 101);
len1 = strlen(a1);
len2 = strlen(b1);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
j = 0;
for(i = len1 - 1; i >= 0; i--)
a[j++] = a1[i] - '0';
j = 0;
for(i = len2 - 1; i >= 0; i--)
b[j++] = b1[i] - '0';
for(i = 0; i < 100; i++)
{
a[i] = a[i] - b[i];
if(a[i] < 0)
{
a[i] = 10 + a[i];
a[i + 1]--;
}
}
i = 99;
while(a[i] == 0)
i--;
for(; i >= 0; i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
32
|
15542
|
/*????*/
int a[N],b[N],c[N];
int na,nb,nc;
int i,j;
/*????*/
void input()
{
char ac[N],bc[N];
scanf("%s",ac);
na=strlen(ac);
scanf("%s",bc);
nb=strlen(bc);
for (i=0;i<na;i++)
{
a[i]=ac[na-1-i]-48;
}
for (i=0;i<nb;i++)
{
b[i]=bc[nb-1-i]-48;
}
}
/*????*/
void jian(int a[],int b[],int na,int nb)
{
nc=(na>nb)?na:nb;
for (i=0;i<nc;i++)
{
c[i]+=a[i]-b[i];
if (c[i]<0)
{c[i]+=10;
c[i+1]-=1;}
}
}
/*????*/
void print()
{
if (c[nc]!=0) printf("%d",c[nc]);
for (i=nc-1;i>=0;i--)
printf("%d",c[i]);
}
/*???*/
void main()
{
int cishu,k;
scanf("%d",&cishu);
for(k=1;k<=cishu;k++)
{
for (i=0;i<N;i++) {b[i]=0;a[i]=0;}
for (i=0;i<N;i++) c[i]=0;
input();
jian(a,b,na,nb);
print();
printf("\n");
}
}
|
32
|
15543
|
void main()
{
int n,lengtha,lengthb,i,j,k,l;
char a[100],b[100],c[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n",a);
scanf("%s\n",b);
lengtha=strlen(a);
lengthb=strlen(b);
for(j=1;j<=lengthb;j++)
{
if (a[lengtha-j]>=b[lengthb-j])
c[lengtha-j]=a[lengtha-j]-b[lengthb-j];
else
{ c[lengtha-j]=a[lengtha-j]-b[lengthb-j]+10;
a[lengtha-j-1]=a[lengtha-j-1]-1;}
}
if(a[lengtha-j]<0)
{
a[lengtha-j]=a[lengtha-j]+10;
a[lengtha-j-1]=a[lengtha-j-1]-1;
}
for(k=lengtha-j;k>=0;k--)
c[k]=a[k]-48;
for(l=0;l<lengtha;l++)
printf("%d",c[l]);
printf("\n");
}
}
|
32
|
15544
|
int main()
{
int n, i, j, cnt = 0;
cin >> n;
int a[100], b[100], c[100];
char num1[101], num2[101];
while(cnt < n)
{
cin >> num1;
cin >> num2;
int len1 = strlen(num1);
int len2 = strlen(num2);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
j = 0;
for(i = len1 - 1; i >= 0; i--)
a[j++] = num1[i] - '0';
j = 0;
for(i = len2 - 1; i >= 0; i--)
b[j++] = num2[i] - '0';
for(i = 0; i < len2; i++)
{
if(a[i] < b[i])
{
if(a[i] == -1)
a[i] = 9;
else
a[i] += 10;
a[i + 1]--;
}
c[i] = a[i] - b[i];
}
if(len1 > len2)
{
for(i = len2; i < len1; i++)
c[i] = a[i];
}
for(i = len1 - 1 ; i >= 0; i--)
cout << c[i];
cout << endl;
cnt++;
}
return 0;
}
|
32
|
15545
|
void main()
{
int n,i;
char a[100][100];
char b[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%s",a[i],b[i]);
int p,q,j,k;
for(i=0;i<n;i++)
{
p=strlen(a[i]);q=strlen(b[i]);
for(j=q-1,k=p-1;j>=0;j--,k--)
{
if(a[i][k]>=b[i][j]) a[i][k]=a[i][k]-b[i][j]+48;
else if(a[i][k]<b[i][j]) {a[i][k]=a[i][k]-b[i][j]+58;a[i][k-1]=a[i][k-1]-1;}
}
for(k=0;k<p;k++)
{if(a[i][k]!=0) {printf("%c",a[i][k]);j=k;break;}}
for(k=j+1;k<p;k++) printf("%c",a[i][k]);
printf("\n");
}
}
|
32
|
15546
|
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char p[100],q[100];
int j,lp,lq,l;
int a[100],b[100];
scanf("%s%s",p,q);
lp=strlen(p);
lq=strlen(q);
l=lp-lq;
for(j=0;j<lp;j++)
{
if (p[j]<='9' && p[j]>=0) a[j]=p[j]-48;
}
for(j=0;j<lq;j++)
{
if (q[j]<='9' && q[j]>=0) b[j]=q[j]-48;
}
for (j=lq-1;j>=0;j--)
{
int c;
c=a[j+l]-b[j];
if(c>=0) a[j+l]=c;
else
{
a[j+l]=10+c;
a[j+l-1]=a[j+l-1]-1;
}
}
for(j=0;j<lp;j++)
{
p[j]=a[j]+48;
}
printf("%s\n",p);
}
return 0;
}
|
32
|
15547
|
int main()
{
int n;
cin>>n;
while( n>0 )
{
n--;
char c1[110],c2[110],c[110];
cin>>c1>>c2;
int len1=strlen(c1);
int len2=strlen(c2);
int len=len1+1;
for( int i=0 ; i<110 ; i++ )
{
c[i]=1;
}
if( len2>len1 )
{
len=len2+1;
}
if( c1[0]=='0' && c2[0]=='0' && len1==1 && len2==1 )
{
cout<<"0"<<endl;
}
else
{
for( int i=len1-1 ; i>=0 ; i-- )
{
c1[i+len-len1]=c1[i];
}
for( int i=len-len1-1 ; i>=0 ; i-- )
{
c1[i]='0';
}
for( int i=len2-1 ; i>=0 ; i-- )
{
c2[i+len-len2]=c2[i];
}
for( int i=len-len2-1 ; i>=0 ; i-- )
{
c2[i]='0';
}
for( int i=len-1 ; i>=0 ; i-- )
{
c[i]+='0'+c1[i]-c2[i]-1;
if( c[i]<'0' )
{
c[i]+=10;
c[i-1]--;
}
}
for( int i=0 ; ; i++ )
{
if( c[i]!='0' )
{
for( int j=i ; j<len ; j++ )
{
cout<<c[j];
}
cout<<endl;
break;
}
}
}
}
}
|
32
|
15548
|
void main()
{
char a[100],b[100],c[100][100];
int n,i,j,k,l1,l2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
l1=strlen(a);
l2=strlen(b);
for(j=l1-1,k=l2-1;k>=0;j--,k--)
{
a[j]=a[j]-b[k]+'0';
if(a[j]<'0')
{
a[j]=a[j]+10;
a[j-1]=a[j-1]-1;
}
}
strcpy(c[i],a);
}
for(i=0;i<n;i++)
printf("%s\n",c[i]);
}
|
32
|
15549
|
void dajianfa(char a[],char b[]);
void main ()
{
int n;
char a[100];
char b[100];
int i;
char nouse;
scanf("%d%c",&n,&nouse);
for (i=0;i<n;i++)
{
gets(a);
gets(b);
dajianfa(a,b);
if(i!=n-1) gets(b);
}
}
void dajianfa(char a[],char b[])
{
int len1,len2;
int i;
len1=strlen(a);
len2=strlen(b);
for(i=1;i<=len2;i=i+1)
{
if(a[len1-i]>=b[len2-i]) a[len1-i]=a[len1-i]-b[len2-i]+48;
else {
a[len1-i-1]-=1;a[len1-i]=a[len1-i]-b[len2-i]+58;
}
}
a[len1]='\0';
puts(a);
}
|
32
|
15550
|
int main(){
int i,x[102],y[102],z[102],n;
char s[103];
cin>>n;
while(n--){
for(i=0;i<102;i++){x[i]=0;y[i]=0;z[i]=0;}
cin>>s;
for(i=0;i<strlen(s);i++) x[101-strlen(s)+i+1]=(int)(s[i]-48);
cin>>s;
for(i=0;i<strlen(s);i++) y[101-strlen(s)+i+1]=(int)(s[i]-48);
for(i=101;i>0;i--){
if (x[i]<y[i]) {z[i]=x[i]+10-y[i];x[i-1]--;}
else z[i]=x[i]-y[i];
}
for(i=0;i<102;i++) if (z[i]!=0) break;
if (i==102) {cout<<z[i-1];return 0;}
for(;i<102;i++)cout<<z[i];
cout<<'\n';
}
}
|
32
|
15551
|
int main()
{
int n ;
cin >> n ;
for (int k = 1 ; k <= n ; k ++)
{
char str1[200], str2[200] ;
int num1[200], num2[200] = {0} , num[200] = {0} ;
cin >> str1 >> str2 ;
int len1 = strlen(str1) , len2 = strlen(str2) ;
for (int i = len1 - 1 ; i >= 0 ; i --)
num1[i] = str1[i] - '0' ;
for (int i = len1 - 1 , j = len2 - 1 ; j >= 0 ; i -- , j --)
num2[i] = str2[j] - '0' ;
for (int i = len1 - 1 ; i >= 0 ; i --)
if (num1[i] >= num2[i])
num[i] = num1[i] - num2[i] ;
else
{
num[i] = 10 + num1[i] - num2[i] ;
for (int a = 1 ; a <= i ; a ++)
{
if (num1[i - a] == 0)
{
num1[i - a] = 9 ;
continue ;
}
num1[i - a] -- ;
break ;
}
}
int b = 0 ;
while (num[b] == 0)
b ++ ;
for ( ; b <= len1 - 1 ; b ++)
cout << num[b] ;
cout << endl ;
}
return 0 ;
}
|
32
|
15552
|
void main()
{
char a[100]={'\0'},b[100]={'\0'},re[100]={'\0'},n,i=0,l1=0,k=0,l2=0;
scanf("%d",&n);
while(scanf("%s\n%s",a,b)!=EOF)
{
l1=strlen(a);
l2=strlen(b);
k=l1-l2;
for(i=l1-1;i>=k;i--)
{
if(a[i]>=b[i-k])
{
re[i]=a[i]-b[i-k]+'0';
}
else
{
re[i]=a[i]+10-b[i-k]+'0';
a[i-1]=a[i-1]-1;
}
}
for(i=k-1;i>=0;i--)
{
re[i]=a[i];
}
printf("%s\n",re);
for(i=0;i<100;i++)
{
a[i]='\0';
b[i]='\0';
re[i]='\0';
}
}
}
|
32
|
15553
|
void main()
{
int p,i,k,l,n,q,d,j;
char s1[101],s2[101],re[101][101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",s1,s2);
k=strlen(s1);
d=k;
l=strlen(s2);
for(;l>0;l--)
{
if(s1[k-1]>=s2[l-1])
{
p=s1[k-1]-s2[l-1];
s1[k-1]=p+48;
}
else
{
for(q=k-2;s1[q]=='0';q--)
{
s1[q]='9';
}
s1[q]=s1[q]-1;
p=10+(s1[k-1]-s2[l-1]);
s1[k-1]=p+48;
}
k=k-1;
}
for(q=0;q<d;q++)
{
if(s1[q]!=0)
{
re[i][0]=s1[q];
break;
}
}
q=q+1;
for(j=1;q<d;q++)
{ re[i][j]=s1[q];
j++;}
re[i][j]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",re[i]);
}
|
32
|
15554
|
void main()
{
char a[101],b[101];
int c[101],e[101],*d,n,i,j,l1,l2;
scanf("%d",&n);
for (j=1;j<=n;j++)
{
scanf("%s%s",a,b);
l1=strlen(a);
l2=strlen(b);
d=(int*)malloc((l1+l2)*sizeof(int));
for (i=l1-1;i>=0;i--)
{
c[i]=a[i]-48;
}
for (i=l1-1;i>=0;i--)
{
d[i]=b[i]-48;
if (i>=l2) d[i]=0;
}
for (i=0;i<l2;i++)
{
d[i+l1]=d[i];
}
for (i=l1-1;i>=0;i--)
{
e[i]=c[i]-d[i+l2];
if (e[i]<0)
{
e[i]=e[i]+10;
c[i-1]=c[i-1]-1;
}
}
if (e[0]!=0) printf("%d",e[0]);
for (i=1;i<=l1-2;i++)
{
printf("%d",e[i]);
}
printf("%d\n",e[l1-1]);
}
}
|
32
|
15555
|
void main()
{
void minus(char n1[100],char n2[100]);
char num1[100],num2[100];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",num1,num2);
minus(num1,num2);
printf("%s\n",num1);
}
}
void minus(char n1[100],char n2[100])
{
int a,b;
int k;
a=strlen(n1);
b=strlen(n2);
for(k=b-1;k>=0;k--)
{
if(n1[a-b+k]>=n2[k])n1[a-b+k]=n1[a-b+k]-n2[k]+48;
else
{
n1[a-b+k-1]--;
n1[a-b+k]=n1[a-b+k]-n2[k]+58;
}
}
}
|
32
|
15556
|
void main()
{
int n, result[100];
char a[100], b[100], c[2];
scanf("%d", &n);
int i,s,t,j,k;
for(i=0;i<n;i++)
{
gets(c);
gets(a);
gets(b);
s=strlen(a);
t=strlen(b);
for (j=s-1; ;j--)
{
if (a[j]>=b[j-s+t])
result[j] = a[j]-b[j-s+t];
else
{
result[j] = a[j]-b[j-s+t]+10;
a[j-1]--;
}
if (j-s+t==0)
break;
}
for(k=0; k<j; k++)
result[k]=a[k]-'0';
if(j>0)
{
for(k=0;k<s;k++)
printf("%d",result[k]);
printf("\n");
}
else
{
for(k=0;k<s;k++)
if (result[k]!=0)
break;
for(j=k;j<s;j++)
printf("%d",result[k]);
printf("\n");
}
}
}
|
32
|
15557
|
void func2(char o[],int x)
{
for (int u=0;u<x;u++)
o[u]=0;
}
main()
{
char *p1,*p2;
char a[100]={0},b[100]={0},d[100]={0},e[100][100]={0};
int c[100]={0};
int i,j,k,m,n,g=0,t,v,l;
scanf("%d\n",&v);
for (k=0;k<v;k++)
{
scanf("%s\n",a);
scanf("%s",b);
p1=a;
p2=b;
m=strlen(a);
n=strlen(b);
for (i=0;i<m-n;i++)
d[i]='0';
p2=strcat(d,b);
for (j=m-1;j>=0;j--)
{
c[j]=p1[j]-p2[j]+g;
if (c[j]<0)
{
c[j]=c[j]+10;
g=-1;
}
else
g=0;
t=m-j;
e[k][j]=c[j]+'0';
}
for (int h=0;h<m;h++)
{
if (e[k][h]=='0')
e[k][h]=0;
else
break;
}
func2(a,m);
func2(b,m);
func2(d,m);
}
for (l=0;l<v;l++)
printf("%s\n",e[l]);
}
|
32
|
15558
|
void main()
{
char a[100]={'\0'},b[100]={'\0'},c[100]={'\0'},d[100]={'\0'},e[100]={'\0'},l;
int n,i,j,h,k,t;
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
t=0;
gets(a);
gets(c);
l=getchar();
h=strlen(a)-1;
for(j=0;j<=h;j++)
b[j]=a[h-j];
k=strlen(c)-1;
for(j=0;j<=k;j++)
d[j]=c[k-j];
for(j=k+1;j<=h;j++)
d[j]='0';
for(j=0;j<=h;j++)
{
if(b[j]>=d[j]) e[j]=b[j]-d[j];
else {
e[j]=b[j]+10-d[j];
b[j+1]=b[j+1]-1;
}
}
for(j=h;j>=0;j--)
{
if (e[j]>0) t=t+1;
if (t>0) printf("%c",e[j]+48);
}
printf("\n");
}
}
|
32
|
15559
|
void main()
{
int n,i,j,p,q,k;
char a[100][100],b[100][100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
getchar();
gets(a[i]);
gets(b[i]);
}
for (i=0;i<n;i++)
{
p=strlen(a[i]);
q=strlen(b[i]);
for (j=0;j<q;j++)
{
if (a[i][p-j-1]>=b[i][q-j-1])
a[i][p-j-1]=a[i][p-j-1]-b[i][q-j-1]+48;
else
{
a[i][p-j-1]=a[i][p-j-1]-b[i][q-j-1]+58;
if (a[i][p-j-2]!=48)
a[i][p-j-2]=a[i][p-j-2]-1;
else
{
a[i][p-j-2]=57;
for (k=3;;k++)
{
if (a[i][p-j-k]!=48)
{
a[i][p-j-k]--;
break;
}
else
a[i][p-j-k]=57;
}
}
}
}
puts(a[i]);
}
}
|
32
|
15560
|
void minus(char a[],char b[]);
void ni(char a[]);
void tranvert(char m,char a[]);
void trans(char n,char m,char b[]);
void main()
{
char k,i,m,n,a[30][100]={0},b[30][100]={0};
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
m=strlen(a[i]);
n=strlen(b[i]);//the result at most has m bits
ni(a[i]);
ni(b[i]);
trans(n,m,b[i]);
minus(a[i],b[i]);
tranvert(m,a[i]);
ni(a[i]);
printf("\n");
}
for(i=0;i<k;i++)
{
puts(a[i]);
}
}
void minus(char a[],char b[])
{
char i,t,m=strlen(a),jin=0;//experimental
for(i=0;i<=m-1;i++)
{
t=a[i]-b[i]-jin;
if(t>=0) {a[i]=t; jin=0;}
else {a[i]=t+10; jin=1;}
}
}
void ni(char a[])
{
char i,t,m=strlen(a);
for(i=0;i<m/2;i++)
{
t=a[i];
a[i]=a[m-1-i];
a[m-1-i]=t;
}
}
void tranvert(char m,char a[])
{
char i,j; //n=strlen(a)
for(i=m-1;i>=1;i--)
if(a[i]!=0) break;
for(j=i;j>=0;j--)
a[j]+='0';
}
void trans(char n,char m,char b[])// add 0 so that b is as long as a
{ char i;
for(i=n;i<=m-1;i++)
b[i]='0';
}
|
32
|
15561
|
int main()
{
char a[100],b[100],c[100],d[100],e[100];
int n,j,p,q,k,i;
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s",a);
p=strlen(a);
for(i=0;i<p;i++)
{
c[p-1-i]=a[i];
}
scanf("%s",b);
q=strlen(b);
for(i=0;i<q;i++)
{
d[q-1-i]=b[i];
}
for(i=q;i<p;i++)
{
d[i]='0';
}
for(i=0;i<p;i++)
{
if(c[i]>=d[i])
e[i]=c[i]-d[i]+48;
else
{
e[i]=10+c[i]-d[i]+48;
for(k=i+1;k<p;k++)
{
if(k!=0)
{
c[k]=c[k]-1;
break;
}
}
}
}
for(i=p-1;i>=0;i--)
{
if(e[i]!='0')
{
break;
}
}
for(k=i;k>=0;k--)
{
printf("%c",e[k]);
}
printf("\n");
}
return 0;
}
|
32
|
15562
|
void chuli(char a[],char b[]){
int la,m,i,j;
m=strlen(b);
la=strlen(a);
for(i=0;i<m;i++){
if(a[la-1-i]>=b[m-1-i])
a[la-1-i]=a[la-1-i]-b[m-1-i]+48;
else{
a[la-1-i]=a[la-1-i]+10-b[m-1-i]+48;
j=la-2-i;
while(a[j]==48){
a[j]=48+9;
j--;
}
a[j]=a[j]-1;
}//*elsewai end
}//*for end
i=0;
while(a[i]==48){
i=i+1;}
printf("%s\n",a);
}
void main(){
char a[100][100],b[100][100];
char p;
int m,i;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%s",a[i]);scanf("%s",b[i]);
}
for(i=0;i<m;i++)
chuli(a[i],b[i]);
}
|
32
|
15563
|
void main()
{
int n,i,j,lg1,lg2,t;
char bjs[100][100],js[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&bjs[i]);
scanf("%s",&js[i]);
}
for(j=0;j<n;j++)
{
lg1=strlen(bjs[j]);
lg2=strlen(js[j]);
t=lg1-lg2;
for(i=lg2-1;i>=0;i--)
{
if(bjs[j][t+i]-js[j][i]>=0)
bjs[j][t+i]=bjs[j][t+i]-js[j][i]+48;
else
{
bjs[j][t+i]=bjs[j][t+i]-js[j][i]+48+10;
bjs[j][t+i-1]=bjs[j][t+i-1]-1;
}
}
printf("%s\n",bjs[j]);
}
}
|
32
|
15564
|
void main()
{
int n,i,j,longa[100],longb[100],t[100];
char a[100][101],b[100][101],c[100][101];
scanf("%d",&n);getchar();
for(i=0;i<n;i++)
{
gets(a[i]);
gets(b[i]);
getchar();
longa[i]=strlen(a[i])-1;
longb[i]=strlen(b[i])-1;
}
for(i=0;i<n;i++)
{
for(j=0;j<=longa[i];j++)
{
if(j<=longb[i])
{
c[i][longa[i]-j]=a[i][longa[i]-j]-b[i][longb[i]-j]+48;
if(c[i][longa[i]-j]<48)
{
c[i][longa[i]-j]=c[i][longa[i]-j]+10;
a[i][longa[i]-j-1]--;
}
}
else c[i][longa[i]-j]=a[i][longa[i]-j];
}
for(j=0,t[i]=0;j<=longa[i];j++)
{
if(c[i][j]==48) t[i]++;
else break;
}
for(j=t[i];j<longa[i];j++)
printf("%c",c[i][j]);
printf("%c\n",c[i][longa[i]]);
}
}
|
32
|
15565
|
int main()
{
char a[200],b[200];
int n;
cin>>n;
while(n>=1)
{
int c[200]={0},d[200]={0},e[200]={0},le1,le2,i,j,m;
cin>>a;
cin>>b;
le1=strlen(a);
le2=strlen(b);
for(i=0,j=le1-1;i<=le1-1,j>=0;i++,j--)
c[i]=a[j]-'0';
for(i=0,j=le2-1;i<=le2-1,j>=0;i++,j--)
d[i]=b[j]-'0';
for(i=0;i<=199;i++)
{
if(c[i]>=d[i])
e[i]=c[i]-d[i];
if(c[i]<d[i])
{
e[i]=10+c[i]-d[i];
c[i+1]=c[i+1]-1;
}
}
for(i=199;i>=0;i--)
if(e[i]!=0)
{
m=i;
break;
}
for(i=m;i>=0;i--)
cout<<e[i];
cout<<endl;
n--;
}
return 0;
}
|
32
|
15566
|
void main()
{
char max[100],min[100],result[100];
int n,i,a,b,j,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",max,min);
a=strlen(max);
b=strlen(min);
k=0;
if(a==b)
{
for(j=(a-1);j>=0;j--)
{
max[j]=max[j]-k;
if(max[j]>=min[j])
{
result[j]=max[j]-min[j]+48;
k=0;
}
else
{
result[j]=max[j]-min[j]+58;
k=1;
}
}
}
else
{
min[a]='\0';
for(j=1;j<=b;j++)
min[a-j]=min[b-j];
for(j=(a-b-1);j>=0;j--)
min[j]='0';
for(j=(a-1);j>=0;j--)
{
max[j]=max[j]-k;
if(max[j]>=min[j])
{
result[j]=max[j]-min[j]+48;
k=0;
}
else
{
result[j]=max[j]-min[j]+58;
k=1;
}
}
}
for(j=0;j<a;j++)
{
if(result[j]!='0')
{
for(k=j;k<a;k++)
printf("%c",result[k]);
printf("\n");
}
break;
}
}
}
|
32
|
15567
|
void main()
{
char beijian[200],jian[200],jian2[200],result[200];
int i=0,j=0,l1,l2,n;
scanf("%d",&n);
for(j=0;j<n;j++)
{
for(i=0;i<100;i++)
{
jian2[i]=48;
result[i]=48;
}
jian2[99]=0;
result[99]=0;
scanf("%s",beijian);
scanf("%s",jian);
l1=strlen(beijian);
l2=strlen(jian);
if(l1==l2)
{
for(i=l1-1;i>=0;i--)
{
if(beijian[i]<jian[i])
{
beijian[i]=beijian[i]+10;
beijian[i-1]=beijian[i-1]-1;
}
result[i]=beijian[i]-jian[i]+48;
}
result[l1]='\0';
}
else
{
for(i=l1-1;i>=l1-l2;i--) jian2[i]=jian[i-l1+l2];
for(i=l1-1;i>=0;i--)
{
if(beijian[i]<jian2[i])
{
beijian[i]=beijian[i]+10;
beijian[i-1]=beijian[i-1]-1;
}
result[i]=beijian[i]-jian2[i]+48;
}
result[l1]='\0';
}
for(i=0;i<l1;i++)
{
if(result[i]!=0&&result[i]!=48) break;
}
while(result[i]!='\0') printf("%c",result[i++]);
printf("\n");
}
}
|
32
|
15568
|
int main()
{
int len1,len2,n,i,j,k,result[1000];
char num1[101],num2[101];
cin>>n;
for(i=1;i<=n;i++)
{
int a[1000]={0};
int b[1000]={0};
int result[1000]={0};
cin>>num1>>num2;
len2=strlen(num2);
len1=strlen(num1);
for(j=len1-1,k=0;j>=0;j--,k++)
{
a[k]=num1[j]-'0';
}
for(j=len2-1,k=0;j>=0;j--,k++)
{
b[k]=num2[j]-'0';
}
for(k=0;k<=len1-1;k++)
{
result[k]=result[k]+a[k]-b[k];
if(result[k]<0)
{
result[k+1]--;
result[k]+=10;
}
}
for(k=len1-1;k>=0;k--)
{
cout<<result[k];
}
cout<<endl;
}
return 0;
}
|
32
|
15569
|
int main()
{
int n,i,j;
scanf("%d",&n);
char a[100],b[100];
for(j=0;j<n;j++)
{
scanf("%s",a);
scanf("%s",b);
int r=strlen(a);
int t=strlen(b);
char *p1,*p2,*p3;
p1=a;
p2=b;
p3=(char *)malloc((r+1)*sizeof(char));
strcpy(p3,a);
for( i=1;i<=t;i++)
{
if(p1[r-i]-p2[t-i]<0)
{
p3[r-i]=p1[r-i]+10-p2[t-i]+'0';
p1[r-i-1]--;
p3[r-i-1]--;
}
else
{
p3[r-i]=p1[r-i]-p2[t-i]+'0';
}
}
printf("%s\n",p3);
free(p3);
}
return 0;
}
|
32
|
15570
|
int a[10000]={0},b[10000]={0},c[10000],d[10000];
void jian(int a[10000],int b[10000])
{
int i,j,k,m;
for (i=0;i<=9000;i++) c[i]=0;
m=a[0]+b[0]-1;
for (i=1;i<=a[0]+b[0]-1;i++)
{
c[i]=c[i]+a[i]-b[i];
if (c[i]<0)
{
c[i+1]=-1;
c[i]+=10;
}
}
j=m+10;
while (j>1&&c[j]==0) j--;
for (i=1;i<=a[0]+1;i++)
a[i]=c[i];
a[0]=j;
for (i=j;i>=1;i--)
cout <<a[i];
cout <<endl;
}
int main()
{
int i,j,k,m,n;
int len1=0,len2=0;
char s1[10000],s2[10000];
cin >>n;
for (j=1;j<=n;j++)
{
for (i=0;i<=9000;i++) {a[i]=0;b[i]=0;}
cin >>s1;
cin >>s2;
len1=strlen(s1);
len2=strlen(s2);
a[0]=len1;
b[0]=len2;
for (i=1;i<=len1;i++)
a[len1-i+1]=((int)s1[i-1])-48;
for (i=1;i<=len2;i++)
b[len2-i+1]=((int)s2[i-1])-48;
jian(a,b);
}
return 0;
}
|
32
|
15571
|
int main(int argc, char *argv[])
{
char a[100],b[100],c[100],f[100],e[100];
int i,m,k,n;
int d[100];
scanf("%d",&n);
while(n>0)
{
scanf("%s",a);
m=strlen(a);
scanf("%s",b);
k=strlen(b);
for(i=0;i<m;i++)
f[i]=a[m-1-i];
for(i=0;i<k;i++)
e[i]=b[k-1-i];
for(i=k;i<m;i++)
e[i]='0';
for(i=0;i<m;i++)
d[i]=f[i]-e[i];
for(i=0;i<m;i++)
if(d[i]<0)
{
d[i]=d[i]+10;
d[i+1]=d[i+1]-1;}
for(i=0;i<m;i++)
c[i]=d[i]+'0';
int num=0;
for(i=m-1;i>=0;i--)
{if(num)
{printf("%c",c[i]);continue;}
if(c[i]!='0')
{printf("%c",c[i]);
num=1;}
}
printf("\n");
n--;
}
return 0;
}
|
32
|
15572
|
void main()
{
char a[101],b[101],k;
int m,i,n,j,s=102,t=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
m=strlen(a)-strlen(b);
for(j=strlen(a)-1;j>=m;j--)
{
if(t!=0) a[j]--;
if(a[j]>=b[j-m])
{
a[j]=a[j]-b[j-m]+'0';
t=0;
}
else
{
a[j]=a[j]+10-b[j-m]+'0';
t=1;
}
}
for(j=m-1;j>=0;j--)
{
if(t!=0) a[j]--;
if(a[j]<'0')
{
a[j]=a[j]+10;
t=1;
}
else t=0;
}
for(j=0;j<strlen(a);j++)
{
if(a[j]!='0')
{
s=j;
break;
}
}
if(s==102) printf("0\n");
else
{
for(j=s;j<strlen(a);j++)
printf("%c",a[j]);
printf("\n");
scanf("%c",&k);
}
}
}
|
32
|
15573
|
void main()
{
int n;
scanf("%d",&n);
char miner[20][101],minee[20][101];
int i,sp,k,pr;
int lr,le;
for(i=1;i<=n;i++)
{
scanf("%s%s",&miner[i],&minee[i]);
lr=strlen(miner[i]);
le=strlen(minee[i]);
while(le>=1)
{ if(miner[i][lr-1]>=minee[i][le-1])
miner[i][lr-1]=miner[i][lr-1]-minee[i][le-1]+'0';
else
{sp=lr-2;
while(miner[i][sp]=='0'){miner[i][sp]='9';sp--;}
miner[i][sp]=miner[i][sp]-1;
miner[i][lr-1]=miner[i][lr-1]-minee[i][le-1]+'0'+10;
}
le--;lr--;
}
k=0;lr=strlen(miner[i]);
while(1){if(miner[i][k]=='0')k++;else break;}
for(pr=k;pr<=lr-1;pr++)printf("%c",miner[i][pr]);
printf("\n");
}
}
|
32
|
15574
|
//**********************
//?????************
int main()
{
int n;
cin>>n;
for(int times=1;times<=n;times++)
{
cin.get();
const int max=200;
char str1[max+1],str2[max+1];
long an1[max]={0},an2[max]={0};
cin.getline(str1,max+1);
cin.getline(str2,max+1);
int la=strlen(str1);
int lb=strlen(str2);
memset(an1,0,sizeof(an1));
memset(an2,0,sizeof(an2));
int i=0,j=0;
for (i = la-1;i>=0; i--)
an1[j++] = str1[i] - '0';
j=0;
for (i = lb-1;i>=0;i--)
an2[j++] = str2[i] - '0'; //??
for(i=0;i<max;i++)
{
an1[i]=an1[i]-an2[i];
if(an1[i]<0)
{
an1[i]=an1[i]+10;
an1[i+1]=an1[i+1]-1;
}
} //??
i=max-1;
while(an1[i]==0)
i--;
for(;i>=0;i--)
cout<<an1[i];
cout<<endl;
} //??
return 0;
}
|
32
|
15575
|
void main()
{
char a[800]={'\0'},b[800]={'\0'},c[800]={'\0'},d[800]={'\0'},s;
int i,k,m,n,j,x,y,z;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%s%s",&a,&b);
m=strlen(a);n=strlen(b);
if(n<m)
{
for(j=0;j<m-n;j++)
c[j]=48;
for(j=m-n;j<m;j++)
c[j]=b[j-m+n];
}
else
strcpy(c,b);
for(j=m-1;j>=0;j--)
{
if(j==0)
{
d[j]=a[j]-c[j]+48;
break;
}
if(a[j]>=c[j])
d[j]=a[j]-c[j]+48;
else
{
d[j]=a[j]-c[j]+58;
for(z=1;z<=j;z++)
{
if(a[j-z]>48)
{
a[j-z]=a[j-z]-1;
break;
}
if(a[j-z]==48)
a[j-z]=57;
}
}
}
for(x=0;x<m;x++)
if(d[x]!=48)
{
y=x;break;
}
for(x=y;x<m;x++)
printf("%c",d[x]);
printf("\n");
}
}
|
32
|
15576
|
int main(){
char a[100],b[100];
int i,j,m;
cin>>m;
while(m!=0){
cin>>a>>b;
for(i=strlen(b)-1,j=strlen(a)-1;i>=0;i--,j--){
if (a[j]-b[i]<0) {
a[j]=10+a[j]-b[i]+48;
a[j-1]-=1;
}
else a[j]=a[j]-b[i]+48;
}
for(i=0;i<=strlen(a)-1;i++){
if (a[i]!='0'){
for(j=i;j<=strlen(a)-2;j++)
cout<<a[j];
cout<<a[strlen(a)-1]<<endl;
break;
}
}
m--;
}
return 0;
}
|
32
|
15577
|
void main()
{
int n, i, j, la, lb, k;
char a[100][100], b[100][100], c[100][100]={'\0'};
scanf("%d\n", &n);
gets(a[0]);
gets(b[0]);
for(i=1; i<n; i++)
{
scanf("\n");
gets(a[i]);
gets(b[i]);
}
for(i=0; i<n; i++)
{
la=strlen(a[i]);
lb=strlen(b[i]);
for(j=la-1; j>=la-lb; j--)
{
if(a[i][j]>=b[i][j-la+lb])
a[i][j]=a[i][j]-b[i][j-la+lb]+48;
else
{
a[i][j]=58+a[i][j]-b[i][j-la+lb];
if(a[i][j-1]>'0')
a[i][j-1]--;
else
{
k=j;
while(a[i][k-1]=='0')
{
a[i][k-1]='9';
k--;
}
a[i][k-1]--;
}
}
}
k=0;
for(j=0; a[i][j]!='\0'; j++)
if(a[i][j]!='0') break;
for(j=j; a[i][j]!='\0'; j++)
{
c[i][k]=a[i][j];
k++;
}
puts(c[i]);
}
}
|
32
|
15578
|
/*
* dazhengshujianfa.cpp
*
* Created on: 2010-12-24
* Author: lz
*/
int main()
{
int n;
cin>>n;
char a[200];//?????
char b[200];//????
char c[200];//???
char s[200];//????????
while(n>0)
{
n--;
int i;
int j;
int carry=0;//??
cin>>s;
int slen=strlen(s);
for(i=0;i<slen;i++)
a[i]=s[slen-i-1];
int alen=slen;
cin>>s;
slen=strlen(s);
for(i=0;i<slen;i++)
b[i]=s[slen-i-1];
int blen=slen;
for(i=0;i<blen;i++)//??
{
if(a[i]-'0'-carry>=b[i]-'0')
{
c[i]=(char)(a[i]-b[i]-carry+'0');
carry=0;
}
else
{
c[i]=(char)(a[i]-b[i]-carry+10+'0');
carry=1;
}
}
for(i=blen;i<alen;i++)
{
if(a[i]-carry>='0')
{
c[i]=(char)(a[i]-carry);
carry=0;
}
else
{
c[i]=(char)(a[i]-carry+10);
carry=1;
}
}
for(i=alen-1;i>=0;i--)
if(c[i]!='0')
break;
for(j=i;j>=0;j--)
cout<<c[j];
cout<<endl;
}
return 0;
}
|
32
|
15579
|
void main()
{
char str1[60][100],str2[60][100],b[100];
int i,k,c,n,j,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",str1[i],str2[i]);
printf("\n");
}
for(i=0;i<n;i++)
{
t=strlen(str2[i]);
c=strlen(str1[i]);
k=c-t;
for(j=t-1;j>=0;j--)
{
if(str1[i][k+j]>=str2[i][j]) b[k+j]=str1[i][k+j]-str2[i][j];
else {b[k+j]=str1[i][k+j]+10-str2[i][j];str1[i][k+j-1]-=1;}
}
for(j=0;j<k;j++) b[j]=str1[i][j]-48;
for(j=0;j<c;j++) printf("%d",b[j]);
printf("\n");
}
}
|
32
|
15580
|
int main()
{
char temp[101];
int n,a[101]={0},b[101]={0},c[101]={0},i,j,l,m,is;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
is=1;
scanf("%s",temp);
l=strlen(temp);
for(j=l-1;j>=0;j--)
a[l-j]=temp[j]-48;
scanf("%s",temp);
m=strlen(temp);
for(j=m-1;j>=0;j--)
b[m-j]=temp[j]-48;
for(j=m+1;j<=100;j++)b[j]=0;
for(j=1;j<=l;j++)
{
if(a[j]<b[j])
{
a[j]+=10;
a[j+1]--;
}
c[j]=a[j]-b[j];
}
while(c[l]==0){l--;if(l==0){is=0;break;}}
if(is){for(j=l;j>=1;j--)printf("%d",c[j]);
printf("\n");}
else printf("%d\n",0);
}
}
|
32
|
15581
|
int main()
{
char a[105], b[105];
int na[105], nb[105], n, i, j, k, lena, lenb;
cin >>n;
cin.get();
for (i = 1; i <= n; i ++)
{
memset(na, 0, sizeof(na));
memset(nb, 0, sizeof(nb));
cin.getline (a, 104);
cin.getline (b, 104);
lena = strlen(a);
lenb = strlen(b);
for (j = 0; j <= lena - 1; j ++)
{
na [j] = a [lena -j - 1] - '0';
}
for (j = 0; j <= lenb - 1; j ++)
{
nb [j] = b [lenb - j - 1] - '0';
}
for (j = 0; j <= lena - 1; j ++)
{
na[j] = na [j] - nb [j];
if (na [j] < 0)
{
na [j] = na [j] + 10;
na [j + 1] = na [j + 1] - 1;
}
}
j = 102;
while (na[j] == 0)
j --;
for (; j >= 0; j--)
{
if (j != 0)
cout << na[j];
else
cout << na[j] << endl;
}
cin.get();
}
return 0;
}
|
32
|
15582
|
int main()
{
char sn[10];
int n;
gets(sn);
n = atoi(sn);
int k;
char a[250][250];
char b[250][250];
char cc[10];
for(k=0;k<n;k++)
{
if( k==0)
{
gets(a[k]);
gets(b[k]);
}
else
{
gets(cc);
gets(a[k]);
gets(b[k]);
}
}
int lena[250];
int lenb[250];
int i;int j;
for(k=0;k<n;k++)
{
lena[k]=strlen(a[k]);
lenb[k]=strlen(b[k]);
int shua[251][250];int shub[251][250];
memset(shua[k],0,sizeof(shua[k]));
memset(shub[k],0,sizeof(shub[k]));
j=0;
for(i=lena[k]-1;i>=0;i--)
{
shua[k][j++]=a[k][i]-'0';
}
j=0;
for(i=lenb[k]-1;i>=0;i--)
{
shub[k][j++]=b[k][i]-'0';
}
for(i=0;i<250;i++)
{
shua[k][i]-=shub[k][i];
if(shua[k][i]<0)
{
shua[k][i]+=10;
shua[k][i+1]--;
}
}
int bStartOutput = 0;
for(i=249;i>=0;i--)
{
if(bStartOutput)
{
printf("%d",shua[k][i]);
}
else if(shua[k][i] > 0)
{
printf("%d",shua[k][i]);
bStartOutput = 1;
}
}
printf("\n");
if (!bStartOutput)
printf("0\n");
}
return 0;
}
|
32
|
15583
|
void main()
{
int i,j,n;
int la[50],lb[50];
char a[50][100],b[50][100],c[50][100]={'\0'};
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s",a[i]);
scanf("%s",b[i]);
la[i]=strlen(a[i]);
lb[i]=strlen(b[i]);
printf("\n");
}
for(i=0;i<n;i++)
{ for(j=0;j<la[i]-lb[i];j++)
c[i][j]=a[i][j];
for(j=la[i]-lb[i];j<la[i];j++)
c[i][j]=a[i][j]-b[i][j-la[i]+lb[i]]+48;
for(j=la[i]-1;j>=0;j--)
if(c[i][j]<48)
{c[i][j]+=10;
c[i][j-1]--;
}
}
for(i=0;i<n;i++)
{if(c[i][0]=='0')
for(j=0;i<la[i]-1;j++)
c[i][j]=c[i][j+1];
printf("%s\n",c[i]);
}
}
|
32
|
15584
|
void main()
{
int n,i,m,k,j,l;
char str[1000][1000],stt[1000][1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",str[i]);
scanf("%s",stt[i]);
}
for(i=0;i<n;i++)
{
m=strlen(str[i]);
k=strlen(stt[i]);
for(j=m-1;j>=m-k;j--)
{
if(str[i][j]>=stt[i][j+k-m])
str[i][j]=str[i][j]-stt[i][j+k-m]+48;
else
{
str[i][j]=str[i][j]-stt[i][j+k-m]+58;
str[i][j-1]=str[i][j-1]-1;
l=j-1;
while(str[i][l]<48)
{
str[i][l]=str[i][l]+10;
l=l-1;
str[i][l]=str[i][l]-1;
}
}
}
printf("%s\n",str[i]);
}
}
|
32
|
15585
|
void main()
{
int n,z,p,q,i,j,s,h;
char a[100],b[100];
scanf("%d",&n);
for(z=0;z<n;z++)
{
scanf("%s\n%s",a,b);
p=strlen(a);
q=strlen(b);
for(i=p-1,j=q-1;i>=0;i--,j--)
{
if(j>=0)
{
if(*(a+i)>=*(b+j))
*(a+i)=*(a+i)-*(b+j)+48;
else
{
*(a+i)=*(a+i)-*(b+j)+58;
*(a+i-1)=*(a+i-1)-1;
}
}
else
{
if(*(a+i)<'0')
{
*(a+i)=*(a+i)+10+48;
*(a+i-1)=*(a+i-1)-1;
}
else
break;
}
}
for(s=0;s<p;s++)
{
if(*(a+s)!='0')
{for(h=s;h<p;h++)
printf("%d",*(a+h)-48);
break;}
}
printf("\n");
}
}
|
32
|
15586
|
void main()
{
char a[100],b[100];
int k,d,la,lb,forb,n,i;
int c[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
d=10;
la=strlen(a);
lb=strlen(b);
for(k=la-1;k>=0;k--)
{if((lb-la+k)<0)
forb=48;
else
forb=b[lb-la+k];
d=a[k]-1+d/10+10-forb;
c[k]=d%10;
}
for(k=0;k<=la-1;k++)
{if(c[k]!=0) break;
}
for(;k<=la-1;k++)
printf("%d",c[k]);
putchar('\n');
}
}
|
32
|
15587
|
int main (){
char a[101],b[101],d[101];
char c[101];
int n,i,j,k,h;
cin>>n;
for(i=0;i<n;i++){
cin>>a>>b;
for(j=0;j<101;j++)
if(a[j]=='\0')break;
for(k=0;k<101;k++)
if(b[k]=='\0')break;
for(h=0;k>=0;k--,j--,h++){
if(a[j]-b[k]<0){
c[h] = a[j]-b[k]+'0'+10;
a[j-1]=a[j-1]-1;}
else c[h] = a[j]-b[k]+'0';
}
for(;j>=0;j--,h++)
c[h]=a[j];
for(k=h-1;k>0;k--)
if(c[k]!='0')break;
for(;k>0;k--)
cout<<c[k];
cout<<endl;}
return 0;
}
|
32
|
15588
|
char str1[N],str2[N],temp[N];
int max(int x,int y)
{
return(x>y?x:y);
}
void major(char str1[],char str2[])
{
int a[N],b[N];
int len1,len2,len,t,jump,i;
len1=strlen(str1);
len2=strlen(str2);
if(len1<len2)
{
strcpy(temp,str1);t=len1;
strcpy(str1,str2);len1=len2;
strcpy(str2,temp);len2=t;
}
len=max(len1,len2);
jump=len-len2+1;
for(i=len;i>=0;i--)
str1[i]=str1[i-1];
str1[0]='0';
for(i=len;i>=jump;i--)
{
str2[i]=str2[i-jump];
}
for(i=0;i<jump;i++)
str2[i]='0';
for(i=len;i>=0;i--)
{
a[i]=str1[i]-'0';
b[i]=str2[i]-'0';
}
for(i=len;i>=0;i--)
{
if(a[i]>=b[i])
a[i]=a[i]-b[i];
else
{
a[i]=a[i]+10-b[i];
a[i-1]-=1;
}
}
if(a[1]==0)
{
for(i=0;i<=len-2;i++)
temp[i]=a[i+2]+'0';
temp[len-1]='\0';
}
else if(a[1]!=0)
{
for(i=0;i<=len-1;i++)
temp[i]=a[i+1]+'0';
temp[len]='\0';
}
printf("%s\n",temp);
}
void main()
{
char s1[100][N],s2[100][N];
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",s1[i]);
scanf("%s",s2[i]);
if(i<n-1)
printf("\n");
}
for(i=0;i<n;i++)
major(s1[i],s2[i]);
}
|
32
|
15589
|
int main()
{
int n,length_a,length_b,i,j,k;
char a[128],b[128];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
length_a=strlen(a);
length_b=strlen(b);
for(j=length_a;(length_a-j)<length_b;j--)
{
if (a[j-1]>=b[length_b-1+j-length_a])
a[j-1]=a[j-1]-b[length_b+j-length_a-1]+48;
else
{
a[j-1]=a[j-1]+10-b[length_b+j-length_a-1]+48;
k=j-2;
while(a[k]=='0')
{
a[k]='9';
k--;
}
a[k]--;
}
}
k=0;
while(a[k]=='0')
k++;
for(;k<length_a;k++)
putchar(a[k]);
putchar('\n');
}
return 0;
}
|
32
|
15590
|
int main(int argc, char* argv[])
{
int i,a[101],b[101];
char A[101],B[101];
int n,l1,l2;
int j,t,h;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(h=0;h<101;h++)
a[h]=b[h]=0;
int k=1;
scanf("%s%s",A,B);
l1=strlen(A);
l2=strlen(B);
for(j=0;j<l1;j++)
a[100-l1+j]=A[j]-'0';
for(j=0;j<l2;j++)
b[100-l2+j]=B[j]-'0';
for(j=99;j>0;j--)
{
if(a[j]>=b[j]) a[j]=a[j]-b[j];
else
{
a[j]-=b[j]-10;
a[j-1]-=1;
}
}
for(j=0;j<100;j++)
{
if(a[j]!=0)
{
k=j;
break;
}
}
for(j=k;j<100;j++)
printf("%d",a[j]);
printf("\n");
}
return 0;
}
|
32
|
15591
|
void main()
{
char a[10000],b[10000],c[10000];
int d,i,n,j,m,t,s,w;
scanf("%d",&w);
for(j=0;j<w;j++)
{
scanf("%s",a);
scanf("%s",b);
for(n=1;a[n]!='\0';)
n++;
for(m=1;b[m]!='\0';)
m++;
d=n-m;
for(i=m-1;i>=0;i--)
b[i+d]=b[i];
for(i=0;i<n-m;i++)
b[i]='0';
for(i=n-1;i>=n-m;i--)
{
t=a[i]-b[i];
if(t<0)
{
t=10+a[i]-b[i];
a[i-1]=a[i-1]-1;
}
c[i]=t+'0';
s=i-1;
while(a[s]<'0')
{
a[s]=a[s]+10;
a[s-1]=a[s-1]-1;
s--;
}
}
for(i=0;i<n-m;i++)
c[i]=a[i];
for(i=0;i<n;i++)
printf("%c",c[i]);
printf("\n");
}
}
|
32
|
15592
|
int main()
{
int i,j,n;
char a0[110],b0[110];
unsigned int a[110]={0},b[110]={0};
for(cin>>n;n>=1;--n)
{
cin>>a0>>b0;
for(i=0;i<=strlen(a0)-1;++i)
a[i]=a0[i]-'0';
for(i=0;i<=strlen(b0)-1;++i)
b[i-strlen(b0)+strlen(a0)]=b0[i]-'0';
for(i=strlen(a0)-1;i>=strlen(a0)-strlen(b0);--i)
{
if(a[i]>=b[i])
a[i]=a[i]-b[i];
else
{
for(j=i-1;j>=0;--j)
{
if(a[j]!=0)
{
a[j]=a[j]-1;
for(j=j+1;j<=i-1;++j)
{
a[j]=9;
}
a[i]=10+a[i]-b[i];
break;
}
}
}
}
for(i=0;i<=strlen(a0)-1;++i)
cout<<a[i];
cout<<endl;
}
return 0;
}
|
32
|
15593
|
void main()
{
char a0[100],b0[100];
int i,j,k,l,add,n,x,y,a[100]={0},b[100]={0},c[100][100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{ for(j=0;j<100;j++)
a0[i]='\0';
b0[i]='\0';
scanf("%s",a0);
scanf("%s",b0);
x=strlen(a0);
y=strlen(b0);
for(j=0;j<x;j++)
if(a0[j]!='\0')
a[j]=a0[j]-48;
for(j=0;j<y;j++)
if(b0[j]!='\0')
b[j]=b0[j]-48;
for(k=x-1,l=99;k>=0;k--,l--)
a[l]=a[k];
for(;l>=0;l--)
a[l]=0;
for(k=y-1,l=99;k>=0;k--,l--)
b[l]=b[k];
for(;l>=0;l--)
b[l]=0;
add=0;
for(j=99;j>=100-x;j--)
{
if((a[j]-add)<b[j])
{c[i][j]=a[j]+10-b[j]-add;add=1;}
else
if((a[j]-add)>=b[j])
{c[i][j]=a[j]-b[j]-add;add=0;}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<100;j++)
if(c[i][j]!=0)
break;
k=j;
for(;k<100;k++)
printf("%d",c[i][k]);
printf("\n");
}
}
|
32
|
15594
|
void main()
{
char bjs[200],js[200];
int i,j,k,l,count,n,c;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
if(strcmp(bjs,js)!=0)
{
scanf("%s",bjs);
scanf("%s",js);
c=strlen(bjs)-strlen(js);
for(j=strlen(js)-1;j>=0;j--)
{
if(bjs[c+j]<js[j])
{
for(k=1;;k++)if(bjs[c+j-k]>48)break;
bjs[c+j-k]-=1;
for(l=1;l<k;l++)bjs[c+j-l]=57;
bjs[c+j]=58+bjs[c+j]-js[j];
}
else bjs[c+j]=bjs[c+j]-js[j]+48;
}
for(j=0;;j++)if(bjs[j]!=48)break;
for(k=j;k<strlen(bjs);k++)printf("%c",bjs[k]);
putchar(10);
}
else printf("0\n");
}
}
|
32
|
15595
|
void subtraction (char big[100], char small[100], int n)
{
int i;
for (i=n;i>=0;i--)
{
if (big[i]-small[i]>=0)
big[i]=big[i]-small[i]+'0';
else
{
big[i]=big[i]-small[i]+10+'0';
small[i-1]=small[i-1]+1;
}
}
}
void main ()
{
char numbig[100], numsmall[100];
int i,j,lennumbig,lennumsmall,n,k;
scanf("%d",&n);
for (k=0;k<n;k++)
{
scanf ("%s",&numbig);
scanf ("%s",&numsmall);
getchar();
lennumbig=strlen(numbig);
lennumsmall=strlen(numsmall);
for (i=lennumbig,j=lennumsmall;i>=lennumbig-lennumsmall;i--,j--)
numsmall[i]=numsmall[j];
for (i=0;i<lennumbig-lennumsmall;i++)
numsmall[i]='0';
subtraction(numbig,numsmall,lennumbig-1);
puts(numbig);
}
}
|
32
|
15596
|
void main()
{void min(char a[],char b[]);
int n,i,j,k;
char a[100][110];
char b[100][110];
scanf("%d",&n);
for (i=0;i<n;i++)
{ scanf("%s %s",a[i],b[i]);
printf("\n");
}
for (i=0;i<n;i++)
min(a[i],b[i]);
}
void min(char a[],char b[])
{
int i,j=0,pa[110],pb[110];
int la=strlen(a);
int lb=strlen(b);
for(i=la-1;i>=0;i--)
{
pa[j++]=a[i]-'0';
}
for(i=j;i<109;i++)
pa[i]=0;
j=0;
for(i=lb-1;i>=0;i--)
{
pb[j++]=b[i]-'0';
}
for(i=j;i<109;i++)
pb[i]=0;
for(i=0;i<la;i++)
{
pa[i]-=pb[i];
if(pa[i]<0)
{
pa[i]+=10;
pa[i+1]--;
}
}
int out=0;
for(i=la-1;i>=0;i--)
{
if(out)
printf("%d",pa[i]);
else if(pa[i])
{
printf("%d",pa[i]);
out=1;
}
}
printf("\n");
return;
}
|
32
|
15597
|
/**
* @file 1000012907_1.cpp
* @author ???
* @date 2010?11?17
* @description
* ??????: ?????
*/
int main()
{
int n, i, len1, len2, j, k, char11[101], char22[101], flag = 0, answer[101];
char char1[101], char2[101];
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> char1 >> char2;
len1 = strlen(char1);
len2 = strlen(char2);
memset(answer, '\0', sizeof(answer));
memset(char11, '\0', sizeof(char11));
memset(char22, '\0', sizeof(char22));
k = 0;
for (j = len1 - 1; j >= 0; j--)
{
char11[k] = char1[j] - '0';
k++;
}
k = 0;
for (j = len2 - 1; j >= 0; j--)
{
char22[k] = char2[j] - '0';
k++;
}
for (j = 0; j < len1; j++)
{
if (char11[j] < char22[j])
{
char11[j + 1] = char11[j + 1] - 1;
answer[j] = char11[j] + 10 - char22[j];
}
else
{
answer[j] = char11[j] - char22[j];
}
}
for (j = len1 - 1; j >= 0; j--)
{
if (answer[j] != 0)
{
flag = 1;
}
if (flag == 1)
{
cout << answer[j];
}
}
cout << endl;
}
return 0;
}
|
32
|
15598
|
int main()
{int n,i,j,p,q,m;
char a[100],b[100],c[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s",a);
scanf("%s",b);
p=strlen(a);
q=strlen(b);
for(j=0;j<q;j++)
{m=a[p-1-j]-b[q-1-j];
if(m<0) m+=10,a[p-2-j]-=1;
c[p-1-j]='0'+m;
}
for(j=0;j<p-q;j++)
c[j]=a[j];
for(j=0;j<p;j++)
if(c[j]!='0')break;
for(;j<p;j++)
printf("%c",c[j]);
printf("\n");
}
}
|
32
|
15599
|
int trans(char str[], int a[])
{
int l=(int)strlen(str);
int i;
for (i=0;i<l;i++)
{ a[l-i-1]=str[i]-'0';
}
return l;
}
void print(int a[], int l)
{
int k=l-1;
int i;
while (a[k]==0 && k>0)
{ k--;
}
for (i=k;i>=0;i--)
{ printf("%d",a[i]);
}
}
int minus(int a[], int al, int b[], int bl,int c[])
{
int i;
for (i=0;i<al;i++)
{ c[i]=a[i];
if (i<bl) c[i]=c[i]-b[i];
}
for (i=0;i<al;i++)
{ if (c[i]<0)
{ c[i+1]--;
c[i]=c[i]+10;
}
}
return al;
}
int main()
{
char s1[101],s2[101];
int a[101],b[101],c[101];
int al,bl,cl,i,n;
scanf("%d",&n);
for (i=0;i<n;i++)
{ scanf ("%s%s",s1,s2);
al=trans(s1,a);
bl=trans(s2,b);
cl=minus(a,al,b,bl,c);
print(c,cl);
printf("\n");
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.