id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
15,900 |
int n,i,j;
int a[105],b[105],c[105];
int l1,l2,ml;
char s1[105],s2[105];
void jian()
{
for(i=0;i<ml+3;i++)
a[i]=b[i]=c[i]=0;
for(i=0;i<l1;i++)
{
a[i]=s1[l1-i-1]-'0';
}
for(i=0;i<l2;i++)
{
b[i]=s2[l2-i-1]-'0';
}
for(i=0;i<ml;i++)
{
c[i]=a[i]-b[i];
if(c[i]<0)
{
c[i]+=10;
a[i+1]-=1;
}
}
while(c[ml]==0 && ml>0)
ml--;
for(i=ml;i>=0;i--)
printf("%d",c[i]);
printf("\n");
}
int main()
{
scanf("%d",&n);
while(n--)
{
scanf("%s",s1);
scanf("%s",s2);
l1=strlen(s1);
l2=strlen(s2);
ml=l1;
jian();
}
return 0;
}
|
32
|
15,901 |
void main()
{
char a[50][100],b[50][100];
int n,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%s",a[i],b[i]);
for(i=0;i<n;i++)
{
for(j=strlen(a[i])-1,k=strlen(b[i])-1;k>=0;j--,k--)
{
a[i][j]=a[i][j]-b[i][k]+'0';
if(a[i][j]<'0')
{
a[i][j]=a[i][j]+10;
a[i][j-1]=a[i][j-1]-1;
}
}
printf("%s\n",a[i]);
}
}
|
32
|
15,902 |
int main()
{
char num1[100], num2[100], num3[100];
int i, j, n, len1, len2;
cin>>n;
for(i=0;i<n;i++)
{
cin>>num1;
cin>>num2;
len1 = strlen(num1);
len2 = strlen(num2);
num3[len1]='\0';
for(j=(len1-1);j>=len1-len2;j--)
{
if(num1[j]>=num2[j-len1+len2])
{
num3[j]=num1[j]-num2[j-len1+len2]+48;
}
else
{
num3[j]=58-(num2[j-len1+len2]-num1[j]);
num1[j-1]=num1[j-1]-1;
}
}
for(j=(len1-len2-1);j>=0;j--)
{
num3[j]=num1[j];
}
cout<<num3<<endl;
}
return 0;
}
|
32
|
15,903 |
// ?????.cpp : ??????????????
//
int main()
{
int n,j,len,len2;
cin>>n;
for(int i=0;i<n;i++)
{
char A[101],B[101],C[101],D[101];
cin.getline(D,100);
cin.getline(A,100);
cin.getline(B,100);
len=strlen(A);
for(j=0;2*j<len;j++)
{
char k;
k=A[j];
A[j]=A[len-j-1];
A[len-j-1]=k;
}
len2=strlen(B);
for(j=0;2*j<len2;j++)
{
char k;
k=B[j];
B[j]=B[len2-j-1];
B[len2-j-1]=k;
}
for(j=len2;j<len;j++)B[j]='0';
B[j]=0;
for(j=0;j<len;j++)
{
C[j]=(int)A[j]+'0'-(int)B[j];
if(C[j]<'0')
{
A[j+1]--;
C[j]+=10;
}
}
for(j=len-1;j>0&&C[j]=='0';j--);
for(;j>=0;j--)cout<<C[j];cout<<endl;
}
return 0;
}
|
32
|
15,904 |
void main()
{
int n,i,m;
scanf("%d",&n);
char a[100][101],b[100][101];
scanf("%s",a[0]);
scanf("%s",b[0]);
for(i=1;i<n;i++)
{
printf("\n");
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
int c[101],j,l1,l2;
char d[101];
l1=strlen(a[i]);
l2=strlen(b[i]);
for(m=0;m<(l1-l2);m++)
d[m]='0';
for(m=1;m<=l2;m++)
d[l1-m]=b[i][l2-m];
for(j=1;j<=l1;j++)
{
if(a[i][l1-j]>=d[l1-j])
c[j]=a[i][l1-j]-d[l1-j];
else
{
c[j]=(10+a[i][l1-j])-d[l1-j];
a[i][l1-j-1]=a[i][l1-j-1]-1;
}
}
for(j=l1;j>=1;j--)
printf("%d",c[j]);
printf("\n");
}
}
|
32
|
15,905 |
void main()
{
int i,j,n,la,lb,aa,bb,cc;
char a[100][100],b[100][100],c[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(j=0;j<n;j++)
{
la=strlen(a[j]);
lb=strlen(b[j]);
for(i=0;i<la;i++)
{
if((lb-1-i)>=0)
{
aa=a[j][la-1-i]-48;
bb=b[j][lb-1-i]-48;
if(aa>=bb)
{ cc=aa-bb; }
if(aa<bb)
{
aa=aa+10;
cc=aa-bb;
a[j][la-2-i]=a[j][la-2-i]-1;
}
c[j][la-1-i]=cc+48;
}
if((lb-1-i)<0)
{
c[j][la-1-i]=a[j][la-1-i];
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",c[i]);
}
}
|
32
|
15,906 |
/**
* @file C8Q4.cpp
* @author ???
* @date 2013-11-17
* @description
* ??????:?????
*/
int main()
{
char c1[MAX]; //???
char c2[MAX]; //??
int n; //????
cin >> n;
for (int i = 0 ; i < n; i++)
{
cin.get(); //????????
cin.getline(c1,MAX-1);
cin.getline(c2,MAX-1);
int len1,len2 ;
len1 = strlen(c1);
len2 = strlen(c2);
int p1,p2; //????????
p2 = len2-1;
p1 = len1-1;
while(p2 >= 0)
{
c1[p1] -= c2[p2] - '0'; //????
if (c1[p1] < '0') //????
{
for (int i = p1 - 1 ; i >= 0 ; i--) //??????
{
c1[i+1] += 10;
c1[i] -= 1;
if (c1[i] >= '0') //????????
break;
}
}
p2--;p1--; //?????????
}
for(p1 = 0 ; p1 < len1 ; p1++ ) //?????0
{
if (c1[p1] != '0')
break;
}
cout << c1 + p1 << endl;
}
}
|
32
|
15,907 |
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
|
15,908 |
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
|
15,909 |
void main()
{
int m1,m2,n,k=1,p,i;
char a[100],b[100],c[100],d[100];
scanf("%d",&n);
while(k<=n)
{
scanf("%s",a);
scanf("%s",b);
k++;
m1=strlen(a);m2=strlen(b);
for(i=0;i<=m1;i++)
a[i]=a[i]-48;
for(i=0;i<=m2;i++)
b[i]=b[i]-48;
p=m1-m2;
for(i=0;i<m2;i++) c[i+p]=b[i];
for(i=0;i<p;i++) c[i] = 0;
for(i=m1-1;i>=0;i--)
{
if(a[i]>=c[i]) d[i]=a[i]-c[i];
else
{
d[i]=a[i]+10-c[i]; a[i-1]=a[i-1]-1;
}
}
for(i=0;i<m1;i++)
printf("%d",d[i]);
printf("\n");
}
}
|
32
|
15,910 |
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
|
15,911 |
void main()
{
char a[20][100];
char b[20][100];
int k,l,j,t,p,i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
t=(int)strlen(a[i]);
p=(int)strlen(b[i]);
for(k=t-1,l=p-1;l>=0;k--,l--)
if(a[i][k]>=b[i][l])
a[i][k]=a[i][k]-b[i][l];
else
{
a[i][k]=a[i][k]+10-b[i][l];
a[i][k-1]=a[i][k-1]-1;
}
for(j=0;j<(t-p);j++)
printf("%c",a[i][j]);
for(j=t-p;j<t;j++)
printf("%c",a[i][j]+'0');
printf("\n");
}
}
|
32
|
15,912 |
void subtr(char a[101],char b[101])
{
int c[101];
int i,k,d=0;
for(i=0;i<=100;i++)
{
a[i]=a[i]-'0';
b[i]=b[i]-'0';
}
for(i=100;i>=0;i--)
{
if ((a[i]-b[i])<0)
{
a[i-1]=a[i-1]-1;
c[i]=a[i]+10-b[i];
}
else
{
c[i]=a[i]-b[i];
}
}
for(k=0;k<100;k++)
{
if (c[k]==0)
d++;
else break;
}
for(k=d;k<101;k++)
printf("%d",c[k]);
printf("\n");
}
void main ()
{
int l,k,i,j;
int l1[20],l2[20];
char m;
char a[20][101],b[20][101];
char c[101],d[101];
scanf("%d",&l);
for(i=1;i<=l;i++)
{
for(j=1;j<=100;j++)
{
a[i][j]='\0';
b[i][j]='\0';
}
}
for(i=1;i<=l;i++)
{
scanf("%s",&a[i]);
scanf("%s",&b[i]);
}
for(i=1;i<=l;i++)
{
l1[i]=0;
l2[i]=0;
for(j=0;j<100;j++)
{
if(a[i][j]!='\0')
l1[i]=l1[i]+1;
}
for(j=0;j<100;j++)
{
if(b[i][j]!='\0')
l2[i]=l2[i]+1;
}
}
for(i=1;i<=l;i++)
{
for(j=0;j<100;j++)
{
c[j]=a[i][j];
d[j]=b[i][j];
}
for(k=100;k>=(101-l1[i]);k--)
{
c[k]=c[k-(101-l1[i])];
}
for(k=0;k<(101-l1[i]);k++)
c[k]='0';
for(k=100;k>=(101-l2[i]);k--)
{
d[k]=d[k-(101-l2[i])];
}
for(k=0;k<(101-l2[i]);k++)
d[k]='0';
subtr(c,d);
}
}
|
32
|
15,913 |
int main()
{
int n,i,j;
cin>>n;
cin.get();
for(i=1;i<=n;i++)
{
char str1[1000],str2[1000],str3[1000],str4[1000];
cin.getline(str1,900);
cin.getline(str2,900);
int a=strlen(str1);
int b=strlen(str2);
for(j=0;j<a;j++)
{
str3[j]=str1[a-j-1];
}
for(j=0;j<b;j++)
{
str4[j]=str2[b-j-1];
}
for(j=0;j<b;j++)
{
if(str3[j]>=str4[j])
str3[j]=str3[j]-str4[j]+'0';
else
{
str3[j]=10+str3[j]-str4[j]+'0';
str3[j+1]--;
}
}
for(j=a-1;j>=0;j--)cout<<str3[j];
cout<<endl;
cin.get();
}
return 0;
}
|
32
|
15,914 |
main()
{
int i,k,r,N;
int a1[250],b1[250],c[250];
char a[250],b[250];
scanf("%d",&N);
for (i=1;i<=N;i++)
{
for (k=0;k<250;k++)
{
a[k]=0;
b[k]=0;
a1[k]=0;
b1[k]=0;
c[k]=0;
}
scanf("%s%s",a,b);
for (k=249;k>=0;k--)
if (a[k]>='0'&&a[k]<='9')
a1[k+250-strlen(a)]=a[k]-'0';
for (k=249;k>=0;k--)
if (b[k]>='0'&&b[k]<='9')
b1[k+250-strlen(b)]=b[k]-'0';
/*for (k=0;k<250;k++)
printf("%d",a1[k]);
printf("\n");
for (k=0;k<250;k++)
printf("%d",b1[k]);
printf("\n");*/
for (k=249;k>=0;k--)
{
if (a1[k]<b1[k])
{
a1[k]+=10;
a1[k-1]--;
}
c[k]=a1[k]-b1[k];
}
r=0;
while(c[r]<=0&&r<250)
r++;
if (r==250)
printf("0");
for (k=r;k<250;k++)
printf("%d",c[k]);
printf("\n");
}
}
|
32
|
15,915 |
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
|
15,916 |
int main()
{
char a[10][100],b[10][100];
int n,i,j,lengtha[10],lengthb[10],begin;
scanf("%d",&n);
for(i=0;i<10;i++)for(j=0;j<100;j++){a[i][j]='\0';b[i][j]='\0';}
for(i=0;i<10;i++){lengtha[i]=0;lengthb[i]=0;}
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
for(j=0;a[i][j]!='\0';j++)lengtha[i]++;
for(j=0;b[i][j]!='\0';j++)lengthb[i]++;
for(j=lengthb[i]-1;j>=0;j--)b[i][j+lengtha[i]-lengthb[i]]=b[i][j];
for(j=0;j<lengtha[i]-lengthb[i];j++)b[i][j]='0';
for(j=lengtha[i]-1;j>=0;j--)
{
if(b[i][j]<=a[i][j]){a[i][j]=a[i][j]-b[i][j]+48;}
else{a[i][j]=10+a[i][j]-b[i][j]+48;a[i][j-1]--;}
}
begin=0;
for(j=0;j<lengtha[i]-1;j++){if(a[i][j]!='0'){printf("%c",a[i][j]);begin=1;}else if(begin==1)printf("%c",a[i][j]);}
printf("%c",a[i][lengtha[i]-1]);
printf("\n");
}
return 0;
}
|
32
|
15,917 |
void main()
{
char a[30][100], b[30][100], c[30][100];
int n, i, j, p[100], q[100], alpha[30][100], beta[30][100], gama[30][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
for(j=0;a[i][j]!='\0';j++);
p[i]=j;
for(j=0;b[i][j]!='\0';j++);
q[i]=j;
for(j=0;j<p[i];j++)
alpha[i][j]=a[i][p[i]-1-j]-48;
for(j=0;j<q[i];j++)
beta[i][j]=b[i][q[i]-1-j]-48;
for(j=q[i];j<p[i];j++)
beta[i][j]=0;
for(j=0;j<p[i];j++)
{
gama[i][j]=alpha[i][j]-beta[i][j];
if(gama[i][j]<0)
{
gama[i][j]+=10;
alpha[i][j+1]-=1;
}
}
for(j=0;j<p[i];j++)
c[i][j]=gama[i][p[i]-1-j]+48;
}
for(i=0;i<n;i++)
{
for(j=0;c[i][j]=='0';j++);
for(;j<p[i];j++)
printf("%c",c[i][j]);
printf("\n");
}
}
|
32
|
15,918 |
int main()
{
int n,i,j,k,l,tem;
char a[100][1000],b[100][1000];
int c[100][1000];
cin>>n;
for(i=0;i<n;i++)
{
cin.get();
cin.get(a[i],900);
cin.get();
cin.get(b[i],900);
cin.get();
for(j=strlen(a[i])-1;j>=strlen(a[i])-strlen(b[i]);j--)
{
c[i][j]=a[i][j]-b[i][j-strlen(a[i])+strlen(b[i])];
if(c[i][j]<0)
{
c[i][j]=c[i][j]+10;
a[i][j-1]=a[i][j-1]-1;
}
}
for(j>=strlen(a[i])-strlen(b[i])-1;j>=0;j--)
{
c[i][j]=a[i][j]-'0';
}
for(j=0;j<strlen(a[i]);j++)
{
if(c[i][j]!=0)
{
tem=j;
break;
}
}
for(j=tem;j<strlen(a[i]);j++)
{
cout<<c[i][j];
}
cout<<endl;
}
}
|
32
|
15,919 |
int main()
{
int n;
cin>>n;
while(n--)
{
getchar();
char a[260]={0},b[260]={0},c[260]={0};
cin.getline(a,255);
cin.getline(b,255);
int a1[260]={0},b1[260]={0},c1[260]={0},i=0,na,nb;
while(a[++i]!=0)
;
na=i;
while(i-->0)
a1[251-na+i]=a[i]-'0';
while(b[++i]!=0)
;
nb=i;
while(i-->0)
b1[251-nb+i]=b[i]-'0';
for(i=255;i>0;i--)
{
c1[i]+=a1[i]-b1[i];
if(c1[i]<0)
{
c1[i]+=10;
c1[i-1]-=1;
}
}
for(i=0;c1[i]==0&&i<255;i++)
;
if(i==255)
cout<<"0";
else
for(;i<251;i++)
cout<<c1[i];
cout<<endl;
}
return 0;
}
|
32
|
15,920 |
int main()
{
int n,i,j,k,str1[100]={0},str2[100]={0},len1,len2;
char a[100]={0},b[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a,b);
len1=strlen(a),len2=strlen(b);
k=0;
for(j=len1-1;j>=0;j--)
{
str1[k++]=a[j]-'0';
}
k=0;
for(j=len2-1;j>=0;j--)
{
str2[k++]=b[j]-'0';
}
for(j=0;j<len1;j++)
{
str1[j]-=str2[j];
if(str1[j]<0)
{
str1[j]+=10;
str1[j+1]--;
}
}
for(j=len1-1;j>=0;j--)
printf("%d",str1[j]);
printf("\n");
for(j=0;j<100;j++)
{
str1[j]=0;
}
for(j=0;j<100;j++)
{
str2[j]=0;
}
for(j=0;j<100;j++)
{
a[j]=0;
}
for(j=0;j<100;j++)
{
b[j]=0;
}
}
return 0;
}
|
32
|
15,921 |
main()
{
char a[100],b[100],c[20][100];
int n,i,j,j1,j2,lena,lenb;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
j=0;
for(j1=lena-1,j2=lenb-1;j2>=0;j1--,j2--)
{
if(j==1) a[j1]=a[j1]-j;
j=0;
if(a[j1]<b[j2])
{
a[j1]=a[j1]+10-b[j2]+'0';
j=1;
}
else a[j1]=a[j1]-b[j2]+'0';
}
if(j==1) a[j1]=a[j1]-j;
for(j1=0;j1<lena;j1++)
{
if(a[j1]!='0') break;
}
for(j=j1,j2=0;j<lena;j++,j2++)
c[i][j2]=a[j];
c[i][j2]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",c[i]);
}
|
32
|
15,922 |
int main()
{
char num1[200],num2[200];
int result[200];
int n,i,j,k,flag=0;
int len1,len2;
cin>>n;
for (i=1;i<=n;i++)
{
cin.get();
cin.getline (num1,200);
cin.getline (num2,200);
len1=strlen(num1);
len2=strlen(num2);
for (j=len1-1,k=len2-1;j>=0;j--,k--)
{
if (k>=0)
{
if (flag==1)
{
num1[j] -= 1;
flag=0;
}
if (num1[j]<num2[k])
{
num1[j] += 10;
flag=1;
}
result[j]=num1[j]-num2[k];
}
else
{
if (flag==1)
{
num1[j] -=1;
flag=0;
}
result[j]=num1[j]-'0';
}
}
for (j=0;j<len1;j++)
{
if (result[j]!=0)
flag=1;
if (result[j]==0 && flag==0)
continue;
else cout<<result[j];
}
cout<<endl;
flag=0;
}
return 0;
}
|
32
|
15,923 |
void main()
{
int n,la,lb,i,j;
char a[100][100],b[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
la=strlen(a[i]);
lb=strlen(b[i]);
for(j=1;j<=lb;j++)
{
if(a[i][la-j]>=b[i][lb-j]) a[i][la-j]=a[i][la-j]-b[i][lb-j];
else {a[i][la-j]=a[i][la-j]+10-b[i][lb-j];a[i][la-j-1]-=1;}
}
for(j=0;j<la-lb;j++) a[i][j]=a[i][j]-'0';
for(j=0;j<la;j++)
printf("%d",a[i][j]);
printf("\n");
}
}
|
32
|
15,924 |
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
|
15,925 |
void main()
{
int n,i,c,j,k,m;
char a[100][100],b[100][100],d[100][100];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%s %s",a[i],b[i]);
for(i=1;i<=n;i++)
{
c=strlen(a[i])-strlen(b[i]);
for(j=strlen(b[i]);j>=0;j--)
b[i][j+c]=b[i][j];
for(k=0;k<c;k++)
b[i][k]='0';
}
for(i=1;i<=n;i++)
{
for(m=(strlen(a[i])-1);m>=0;m--)
{
if(a[i][m]>=b[i][m])
d[i][m]=a[i][m]-b[i][m]+48;
if(a[i][m]<b[i][m])
{
d[i][m]=a[i][m]-b[i][m]+58;
a[i][m-1]=a[i][m-1]-1;
}
}
d[i][strlen(a[i])]='\0';
}
for(i=1;i<=n;i++)
printf("%s\n",d[i]);
}
|
32
|
15,926 |
int flag=0;
char minus(char a,char b)
{ int z;
if ((int)a>=(int)b) z=(int)a-(int)b+48;
else
{
z=(int)a-(int)b+10+48;
flag=1;
}
return((char)z);
}
void main()
{
char a[100],b[100];
int n,i,j,k,la,lb,m;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",a,b);
printf("\n");
la=strlen(a);
lb=strlen(b);
for(j=0;j<lb;j++)
{ flag=0;
a[la-j-1]=minus(a[la-j-1],b[lb-j-1]);
if(flag)
{
for(k=1;;k++)
{
if(a[la-j-1-k]!='0')
{
a[la-j-1-k]=a[la-j-1-k]-1;
if(k>1)
for(m=1;m<=k-1;m++)
a[la-j-1-m]='9';
break;
}
}
}
}
printf("%s\n",a);
}
}
|
32
|
15,927 |
main()
{int n,g;
scanf("%d",&n);
for(g=0;g<n;g++)
{
char a[1000];
char b[1000],c[1000];
memset(c,'0',sizeof(c));
scanf("%s %s",a,b);
int l1,l2;
l1=strlen(a);
l2=strlen(b);
int l;
if(l1>l2)
l=l1;
else l=l2;
//printf("%d\n",l);
int i;
for(i=l;i>l-l1;i--)
{
a[i]=a[i-(l-l1+1)];
}
//printf("%c\n",a[l]);
for(i=l;i>l-l2;i--)
b[i]=b[i-(l-l2+1)];
//printf("%c\n",b[l]);
for(i=0;i<=l-l1;i++)
{
a[i]='0';
}
//printf("%c\n",a[l-l1]);
for(i=0;i<=l-l2;i++)
{
b[i]='0';
}
//printf("%c\n",b[l-l2+1]);
int flag=0;
for(i=l;i>0;i--)
{int sum=0;
if(flag==1)
sum=a[i]-b[i]-1;
if(flag==0)
sum=a[i]-b[i];
if(sum<0)
{c[i]=sum+'0'+10; flag=1;}
else
{c[i]=sum+'0';flag=0;}
}
//printf("%c %c %c %c\n",c[l],c[3],c[2],c[1]);
int flag1=0;
//printf("%c\n",c[0]);
int t;
for(i=0;i<=l;i++)
{
if(c[i]!='0')
{t=i;break;}
}
for(i=t;i<=l;i++)
printf("%c",c[i]);
printf("\n");
/*if(flag)
{
for(i=0;i<=l;i++)
printf("%c",c[i]);
}
else
{for(i=1;i<=l;i++)
printf("%c",c[i]);
}*/
}
}
|
32
|
15,928 |
//***************************
//*???????? **
//*?????? **
//*???2013.11.15 **
//***************************
int main()
{
int n;
cin>>n;
for(int k=1;k<=n;k++)
{
const int MAX_LEN = 200;
unsigned num1[MAX_LEN+1];
unsigned num2[MAX_LEN];
char str1[MAX_LEN + 1];
char str2[MAX_LEN + 1];
cin.get();
cin.getline(str1, MAX_LEN + 1);
cin.getline(str2, MAX_LEN + 1);
int nLen1 = strlen(str1);
int nLen2 = strlen(str2);
memset(num1, 0, sizeof(num1));
memset(num2, 0, sizeof(num2));
int i, j = 0;
for (i = nLen1 - 1; i >= 0; i--)
num1[j++] = str1[i] - '0'; //???????????????
j = 0;
for (i = nLen2 - 1; i >= 0; i--)
num2[j++] = str2[i] - '0';
for (i = 0; i < MAX_LEN; i++)
{
num1[i] -= num2[i]; //???????????
if(num1[i] >= 10) //????????
{
num1[i] += 10;
num1[i + 1]--; //????
}
}
i = MAX_LEN;
while (num1[i]==0)
i--; //???????0??
for (; i >= 0; i--)
cout << num1[i]; //??????
cout << endl;
}
return 0;
}
|
32
|
15,929 |
int main()
{
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++){
char a[101]={'0'},b[101]={'0'};
scanf("%s\n%s",a,b);
int lena,lenb;
lena=strlen(a);
lenb=strlen(b);
int na[101]={0},nb[101]={0},nc[101]={0};
int curr;
for(curr=0;curr<lena;curr++){
na[curr]=a[lena-1-curr]-'0';
}
for(curr=0;curr<lenb;curr++){
nb[curr]=b[lenb-1-curr]-'0';
}
int r=0;
for(curr=0;curr<lena;curr++){
if(na[curr]-r>=nb[curr]){
nc[curr]=na[curr]-r-nb[curr];
r=0;
}
else{
nc[curr]=na[curr]-r+10-nb[curr];
r=1;
}
}
printf("\n");
if(nc[lena-1]!=0)printf("%d",nc[lena-1]);
for(curr=lena-2;curr>=0;curr--)printf("%d",nc[curr]);
}
return 0;
}
|
32
|
15,930 |
void j(char a[],char b[])
{
int i,m,n;
m=strlen(a);
n=strlen(b);
for(i=m-1;i>=m-n;i--)
{
a[i]=a[i]-b[i-m+n]+48;
}
for(i=m-1;i>=0;i--)
{
if(a[i]<48)
{
a[i]=a[i]+10;
a[i-1]=a[i-1]-1;
}
}
printf("%s\n",a);
}
void main()
{
int i,n;
char a[20][100],b[20][100],c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
c=getchar();
}
for(i=0;i<n;i++)
{
j(a[i],b[i]);
}
}
|
32
|
15,931 |
int main()
{
char a[100],b[100];
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a>>b;
int mark=0;
if(strlen(a)<strlen(b))
{
char d[1000];
strcpy(d,a);strcpy(a,b);strcpy(b,d);mark=1;
}
else if(strlen(a)==strlen(b))
{
int s=0;
for(int i=0;i<strlen(a);i++)
{
if(a[i]-b[i]>0) {s=1;break;}
else if(a[i]-b[i]<0) {s=-1;break;}
}
if(s==-1)
{
char d[1000];
strcpy(d,a);strcpy(a,b);strcpy(b,d);mark=1;
}
}
if(mark) cout<<"-";
int i=0,j=0,k=0;
int lend=0,c[1000];
for(i=strlen(a)-1,j=strlen(b)-1,k=0;i>=0&&j>=0;i--,j--,k++)
{
if(lend)
{
if(a[i]==48) {lend=1;a[i]=a[i]+9;}
else {a[i]--;lend=0;}
}
if(a[i]>=b[j]) c[k]=a[i]-b[j];
else {c[k]=a[i]-b[j]+10;lend=1;}
}
while(i>=0)
{
if(lend)
{
if(a[i]==48) {lend=1;a[i]=a[i]+9;}
else {a[i]--;lend=0;}
}
c[k]=a[i]-48;
k++;i--;
}
while(j>=0)
{
if(lend)
{
if(a[i]==48) {lend=1;a[i]=a[i]+9;}
else {a[i]--;lend=0;}
}
c[k]=b[j]-48;
k++;j--;
}
for(i=k-1;i>=0;i--)
if(c[i]!=0) break;
if(i==-1) cout<<c[0];
else for(j=i;j>=0;j--)
cout<<c[j];
cout<<endl;
}
return 0;
}
|
32
|
15,932 |
void main()
{
char a[101],b[101];
int m,p,n,i,j,q,s,t;
scanf("%d",&m);
for(t=0;t<m;t++)
{
scanf("%s\n%s",a,b);
p=strlen(a);
n=strlen(b);
j=p-1;
for(q=n-1;q>=0;q--)
{
if(a[j]<b[q])
{
a[j]=a[j]+10-b[q]+'0';
a[j-1]=a[j-1]-1;
}
else a[j]=a[j]-b[q]+'0';
j--;
}
s=0;
for(i=0;i<p;i++)
{
if(a[i]!=0)
{
printf("%c",a[i]);
s=1;
}
else if(s!=0)printf("%c",a[i]);
}
printf("\n");
}
}
|
32
|
15,933 |
void main()
{
int n,i,j,j1,l,l1;
char str[100][100],str1[100][100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",str[i],str1[i]);
getchar();
}
for(i=1;i<=n;i++)
{
l=strlen(str[i]);
l1=strlen(str1[i]);
j=0;
while(j<l1)
{
str[i][l-1-j]='0'+(int)str[i][l-1-j]-(int)str1[i][l1-1-j];
j1=j;
while(str[i][l-1-j1]<'0')
{
str[i][l-1-j1]=10+str[i][l-1-j1];
j1++;
str[i][l-1-j1]='0'+(int)str[i][l-1-j1]-(int)'1';
}
j++;
}
j1=0;
while(str[i][j1]=='0') j1++;
for(j=j1;j<l;j++)putchar(str[i][j]);
printf("\n");
}
}
|
32
|
15,934 |
void main()
{
char str1[100],str2[100],str3[100];
int a,b,i,j,n,c=1;
scanf("%d",&n);
while(c<=n)
{
scanf("%s",str1);
scanf("%s",str2);
a=strlen(str1);
b=strlen(str2);
for(i=a-1,j=b-1;i>=a-b;i--,j--)
{
if(str1[i]>=str2[j])
str3[i]=str1[i]-str2[j]+'0';
else
{
str3[i]=str1[i]-str2[j]+10+'0';
str1[i-1]=str1[i-1]-1;
}
}
for(i=a-b-1;i>=0;i--)
str3[i]=str1[i];
for(i=0;i<a;i++)
{
if(str3[i]!='0')
break;
}
for(j=i;j<a;j++)
printf("%c",str3[j]);
printf("\n");
c++;
}
}
|
32
|
15,935 |
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
|
15,936 |
int main()
{
char num1[101]={0},num2[101]={0};
int i,j,k=1,n,l;
cin>>n;
while(k<=n)
{
int anw1[101]={0},anw2[101]={0};
cin>>num1;
cin>>num2;
l=strlen(num1);
for(j=0,i=strlen(num1)-1;i>=0;i--,j++)
anw1[j]=num1[i]-'0';
for(j=0,i=strlen(num2)-1;i>=0;i--,j++)
anw2[j]=num2[i]-'0';
for(i=0;i<=100;i++)
{
if(anw1[i]>anw2[i])
{
anw1[i]=anw1[i]-anw2[i];
continue;
}
if(anw1[i]<anw2[i])
{
l=anw1[i]+10-anw2[i];
anw1[i]=l;
anw1[i+1]--;
continue;
}
if(anw1[i]==anw2[i])
{
anw1[i]=0;
continue;
}
}
for(i=100;i>=0;i--)
if(anw1[i]!=0)
{
for(j=i;j>=0;j--)
cout<<anw1[j];
if (k<n)
cout<<endl<<endl;
if(k==n)
cout<<endl;
break;
}
k++;
}
return 0;
}
|
32
|
15,937 |
int main(){
int n,t;
cin>>n;
for(t=1;t<=n;t++){
char a[101],b[101],c[101];
cin>>a;
cin>>b;
int n1,n2,n3,i,j,k=0;
n1=strlen(a),n2=strlen(b),n3=strlen(a);
for(i=n1-1,j=n2-1;i>=0;i--,j--)
{
if(j>=0)
{
if(a[i]-k>=b[j])
{
c[i]=a[i]-b[j]-k+48;
k=0;
}
else
{
c[i]=a[i]+10-b[j]-k+48;
k=1;
}
}
else
{
if(a[i]-48>=k)
{
c[i]=a[i]-k;
k=0;
}
else
{
c[i]=10+a[i]-k;
k=1;
}
}
}
if(c[0]!='0')
cout<<c[0];
for(i=1;i<n1-1;i++)
cout<<c[i];
cout<<c[n1-1]<<endl;}
return 0;
}
|
32
|
15,938 |
void main()
{
int l1[25],l2[25],n,w,z,q,i,d,k,j;
/* int t;
char c[101]
*/ char c1[25][101],c2[25][101],a[25][101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c1[i]);
l1[i]=strlen(c1[i]);
scanf("%s",c2[i]);
l2[i]=strlen(c2[i]);
d=l1[i]-l2[i];
for(w=l2[i];w<l1[i]-1;w++)
c2[i][w]='0';
c2[i][l1[i]-1]='\0';
q=0;
c2[i][l1[i]]='\0';
c2[i][l1[i]-1]='0';
while(q!=d)
{
for (z=l1[i];z>0;z--)
{
c2[i][z]=c2[i][z-1];
}
c2[i][0]=c2[i][l1[i]];
q++;
}
c2[i][l1[i]]='\0';
for(k=l1[i]-1;k>=0;k--)
{
if(c1[i][k]>=c2[i][k])
a[i][k]=c1[i][k]-c2[i][k]+48;
else
{
a[i][k]=c1[i][k]+10-c2[i][k]+48;
c1[i][k-1]=c1[i][k-1]-1;
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<l1[i];j++)
printf("%c",a[i][j]);
printf("\n");
}
}
|
32
|
15,939 |
/**
* @file ?????
* @author ???
* @date 11-17
* @description ?????
*/
int main()
{
int n, i, j, s[101], sa[101], sb[101], la, lb;
char a[101], b[101] ;
cin >> n;
for (j = 1; j <= n; j ++)
{
for (i = 0; i <= 100 ; i ++)
{
sa[i] = 0; sb[i] = 0 ; s[i] = 0;
}
cin.get();
cin.getline(a,101);
cin.getline(b,101);
la = strlen(a);
lb = strlen(b);
for (i = la-1; i >= 0 ; i --) sa[la-1-i] = a[i] - '0' ;
for (i = lb-1; i >= 0 ; i --) sb[lb-1-i] = b[i] - '0' ;
for (i = 0 ; i <= la-1 ; i ++)
{
s[i] = s[i] + sa[i] - sb[i] ;
if (s[i] < 0) { s[i] = s[i] + 10; s[i+1] -- ;}
}
for (i = la-1; i >= 0 ; i -- )
if (s[i] != 0) break;
while (i >= 0)
{
cout << s[i] ;
i --;
}
cout << endl;
}
return 0;
}
|
32
|
15,940 |
int main()
{
int i,j,n;
cin>>n;
char l[1];
while(n>0)
{
cin.getline(l,1);
char a[100],b[100],c[100];
cin.getline(a,100);
cin.getline(b,100);
int len1=strlen(a),len2=strlen(b);
for(i=len1-1;i>=len1-len2;i--)
{
b[i]=b[i+len2-len1];
}
for(i=0;i<len1-len2;i++)
{
b[i]=48;
}
b[len1]='\0';
for(i=len1-1;i>=0;i--)
{
c[i]=a[i]-b[i]+48;
if(c[i]<48){c[i]=a[i]-b[i]+58;a[i-1]=a[i-1]-1; }
}
i=0; c[len1]='\0';
while(c[i]==0&&strlen(c)>1)
{
for(j=0;j<len1;j++ )
{
c[j]=c[j+1];
}
}
cout<<c<<endl;
n--;
}
return 0;
}
|
32
|
15,941 |
void minus(char p[110],char a[110])
{
int m,n,i,j;
m=strlen(p);
n=strlen(a);
for(i=n-1;i>=0;i--)
{
if(p[m-n+i]>=a[i]) p[m-n+i]=p[m-n+i]-a[i]+48;
else
{
for(j=m-n+i-1;j>=0;j--)
{
if(p[j]==48) p[j]=57;
else
{
p[j]-=1;
break;
}
}
p[m-n+i]=p[m-n+i]-a[i]+58;
}
}
for(i=0;i<m;i++) if(p[i]!=48)break;
for(j=0;j<m-i;j++) p[j]=p[j+i];
}
void main()
{
int n,i;
char pass[110],act[110],res[100][110];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",pass,act);
minus(pass,act);
strcpy(res[i],pass);
}
for(i=0;i<n;i++) printf("%s\n",res[i]);
}
|
32
|
15,942 |
int main ()
{
int n,k;
cin>>n;
cin.get();
for (k=0;k<n;k++)
{
char s1[10000],s2[10000];
int a1[10000]={0},a2[10000]={0};
int l1,l2;
int d[10000]={0};
cin.getline(s1,10000);
cin.getline(s2,10000);
l1=strlen(s1);
l2=strlen(s2);
int i,j=0;
for (i=l1-1;i>=0;i--)
{
a1[j]=s1[i]-'0';
j++;
}
j=0;
for (i=l2-1;i>=0;i--)
{
a2[j]=s2[i]-'0';
j++;
}
/*for (i=0;i<l1;i++)
cout<<a1[i];
cout<<endl;
for (i=0;i<l2;i++)
cout<<a2[i];
cout<<endl;*/
for (i=0;i<l1;i++)
{
//cout<<d[i]<<' ';
d[i]+=a1[i]-a2[i];
if (d[i]<0)
{
d[i]+=10;
d[i+1]-=1;
}
}
//cout<<endl;
/*for (i=0;i<l1;i++)
cout<<d[i];
cout<<endl;*/
int q=0;
for (i=l1-1;i>=0;i--)
{
if ((d[i]==0) && (q==0))
continue;
cout<<d[i];
q=1;
}
cout<<endl;
if (k==n-1)
return 0;
cin.get();
}
return 0;
}
|
32
|
15,943 |
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
|
15,944 |
char* minus(char*a,char*b)
{
int i, j;
for(i=strlen(a)-1,j=strlen(b)-1;j>=0;i--,j--)
{
a[i]-=(b[j]-'0');
if(a[i]<'0')
{
a[i]+=10;
a[i-1]--;
}
}
return a;
}
int main()
{
char a[10][100],b[10][100];
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%s\n%s",a[i],b[i]);
printf("\n");
}
for(i=0;i<n;i++)
printf("%s\n",minus(a[i],b[i]));
return 0;
}
|
32
|
15,945 |
int main()
{
int str_1[100],str_2[100],str_3[100],n,k;
char str_a[101],str_b[101];
int len_a,len_b;
cin>>n;
for(k=0;k<n;k++)
{
cin.get();
cin.getline(str_a,101);
cin.getline(str_b,101);
len_a=strlen(str_a);
len_b=strlen(str_b);
memset(str_1,0,sizeof(str_1));
memset(str_2,0,sizeof(str_2));
memset(str_3,0,sizeof(str_3));
int i,j=0;
for(i=len_a-1;i>=0;i--)
str_1[j++]=str_a[i]-'0';
j=0;
for(i=len_b-1;i>=0;i--)
str_2[j++]=str_b[i]-'0';
for(i=0;i<len_b;i++)
{
if(str_1[i]>=str_2[i])
str_3[i]=str_1[i]-str_2[i];
else
{
str_3[i]=str_1[i]-str_2[i]+10;
str_1[i+1]--;
}
}
for(;i<len_a;i++)
str_3[i]=str_1[i];
for(i=99;i>=0;i--)
{
if(str_3[i]!=0)
break;
}
if(i==-1)
cout<<0;
else
for(;i>=0;i--)
cout<<str_3[i];
cout<<endl;
}
return 0;
}
/*
int main()
{
const int MAX_LEN = 250;
unsigned an1[MAX_LEN];
unsigned 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);
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++)
{
an1[i] += an2[i];
if(an1[i] >= 10) //??????
{
an1[i] -=10;
an1[i + 1]++; // i++?
}
}
i = MAX_LEN - 1;
for(;i>=0;i--)
if(an1[i]!=0)
break; //???????0??
if(i==-1)
cout<<0<<endl;
else
{
for(;i >= 0; i--)
cout << an1[i]; //??????
cout << endl;
}
return 0;
}*/
|
32
|
15,946 |
void main()
{
char a[100],b[100],c[100],r;
int n,i,j,k,la,lb,t;
struct
{
char result[100];
}result[50];
scanf("%d",&n);
for(k=0;k<n;k++)
{
scanf("%s%s",a,b);
la=strlen(a);
lb=strlen(b);
for(i=0;i<la/2;i++)
{
r=a[i];
a[i]=a[la-i-1];
a[la-i-1]=r;
}
for(i=0;i<lb/2;i++)
{
r=b[i];
b[i]=b[lb-i-1];
b[lb-i-1]=r;
}
for(i=0;i<lb;i++)
{
if(a[i]>=b[i])
{
t=a[i]-b[i];
}
else
{
if(a[i+1]==48)
{
for(j=0;;j++)
{
if(a[i+1+j]==48)
{
a[i+1+j]=57;
continue;
}
else
{
a[i+1+j]=a[i+1+j]-1;break;
}
}
}
else
{
a[i+1]=a[i+1]-1;
}
t=a[i]+10-b[i];
}
c[i]=t+48;
}
for(i=lb;i<la;i++)
{
c[i]=a[i];
}
for(i=0;i<la/2;i++)
{
r=c[i];
c[i]=c[la-i-1];
c[la-i-1]=r;
}
for(i=0;;i++)
{
if(c[i]!=48)
{
for(j=0;j<la-i;j++)
{
result[k].result[j]=c[i+j];
}
result[k].result[la-i]='\0';
break;
}
}
}
for(k=0;k<n;k++)
printf("%s\n",result[k].result);
}
|
32
|
15,947 |
int main()
{
int n,u,i ,Len1=0,Len2=0,max=0;
const int MAX_LEN = 100;
int num1[MAX_LEN+1]={0};int num2[MAX_LEN+1]={0};
char str1[MAX_LEN + 1];char str2[MAX_LEN + 1];
cin >> n;
cin.get();
for (u=0;u<n;u++)
{
cin.getline(str1, MAX_LEN + 1);
cin.getline(str2, MAX_LEN + 1);
Len1 = strlen(str1);
Len2 = strlen(str2);
for (i = Len1 - 1; i >= 0; i--)
num1[Len1-1-i] = str1[i]-'0';
for (i = Len2 - 1; i >= 0; i--)
num2[Len2-1-i] = str2[i]-'0';
if (Len1>Len2)
{
max=Len1;
}
else
max=Len2;
for (i = 0; i <max; i++)
{
num1[i]=num1[i]- num2[i];
if(num1[i]<0)
{
num1[i]=num1[i]+10;
num1[i+1]=num1[i+1]-1;
}
}
i = MAX_LEN;
while (num1[i]==0)
i--;
for (; i >= 0; i--)
cout << num1[i];
cout << endl;
for (i=0;i<MAX_LEN;i++)
{
num1[i]=0;
num2[i]=0;
}
Len1=0;
Len2=0;
max=0;
if (i!=n-1)
cin.get();
}
return 0;
}
|
32
|
15,948 |
void main()
{int n,i,l,al,bl;
char a[101],b[101];
scanf("%d",&n);
l=n;
while(l>0)
{scanf("%s",&a);
scanf("%s",&b);
al=strlen(a);
bl=strlen(b);
for(i=100;i>=101-al;i--)
a[i]=a[i-101+al]-48;
for(i=100;i>=101-bl;i--)
b[i]=b[i-101+bl]-48;
for(i=0;i<=100-al;i++)
a[i]=0;
for(i=0;i<=100-bl;i++)
b[i]=0;
for(i=100;i>=101-al;i--)
{a[i]=a[i]-b[i];
if(a[i]<0)
{a[i]=a[i]+10;
a[i-1]=a[i-1]-1;
}
}
if(a[101-al]!=0)
printf("%d",a[101-al]);
for(i=102-al;i<=100;i++)
printf("%d",a[i]);
printf("\n");
l--;
}
}
|
32
|
15,949 |
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
|
15,950 |
void main()
{
char str[100][100],d,string[100][100];
int n,i,j,m,l;
scanf("%d",&n);
d=getchar();
for(i=0;i<n;i++){scanf("%s",str[i]);d=getchar();scanf("%s",string[i]);}
for(i=0;i<n;i++)
{
m=strlen(str[i]);
l=strlen(string[i]);
for(j=1;j<=l;j++)
str[i][m-j]=str[i][m-j]-string[i][l-j]+48;
for(j=m-1;j>0;j--)
if(str[i][j]<48)
{
str[i][j]+=10;
str[i][j-1]--;
}
printf("%s\n",str[i]);
}
}
|
32
|
15,951 |
/*
* 004.cpp
* name:?????
* Created on: 2011-12-25
* Author: 11029
*/
int main(){
char a[101],b[101];
int la,lb,i,n;
cin>>n;
getchar();
while (n--)
{
cin.getline(a,101);
cin.getline(b,101);
la=strlen(a);
lb=strlen(b);
for (i=lb-1;i>=0;i--)
{
a[i+la-lb]-=(b[i]-'0');
if (a[i+la-lb]<'0')
{
a[i+la-lb]+=10;
a[i+la-lb-1]--;
}
}
cout<<a<<endl;
getchar();
}
}
|
32
|
15,952 |
int main(int argc, char* argv[])
{
int n,bei1[100],jian1[100],cha[100];
int j,a,b,i;
char bei[100],jian[100];
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s",bei);
scanf("%s",jian);
a=strlen(bei);
b=strlen(jian);
for(i=0;i<a;i++)
{
bei1[i]=bei[i]-'0';
}
for(i=0;i<b;i++)
{
jian1[i]=jian[i]-'0';
}
for(i=b-1;i>=0;i--)
{
jian1[a-b+i]=jian1[i];
}
for(i=0;i<(a-b);i++)
{
jian1[i]=0;
}
for(i=a-1;i>=0;i--)
{
if(bei1[i]>=jian1[i])
{
cha[i]=bei1[i]-jian1[i];
}
if(bei1[i]<jian1[i])
{
cha[i]=bei1[i]+10-jian1[i];
bei1[i-1]=bei1[i-1]-1;
}
}
if(cha[0]==0)
{
for(i=1;i<a;i++)
{
printf("%d",cha[i]);
}
printf("\n");
}
else
for(i=0;i<a;i++) printf("%d",cha[i]);
printf("\n");
}
return 0;
}
|
32
|
15,953 |
int main()
{
char a[102] , b[102] ;
int n, i=0, j=0 ,lena, lenb;
cin>>n;
for(i=0; i<n; i++)
{
int p[102]={0};
int q[102]={0};
cin>>a>>b;
lena=strlen(a);
lenb=strlen(b);
for(j=0; j<lena; j++)
{
p[j]=a[lena-j-1]-'0';
}
for(j=0; j<lenb; j++)
{
q[j]=b[lenb-j-1]-'0';
}
for(j=0; j<=lena; j++)
{
if(p[j]<q[j])
{
p[j+1]--;
p[j]=p[j]-q[j]+10;
}
else
p[j]-=q[j];
}
int temp=1;
for(j=lena; j>=0; j--)
{
if(p[j]==0 && temp==1)
continue;
if(p[j]!=0)
{
cout<<p[j];
temp=0;
}
if(p[j]==0)
cout<<p[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15,954 |
int main()
{
int N,i,l1,l2,loop,t,s;
char n1[410],n2[410];
int a[410],b[410],c[410];
int num(char c);
scanf("%d",&N);
for(loop=1;loop<=N;loop++)
{
scanf("%s",n1);
scanf("%s",n2);
memset(a,0,410*sizeof(int));
memset(b,0,410*sizeof(int));
t=0;
s=0;
l1=strlen(n1);
l2=strlen(n2);
for(i=0;i<=l1-1;i++)
a[i]=num(n1[l1-1-i]);
for(i=0;i<=l2-1;i++)
b[i]=num(n2[l2-1-i]);
for(i=0;i<410;i++)
if(a[i]-b[i]-t>=0)
{
c[i]=a[i]-b[i]-t;
t=0;
}
else
{
c[i]=a[i]-b[i]-t+10;
t=1;
}
for(i=409;i>=0;i--)
{
if(c[i]!=0)
s=1;
if(s==1)
printf("%d",c[i]);
}
if(s==0)
printf("0");
printf("\n");
}
return 0;
}
int num(char c)
{
return c-'0';
}
|
32
|
15,955 |
/*
* temperary.cpp
*
* Created on: 2011-12-25
* Author: ???
*/
int main() {
int n;
cin>>n;
while(n>0){
n--;
char a[100],b[100];
cin>>a>>b;
int l1=strlen(a),l2=strlen(b),i,c[100];
for(i=0;i<l2;i++){
if(a[l1-1-i]<b[l2-1-i]){
a[l1-2-i]--;
a[l1-1-i]+=10;
}
c[i]=a[l1-1-i]-b[l2-1-i];
}
for(i=l2;i<l1;i++){
if(a[l1-1-i]<'0'){
a[l1-2-i]--;
a[l1-1-i]+=10;
}
c[i]=a[l1-1-i]-48;
}
while(c[i-1]==0)i--;
while(i>0){
i--;cout<<c[i];
}
cout<<endl;
}
return 0;
}
|
32
|
15,956 |
void main()
{
int a[100],b[100],n,i,k,la,lb;
char t[100];
scanf("%d",&n);
for(k=0;k<n;k++)
{
scanf("%s",t);
la=strlen(t);
for(i=la-1;i>=0;i--)
a[i]=t[la-i-1]-'0';
scanf("%s",t);
lb=strlen(t);
for(i=lb-1;i>=0;i--)
b[i]=t[lb-i-1]-'0';
for(i=0;i<lb;i++)
{
a[i]=a[i]-b[i];
if(a[i]<0)
{
a[i]+=10;
a[i+1]-=1;
}
}
while(a[i]<0)
{
a[i]+=10;
a[++i]-=1;
}
la--;
while(a[la]==0) la--;
for(i=la;i>=0;i--)
printf("%d",a[i]);
printf("\n");
}
}
|
32
|
15,957 |
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
|
15,958 |
int leap(int *p,int n)
{
if(n==0) return -1;
if((*p)!=0) return 0;
else return leap(p+1,n-1)+1;
}
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char a[100],b[100];
int j,k=0,f=0,c[100]={0};
scanf("%s %s",a,b);
int len1=strlen(a),len2=strlen(b);
for(j=len2-1;j>=0;j--)
b[j+len1-len2]=b[j];
for(j=len1-len2-1;j>=0;j--)
b[j]='0';
for(j=len1-1;j>=0;j--)
{
c[j]=a[j]-b[j]-k;
if(c[j]<0)
{
c[j]+=10;
k=1;
}
else k=0;
}
j=leap(c,len1);
if(j==-1) printf("0");
else
for( ;j<len1;j++)
printf("%d",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15,959 |
void main()
{
int n,i,j,k,x,la[100],lb[100];
char a[100][100],b[100][100],c[100][100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
printf("\n");
}
for(i=0;i<n;i++)
{
la[i]=strlen(a[i]);
lb[i]=strlen(b[i]);
}
for(i=0;i<n;i++)
{
for(j=la[i]-1,k=lb[i]-1;j>(la[i]-lb[i]),k>=0;j--,k--)
{
if(a[i][j]<b[i][k])
{c[i][j]=58+a[i][j]-b[i][k];a[i][j-1]=a[i][j-1]-1;}
else c[i][j]=a[i][j]-b[i][k]+48;
}
for(j=0;j<la[i]-lb[i];j++)
c[i][j]=a[i][j];
}
for(x=0;x<n;x++)
printf("%s\n",c[x]);
}
|
32
|
15,960 |
struct jianfa
{
char bjs[100];
char js[100];
}a[20];
void main()
{
int i,l[20],j[20],k,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a[i].bjs,a[i].js);
getchar();
l[i]=strlen(a[i].bjs);
j[i]=strlen(a[i].js);
}
for(k=0;k<n;k++)
{
for(i=0;i<j[k];i++)
{
a[k].bjs[l[k]-1-i]=a[k].bjs[l[k]-1-i]-a[k].js[j[k]-1-i]+48;
if(a[k].bjs[l[k]-1-i]<48)
{
a[k].bjs[l[k]-1-i]=a[k].bjs[l[k]-1-i]+10;
a[k].bjs[l[k]-2-i]=a[k].bjs[l[k]-2-i]-1;
}
}
puts(a[k].bjs);
}
}
|
32
|
15,961 |
int main()
{
char numa[201], numb[201];
int a[201], b[201], result[201];
int n, i, j, k, la, lb;
cin >> n;
for (; n > 0; n--)
{
k = 0;
cin.ignore();
cin.getline(numa, 201);
cin.getline(numb, 201);
la = strlen(numa);
lb = strlen(numb);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(result, 0, sizeof(result));
for(i = 0; i < la; i ++)
{
a[i] = numa[i] - '0';
}
for(j = 0; j < lb; j++)
{
b[j] = numb[j] - '0';
}
for(i = la - 1, j = lb - 1; i >= 0; i--, j--)
{
if(b[j] > a[i])
{
b[j - 1]++;
result[i] = 10 + a[i] - b[j];
}
else
result[i] = a[i] - b[j];
}
while (result[k] == 0)
k++;
for(i = k; i < la; i++)
cout << result[i];
cout << endl;
}
return 0;
}
|
32
|
15,962 |
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
|
15,963 |
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
|
15,964 |
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
|
15,965 |
void main()
{
int n,m,i,j,l1,l2,k,p,o=0,a[200],carry=0,jump;
char str1[101],str2[101],str3[200];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",str1,str2);
l1=strlen(str1);
l2=strlen(str2);
str1[101]='\0';
jump=101-l1;
for(m=l1-1;m>=0;m--)
str1[m+jump]=str1[m];
for(m=0;m<jump;m++)
str1[m]='0';
str2[101]='\0';
jump=101-l2;
for(m=l2-1;m>=0;m--)
str2[m+jump]=str2[m];
for(m=0;m<jump;m++)
str2[m]='0';
for(j=100;j>=100-l1;j--)
{
if(str1[j]>=(carry+str2[j]))
{
str3[j]=str1[j]-(str2[j]+carry)+48;
carry=0;
}
else
{
str3[j]=str1[j]+10-(str2[j]+carry)+48;
carry=1;
}
}
for(k=101-l1;k<=100;k++)
{
printf("%c",str3[k]);
}
printf("\n");
}
}
|
32
|
15,966 |
int main()
{
int n,i,j,lena,lenb,m,p;
char a[110],b[110],t;
scanf("%d\n",&n);
for(;n>0;n--)
{
gets(a);
gets(b);
lena=strlen(a);
lenb=strlen(b);
for(i=0;i<lenb/2;i++)
{
t=b[i];
b[i]=b[lenb-i-1];
b[lenb-i-1]=t;
}
for(i=0;i<lena/2;i++)
{
t=a[i];
a[i]=a[lena-i-1];
a[lena-i-1]=t;
}
for(i=0;i<lenb;i++)
{
if(a[i]>=b[i])
a[i]='0'+a[i]-b[i];
else
{
j=i+1;
while(a[j]=='0')
{
a[j]='9';
j++;
}
a[j]-=1;
a[i]=a[i]+10-b[i]+'0';
}
}
for(i=lena-1;i>=0;i--)
if(a[i]!='0')break;
for(j=i;j>=0;j--)
printf("%c",a[j]);
printf("\n");
gets(a);
}
}
|
32
|
15,967 |
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
|
15,968 |
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
|
15,969 |
void f(int aa[], int bb[],int c[],int t);
int d[20][101]={0};
main()
{
int i,n,lens1,lens2,r=0,h=0,w1,w2;
int t[20];
scanf("%d",&n);
for (i=0;i<n;i++)
{
char a[101],b[101];
int aa[101],bb[101],c[101]={0};
scanf("%s",a);
scanf("%s",b);
lens1=strlen(a);
lens2=strlen(b);
t[i]=(lens1>lens2)?lens1:lens2;
for (r=0;r<strlen(a);r++)
aa[r+101-strlen(a)]=a[r]-'0';
for (r=0;r<strlen(b);r++)
bb[r+101-strlen(b)]=b[r]-'0';
for (r=101-t[i];r<101-t[i]+(lens1-lens2);r++)
bb[r]=0;
f(aa,bb,c,t[i]);
for (r=100;r>=101-t[i];r--)
d[h][r]=c[r];
h++;
printf("\n");
}
for (r=0;r<h;r++)
{
for (w1=101-t[r];w1<=100;w1++)
if (w1!=0)
break;
for (w2=w1;w2<=100;w2++)
printf("%d",d[r][w2]);
printf("\n");
}
printf("\n");
}
void f(int aa[],int bb[],int c[],int t)
{
int i;
for (i=100;i>=101-t;i--)
c[i]=aa[i]-bb[i];
for (i=100;i>=101-t;i--)
if (c[i]<0)
{c[i]=c[i]+10;
c[i-1]--;
}
return;
}
|
32
|
15,970 |
main()
{ int n,i,j,k,p,q,x;
char a[20][2][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{ for(j=0;j<2;j++)
scanf("%s",a[i][j]);
printf("\n");
}
for(i=0;i<n;i++)
{ p=strlen(a[i][0]);
q=strlen(a[i][1]);
for(j=0;j<q;j++)
{ x=a[i][0][p-j-1]-a[i][1][q-j-1];
if(x<0){x=x+10;a[i][0][p-j-2]--;}
a[i][0][p-j-1]=x+48;
}
for(k=0;k<p;k++)
printf("%c",a[i][0][k]);
if(i<n-1) printf("\n");
}
}
|
32
|
15,971 |
void main()
{
char s1[100]={0},s2[100]={0};
int n,i,n1,n2,j,k,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
gets(s1);
gets(s1);
gets(s2);
n1=strlen(s1);
n2=strlen(s2);
for(j=n1-1,k=n2-1;k>=0;j--,k--)
{
if(s1[j]>=s2[k])s1[j]=s1[j]-s2[k]+48;
else
{
s1[j]=s1[j]-s2[k]+58;
m=j;
do
{
if(s1[m-1]!='0'){s1[m-1]--;break;}
else {s1[m-1]+=9;m--;}
}
while(m>=0);
}
}
for(j=0;j<n1;j++)printf("%c",s1[j]);
printf("\n");
for(j=0;j<100;j++){s1[j]=0;s2[j]=0;}
}
}
|
32
|
15,972 |
int main()
{
int n,i,j,k,a[105]={0},b[105]={0},c[105]={0},l1,l2,l,cha;
char s1[105],s2[105];
scanf ("%d",&n);
for (k=1;k<=n;k++)
{
scanf("%s %s",s1,s2);
l1=strlen(s1);
l2=strlen(s2);
for (i=0;i<=l1-1;i++)
{
a[i]=s1[l1-i-1]-'0';
}
for (j=0;j<=l2-1;j++)
{
b[j]=s2[l2-j-1]-'0';
}
for (i=0;i<=l1-1;i++)
{
c[i]=a[i]-b[i];
if (c[i]<0)
{
c[i]+=10;
a[i+1]-=1;
}
}
while (c[l1]==0&&l1>0)
{
l1--;
}
for (i=l1;i>=0;i--)
{
printf("%d",c[i]);
}
printf ("\n");
for (i=0;i<=104;i++)
{
a[i]=0;b[i]=0;c[i]=0;
}
}
return 0;
}
|
32
|
15,973 |
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
|
15,974 |
int main()
{
int N, m, n, i;
cin >> N;
char a[101], b[101], c[101];
while ( N-- )
{
cin >> a >> b;
m = strlen(a);
n = strlen(b);
int t = 0, left = 0;
for ( i = 0; i < n; i++ )
c[m-1-i] = b[n-1-i];
for ( i = 0; i < m-n; i++ )
c[i] = '0';
//cout << a << endl << c << endl;
for ( i = m-1; i >= 0; i-- )
{
if ( a[i] - c[i] + left < 0 ) t = -1;
else t = 0;
a[i] = ( a[i] - c[i] + left + 10 ) % 10 + '0';
left = t;
}
cout << a << endl;
}
return 0;
}
|
32
|
15,975 |
/*
* ????BigIntegerSubtraction.cpp
* ?????????????
* Created on: 2010-12-25
* Author: ???
*/
int main()
{
int n;
char a[100],b[100];
char d[100],e[100];
int f[100];
int i,j,k;
int p,q;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(f,0,sizeof(f));
memset(d,0,sizeof(d));
memset(e,0,sizeof(e));
cin>>n;
gets(a);
for(k=1;k<=n;k++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(f,0,sizeof(f));
memset(d,0,sizeof(d));
memset(e,0,sizeof(e));
cin>>a;
cin>>b;
p=strlen(a);
q=strlen(b);
for(j=0;j<p;j++)
d[j]=a[p-1-j];
for(j=0;j<q;j++)
e[j]=b[q-1-j];
for(i=0;i<q;i++)
{
if(d[i]>=e[i])
f[i]=d[i]-e[i];
else
{
f[i]=10+d[i]-e[i];
d[i+1]=d[i+1]-1;
}
}
for(;i<p;i++)
f[i]=d[i]-'0';
for(i=99;i>=0;i--)
{
if(f[i]!=0)
break;
}
for(;i>=0;i--)
cout<<f[i];
cout<<endl;
}
return 0;
}
|
32
|
15,976 |
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
|
15,977 |
void main()
{
int i,t,j,n,len_a,len_b,len_e,temp;
char a[101],b[101],c[101],d[101],e[101],f[101];
scanf("%d\n",&n);
for(j=0;j<n;j++)
{
gets(a);
gets(b);
len_a=strlen(a);
len_b=strlen(b);
for(i=0;i<len_a/2;i++)
{
temp=a[i];
a[i]=a[len_a-i-1];
a[len_a-i-1]=temp;
}
for(i=0;i<len_b/2;i++)
{
temp=b[i];
b[i]=b[len_b-i-1];
b[len_b-i-1]=temp;
}
for(i=len_b;i<len_a;i++)
b[i]='0';
for(i=0;i<len_a;i++)
{
t=a[i]-b[i];
if(t<0)
{
t=t+10;
a[i+1]=a[i+1]-1;
}
a[i]=t-1+'1';
}
for(i=len_a-1;i>=0;i--)
{
if(a[i]!='0')break;
else len_a--;
}
a[len_a]='\0';
for(i=0;i<len_a/2;i++)
{
temp=a[i];
a[i]=a[len_a-i-1];
a[len_a-i-1]=temp;
}
puts(a);
gets(a);
}
}
|
32
|
15,978 |
void main()
{
char a[100],b[100],c[100],r[100],str[100],substr[100];
int i,j,m1,m2,n,k,t;
scanf("%d",&n);
for(k=1;k<=n;k++)
{
str[0]='\0';
substr[0]='\0';
scanf("%s",str);
scanf("%s",substr);
m1=strlen(str);
m2=strlen(substr);
for(i=0,j=m1-1;i<m1;i++,j--)
a[i]=str[j];
a[i]='\0';
for(i=0,j=m2-1;i<m2;i++,j--)
b[i]=substr[j];
if(m1>m2)
for(i=m2;i<m1;i++)
b[i]='0';
b[i]='\0';
for(i=0;i<m1;i++)
{
if(a[i]>=b[i])
c[i]=a[i]-b[i]+48;
else
{
c[i]=a[i]+10-b[i]+48;
a[i+1]--;
}
}
for(i=m1-1;c[i]=='0';i--);
c[i+1]='\0';
t=strlen(c);
for(i=0,j=t-1;i<t;i++,j--)
r[i]=c[j];
r[i]='\0';
puts(r);
}
}
|
32
|
15,979 |
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
|
15,980 |
void main()
{
char a[101],b[101],r[100][101];
int i,j,k,n,c,la,lb;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
la=strlen(a);
lb=strlen(b);
c=la-lb;
r[i][la]='\0';
for(j=la-1;j>=0;j--)
{
if(j>=la-lb)
{
if(a[j]>=b[j-c])
r[i][j]=a[j]-b[j-c]+'0';
else
{
r[i][j]=10+a[j]-b[j-c]+'0';
k=j-1;
while(a[k]=='0')
{
a[k]='9';
k--;
}
a[k]--;
}
}
else r[i][j]=a[j];
}
}
for(i=0;i<n;i++)
printf("%s\n",r[i]);
}
|
32
|
15,981 |
void main()
{
int n,i,j,La,Lb;
char A[100],B[100],C[30][100];
scanf("%d\n",&n);
for (i=0;i<=n-1;i++)
{
gets(A);
gets(B);
getchar();
La=strlen(A);
Lb=strlen(B);
for (j=Lb-1;j>=0;j--)
{
A[La-Lb+j]=A[La-Lb+j]-B[j];
if (A[La-Lb+j]<0)
{
A[La-Lb+j]+=10;
A[La-Lb+j-1]-=1;
}
A[La-Lb+j]+=48;
}
strcpy(C[i],A);
}
for (i=0;i<=n-1;i++) puts(C[i]);
}
|
32
|
15,982 |
void main()
{
int n,la,lb,j,t;
char a[100],b[100];
int c[100];
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
t=0;
for(j=0;j<100;j++)c[j]=0;
scanf("%s",a);
scanf("%s",b);
la=strlen(a);
lb=strlen(b);
for(j=0;j<lb;j++)
{
c[j]=c[j]+a[la-1-j]-b[lb-1-j];
if (c[j]<0)
{
c[j]=c[j]+10;
c[j+1]-=1;
}
}
for(j=lb;j<la;j++) c[j]=c[j]+a[la-1-j]-48;
for(j=99;j>=0;j--)
{
if (c[j]!=0) {printf("%d",c[j]);t=1;}
else if (t!=0) printf("%d",c[j]);
}
printf("\n");
}
}
|
32
|
15,983 |
void main()
{
int n,lena,lens,i,j,k;
char str[100],a[100],*pa,*ps,e[20],*p;
scanf("%d",&n);
gets(e);
for(i=1;i<=n;i++)
{
gets(str);
gets(a);
gets(e);
lens=strlen(str);
lena=strlen(a);
pa=a+lena-1;
ps=str+lens-1;
for(;pa>=a;pa--,ps--)
{
if(*ps>=*pa)
*ps=*ps-*pa+48;
else
{
*ps=*ps-*pa+58;
p=ps-1;
while(*p==0)
{
*p=57;
p--;
}
*p=*p-1;
}
}
for(k=0;k<=lens-1;k++)
{
if(str[i]!=0)
break;
}
for(j=k;j<lens-1;j++)
printf("%c",str[j]);
printf("%c\n",str[lens-1]);
}
}
|
32
|
15,984 |
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
|
15,985 |
int main()
{
char a[101],b[101];
int ia[101],ib[101];
int n=0,i=0,j=0,q=0,len1=0,len2=0,t=0,ans[101]={0};
cin>>n;
for(t=0;t<n;t++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(ia,0,sizeof(ia));
memset(ib,0,sizeof(ib));
memset(ans,0,sizeof(ans));
cin>>a>>b;
len1=strlen(a);
len2=strlen(b);
int k=0;
for(i=len1-1;i>=0;i--)
{
ia[k]=a[i]-'0';
k++;
}
k=0;
for(i=len2-1;i>=0;i--)
{
ib[k]=b[i]-'0';
k++;
}
for(i=0;i<len2;i++)
{
if(ia[i]<ib[i])
{
if(ia[i+1]!=0)
{
ia[i+1]--;
ia[i]=ia[i]+10;
ans[i]=ia[i]-ib[i];
}
else
{
for(j=i+2;j<len1;j++)
{
if(ia[j]!=0)
{
q=j;
ia[j]--;
break;
}
}
for(j=i+1;j<q;j++)
ia[j]=9;
ia[i]=ia[i]+10;
ans[i]=ia[i]-ib[i];
}
}
else
ans[i]=ia[i]-ib[i];
}
int p=0;
for(i=len1;;i--)
{
if(ia[i]!=0)
{
p=i;
break;
}
}
for(i=p;i>=len2;i--)
{
ans[i]=ia[i];
}
for(i=p;i>=0;i--)
cout<<ans[i];
cout<<endl;
}
return 0;
}
|
32
|
15,986 |
/*
* 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
|
15,987 |
int main()
{
int a[200],b[200],len1,len2,n,k;
char str1[200];char str2[200];
cin>>n;
for(int i=1;i<=n;i++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
cin.get();
cin.getline(str1,200);
cin.getline(str2,200);
len1=strlen(str1);
len2=strlen(str2);
k=0;
for(int j=len1-1;j>=0;j--)
{
a[k]=str1[j]-'0';
k++;
}
k=0;
for(int j=len2-1;j>=0;j--)
{
b[k]=str2[j]-'0';
k++;
}
for(int j=0;j<len1;j++)
{
a[j]=a[j]-b[j];
if(a[j]<0)
{
a[j]=a[j]+10;
a[j+1]--;
}
}
for(int j=len1-1;j>=0;j--)
{
cout<<a[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15,988 |
char m[20][100],n[20][100],a[20][100];
int lm[20],ln[20];
void minus(int k,int x,int r)
{
int s;
if (x>=101-lm[k])
{ s=m[k][x]-n[k][x]+r;
if (s>=0) r=0;
else
{
r=-1;
s=s+10;
}
minus(k,x-1,r);
a[k][x-101+lm[k]]=s+48;
}
}
void input(int k)
{
int i,j;
scanf("%s",m[k]);
scanf("%s",n[k]);
lm[k]=strlen(m[k]);
ln[k]=strlen(n[k]);
j=100;
for (i=lm[k]-1;i>=0;i--)
{
m[k][j]=m[k][i]-48;
m[k][i]=0;
j--;
}
j=100;
for (i=ln[k]-1;i>=0;i--)
{
n[k][j]=n[k][i]-48;
n[k][i]=0;
j--;
}
}
void main()
{
int i,s;
scanf("%d",&s);
for (i=1;i<=s;i++)
{
input(i);
if(i<s)getchar();
minus(i,100,0);
}
for (i=1;i<=s;i++)
printf("%s\n",a[i]);
}
|
32
|
15,989 |
//********************************
//*???????? **
//*????? 1300012845 **
//*???2013.11.15 **
//********************************
int main ()
{
int n, i, j, k, u=1;
int l1, l2, flag=0;
char str1[102] = {0}, str2[102] = {0};
int out[102]={0};
int num1[103]={0}, num2[103]={0};
cin >> n;
for ( k = 1; k <= n; k++ )
{
flag = 0;//????????
cin >> str1 >> str2;
l1 = strlen(str1);
l2 = strlen(str2);
u=1;
memset(out,0,102);//??????
for ( i = 0; i <= l1-1; i++ )
num1[i+1] = str1[i] - '0';//????????
for ( i = 0; i <= l2-1; i++ )
num2[i+1] = str2[i] - '0';//????????
while ( u <= l1 && u <= l2)
{
out [u] = num1[l1 - u + 1] - num2 [l2 - u + 1];//?????????????
u++;
}
for ( u= l1; u >= l2+1; u-- )
out[u] = num1[l1 - u + 1];//??????????????
for ( i =1; i <= l1-1; i++ )
{
if ( out [i] <0 )//???????+10???
out[i+1]+=-1, out[i]+=10;
}
for ( u = l1; u >=1 ; u-- )
{
if ( out[u] != 0)
flag = 1;//????????????????
if( flag ) cout << out[u] ;
if ( u==0)
break;
}
cout << endl;
}
return 0;
}
|
32
|
15,990 |
int main ()
{
char a[1001],b[1001];
int i,j,k,n,l1,l2,c[1001],d[1001];
cin >>n;
for (i=0;i<n;i++)
{
cin.get ();
cin.getline (a,1000);
l1=strlen (a);
cin.getline (b,1000);
l2=strlen (b);
for (k = 0; k <1001; ++k) c[k] = d[k] = 0;
int ll1 = l1, ll2 = l2;
for (j=0;j<l1;j++)
c[--ll1]=a[j]-'0';
for (j=0;j<l2;j++)
d[--ll2]=b[j]-'0';
for (k=0;k<l1;k++)
{
if (c[k]-d[k]<0)
{
c[k]=10+c[k]-d[k];
c[k+1]--;
}
else c[k]=c[k]-d[k];
}
for (k=l1-1;k>=0;k--)
{
if (c[k]!=0)
{
j=k;break;
}
}
for (k=j;k>=0;k--)
{
cout <<c[k];
}
cout <<endl;
}
return 0;
}
|
32
|
15,991 |
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
|
15,992 |
/*
* POJ2736.cpp
*
* Created on: 2011-12-25
* Author: wuch
*/
int main(){
int n,i,j,l1,l2;
char a[100],b[100];
int ans[100],aa[100],bb[100];
cin>>n;
for (i=0;i<n;i++){
cin>>a>>b;
l1=strlen(a);
l2=strlen(b);
for (j=0;j<l1;j++) aa[j]=a[l1-j-1]-'0';
for (j=0;j<l2;j++) bb[j]=b[l2-j-1]-'0';
if (l1>l2) for (j=l2;j<l1;j++) bb[j]=0;
for (j=0;j<l1;j++) ans[j]=aa[j]-bb[j];
for (j=0;j<l1;j++) if (ans[j]<0){
ans[j]=ans[j]+10;
ans[j+1]--;
}
for (j=l1-1;j>-1;j--) cout<<ans[j];
cout<<endl;
}
return 0;
}
|
32
|
15,993 |
void main()
{
int n,i,j;
struct num
{
char a[101];
int na;
char b[101];
int nb;
char c[101];
}num[999];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",num[i].a);
scanf("%s",num[i].b);
getchar();
}
for(i=0;i<n;i++)
{
for(j=0;num[i].a[j]!='\0';j++)
num[i].na=j+1;
for(j=0;num[i].b[j]!='\0';j++)
num[i].nb=j+1;
for(j=1;j<=num[i].nb;j++)
{
num[i].c[num[i].na-j]=num[i].a[num[i].na-j]-num[i].b[num[i].nb-j]+'0';
if(num[i].c[num[i].na-j]<'0')
{
num[i].a[num[i].na-j-1]--;
num[i].c[num[i].na-j]+=10;
}
}
for(j=0;j<num[i].na-num[i].nb;j++)
num[i].c[j]=num[i].a[j];
num[i].c[num[i].na]='\0';
printf("%s\n",num[i].c);
}
}
|
32
|
15,994 |
void minus(char a[],char b[],char result[]);
void main()
{
int n,i;
char a[max][1000]={0},b[max][1000]={0};
char result[max][1000]={0};
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s\n\n",a[i],b[i]);
minus(a[i],b[i],result[i]);
printf("%s\n",result[i]);
}
}
void minus(char a[],char b[],char result[])
{
int la,lb,lresult;
int flag=0;
int t=0;
int s,c=0;
int i;
char h[1000]={0};
char temp1;
la=strlen(a)-1;
lb=strlen(b)-1;
while(la >= 0)
{
if(lb < 0)
{
s=a[la--]-48;
}
else
{
s=a[la--]-b[lb--];
}
result[t++]=s-c+48;
if(result[t-1] < 48)
{
result[t-1]+=10;
c=1;
}
else c=0;
}
while(result[t] == 0) t--;
while(result[t] == '0')
{
result[t]=0;t--;
}
lresult=t;
for(i=0;i <= lresult/2;i++)
{
temp1=result[i];
result[i]=result[lresult-i];
result[lresult-i]=temp1;
}
}
|
32
|
15,995 |
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
|
15,996 |
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
char integer1[101],integer2[101],answer[101];
cin>>integer1>>integer2;
memset(answer,'\0',sizeof(answer));
int len1=strlen(integer1),len2=strlen(integer2);
for(int j=len1-1,k=len2-1,count=99;j>=0;j--,k--,count--){
if(k<0)answer[count]=integer1[j];
else{
if(integer1[j]-'0'>=integer2[k]-'0')answer[count]=(integer1[j]-'0'-(integer2[k]-'0'))+'0';
else{
integer1[j-1]=integer1[j-1]-1;
answer[count]=integer1[j]-'0'+10-(integer2[k]-'0')+'0';
}
}
}
for(int j=0;j<100;j++){
if(answer[j]!='\0')cout<<answer[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15,997 |
void main()
{
char st1[10000],st2[10000];
int n,re[10000],k,l1,l2,i,j,y;
scanf("%d",&n);
for(k=1;k<=n;k++)
{ scanf("\n");
gets(st1);
gets(st2);
l1=strlen(st1);
l2=strlen(st2);
j=l1-l2;
for(i=l2-1;i>=0;i--)
st2[i+j]=st2[i];
for(i=0;i<=j-1;i++)
st2[i]='0';
for(i=l1-1;i>=0;i--)
{
if(st1[i]>=st2[i])
re[i]=st1[i]-st2[i];
else
{
re[i]=st1[i]+10-st2[i];
st1[i-1]=st1[i-1]-1;
}
}
y=0;
if(re[0]==0)
for(i=0;i<l1;i++)
{re[i]=re[i+1];
y=1;
}
if(y==1)
{for(i=0;i<l1-1;i++)
printf("%d",re[i]);
printf("\n");}
else {for(i=0;i<l1;i++)
printf("%d",re[i]);
printf("\n");
}
}
}
|
32
|
15,998 |
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
|
15,999 |
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
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.