label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
32
|
15900
|
// ?????.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
|
15901
|
void main()
{
char m1[100],m2[100],n1[100],n2[100],sum[100];
int i,mlen,nlen,t,u;
scanf("%d",&t);
for (u=0;u<t;u++)
{
for (i=0;i<100;i++)
sum[i]='\0';
for (i=0;i<100;i++)
m1[i]='0';
for (i=0;i<100;i++)
n1[i]='0';
scanf("%s",m1);
scanf("%s",n1);
mlen=strlen(m1);
nlen=strlen(n1);
for (i=0;i<100;i++)
m2[i]='0';
for (i=0;i<100;i++)
n2[i]='0';
for (i=0;i<mlen;i++) /**/
m2[100-mlen+i]=m1[i];
for (i=0;i<=nlen;i++)
n2[100-nlen+i]=n1[i];
for (i=99;i>=0;i--)
{
sum[i]=sum[i]+m2[i]-n2[i]+48;
if (sum[i]<'0')
{
sum[i]=sum[i]+10;
sum[i-1]=sum[i-1]-1; /**/
}
}
for (i=0;i<100;i++)
{
if ((sum[i]!='0')&&(sum[i]!='\0'))
break;
}
for (i=i;i<100;i++)
printf("%c",sum[i]);
printf("\n");
}
}
|
32
|
15902
|
void Inverse(char a[])
{
int len=strlen(a);
for(int i=0;i<len/2;i++)
{
char temp;
temp=a[i];
a[i]=a[len-1-i];
a[len-1-i]=temp;
}
}
int main()
{
char a[110],b[110];
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin.get();
cin.getline(a,101);
cin.getline(b,101);
Inverse(a);
Inverse(b);
int j;
for(j=0;b[j]!='\0';j++)
{
if(a[j]>=b[j])
a[j]=a[j]-b[j]+'0';
else
{
a[j+1]--;
a[j]=a[j]+10-b[j]+'0';
}
}
while(a[j]<'0'&&a[j]!='\0')
{
a[j+1]--;
a[j]=a[j]+10-b[j]+'0';
}
Inverse(a);
j=0;
while(a[j]=='0')
j++;
while(a[j]!='\0')
cout<<a[j++];
cout<<endl;
}
return 0;
}
|
32
|
15903
|
void main()
{
char a[200]={"\0"},b[200]={"\0"},c;
int i,j,k,m,n,s,t=0,length;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
k=strlen(a);
m=strlen(b);
length=k-m;
for(j=k-1;j>=length;j--)
{
if(t) a[j]--;
if(a[j]>=b[j-length])
{
a[j]=a[j]-b[j-length]+48;
t=0;
}
else
{
a[j]=a[j]+10-b[j-length]+48;
t=1;
}
}
for(j=length-1;j>=0;j--)
{
if(t) a[j]--;
if(a[j]<48)
{
a[j]=a[j]+10;
t=1;
}
else t=0;
}
for(j=0;j<k;j++)
{
if(a[j]!=48)
{
s=j;
break;
}
}
if(s>200) printf("0\n");
else
{
for(j=s;j<k;j++)
printf("%c",a[j]);
printf("\n");
}
}
}
|
32
|
15904
|
//********************************
//*???????? **
//*?????? 1300012745 **
//*???2013.11.19 **
//********************************
int main()
{
char stra[102], strb[102];
int n, num1[102] = {0}, num2[102] = {0}, num[102] = {0}, i, lena, lenb, j, k;
cin >> n;
for (i = 1; i <= n; i++)
{
cin.get();
cin.getline(stra,102);
cin.getline(strb,102);
lena = strlen(stra);
lenb = strlen(strb);
memset(num1,0,sizeof(num1));
memset(num2,0,sizeof(num2));
memset(num,0,sizeof(num));
k = 0;
for (j = lena - 1; j >= 0; j--)
{
num1[k++] = stra[j] - '0';
}
k = 0;
for (j = lenb - 1; j >= 0; j--)
{
num2[k++] = strb[j] - '0';
}
for (j = 0; j < 102; j++)
{
num1[j]-=num2[j];
if (num1[j] < 0)
{
num1[j]+=10;
num1[j + 1]--;
}
}
j = lena;
while (num1[j] == 0)
j--;
for (k = j; k >= 0; k--)
cout << num1[k];
cout << endl;
}
return 0;
}
|
32
|
15905
|
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
|
15906
|
int main()
{
char c[101],d[101],e[101],f[101];
int a,b,h,n,i,j,m,o;
int tmp;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s",&c,&d);
a=strlen(d);
b=strlen(c);
for(o=0;o<a;o++) f[o]=d[a-o-1];
for(j=0;j<b;j++) e[j]=c[b-j-1];
for(m = 0; m < a; m++)
{
if(e[m]<f[m])
{
e[m]=e[m]+10 - f[m] + '0';
tmp = m;
while(e[++tmp] < '1')
e[tmp] = '9';
e[tmp]--;
}
else e[m]=e[m]-f[m] + '0';
}
for(h = b-1; h > 0; h--) {
if (e[h] != '0') {
break;
}
}
for(; h >= 0; h--)
printf("%d",e[h] - '0');
printf("\n");
}
return 0;
}
|
32
|
15907
|
void main()
{
char str1[100],str2[100];int n,i,j,k,p;
int a[100],b[100];
int yidegeshu,erdegeshu;
scanf("%d",&n);
for(p=0;p<=n-1;p++)
{
scanf("%s",str1);
scanf("%s",str2);
yidegeshu=strlen(str1);
erdegeshu=strlen(str2);
for(i=0;i<=yidegeshu-1;i++)
a[i]=str1[yidegeshu-i-1]-48;
for(i=0;i<=erdegeshu-1;i++)
b[i]=str2[erdegeshu-i-1]-48;
for(j=erdegeshu;j<=yidegeshu-1;j++)
b[j]=0;
for(i=0;i<=yidegeshu-1;i++)
{
if(a[i]>=b[i])
{a[i]=a[i]-b[i];}
else if(a[i]<b[i])
{
a[i]=a[i]+10;
a[i+1]=a[i+1]-1;
a[i]=a[i]-b[i];
}
}
for(k=yidegeshu-1;k>=0;k--)
{ printf("%d",a[k]);}
printf("\n");
}
}
|
32
|
15908
|
int main(int argc, char* argv[])
{
int n,i,j,k,a,b,carry;
char str1[100],str2[100],str3[100]={'\0'};
scanf("%d",&n);
for(i=0;i<n;i++)
{
a=strlen(str3);
for(j=0;j<a;j++)
{
str3[j]='\0';
}
scanf("%s",&str1);
scanf("%s",&str2);
a=strlen(str1);
b=strlen(str2);
carry=0;
for(j=a-1,k=b-1;j>a-b-1;j--,k--)
{
str3[j]=str1[j]-str2[k]+'0'-carry;
if(str3[j]-'0'<0)
{
carry=1;
str3[j]+=10;
}
else
carry=0;
}
for(j=a-b-1;j>=0;j--)
{
str3[j]=str1[j]-carry;
if(str3[j]-'0'<0)
{
carry=1;
str3[j]+=10;
}
else
carry=0;
}
if(str3[0]=='0')
{
for(j=0;j<a;j++)
{
str3[j]=str3[j+1];
}
}
printf("%s",str3);
if(i!=n-1)
printf("\n");
}
return 0;
}
|
32
|
15909
|
void main()
{int n,d,e,i,k,carry=0;
char a[101]={0},b[101]={0},c[101]={0};
char *p1=a,*p2=b;
void move(char *p,int m);
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{gets(a);
gets(a);
gets(b);
d=strlen(a);
e=strlen(b);
move(p1,d);
move(p2,e);
for(k=99-d+1;k<=99-e;k++)
b[k]='0';
for(k=99;k>=99-d+1;k--)
{
b[k]=b[k]-'0';
a[k]=a[k]-'0';
if(carry+b[k]>a[k])
{c[k]=a[k]-b[k]+10-carry;
carry=1;}
else
{c[k]=a[k]-b[k]-carry;
carry=0;}
c[k]=c[k]+'0';
}
for(k=0;k<=99;k++)
{if(c[k]!=0)
printf("%c",c[k]);}
printf("\n");
for(k=0;k<=100;k++)
c[k]=0;
carry=0;
}}
void move(char *p,int m)
{ int h;
*(p+100)=0;
for(h=99;h>=99-m+1;h--)
*(p+h)=*(p+h-100+m);
for(h=0;h<=99-m;h++)
*(p+h)=0;
}
|
32
|
15910
|
void main()
{
int n,i,c,d,j,k,x,y;
char a[101],b[101],s[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",a,b);
c=strlen(a);
d=strlen(b);
for(j=c-1,k=d-1;k>=0;k--,j--)
s[j]=a[j]-b[k]+48;
for(x=0;x<c-d;x++)
s[x]=a[x];
for(y=c-1;y>=0;y--)
if(s[y]>=48&&s[y]<=57)
s[y]=s[y];
else
{
s[y]=s[y]+10;
s[y-1]=s[y-1]-1;
}
for(x=0;x<=c-1;x++)
printf("%c",s[x]);
printf("\n\n");
}
}
|
32
|
15911
|
main()
{
int i,n,k,m,m1;
int a[100],b[100]={0},c[100];
char str1[100],str2[100];
scanf("%d",&n);
for(k=1;k<=n;k++)
{
scanf("%s%s",str1,str2);
for(i=0;str1[i]!='\0';i++);
m=i;
for(i=1;i<=m;i++)
a[i]=str1[m-i]-48;
for(i=0;str2[i]!='\0';i++);
m1=i;
for(i=1;i<=m1;i++)
b[i]=str2[m1-i]-48;
for(i=1;i<=m;i++)
{
if(a[i]<b[i]) c[i]=a[i]-b[i]+10,a[i+1]=a[i+1]-1;
else c[i]=a[i]-b[i];
}
if(c[m]==0) for(i=m-1;i>0;i--) printf("%d",c[i]);
else for(i=m;i>0;i--) printf("%d",c[i]);
printf("\n");
for(i=1;i<=100;i++) b[i]=0;
}
}
|
32
|
15912
|
int main()
{
int n,i,p,q,t,j;
scanf("%d",&n);
scanf("\n");
char a[100],b[100],c[100];
for(i=0;i<=99;i++)
{
a[i]='\0';
}
for(i=0;i<=99;i++)
{
b[i]='\0';
}
for(i=1;i<=n;i++)
{
gets(a);
gets(b);
scanf("\n");
p=strlen(a);
q=strlen(b);
for(t=1;t<=q;t++)
{
if(a[p-t]>=b[q-t])
c[p-t]=a[p-t]-b[q-t]+48;
else
{
c[p-t]=a[p-t]+58-b[q-t];
a[p-t-1]=a[p-t-1]-1;
}
}
for(t=0;t<=p-q-1;t++)
{
c[t]=a[t];
}
for(j=0;j<=p-1;j++)
{
printf("%c",c[j]);
}
printf("\n");
}
return 0;
}
|
32
|
15913
|
int main()
{
int n;
int i,j;
char a[101];
char b[101];
int a1[101];
int b1[101]={0};
int c[101]={0};
scanf("%d",&n);
int length1,length2,length;
for(j=1;j<=n;j++)
{
for(i=0;i<=100;i++)
{
a1[i]=b1[i]=c[i]=0;
}
scanf("%s%s",a,b);
length1=strlen(a);
length2=strlen(b);
if(length1>length2)
{length=length1;}
else
{length=length2;}
for(i=0;i<length1;i++)
{
a1[i]=a[length1-i-1]-'0';
}
for(i=0;i<length2;i++)
{
b1[i]=b[length2-i-1]-'0';
}
for(i=0;i<length;i++)
{
c[i]+=a1[i]-b1[i];
while(c[i]<0)
{
c[i]=c[i]+10;
c[i+1]--;
}
}
for(i=0;i<length;i++)
{
printf("%d",c[length-i-1]);
}
printf("\n");
}
return 0;
}
|
32
|
15914
|
main()
{
char a[100],b[100],c[30][100];
int n,i,j,m1,m2;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
gets(a);
gets(b);
if(i!=n-1) getchar();
m1=strlen(a);
m2=strlen(b);
for(j=m2-1;j>=0;j--)
b[j+m1-m2]=b[j];
for(j=0;j<m1-m2;j++)
b[j]='0';
for(j=m1-1;j>=0;j--)
{
if(a[j]<b[j]) {c[i][j]=a[j]+10-b[j];a[j-1]--;}
else c[i][j]=a[j]-b[j];
}
c[i][m1]=10;
}
for(i=0;i<n;i++)
{
for(j=0;c[i][j]<10;j++)
printf("%d",c[i][j]);
printf("\n");
}
}
|
32
|
15915
|
int main ()
{
int n , i , j , k,num1[101]={0},num2[101]={0},res[101]={0} ;
cin >> n ;
cin.get();
char str1[101] , str2[101] ;
for (i = 0 ;i < n ;i++)
{
memset(num1 , 0 , sizeof(num1)) ;
memset(num2 , 0 , sizeof(num2)) ;
memset(res , 0 , sizeof(res)) ;
cin.getline(str1,101) ;
cin.getline(str2,101) ;
cin.get() ;
for (j = 0 ; j < strlen(str2) ; j++ )
num2[j] = str2[strlen(str2)-j-1]-'0' ;
for (j = 0 ; j < strlen(str1) ; j++ )
num1[j] = str1[strlen(str1)-j-1]-'0' ;
for(k = 0 ; k < strlen(str1) ; k++)
{
if(num1[k]-num2[k]<0)
{
res[k]=num1[k]-num2[k]+10;
num1[k+1]-- ;
}
else res[k]=num1[k]-num2[k] ;
}
for(k = strlen(str1)-1 ; k >= 0 ; k--)
{
if(res[k]==0)
continue ;
break ;
}
while (k >=0 )
{
cout << res[k];
k-- ;
}
cout << endl;
}
return 0 ;
}
|
32
|
15916
|
void main()
{
char a[100][100],b[100][100],eat;
int i,ca,cb,n,j;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%s",a[j]);
scanf("%s",b[j]);
}
for(j=0;j<n;j++)
{
for(i=0;a[j][i]!='\0';i++)
a[j][i]=a[j][i]-'1'+1;
ca=i-1;
for(i=0;b[j][i]!='\0';i++)
b[j][i]=b[j][i]-'1'+1;
cb=i-1;
for(i=ca;i-ca+cb>=0;i--)
{
if(a[j][i]<b[j][i-ca+cb])
{
a[j][i-1]-=1;
a[j][i]=a[j][i]+10-b[j][i-ca+cb];
}
else
a[j][i]=a[j][i]-b[j][i-ca+cb];
}
for(i=ca;i>=1;i--)
if(a[j][i]==-1)
{
a[j][i]=9;
a[j][i-1]-=1;
}
for(i=0;i<=ca;i++)
a[j][i]=a[j][i]-1+'1';
printf("%s\n",a[j]);
}
}
|
32
|
15917
|
//********************************
//*???????? **
//*????? 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
|
15918
|
void main()
{
char s1[102],s2[102];
int p,i,j,m,n,len1,t,len2;
scanf("%d\n",&m);
for (t=1;t<=m;t++)
{
gets(s1);
gets(s2);
if (t<m) getchar();
len1=strlen(s1);
len2=strlen(s2);
p=0;
for (i=len2-1;i>=0;i--)
{
if (s1[len1+i-len2]-p<s2[i]) { s1[len1+i-len2]=s1[len1+i-len2]+10-p-s2[i]+48;p=1;}
else {s1[len1+i-len2]=s1[len1+i-len2]-p-s2[i]+48;p=0;}
}
i=1;
while (p==1)
{
if (s1[len1-i-len2]=='0') {s1[len1-i-len2]+=9;i++;}
else {s1[len1-i-len2]=s1[len1-i-len2]-1;p=0;}
}
i=0;
p=1;
while (p==1)
{
if (s1[i]=='0') i++;
else p=0;
}
for (j=i;j<=len1-1;j++)
putchar(s1[j]);
putchar('\n');
}
}
|
32
|
15919
|
void main()
{
int a[101],b[101],c[101]={0},n,i,j,k,len1,len2;
char sa[101],sb[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",sa);
scanf("%s",sb);
len1=strlen(sa);
len2=strlen(sb);
for(j=0;j<101;j++)
{
a[j]=0;
b[j]=0;
}
for(j=len1-1,k=0;j>=0;j--,k++)
{
a[k]=sa[j]-'0';
}
for(j=len2-1,k=0;j>=0;j--,k++)
{
b[k]=sb[j]-'0';
}
for(j=0;j<=len1-1;j++)
{
if(a[j]>=b[j])
{
c[j]=a[j]-b[j];
}
if(a[j]<b[j])
{
a[j+1]-=1;
c[j]=a[j]+10-b[j];
}
}
for(j=len1-1;j>=0;j--)
{
printf("%d",c[j]);
}
printf("\n");
}
}
|
32
|
15920
|
void main()
{
char a[100][102],b[100][102],c[100][102];
int n,i,j,m,k,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
k=strlen(a[i]);
m=strlen(b[i]);
for(j=k-1;j>=k-m;j--)
{
if(a[i][j]<b[i][j+m-k])
{
c[i][j]=a[i][j]+58-b[i][j+m-k];
a[i][j-1]--;
}
else c[i][j]=a[i][j]+48-b[i][j+m-k];
}
for(j=0;j<k-m;j++)
{
if(a[i][j]>='0') c[i][j]=a[i][j];
else c[i][j]=a[i][j]+10;
}
c[i][k]='\0';
for(j=0;j<k;j++)
{
if(c[i][j]!='0') break;
}
if(a[i][0]=='0')
{
for(j=0;j<k;j++) c[i][j]=c[i][j+1];
}
}
for(i=0;i<n;i++) puts(c[i]);
}
|
32
|
15921
|
void printnum(int a[])
{
int i;
for(i = a[0];i > 0; --i) printf("%d", a[i]);
printf("\n");
}
void getnum(int a[])
{
int i;
char str[100];
for(i = 0;i <100;++ i) a[i] = 0;
scanf("%s", str);
a[0] = strlen(str);
for(i = a[0]-1;i >= 0;-- i)
a[ a[0]-i ] = str[i]-'0';
}
void getdif(int c[], int a[], int b[])
{
int i;
if(a[0] > b[0]) c[0] = a[0];
else c[0] = b[0];
c[1] = 0;
for(i = 1;i <= c[0];++ i)
{
if(c[i] + a[i] - b[i] < 0)
{
c[i+1] = -1;
c[i] += a[i] - b[i] + 10;
}
else
{
c[i+1] = 0;
c[i] += a[i] - b[i];
}
}
while(c[ c[0] ] == 0) -- c[0];
}
void main()
{
int a[100], b[100],c[100],n;
scanf("%d",&n);
for(;n != 0;-- n)
{ getnum(a);
getnum(b);
getdif(c, a, b);
printnum(c);
}
}
|
32
|
15922
|
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
|
15923
|
int main()
{
int n,times=0;
cin>>n;
while(true)
{
char ch1[100],ch2[100],ch3[100];
char temp;
memset(ch1,0,100);
memset(ch2,0,100);
memset(ch3,0,100);
cin>>ch1;
cin>>ch2;
int len1=strlen(ch1);
int len2=strlen(ch2);
for(int i=0;i<=len1/2-1;i++)
{
temp=ch1[i];
ch1[i]=ch1[len1-i-1];
ch1[len1-i-1]=temp;
}
for(int i=0;i<=len2/2-1;i++)
{
temp=ch2[i];
ch2[i]=ch2[len2-i-1];
ch2[len2-i-1]=temp;
}
for(int i=len2;i<=len1-1;i++)
ch2[i]='0';
for(int i=0;i<=len1-1;i++)
ch3[i]=ch1[i]-ch2[i]+48;
for(int i=1;i<=len1;i++)
{
for(int j=0;j<=len1-1;j++)
{
if(ch3[j]<'0')
{
ch3[j]+=10;
ch3[j+1]-=1;
}
}
}
if(ch3[len1-1]=='0')
{
for(int i=len1-2;i>=0;i--)
cout<<ch3[i];
}
else
{
for(int i=len1-1;i>=0;i--)
cout<<ch3[i];
}
cout<<endl;
cin.get();
times++;
if(times==n)break;
}
return 0;
}
|
32
|
15924
|
void sub(char a[100],char b[100])
{
int l1,l2,i,j,k;
l1=strlen(a);
l2=strlen(b);
for(i=l1-1,j=l2-1;j>=0;i--,j--)
{
if(a[i]>b[j])
a[i]=a[i]-b[j]+48;
else if(a[i]==b[j])
a[i]='0';
else
{
a[i]=a[i]-b[j]+58;
for(k=i-1;a[k]=='0';k--)
a[k]='9';
a[k]=a[k]-1;
}
}
if(a[0]=='0')
{
for(i=1;i<l1;i++)
printf("%c",a[i]);
printf("\n");
}
else
printf("%s\n",a);
}
void main()
{
char a[100],b[100];
int n,m;
scanf("%d",&n);
for(m=1;m<=n;m++)
{
if(m>1)
printf("\n");
scanf("%s%s",a,b);
sub(a,b);
}
}
|
32
|
15925
|
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
|
15926
|
char szline1[maxlen];
char szline2[maxlen];
int an1[maxlen];
int an2[maxlen];
int main()
{
int n;
cin >> n;
while (n --)
{
cin.get();
cin.getline(szline1, maxlen);
cin.getline(szline2, maxlen);
int len1 = strlen(szline1);
int len2 = strlen(szline2);
memset(an1, 0, sizeof(an1));
memset(an2, 0, sizeof(an2));
for (int i = len1 - 1, j = 0; i >= 0; i --)
an1[j ++] = szline1[i] - '0';
for (int i = len2 - 1, j = 0; i >= 0; i --)
an2[j ++] = szline2[i] - '0';
int begin = 0;
for (int i = 0; i < maxlen; i ++)
{
an1[i] -= an2[i];
if (an1[i] < 0)
{
an1[i] += 10;
an1[i + 1] --;
}
if (an1[i])
begin = i;
}
for (int i = begin; i >= 0; i --)
cout << an1[i];
cout << endl;
}
return 0;
}
|
32
|
15927
|
int main()
{
int a[110]={0},i,j,n,l1,l2,e,b[110]={0};
char s[110],s1[110];
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
gets(s);l1=strlen(s);
gets(s1);l2=strlen(s1);
for (j=l1;j>0;j--)
a[l1-j+1]=s[j-1]-48;
for (j=l2;j>0;j--)
b[l2-j+1]=s1[j-1]-48;
e=0;
for (j=1;j<=l1;j++)
{
a[j]=a[j]-e;
if (a[j]<b[j]) e=1;else e=0;
b[j]=a[j]+e*10-b[j];
}
while (b[l1]==0&&l1>0) l1=l1-1;
for (j=l1;j>0;j--) {printf("%d",b[j]);b[j]=0;}
printf("\n");
if (i<n)scanf("\n");
}
}
|
32
|
15928
|
int main()
{
int n,len1,len2;
char a[100],b[100],t;
cin>>n;
for(int i=0;i<n;i++){
memset(a,'0',100);
memset(b,'0',100);
cin>>a>>b;
len1=strlen(a);
len2=strlen(b);
for(int j=0;j<len1-j;j++){
t=a[j];
a[j]=a[len1-j-1];
a[len1-j-1]=t;
}
for(int j=0;j<len2-j;j++){
t=b[j];
b[j]=b[len2-j-1];
b[len2-j-1]=t;
}
for(int j=0;j<len2;j++)
if(a[j]>=b[j]) a[j]=a[j]-b[j]+'0';
else {
a[j+1]--;
a[j]=a[j]+10-b[j]+'0';
}
if(a[len1-1]!='0') cout<<a[len1-1];
for(int j=len1-2;j>=0;j--)
cout<<a[j];
cout<<endl;
}
}
|
32
|
15929
|
void main()
{
int n,i,j,len,tlen,t=0;
char num1[100][200];
char num2[100][200];
char temp[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %s",num1[i],num2[i]);
for(i=0;i<n;i++)
{
strcpy(temp,num2[i]);
t=0;
tlen=strlen(num1[i])-strlen(num2[i]);
for(j=0;j<tlen;j++)
num2[i][j]='0';
num2[i][j]=0;
strcat(num2[i],temp);
len=strlen(num1[i]);
for(j=len-1;j>=0;j--)
{
if(num1[i][j]+t-num2[i][j]>=0){
num1[i][j]=num1[i][j]+t-num2[i][j]+48;
t=0;}
else {num1[i][j]=num1[i][j]+t-num2[i][j]+58;
t=-1;}
}
if(i!=n-1)
printf("%s\n",num1[i]);
else printf("%s",num1[i]);
}
}
|
32
|
15930
|
void xj(char x[],char a[])
{
int i,j;
char z[100]={0},y[100];
for(i=0;i<100;i++)
y[i]='0';
for(i=0;i<strlen(a);i++)
y[i+strlen(x)-strlen(a)]=a[i];
for(i=strlen(x)-1;i>=0;i--)
{z[i]=x[i]+10-y[i];
if(i-1>=0)
x[i-1]+=z[i]/10-1;
z[i]=z[i]%10+48;
}
for(i=0;i<strlen(x);i++)
if(z[i]!='0')break;
for(j=i;j<strlen(x);j++)
putchar(z[j]);
putchar('\n');
}
void main()
{
int n,i;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s",a);
scanf("%s",b);
xj(a,b);
}
}
|
32
|
15931
|
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
|
15932
|
void minus(char *a,char *b,int na,int nb,char *c)
{
int i;
for(i=0;i<nb;i++)
{
if((a[i]-b[i])<0)
{
c[i]=10+a[i]-b[i]+'0';
a[i+1]--;
}
else
c[i]=a[i]-b[i]+'0';
}
for(i=nb;i<na-1;i++)
{
if(a[i]<'0')
{
a[i]=a[i]+10;
a[i+1]--;
}
c[i]=a[i];
}
c[na-1]=a[na-1];
}
void exchange(char *a,int na)
{
int k;
for(k=1;k<=(na/2);k++)
{
int t;
t=a[k-1];
a[k-1]=a[na-k];
a[na-k]=t;
}
}
void main()
{
int n,i,k,j;
scanf("%d",&n);
char **c;
c=(char**)malloc((n+1)*sizeof(char *));
if(c!=NULL)
{char a[100]
,b[100];
int na,nb;
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
na=strlen(a);
nb=strlen(b);
exchange(a,na);
exchange(b,nb);
c[i]=(char*)malloc((na+1)*sizeof(char));
if(c[i]!=NULL)
minus(a,b,na,nb,c[i]);
}
for(i=0;i<n;i++)
{
for(k=strlen(c[i])-1;k>0;k--)
{
if(c[i][k]>'0')
break;
}
for(j=k;j>=0;j--)
{
printf("%c",c[i][j]);
if(j==0)
printf("\n");
}
free(c[i]);
}
free(c);
}
}
|
32
|
15933
|
/**
* ? ? ???????
* ? ?????
* ????: 2010?11?19?
* ???????????????
*/
int main()
{
int k, n; //????n?????????
cin>>n;
for ( k =1; k <= n; k++ ) //????
{
int a1[201]; //????????????a1??????b1????
int b1[201];
char a[201]; //?????????a??????b????
char b[201];
cin>>a>>b;
int len1 = strlen(a); //????????????
int len2 = strlen(b);
memset(a1,0,sizeof(a1)); //????????0
memset(b1,0,sizeof(b1));
int i, j = 0;
for (i = len1 - 1; i >= 0; i--)
a1[j++] = a[i] - '0'; //???????????????
j = 0;
for (i = len2 - 1; i >= 0; i--)
b1[j++] = b[i] - '0';
for (i = 0; i < len1 ; i++) //????
{
if ( a1[i] >= b1[i] ) //????????
{
a1[i]= a1[i]- b1[i];
}
else
if ( a1[i] < b1[i] ) //??????????????????
{
a1[i]= a1[i] + 10 - b1[i];
a1[i+1]--;
}
}
i = len1;
while( a1[i] == 0 )
i--; //???????0??
for(; i >= 0; i--)
cout << a1[i]; //??????
cout << endl;
}
return 0;
}
|
32
|
15934
|
void main()
{
int i,j,k,n;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s%s",a,b);
for(j=strlen(a)-1,k=strlen(b)-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;
}
}
k=strlen(a);
for(j=0;a[j]=='0';j++);
for(;j<k;j++)
printf("%c",a[j]);
printf("\n");
}
}
|
32
|
15935
|
int main()
{
int n;
cin>>n;
while(n--)
{
//?????? ????????
char num1[101],num2[101];
for(int k=0;k!=101;k++)
num1[k]=num2[k]='\0';
cin>>num1>>num2;
//???len1 len2??????????????
int len1=0,len2=0;
while(num1[len1++]!='\0'){}
while(num2[len2++]!='\0'){}
len1--;
len2--;
//???????????100???? ?????
for(int k=len1-1;k>=0;k--)
{
num1[101+k-len1]=num1[k];
num1[k]='\0';
}
for(int k=len2-1;k>=0;k--)
{
num2[101+k-len2]=num2[k];
num2[k]='\0';
}
//????
for(int k=100;num2[k]!='\0';k--)
{
int temp=num1[k]-num2[k]; //?temp??????????
if(temp<0) //????? ??k???10+temp ?k-1????1
{
num1[k-1]--;
num1[k]=10+temp+'0';
}
else //???k???temp
num1[k]=temp+'0';
}
//????
int k=0; //?k??num1??????'0'?'\0'?? ???????
while(num1[k]=='\0'||num1[k]=='0')
k++;
for(;k!=101;k++)
cout<<num1[k];
cout<<endl;
}
return 0;
}
|
32
|
15936
|
int main()
{
int n;
scanf("%d",&n);
int d[100];
char c[100][100];
for(int i=0;i<n;i++)
{
char a[100]={0};
char b[100]={0};
scanf("%s",a);
scanf("%s",b);
int m=strlen(a);
d[i]=strlen(a);
int o=strlen(b);
for(int j=m-1;j>m-o-1;j--)
c[i][j]=a[j]-b[j-m+o]+'0';
if(m>n)
{
for(int t=m-o-1;t>=0;t--)
c[i][t]=a[t];
}
for(int k=m-1;k>=0;k--)
{
if(c[i][k]<'0')
{
c[i][k]=c[i][k]+10;
c[i][k-1]=c[i][k-1]-1;
}
}
}
for(int h=0;h<n;h++)
{
for(int t=0;t<d[h];t++)
printf("%c",c[h][t]);
printf("\n");
}
}
|
32
|
15937
|
void main()
{
char a[101],b[101];
int n,i,j,c1,c2;
scanf("%d",&n);
for(i=1;i<=n;i++)
{ scanf("%s",a);
scanf("%s",b);
c1=strlen(a);
c2=strlen(b);
for(j=c1-1;j>=c1-c2;j--)
{ if(a[j]<b[j-c1+c2])
{a[j]=a[j]+10-b[j-c1+c2]+48;a[j-1]--;}
else a[j]=a[j]-b[j-c1+c2]+48;
}
printf("%s\n",a);
}
}
|
32
|
15938
|
int main()
{
int n;
cin>>n;
int i,j,k;
char c[n][101];
int d[n];
for(j=0;j<n;j++)
{
char a[101],b[101];
cin>>a>>b;
if(j==n-1);
else cin.get();
int sizea,sizeb;
sizea=strlen(a);
d[j]=sizea;
sizeb=strlen(b);
for(i=sizeb-1;i>=0;i--)
{
b[i+sizea-sizeb]=b[i];
}
for(i=0;i<sizea-sizeb;i++)
b[i]='0';
for(i=sizea-1;i>=0;i--)
{
if(a[i]>=b[i])
c[j][i]=a[i]-b[i]+'0';
else if(a[i]<b[i])
{
a[i-1]=a[i-1]-1;
a[i]=a[i]+10;
c[j][i]=a[i]-b[i]+'0';
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
if(c[i][j]!='0')
break;
for(k=j;k<d[i];k++)
cout<<c[i][k];
cout<<endl;
}
return 0;
}
|
32
|
15939
|
int main()
{
int n,s[200],i,j,e,l,k,d[200],h;
char a[200];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(h=0;h<200;h++)
{
a[h]=s[h]=d[h]=0;
}
scanf("%s",a);
l=strlen(a);
for(j=0;j<l;j++)
{
s[j]=a[l-j-1]-'0';
}
scanf("%s",a);
k=strlen(a);
for(j=0;j<k;j++)
{
d[j]=a[k-j-1]-'0';
}
for(j=0;j<l;j++)
{
s[j]=s[j]-d[j];
if(s[j]<0)
{
s[j]=s[j]+10;
s[j+1]=s[j+1]-1;
}
}
for(j=l-1;j>=0;j--)
{
if(s[j]!=0) break;
}
for(h=j;h>=0;h--)
{
printf("%d",s[h]);
}
printf("\n");
}
return 0;
}
|
32
|
15940
|
void main()
{
int n,i,j,flag=0;
char m1[100],m2[100],m3[100],m4[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s",m1);
scanf("%s",m2);
scanf("\n");
for(j=0;j<=(strlen(m1)-strlen(m2)-1);j++) m3[j]='0';
m3[j]='\0';
strcat(m3,m2);
for(j=strlen(m1)-1;j>=0;j--)
{
if (m1[j]<'0')
{
m1[j]=m1[j]+10;
m1[j-1]=m1[j-1]-1;
}
if (m1[j]>=m3[j]) m4[j]=m1[j]-m3[j]+'0';
else
{
m4[j]=m1[j]-m3[j]+10+'0';
m1[j-1]=m1[j-1]-1;
}
}
for(j=0;j<=strlen(m1)-1;j++)
{
if(m4[j]!='0') flag=1;
if (flag==1) printf("%c",m4[j]);
}
printf("\n");
}
}
|
32
|
15941
|
void main()
{
int a[101][101],b[101][101],c[101][101],x[101][101],y[101][101],j,m,n,t,s,r,q;
scanf("%d",&n);
int i[101]={0};
for(r=0;r<n;r++)
{
q=getchar();
for(i[r]=1;;i[r]++)
{a[r][i[r]]=getchar();
if(a[r][i[r]]=='\n')
{a[r][i[r]]=0;break;}
}
for(j=1;;j++)
{b[r][j]=getchar();
if(b[r][j]=='\n')
{b[r][j]=0;break;}
}
for(m=1;m<i[r];m++)
a[r][m]=a[r][m]-48;
for(m=1;m<j;m++)
b[r][m]=b[r][m]-48;
for(m=1;m<i[r];m++)
x[r][m]=a[r][i[r]-m];
for(m=1;m<j;m++)
y[r][m]=b[r][j-m];
for(m=i[r];m<101;m++)x[r][m]=0;
for(m=j;m<101;m++)y[r][m]=0;
for(m=0;m<101;m++)c[r][m]=0;
for(m=1;m<i[r];m++)
{c[r][m]=(x[r][m]+10-y[r][m])%10;
x[r][m+1]=x[r][m+1]+(x[r][m]+10-y[r][m])/10-1;
}
}
printf("\n");
for(r=0;r<n;r++)
{
for(s=0,t=i[r]-1;t>0;t--)
{if(c[r][t]==0&&s==0)continue;
printf("%d",c[r][t]);
s=1;
}
printf("\n");
}
}
|
32
|
15942
|
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
|
15943
|
void main()
{
int a[101][101];
int b[101][101];
char c;
int i,k,numa,numb,n,j,j0;
scanf("%d\n",&n);
for(i=0;i<=100;i++)
{
for(j=0;j<=100;j++)
{
a[i][j]='\0';
b[i][j]='\0';
}
}
for(i=1;i<=n;i++)
{
k=1;
while((c=getchar())!='\n') a[i][k++]=c;
k=1;
while((c=getchar())!='\n') b[i][k++]=c;
getchar();
}
for(i=1;i<=n;i++)
{
for(numa=1;;numa++) if(a[i][numa]=='\0') break;
for(numb=1;;numb++) if(b[i][numb]=='\0') break;
numa--;numb--;
for(j=0;j<=numa-1&&b[i][numb-j]>='0'&&b[i][numb-j]<='9';j++)
{
a[i][numa-j]=a[i][numa-j]-b[i][numb-j];
if(a[i][numa-j]<0)
{
a[i][numa-j]=a[i][numa-j]+10;
a[i][numa-j-1]=a[i][numa-j-1]-1;
}
a[i][numa-j]=a[i][numa-j]+'0';
}
}
for(i=1;i<=n;i++)
{
for(j0=1;;j0++) if(a[i][j0]!='0') break;
for(j=j0;a[i][j]!='\0';j++)
{
printf("%c",a[i][j]);
}
printf("\n");
}
}
|
32
|
15944
|
const int base=250;
const int start=5;
int ans[300];
main()
{
void trans(char s[],int num[]);
void plus(int a[],int b[]);
int minus(int a[],int b[]);
void print(int num[]);
int judge(int a[],int b[]);
int a[300],b[300];
char sa[300],sb[300];
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
getchar();
gets(sa);
gets(sb);
memset(a,0,300*sizeof(int));
memset(b,0,300*sizeof(int));
memset(ans,0,300*sizeof(int));
trans(sa,a);
trans(sb,b);
b[0]=0-b[0];
if (a[0]*b[0]>0)
{
plus(a,b);
ans[0]=a[0];
}
else
{
int flag=judge(a,b);
if (flag==0) {printf("0\n"); continue;}
if (flag>0)
{minus(a,b);ans[0]=a[0];}
else {minus(b,a);ans[0]=b[0];}
}
print(ans);
}
getchar();getchar();getchar();getchar();
}
void trans(char s[],int num[])
{
int len=strlen(s),b=0;
num[0]=1;
if (s[0]=='-') {len--; b++; num[0]=-1;}
for (int t=0;t<len;t++)
{
num[base-len+t+1]=s[t+b]-'0';
}
num[1]=base-len+1;
}
int judge(int a[],int b[])
{
if (a[1]<b[1]) return 1;
else if (a[1]>b[1]) return -1;
else {
int t,p=0,floor=a[1]<b[1]?a[1]:b[1];
for (t=floor;t<=base&&p==0;t++)
p=a[t]-b[t];
if (p==0) return 0;
else return p>0?1:-1;
}
}
void check(int num[])
{
int p;
for (p=start;num[p]==0&&p<=base;p++);
num[1]=p;
}
void plus(int a[],int b[])
{
int floor=a[1]<b[1]?a[1]:b[1];
for (int t=base;t>=floor;t--)
{
int k=ans[t]+a[t]+b[t];
ans[t]=k%10;
ans[t-1]+=k/10;
}
if (ans[floor-1]!=0) ans[1]=floor-1;
else ans[1]=floor;
}
void minus(int a[],int b[])
{
int floor=a[1]<b[1]?a[1]:b[1];
for (int t=base;t>=floor;t--)
{
int k=ans[t]+a[t]-b[t];
if (k<0) {ans[t-1]-=1; k+=10;}
ans[t]=k%10;
ans[t-1]+=k/10;
}
check(ans);
}
void print(int num[])
{
if (num[0]<0) printf("-");
for (int t=num[1];t<=base;t++)
printf("%d",num[t]);
printf("\n");
}
|
32
|
15945
|
void main()
{
int i,j,n,k,k1,k2,x[101],y[101],z[101];
char a[11][101],b[11][101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=100;j++)
{
a[i][j]='\0';
b[i][j]='\0';
}
}
for(i=1;i<=n;i++)
{
scanf("%s",&a[i]);
scanf("%s",&b[i]);
}
for(i=1;i<=n;i++)
{
for(j=0;j<=100;j++)
{
x[j]=0;
y[j]=0;
z[j]=0;
}
for(j=100;j>=0;j--)
{
if(a[i][j]!='\0')
{
k1=j+1;
for(j=j;j>=0;j--)
a[i][j]=a[i][j]-48;
if(j==-1)
break;
}
}
for(j=100;j>=0;j--)
{
if(b[i][j]!='\0')
{
k2=j+1;
for(j=j;j>=0;j--)
b[i][j]=b[i][j]-48;
if(j==-1)
break;
}
}
for(j=100;j>=101-k1;j--)
x[j]=a[i][j-101+k1];
for(j=100;j>=101-k2;j--)
y[j]=b[i][j-101+k2];
for(j=100,k=0;j>=101-k1;j--)
{
if(x[j]-k>=y[j])
{
z[j]=x[j]-k-y[j];
k=0;
}
if(x[j]-k<y[j])
{
z[j]=x[j]+10-k-y[j];
k=1;
}
}
for(j=0;i<=100;j++)
{
if(j==100&&z[j]==0)
printf("0\n");
if(z[j]!=0)
{
for(j=j;j<=100;j++)
printf("%d",z[j]);
if(j==101)
{
printf("\n");
break;
}
}
}
}
}
|
32
|
15946
|
int main(){
char a[20][100],b[20][100];
char c[20][100];
int i,len1,len2,d,n,cycle;
scanf("%d\n",&n);
for(cycle=0;cycle<n;cycle++)
{
gets(a[cycle]);
gets(b[cycle]);
scanf("\n");
len1=strlen(a[cycle]);
len2=strlen(b[cycle]);
d=len1-len2;
for(i=len1-1;i>=0;i--){
if(i>=d){
c[cycle][i]=a[cycle][i]-b[cycle][i-d]+48;
if(a[cycle][i]<b[cycle][i-d]){
a[cycle][i-1]=a[cycle][i-1]-1;
c[cycle][i]+=10;}
}else c[cycle][i]=a[cycle][i];
}
len2=0;d=0;i=0;len1=0;
}
int j;
for(j=0;j<n;j++){
printf("%s\n",c[j]);
}
}
|
32
|
15947
|
int main()
{
int k,i,j,m,n;
char str1[100]={'\0'},str2[100]={'\0'},c[100][100]={'\0'};
scanf("%d\n",&k);
for(i=0;i<k;i++)
{ gets(str1);gets(str2);getchar();
m=strlen(str1);n=strlen(str2);
for(j=1;j<=n;j++)
{if((str1[m-j]-str2[n-j])>=0){str1[m-j]=str1[m-j]-str2[n-j];}
else{str1[m-j]=str1[m-j]-str2[n-j]+10;str1[m-j-1]=str1[m-j-1]-1;}
str1[m-j]+=48;}
strcpy(c[i],str1);
}
for(i=0;i<k;i++){printf("%s\n",c[i]);}
}
|
32
|
15948
|
void main()
{
int n,i,j,l1[100],l2[100];
char str1[100][100],str2[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",str1[i]);
scanf("%s",str2[i]);
}
for(i=0;i<n;i++)
{
l1[i]=strlen(str1[i]);
l2[i]=strlen(str2[i]);
for(j=1;j<l2[i]+1;j++)
{
if(str1[i][l1[i]-j] >= str2[i][l2[i]-j])
str1[i][l1[i]-j] = str1[i][l1[i]-j] - str2[i][l2[i]-j]+48;
else
{
str1[i][l1[i]-j-1]=str1[i][l1[i]-j-1]-1;
str1[i][l1[i]-j]=str1[i][l1[i]-j]+10-str2[i][l2[i]-j]+48;
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",str1[i]);
}
}
|
32
|
15949
|
char b[101];
void reorder(char a[])
{
int i, l;
char temp0;
l = strlen(a);
for (i = 0; i <l; i++)
b[i] = a[l - i - 1];
}
int main()
{
char bjs[101][101], js[101][101], temp;
int i, j, k, p, n, l1, l2, c[101];
cin >> n;
for (i = 1; i <= n; i++)
cin >> bjs[i] >> js[i];
for (i = 1; i <= n; i++)
{
l1 = strlen(bjs[i]);
l2 = strlen(js[i]);
reorder(bjs[i]);
for (j = 0; j < l1; j++)
bjs[i][j] = b[j];
reorder(js[i]);
for (j = 0; j < l2; j++)
js[i][j] = b[j];
for (j = l2; j < l1; j++)
js[i][j] = '0';
for (j = 0; j < l1; j++)
{
if (bjs[i][j] < js[i][j])
{
bjs[i][j] += 10;
bjs[i][j + 1] -= 1;
}
c[j] = bjs[i][j] - js[i][j];
}
for (k = l1 - 1; k >= 0; k--)
if (c[k] != 0)
break;
if (k == -1)
cout << 0;
else
for (p = k; p >= 0; p--)
cout << c[p];
cout << endl;
}
return(0);
}
|
32
|
15950
|
void main()
{
int n,i,j,l[20],s[20];
char a[20][100],b[20][100],c[20][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a[i],b[i]);
l[i]=strlen(a[i]);
s[i]=strlen(b[i]);
}
for(i=0;i<n;i++)
{
for(j=l[i]-1;j>=0;j--)
{
if(s[i]>0)
{
if(a[i][j]>=b[i][s[i]-1])
{
c[i][j]=a[i][j]-b[i][s[i]-1]+48;
s[i]=s[i]-1;
}
else
{
c[i][j]=10+a[i][j]-b[i][s[i]-1]+48;
a[i][j-1]=a[i][j-1]-1;
s[i]=s[i]-1;
}
}
else
{
c[i][j]=a[i][j];
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<l[i];j++)
{
printf("%c",c[i][j]);
}
printf("\n");
}
}
|
32
|
15951
|
int main()
{
char a[100][100],b[100][100];
char c[100][101];
int i,n;
int p,q,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&a[i]);
scanf("%s",&b[i]);
}
//printf("%s,%s\n",a,b);
for(i=0;i<n;)
{
for(t=0,p=strlen(a[i])-1,q=strlen(b[i])-1;p>=0;p--,q--)
{
if(p>=0&&q>=0&&a[i][p]>=b[i][q]) {
t=0;c[i][p]=a[i][p]-b[i][q]+t;
}
else if(p>=0&&q>=0&&a[i][p]<b[i][q]) {
t=1;
c[i][p]=a[i][p]+t*10-b[i][q];
a[i][p-1]=a[i][p-1]-1;
}
else if(p>=0&&q<0) {
t=0;c[i][p]=a[i][p]-48;
}
//printf("%d,%d\n",p,c[i][p]);
c[i][p]+=48;
}
//printf(" %d\n",strlen(a));
c[i][strlen(a[i])]='\0';
i++;
}
for(i=0;i<n;i++)
{
printf("%s\n",c[i]);
}
return 0;
}
|
32
|
15952
|
void main()
{
char a[100]={""};
char b[100]={""};
int n,i,j,k,p;
int c1,c2;
scanf("%d",&n);
for(j=1;j<=n;j++)
{
c1=0;
c2=0;
scanf("%s",a);
scanf("%s",b);
for(;(a[c1]<=58)&&(a[c1]>=48);c1++)
{}
for(;(b[c2]<=58)&&(b[c2]>=48);c2++)
{}
k=0;
for(i=c1-c2;i<c1;i++)
{
if(a[i]-b[k]>=0)
{
a[i]=a[i]-b[k]+48;
}
else if(a[i]-b[k]<0)
{
for(p=i-1;a[p]==48;p--)
{
a[p]=a[p]+9;
}
if(a[p]!=48)
{
a[p]=a[p]-1;
}
else{}
a[i]=a[i]-b[k]+48+10;
}
k++;
}
printf("%s\n",a);
}
}
|
32
|
15953
|
int main()
{
int n, i, len1, len2, j, k, char11[101] = {0}, char22[101] = {0}, flag = 0, answer[101] = {0};
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
|
15954
|
struct
{char a[200];
char b[200];
int as[200];
int bs[200];
int ad;
int bd;
}num[200];
void main()
{
int n,i,j,x,y,z[200][200],h=0,k,t;
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
scanf("%s\n%s\n\n",&num[i].a,num[i].b);
num[i].ad=strlen(num[i].a);num[i].bd=strlen(num[i].b);
}
scanf("%s\n%s",&num[n-1].a,&num[n-1].b);
num[n-1].ad=strlen(num[n-1].a);num[n-1].bd=strlen(num[n-1].b);
for(i=0;i<n;i++)
{
for(j=0;j<num[i].ad;j++)
num[i].as[j]=num[i].a[j]-48;
for(k=0;k<num[i].bd;k++)
num[i].bs[k]=num[i].b[k]-48;
}
for(i=0;i<n;i++)
{
h=0;
for(j=num[i].ad-1,k=num[i].bd-1;k>=0;k--,j--)
{
if(num[i].as[j]-num[i].bs[k]<0)
{
z[i][h]=num[i].as[j]-num[i].bs[k]+10;
num[i].as[j-1]=num[i].as[j-1]-1;h=h+1;
}
if(num[i].as[j]-num[i].bs[k]>=0)
{
z[i][h]=num[i].as[j]-num[i].bs[k];
h=h+1;
}
}
for(;j>=0;j--)
{
if(num[i].as[j]>=0)
{
z[i][h]=num[i].as[j];
h=h+1;
}
if(num[i].as[j]<0)
{
z[i][h]=num[i].as[j]+10;
num[i].as[j-1]=num[i].as[j-1]-1;
h=h+1;
}
}
for(t=num[i].ad-1;t>=0;t--)
printf("%d",z[i][t]);
printf("\n");
}
}
|
32
|
15955
|
//* * * * * * * * * * * * * * * * * * * * * * * *
//*????????? *
//*????????? *
//*????? *
//*???2010.11.17 *
//* * * * * * * * * * * * * * * * * * * * * * * *
int main()
{
int n, i = 0, j = 0, k; // ????n??????????????i,j,k;
char seline1[101], seline2[101]; // ???????
unsigned int an1[101], an2[101]; // ???????
int len1, len2; // len1,len2?????????
cin >> n; // ??n;
// cin.ignore(); // ???????
for (k = 1; k <= n; k++)
{
for (j = 0; j < 101; j++)
{
seline1[j] = 0;
seline2[j] = 0;
}
cin.ignore();
cin.getline(seline1, 101);
cin.getline(seline2, 101); // ???????
//cout << endl;
len1 = strlen(seline1);
len2 = strlen(seline2); // ?????????
memset(an1, 0, sizeof(an1));
memset(an2, 0, sizeof(an2)); // ?????
j = 0;
for (i = len1 - 1; i >= 0; i--)
an1[j++] = seline1[i] - '0'; // ????????????????
j = 0;
for (i = len2 - 1; i >= 0; i--)
an2[j++] = seline2[i] - '0'; // ???
for (i = 0; i <= len1 - 1; i++)
{
if (an1[i] >= an2[i])
an1[i] -= an2[i]; // ?????????????????????
else
{
an1[i] = an1[i] -an2[i] + 10; // ???????????
an2[i + 1]++;
}
}
i = 100;
while (an1[i] == 0)
i--; // ???????0???
for (; i >= 0; i--)
cout << an1[i]; // ???????
cout << endl; // ?????
}
return 0;
}
|
32
|
15956
|
int num1[101],num2[101];
char char1[101],char2[101];
int main()
{
int n,i,j;
cin>>n;
for (i=1;i<=n;i++)
{
for (j=1;j<=100;j++) {num1[j]=0;num2[j]=0;}
cin>>char1>>char2;
int len1,len2;
for (len1=0;char1[len1]!='\0';len1++);
for (len2=0;char2[len2]!='\0';len2++);
for (j=1;j<=len1;j++)
num1[j]=char1[len1-j]-48;
for (j=1;j<=len2;j++)
num2[j]=char2[len2-j]-48;
for (j=1;j<=len1;j++)
num1[j]=num1[j]-num2[j];
for (j=1;j<=len1;j++)
{
if (num1[j]<0) {num1[j]=num1[j]+10;num1[j+1]--;}
}
int flag=0;
for (j=0;j<len1;j++)
{
if (num1[len1-j]!=0)
flag=1;
cout<<num1[len1-j];
}
if (flag==0) cout<<0;
if (i!=n) cout<<endl;
}
return 0;
}
|
32
|
15957
|
/*
? ? ??1000012827_1.cpp
? ?????
?????20101117
??????????????
**/
int main()
{
char minuend[101], subtrahend[101]; //????????
int n, k = 1, c = -1; //??????n????????c??????????????????
cin >> n;
for(k = 1; k <= n; k ++)
{
cin.get(); //????
//????????????????????????a b ????????result????d e????
int m[100] = {0}, s[100] = {0}, a, b, result[100] = {0}, d = 99, e = 99;
cin.getline(minuend, 100); //??????
cin.getline(subtrahend, 100);
a = strlen(minuend); //???????????
b = strlen(subtrahend);
for(int i = a - 1; i >= 0; i --) //???????
{
m[d] = minuend[i] - '0';
d --;
}
for(int i = b - 1; i >= 0; i --)
{
s[e] = subtrahend[i] - '0';
e --;
}
for(int i = 99; i > 99 - a; i --) //????????
{
if(m[i] >= s[i])
result[i] = m[i] - s[i];
else //????????????????????
{
m[i] = m[i] + 10;
m[i - 1] --;
result[i] =m[i] - s[i];
}
}
for(int i = 0; i < 100; i ++)
if(result[i] != 0) //???????????????
{
c = i;
break;
}
if(c == -1) //?????????
cout << "0" << endl;
else //????????????????????99?
{
for(int i = c; i < 99; i ++)
cout << result[i];
cout << result[99] << endl; //?????100?????
}
}
return 0;
}
|
32
|
15958
|
void read(char x[]) /* read is used to overturn x[] */
{
char temp[100];
int i,k;
scanf("%s",temp);
k=strlen(temp);
x[k]=0;
for(i=0;i<k;i++)
x[i]=temp[k-1-i];
}
void main()
{
char a[100],b[100];
int i,j,la,lb,k,n;
scanf("%d",&n);
for(k=1;k<=n;k++)
{
read(a);
read(b);
la=strlen(a);
lb=strlen(b);
for(i=0;i<lb;i++)
{
if(a[i]<b[i])
{
a[i]=a[i]+10-b[i]+'0';
a[i+1]--;
}
else
a[i]=a[i]-b[i]+'0';
}
for(i=lb;i<la;i++)
{
if(a[i]<'0')
{
a[i]=a[i]+10;
a[i+1]--;
}
}
for(i=0,j=0;i<la;i++)
{
if(a[la-1-i]!='0' || j!=0)
{
printf("%c",a[la-1-i]);
j=1;
}
}
if(j==0) printf("0");
printf("\n");
}
}
|
32
|
15959
|
/**
* @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
|
15960
|
int main()
{
int n, len_a, len_b;
char a[101], b[101];
int num[101];
cin >> n;
for(int i = 1; i <= n; i++)
{
cin.get();
cin.getline(a, 101);
len_a = strlen(a);
cin.getline(b, 101);
len_b = strlen(b);
memset(num, 0, sizeof(num));
for(int i = len_a - 1; i >= 0; i--)
num[len_a - i] = a[i] - '0';
for(int i = len_b - 1; i >= 0; i--)
{
int j = len_b - i, b0 = b[i] - '0';
if(num[j] >= b0)
num[j] -= b0;
else
{
num[j + 1]--;
num[j] = num[j] + 10 - b0;
}
}
int i = 100;
while(num[i] == 0 && i != 1)
i--;
for(int j = i; j >= 1; j--)
cout << num[j];
cout << endl;
}
return 0;
}
|
32
|
15961
|
void main()
{
int n,i,j,k,la,lb,lc;
char a[110],b[110],c[110]={""};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",&a,&b);
la=strlen(a);
lb=strlen(b);
for(j=1;j<=lb;j++)
{
if(a[la-j]>=b[lb-j]) c[la-j]=a[la-j]-b[lb-j]+48;
else
{
c[la-j]=a[la-j]+10-b[lb-j]+48;
a[la-j-1]--;
}
}
for(j=0;j<(la-lb);j++)
c[j]=a[j];
lc=strlen(c);
for(k=0;k<=la-1;k++)
if (c[k]!='0') break;
for(j=k;j<=la-1;j++)
printf("%c",c[j]);
printf("\n");
}
}
|
32
|
15962
|
//********************************
//*???????? **
//*?????? 1300012861 **
//*???2013.11.17 **
//********************************
int main()
{
int n, i, j, k, max, str1[110], str2[110];
char num1[110], num2[110];
cin >> n;
for ( i = 1; i <= n; i++ )
{
cin >> num1;
int nlen1 = strlen(num1);
cin >> num2;
int nlen2 = strlen(num2);
memset(str1, 0, sizeof(str1));
memset(str2, 0, sizeof(str2));
j = 0;
for ( k = nlen1 - 1; k >= 0; k-- )
{
str1[j++] = num1[k] - '0';
}
j = 0;
for ( k = nlen2 - 1; k >= 0; k-- )
str2[j++] = num2[k] - '0';
for ( j = 0; j < nlen2; j++ )
{
str1[j] = str1[j] - str2[j];
if ( str1[j] < 0 )
{
str1[j+1]--;
str1[j] = 10 + str1[j];
}
}
j = nlen1;
while ( str1[j] == 0 )
j--;
for ( ; j >= 0; j-- )
cout << str1[j];
cout << endl;
}
return 0;
}
|
32
|
15963
|
int main()
{
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
char s1[101],s2[101]={'0'},s3[101]={'\0'};
scanf("%s",s1);
scanf("%s",s2);
printf("\n");
int l1,l2,j,u=0;
l1=strlen(s1);
l2=strlen(s2);
for(j=1;j<=l2;j++)
{
int x,y,z;
x=s1[l1-j]-'0';
y=s2[l2-j]-'0';
if(x+u>=y)
{
z=x-y+u;
u=0;
}
else
{
z=10+x-y+u;
u=-1;
}
s3[l1-j]=z+'0';
}
if(l1>l2)
{
int k,l;
k=s1[l1-l2-1]-'0';
s3[l1-l2-1]=k+u+'0';
for(l=0;l<l1-l2-1;l++)
s3[l]=s1[l];
}
int l;
for(l=0;l<l1-1;l++)
{
if(s3[l]!='0')
{
printf("%s",s3+l);
break;
}
}
if(l==l1-1)
{
printf("%c",s3[l1-1]);
}
}
return 0;
}
|
32
|
15964
|
void main()
{
char a[101],b[101],c[101];
int n,i,j,k,p=0,q;
int len1,len2;
scanf("%d",&n);
for(i=0;i<=100;i++)
{
c[i]=0;
}
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
len1=strlen(a);
len2=strlen(b);
for(j=len2-1;j>=0;j--)
{
b[j+len1-len2]=b[j];
}
for(j=0;j<len1-len2;j++)
{
b[j]='0';
}
for(k=len1-1;k>=0;k--)
{
if(a[k]>=b[k])
c[k]=a[k]-b[k];
else if(a[k]<b[k])
{
c[k]=a[k]+10-b[k];
a[k-1]--;
}
}
while(c[p]==0)
{
p++;
}
for(q=p;q<len1;q++)
{
printf("%d",c[q]);
}
printf("\n");
}
}
|
32
|
15965
|
/*
* ???: 1000010191_test4_2.cpp
* ??: ???
* ????: 2010-12-24
* ??: ?????
*/
int main()
{
int n;
cin>>n;
for (int k=1;k<=n;k++)
{
//??
char sa[101],sb[101];
cin>>sa>>sb;
//??
int la=strlen(sa),lb=strlen(sb);
//??
int a[101]={0},b[101]={0};
for (int i=1;i<=la;i++)
a[i]=sa[la-i]-'0';
for (int i=1;i<=lb;i++)
b[i]=sb[lb-i]-'0';
//??
for (int i=1;i<=la;i++)
{
a[i]-=b[i];
if (a[i]<0)
{
a[i]+=10;
a[i+1]--;
}
}
//??
while (a[la]==0) la--;
for (int i=la;i>0;i--) cout<<a[i];
cout<<endl;
}
return 0;
}
|
32
|
15966
|
//********************************
//*???????? **
//*?????? 1300012855 **
//*???2013.11.13 **
//********************************
int main(void)
{
int n; // ???
char ac[101], bc[101]; // ??????
int a[101], b[101]; // ??????
int al, bl; // ???????
cin >> n;
for(int i = 1; i <= n ; i++)
{
cin >> ac >> bc;
al = strlen(ac);
bl = strlen(bc);
for(int j = al - 1; j >= 0; j--) // ????
{
a[j] = ac[al - j - 1] - '0';
}
for(int j = bl - 1; j >= 0; j--) // ????
{
b[j] = bc[bl - j - 1] - '0';
}
for(int j = 0; j < bl; j++) // ???
{
a[j] -= b[j]; // ??
if(a[j] < 0) // ?????????
{
a[j] += 10;
a[j + 1]--;
}
}
int x;
for(x = al - 1; a[x] == 0; x--); // ???????
for(; x >= 0; x--)
{
cout << a[x]; // ????
}
cout << endl;
}
return 0;
}
|
32
|
15967
|
int main()
{
int i,n,j,x,y,k;
char a[101],b[101],c[101],d[101],e[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
x=strlen(a);
y=strlen(b);
for(j=x-1,k=0;j>=0;j--,k++)
c[k]=a[j];
for(j=y-1,k=0;j>=0;k++,j--)
d[k]=b[j];
for(j=0;j<x;j++)
{
if(j<y)
{
if(c[j]<d[j]) {e[j]=c[j]+58-d[j];c[j+1]=c[j+1]-1;}
else e[j]=c[j]-d[j]+48;
}
else e[j]=c[j];
}
for(j=x-1;j>=0;j--) printf("%c",e[j]);
printf("\n");
}
return 0;
}
|
32
|
15968
|
int main() {
int n;
scanf("%d",&n);
while(n--) {
char t1[1000],t2[1000];
int num1[1000]={0},num2[1000]={0};
scanf("%s",&t1);
scanf("%s",&t2);
int i;
int k=0;
for(i=strlen(t1)-1;i>=0;i--){
num1[k]=t1[i]-'0';
k++;
}
k=0;
for(i=strlen(t2)-1;i>=0;i--){
num2[k]=t2[i]-'0';
k++;
}
for(i=0;i<strlen(t1);i++){
num1[i]=num1[i]-num2[i];
if(num1[i]<0) {
num1[i]=num1[i]+10;
num1[i+1]--;
}
}
int check=0;
for(i=strlen(t1)-1;num1[i]==0;i--);
for(;i>=0;i--){
printf("%d",num1[i]);
check=1;
}
printf("\n");
if ((check==0)&&(i==-1)) printf("%d",0);
}
return 0;
}
|
32
|
15969
|
int main()
{
char str1[101], str2[101], kongge[101];
int num1[101] , num2[101], result[101] ;
int len1, len2, i, j, n;
cin >> n;
cin.get();
for(i = 1; i <= n; i++)
{
memset(str1, 0, 101);
memset(str2, 0, 101);
memset(num1, 0, 101);
memset(num2, 0, 101);
memset(result, 0, 101);
cin.getline(str1, 101);
len1 = strlen(str1);
for(j = 0; j < len1 ; j++ )
num1[j] = str1[j] - '0';
cin.getline(str2, 101);
len2 = strlen(str2);
for(j = 0; j < len2; j++ )
num2[len1 - 1 - j] = str2[len2 - 1 - j] - '0';
for(j = len1 - 1; j >= len1 - len2; j-- )
{
if(num1[j] >= num2[j])
num1[j] = num1[j] - num2[j];
else
{
num1[j] = 10 + num1[j] - num2[j];
// if(num1[j - 1] > 0)
num1[j - 1] = num1[j - 1] - 1 ;
/* else
{
int t = j - 1;
while(num1[t] == 0)
{
num1[t] = 9;
t--;
}
num1[t] = num1[t] - 1;
}*/
}
}
j = 0;
while(num1[j] == 0)
j++;
for(; j < len1; j++)
cout << num1[j];
cout << endl;
cin.getline(kongge, 101);
}
return 0;
}
|
32
|
15970
|
main()
{
char s[500],t[500],result[10][500];
int n,i,j,k,m=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
gets(s);
gets(t);
k=strlen(s)-1;
for(j=strlen(t)-1;j>=0;j--)
{
if(s[k]>=t[j]){
s[k]=s[k]-t[j]+'0';
k--;
}
else if(s[k]<t[j])
{
s[k-1]--;
s[k]=s[k]+10-t[j]+'0';
k--;
}
}
strcpy(result[m++],s);
if(i!=n-1) scanf("\n");
}
for(i=0;i<m;i++)
{
for(j=0;result[i][j]!='\0';j++)
{
if(result[i][j]!='0')
break;
}
if(result[i][j]=='\0')
printf("0");
else
for(k=j;result[i][k]!='\0';k++)
{
printf("%c",result[i][k]);
}
printf("\n");
}
}
|
32
|
15971
|
int main()
{
int n,i,j,a[100],b[100],length1,length2;
char s1[100],s2[100];
scanf("%d",&n);
while(n--)
{
scanf("%s",s1);
scanf("%s",s2);
length1=strlen(s1);
length2=strlen(s2);
for(i=0;i<100;i++)
{
a[i]=0;
b[i]=0;
}
for(i=0;i<length1;i++)
a[length1-1-i]=s1[i]-'0';
for(i=0;i<length2;i++)
b[length2-1-i]=s2[i]-'0';
for(i=0;i<length1;i++)
{
a[i]-=b[i];
if(a[i]<0)
{
a[i+1]--;
a[i]+=10;
}
}
for(i=length1-1;i>=0;i--)
if(a[i]!=0)
{j=i;break;}
for(i=j;i>=0;i--)
printf("%d",a[i]);
printf("\n");
}
return 0;
}
|
32
|
15972
|
int bigint1(char*str,int*a)
{
int len=(int)strlen(str);
int i;
for(i=0;i<len;i++)
a[len-i-1]=str[i]-'0';
return len;
}
void bigint2(int*a,int len)
{
int k=len-1;
int i;
while(a[k]==0&&k>0)
k--;
for(i=k;i>=0;i--)
printf("%d",a[i]);
}
int bigint3(int*a,int alen,int*b,int blen,int*c)
{
int i;
for(i=0;i<alen;i++)
{
c[i]=a[i];
if(i<blen) c[i]-=b[i];
}
for(i=0;i<alen;i++)
{
if(c[i]<0)
{
c[i+1]--;
c[i]+=10;
}
}
return c[alen-1]?alen:(alen-1);
}
int main(int argc, char* argv[])
{
char s1[300],s2[300];
int a[300],b[300],c[300];
int alen,blen,clen;
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",s1,s2);
alen=bigint1(s1,a);
blen=bigint1(s2,b);
clen=bigint3(a,alen,b,blen,c);
bigint2(c,clen);
printf("\n");
}
return 0;
}
|
32
|
15973
|
void main()
{
int a[105]={0},b[105]={0},d[105]={0};
int i,j,k,n;
char c[105]="";
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
gets(c);
k=strlen(c);
for (j=0;j<k;j++)
a[j]=c[k-j-1]-'0';
for (j=k;j<105;j++) a[j]=0;
gets(c);
k=strlen(c);
for (j=0;j<k;j++)
b[j]=c[k-j-1]-'0';
for (j=k;j<105;j++) b[j]=0;
//printf("%d %d%d%d%d%s ",k,b[1],b[2],b[3],b[4],c);
gets(c);
for (j=0;j<=102;j++) d[j]=0;
for (j=0;j<=102;j++)
{
d[j]=d[j]+a[j]-b[j];
if (d[j]<0) {d[j]=d[j]+10;d[j+1]=d[j+1]-1;}
//k=j,k=d[j];
}
j=101;
while (d[j]==0) {j--;}
while (j>=0) {printf("%d",d[j]); j--;}
printf("\n");
}
}
|
32
|
15974
|
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);
if(len1<len2) f=-1;
else if(len1==len2)
for(j=0;j<len1;j++)
if(a[j]<b[j])
{
f=-1;
break;
}
if(f==-1)
{
printf("-");
char s[100];
strcpy(s,a);
strcpy(a,b);
strcpy(b,s);
int len=len1;
len1=len2;
len2=len;
}
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
|
15975
|
void calculate(int);
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
calculate(n-i==1?0:1);
return 0;
}
void calculate(int isblank)
{
char large[101],small[101],dif[101];
int large_len,small_len,digit_L,digit_S,digit_dif;
char *p_L,*p_S,*p_dif;
scanf("%s",large);
scanf("%s",small);
large_len=strlen(large);
p_L=large+large_len-1;
small_len=strlen(small);
p_S=small+small_len-1;
p_dif=dif+large_len-1;
*(p_dif+1)=0;
while(p_S-small+1)
{
digit_L=*p_L-'0';
digit_S=*p_S-'0';
digit_dif=digit_L-digit_S;
if(digit_dif<0)
{
digit_dif+=10;
(*(p_L-1))--;
}
*p_dif=digit_dif+'0';
p_L--;
p_S--;
p_dif--;
}
while(p_L>=large)
{
*p_dif=*p_L;
if(*p_L<'0')
{
*p_dif+=10;
(*(p_L-1))--;
}
p_L--;
p_dif--;
}
do
p_dif++;
while(*p_dif=='0');
if(*p_dif)
puts(p_dif);
else
printf("0\n");
if(isblank)
gets(dif);
}
|
32
|
15976
|
int main()
{
int n,i,j,an[100][102]={0},bn[100][102]={0};
char a[100][102]={0},b[100][102]={0};
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
int k=0;
gets(a[i]);
gets(b[i]);
scanf("\n");
for(j=strlen(a[i])-1;j>=0;j--)
an[i][k++]=a[i][j]-'0';
// for(j=0;j<strlen(a[i]);j++)
// printf("%d",an[i][j]);
//printf("\n");
k=0;
for(j=strlen(b[i])-1;j>=0;j--)
bn[i][k++]=b[i][j]-'0';
// for(j=0;i<strlen(b[i]);j++)
// printf("%d",bn[i][j]);
// printf("\n");
for(j=0;j<strlen(a[i]);j++)
{
an[i][j]=an[i][j]-bn[i][j];
if(an[i][j]<0)
{
an[i][j]+=10;
an[i][j+1]--;
}
}
}
int notzero=0;
for(i=0;i<n;i++)
{
for(j=strlen(a[i])-1;j>=0;j--)
{
if(an[i][j]==0&¬zero==0)
continue;
else {printf("%d",an[i][j]); notzero++;}
}
printf("\n");
}
return 0;
}
|
32
|
15977
|
int main()
{
int n,i;
cin >> n;
for( i=0;i<n;i++)
{
char a1[100],a2[100];
cin >> a1 >> a2;
cin.get();
int l1=strlen(a1), l2=strlen(a2);
int b1[100],b2[100],i,j;
memset( b1 ,0 ,sizeof(b1) );
memset( b2 ,0 ,sizeof(b2) );
j=0;
for( i=l1-1;i>=0;i--)
b1[j++]=a1[i]-'0';
j=0;
for( i=l2-1;i>=0;i--)
b2[j++]=a2[i]-'0';
for(i=0;i<l1;i++) //??
{
b1[i]=b1[i]-b2[i];
if(b1[i]<0)
{
b1[i]+=10;
b1[i+1]--;
}
}
i=99;
while( b1[i] ==0 )
{
i--;
if( i==0 )
break;
}
while(i>=0)
cout << b1[i--];
cout << endl;
}
return 0;
}
|
32
|
15978
|
char a[100];
void fuc(char *num0,int n)//??j-1?
{
if(num0[n]>'0') num0[n]=num0[n]-1;
else {
num0[n]='9';
fuc(num0,n-1);
}
}
void minus(char num0[],char num1[])
{
int last[2],i,j,k;
last[0]=strlen(num0)-1;//??????
last[1]=strlen(num1)-1;
a[last[0]+1]='\0';
for (i=last[1],j=last[0];j>=0;i--,j--)
{
if(i>=0)
{
if(num0[j]-num1[i]>=0) a[j]=num0[j]-num1[i]+'0';
else {a[j]=num0[j]-num1[i]+'0'+10;fuc(num0,j-1);}
}
else a[j]=num0[j];
}
if (a[0]=='0')
for(i=0;;i++)
{
if(a[i]=='0') continue;
else {
j=i;
for (k=j;k<=last[0]+1;k++)
a[k-j]=a[k];
break;
}
}
}
void main()
{
int n,i;
char num[3][100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %s",num[0],num[1]);
minus(num[0],num[1]);
printf("%s\n",a);
}
}
|
32
|
15979
|
int main()
{
char a[100][100], b[100][100];
int s[100][100]={0};
int c=0;
int p=0;
int i, j;
int k;
int n;
cin >> n;
for ( i=0; i<n; i++ )
cin >> a[i] >> b[i];
for ( k=0; k<n; k++ )
{
c=0;
p=0;
for ( i=strlen(a[k])-1, j=strlen(b[k])-1; j >= 0; i--, j-- )
{
s[k][c] += a[k][i]-'0'-(b[k][j]-'0');
if ( s[k][c]<0 )
{
s[k][c] += 10;
s[k][c+1]--;
}
c++;
}
for ( ; i >= 0; i-- )
{
s[k][c] += a[k][i]-'0';
if ( s[k][c]<0 )
{
s[k][c] += 10;
s[k][c+1]--;
}
c++;
}
for ( i=100; i >= 0; i-- )
if ( s[k][i] == 0 && p == 0 )
continue;
else
{
p=1;
cout << s[k][i];
}
if ( p == 0 )
cout << "0";
cout << endl;
}
return 0;
}
|
32
|
15980
|
int main()
{
int n,i,j,x,y;
char a[100],b[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
x=strlen(a);
y=strlen(b);
for(j=y-1;j>=0;j--)
{
if(a[x-y+j]<b[j])
{
a[x-y+j]=a[x-y+j]+10-b[j]+48;
a[x-y+j-1]-=1;
}
else
a[x-y+j]=a[x-y+j]-b[j]+48;
}
printf("%s\n",a);
}
return 0;
}
|
32
|
15981
|
int main()
{
int n,time,i,j,len1,len2;
char a[200],b[200];
scanf("%d",&n);
for(time=0;time<n;time++)
{
scanf("%s",a);
scanf("%s",b);
len1=strlen(a);
len2=strlen(b);
j=0;
for(i=0;i<len1;i++)
{
if(i<len2)
a[len1-i-1]-=(b[len2-i-1]-'0');
if(a[len1-i-1]<'0')
a[len1-i-2]-=1;
}
j=0;
for(i=0;a[i]!=0;i++)
{
if(a[i]!='0')j=1;
if(j)printf("%c",(a[i]>='0'?a[i]:a[i]+10));
}
printf("\n");
}
return 0;
}
|
32
|
15982
|
int s1[MAX];
int s2[MAX];
char num1[MAX];
char num2[MAX];
int Minus(int maxx, int * s1, int *s2)
{
int i;
int largest = 0;
for(i=0;i<maxx;i++)
{
s1[i]-=s2[i];
if(s1[i]<0)
{s1[i] += 10;
s1[i+1] --; //jiewei
}
if(s1[i])
largest = i;
}
return largest;
}
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
scanf("%s",num1);
scanf("%s",num2);
int i,j;
memset(s1,0,sizeof(s1));
memset(s2,0,sizeof(s2));
int n1=strlen(num1);
for(j=0,i=n1-1;i>=0;i--)
s1[j++]=num1[i]-'0';
int n2=strlen(num2);
for(j=0,i=n2-1;i>=0;i--)
s2[j++]=num2[i]-'0';
int largest = Minus(MAX,s1,s2);
for(i=largest;i>=0;i--)
printf("%d",s1[i]);
printf("\n");
}
return 0;
}
|
32
|
15983
|
void main()
{
char a[101],b[101];
int n,c,d,p,i,j=0,t;
scanf("%d",&n);
for(p=1;p<=n;p++)
{
scanf("%s%s",a,b);
c=strlen(a);
d=strlen(b);
for(i=1;i<=d;i++)
{
if(b[d-i]<=a[c-i])
a[c-i]=a[c-i]-b[d-i]+48;
else
{
a[c-i]=a[c-i]-b[d-i]+58;
if(a[c-1-i]>48)
a[c-1-i]--;
else
{
t=i;
while(a[c-1-t]==48)
{
a[c-1-t]=9+48;
t++;
}
a[c-1-t]--;
}
}
}
while(a[j]==48)
j++;
for(;j<c;j++)
printf("%c",a[j]);
j=0;
printf("\n");
}
}
|
32
|
15984
|
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
|
15985
|
void main()
{
char a[101],b[101];
int c[100],d[100];
int i,l1,l2,n,j;
scanf("%d",&n);
while(n--)
{
scanf("%s%s",a,b);
l1=strlen(a);
l2=strlen(b);
//printf("%d,%d\n",l1,l2);
for(i=0;i<l1;i++)
c[i]=a[l1-i-1]-'0';
for(i=0;i<l2;i++)
d[i]=b[l2-i-1]-'0';
for(i=0;i<l2;i++)
{
c[i]-=d[i];
if(c[i]<0)
{
c[i]+=10;
c[i+1]--;
}
}
for(i=l1-1;i>=0;i--)
if(c[i]!=0) break;
for(j=i;j>=0;j--)
printf("%d",c[j]);
printf("\n");
}
}
|
32
|
15986
|
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
|
15987
|
int main()
{
char a[100],b[100];
int c[100],d[100],i,j,k,l,n;
scanf("%d",&n);
for(l=0;l<n;l++)
{
scanf("%s\n",a);
scanf("%s",b);
memset(c,0,sizeof(c));
memset(d,0,sizeof(d));
int n1=strlen(a);
j=0;
for(i=n1-1;i>=0;i--) c[j++]=a[i]-'0';
int n2=strlen(b);
j=0;
for(i=n2-1;i>=0;i--) d[j++]=b[i]-'0';
for(i=0;i<100;i++)
{
c[i]=c[i]-d[i];
if(c[i]<0)
{
c[i]=c[i]+10;
c[i+1]--;
}
}
k=99;
while(c[k]==0&&k>0) k--;
for(i=k;i>=0;i--) printf("%d",c[i]);
printf("\n");
}
return 0;
}
|
32
|
15988
|
int main()
{
int n;
cin>>n;
for(int i=0;i<=n-1;i++)
{
char a[101],b[101];
cin>>a>>b;
int c=strlen(a);
int d=strlen(b);
int e[100],f[100];
int h=0,j=0;
for(int g=c-1;g>=0;g--)
{
e[h]=a[g]-'0';
h++;
}//????????
for(int g=d-1;g>=0;g--)
{
f[j]=b[g]-'0';
j++;
}
for(int g=d;g<100;g++)
f[g]=0;//?????????????????0
int l[100]={0};
for(int k=0;k<=c-1;k++)
{
if(e[k]>=f[k])
{
l[k]=e[k]-f[k];
}
else
{
l[k]=e[k]+10-f[k];
e[k+1]=e[k+1]-1;//????????????????????????
}
}
int t=99;
while(l[t]==0)//?????????
t--;
for(;t>=0;t--)
cout<<l[t];
cout<<endl;
}
return 0;
}
|
32
|
15989
|
int main()
{
int n,i,j,m,l,d;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
m=strlen(a);
l=strlen(b);
d=l;
for(j=m-1;j>m-d-1;j--)
{
if(a[j]>=b[l-1])
{
a[j]=a[j]-b[l-1]+48;
l--;
}
else
{
a[j]=a[j]+10-b[l-1]+48;
a[j-1]=a[j-1]-1;
l--;
}
}
j=0;
while(a[j]==0)
j++;
for(;j<m;j++)
printf("%c",a[j]);
printf("\n");
}
return 0;
}
|
32
|
15990
|
void f(void);
void main()
{
int n,i;
scanf("%d",&n);
for (i=0;i<n;i++)
f();
}
void f()
{
int i,x,y,n=0;
char a[101]={""},b[101]={""};
scanf("%s%s",a,b);
x=strlen(a);
y=strlen(b);
for (i=0;i<=y-1;i++)
if (a[x-1-i]>=b[y-1-i]) a[x-1-i]=a[x-1-i]-b[y-1-i]+48;
else {a[x-2-i]=a[x-2-i]-1;a[x-1-i]=a[x-1-i]-b[y-1-i]+10+48;}
while(a[n]=='0')
{ n++;}
for (i=n;i<=x-1;i++)
printf("%c",a[i]);
printf("\n");
}
|
32
|
15991
|
int main()
{
int n, i, j, k, t1[1000] = {0}, t2[1000] = {0}, x[1000], l1, l2;
char c1[1000], c2[1000];
cin >> n;
k = n;
while (k != 0)
{
cin.get();
cin.getline(c1,1000);
cin.getline(c2,1000);
l1 = strlen(c1);
l2 = strlen(c2);
for (i = 0; i < 1000; i++)
t2[i] = t1[i] = 0;
for (i = 0; i < l1; i++)
t1[i] = c1[l1 - 1 - i] - '0';
for (i = 0; i < l2; i++)
t2[i] = c2[l2 - 1 - i] - '0';
for (i = 0; i < l1; i++)
{
x[i] = t1[i] - t2[i];
if (x[i] < 0)
{
x[i] += 10;
t1[i + 1]--;
}
}
for (i = l1 - 1; i >= 0; i--)
if(x[i] != 0) break;
for (j = i; j >= 0; j--)
cout << x[j];
cout << '\n';
k--;
}
return 0;
}
|
32
|
15992
|
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
|
15993
|
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
|
15994
|
int main()
{
void zuocha(void);
int k,n;
cin >> n;
for (k=1;k<=n;k++)
zuocha();
return 0;
}
void zuocha(void)
{
char str1[100],str2[100];
int l1,l2;
cin >> str1 >> str2;
l1=strlen(str1);
l2=strlen(str2);
int num1[100],num2[100],cha[100];
int i,j;
for (i=0;i<l1;i++)
num1[l1-1-i]=str1[i]-'0';
for (i=0;i<l2;i++)
num2[l2-1-i]=str2[i]-'0';
for (i=l2;i<l1;i++)
num2[i]=0;
for (i=0;i<l1;i++)
if (num1[i]>=num2[i])
{
cha[i]=num1[i]-num2[i];
}
else
{
cha[i]=num1[i]+10-num2[i];
num1[i+1] -=1;
}
for (i=l1-1;i>=0;i--)
if (cha[i]!=0)
break;
for (j=i;j>=0;j--)
cout << cha[j];
cout << endl;
}
|
32
|
15995
|
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
|
15996
|
int main()
{
char str1[251], str2[251];
int i = 0, j = 0, len1, len2, a[251], b[251], pos = 0, n, k;
cin >> n;
// memset(c,0,sizeof(c));
for(k = 1;k <= n;k++)
{
cin >> str1 >> str2;
len1 = strlen(str1);
len2 = strlen(str2);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
j = 0;
for(i = len1 - 1;i >= 0;i--)
a[j++] = str1[i] - '0';
j = 0;
for(i = len2 - 1;i >= 0;i--)
b[j++] = str2[i] - '0';
for(i = 0;i < len1;i++)
{
a[i] = a[i] - b[i];
if(a[i] < 0)
{
a[i] = a[i] + 10;
a[i+1] = a[i+1] - 1;
}
}
for(i = len1 - 1; i >= 0;i--)
if(a[i] != 0)
{
pos = i;
break;
}
for(i = pos;i >= 0;i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
32
|
15997
|
//????????//
//??????//
//???1000011029//
//???2010?11?20?//
int main()
{
int n = 0; //??????????//
char num1[102]; //????????//
char num2[102]; //????????//
int i = 0; //??????????//
int t = 0; //???????????????//
int k = 0; //???????????????//
int m = 0; //????????//
int g = 0; //????????//
cin >> n; //????//
for( i = 1;i <= n;i++ ) //??????//
{
cin.ignore(); //??\0//
memset(num1,'0',102);
memset(num2,'0',102);
cin.getline( num1,102 ); //?????//
cin.getline( num2,102 ); //?????//
t = strlen(num1); //???????????//
k = strlen(num2); //???????????//
t = t - 1; //???????????????//
g = t; //?????????????//
for(k = k - 1 ;k >= 0;k-- ) //??????//
{
if( num1[t] >= num2[k] ) //???//
num1[t] = num1[t] - num2[k] + '0';
else //???//
{
num1[t] = 10 + num1[t] - num2[k] + '0';
num1[t - 1]--;
}
t--;
}
for( m = 0;m <= g;m++ )
{
if( num1[m] != 0 )
{
for( t = m;t <= g;t++ )
cout << num1[t]; //??????//
cout << endl;
break;
}
}
}
return 0;
}
|
32
|
15998
|
int main()
{
void usd(char x[100]);
char a[100],b[100],c[100]={'\0'};
int i,j,k,p,n;
scanf("%d",&n);
for (p=0;p<n;p++)
{
scanf("%s",a);
scanf("%s",b);
usd(a);
usd(b);
k=0;
for (i=0;b[i]!='\0';i++)
{
if (a[i]>=b[i]) c[i]=a[i]-b[i]+48;
else
{
c[i]=a[i]+58-b[i];
a[i+1]=a[i+1]-1;
}
k++;
}
for (j=k;a[j]!='\0';j++) c[j]=a[j];
c[j]='\0';
usd(c);
printf("%s\n",c);
}
}
void usd(char x[100])
{
int r,h,i;
char w;
r=strlen(x);
h=r/2;
for (i=0;i<h;i++)
{
w=x[i];x[i]=x[r-1-i];x[r-1-i]=w;
}
}
|
32
|
15999
|
void main()
{
void minus(char x[1000],char y[1000]);
int i,n;
char a[1000]={0},b[1000]={0};
scanf("%d",&n);
i=0;
while(i<n)
{
scanf("%s",a);
scanf("%s",b);
if(a[0]!='\0')
{
i=i+1;
minus(a,b);
printf("\n");
}
}
}
void minus(char x[1000],char y[1000])
{
int la,lb,i,s,c=0,t=0,ls;
char str[1000]={0},temp;
la=strlen(x);
lb=strlen(y);
do
{
if(lb>0)s=x[la-1]-y[lb-1];
if(lb<=0)s=x[la-1]-48;
s=s-c+48;
if(s<48)
{
s=s+10;
c=1;
}
else c=0;
str[t]=s;
t++;
la--;
lb--;
}
while(la>0);
ls=strlen(str);
for(i=ls-1;;i--)
{
if(str[i]=='0')str[i]='\0';
if(str[i]!='0')break;
}
ls=strlen(str)-1;
for(i=0;i<=ls/2;i++)
{
temp=str[i];
str[i]=str[ls-i];
str[ls-i]=temp;
}
printf("%s",str);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.