label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
32
|
15600
|
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
|
15601
|
int main()
{
int n,i,j=0,k=0,l,m,c[101]={0},d[101]={0};
char a[101],b[101];
cin >> n;
for(i=0;i<n;i++)
{
for(j=0;j<101;j++)
{
c[j]=0;
d[j]=0;
}
cin.get();
cin.getline(a,101);
cin.getline(b,101);
l=strlen(a);
m=strlen(b);
for(j = l-1, k = 0;j >= 0;j--)
c[k++]=a[j]-'0';
for(j = m-1, k = 0;j >= 0;j--)
d[k++]=b[j]-'0';
for(j=0;j<l;j++)
{
c[j]-=d[j];
if(c[j]<0)
{
c[j]+=10;
c[j+1]-=1;
}
}
if(c[l-1]==0)
{
for(j=l-2;j>=0;j--)
cout << c[j];
cout << endl;
}
else
{
for(j=l-1;j>=0;j--)
cout << c[j];
cout << endl;
}
}
return 0;
}
|
32
|
15602
|
int main()
{
int n,i,j,x,y;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s\n%s",a,b);
x=strlen(a);
y=strlen(b);
for(j=y;j>0;j--)
{
if(a[j+x-y-1]>b[j-1])
{
a[j+x-y-1]=a[j+x-y-1]-b[j-1]+48;
continue;
}
if(a[j+x-y-1]<b[j-1])
{
a[j+x-y-1]=a[j+x-y-1]-b[j-1]+58;
a[j+x-y-2]--;
continue;
}
if(a[j+x-y-1]==b[j-1])
{
a[j+x-y-1]=48;
}
}
if(a[0]>48)
printf("%s\n",a);
else
{
for(i=1;i<x;i++)
{
printf("%c",a[i]);
}
printf("\n");
}
}
return 0;
}
|
32
|
15603
|
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
|
15604
|
int max(int x,int y)
{
if(x>=y)
return x;
else
return y;
}
int main()
{
int times;
scanf("%d",×);
int flow;
for(flow=0;flow<times;flow++)
{
char a[260];
char b[260];
scanf("%s",a);
scanf("%s",b);
char num[10]={'0','1','2','3','4','5','6','7','8','9'};
int numa[260]={0};
int numb[260]={0};
int c[260]={0};
int i,j,lena,lenb;
lena=strlen(a);
lenb=strlen(b);
int k=0;
for(i=lena-1;i>=0;i--)
{
for(j=0;j<10;j++)
{
if(a[i]==num[j])
{
numa[k]=j; //???a(1234567)?????(7654321)
}
}
k++;
}
k=0; //???!!
for(i=lenb-1;i>=0;i--)
{
for(j=0;j<10;j++)
{
if(b[i]==num[j])
{
numb[k]=j; //???b(12345)?????(54321)
}
}
k++;
}
for(i=0;i<max(lena,lenb);i++)
{
if(numa[i]-numb[i]>=0)
c[i]=numa[i]-numb[i]; //??????,??c
else
{
c[i]=numa[i]-numb[i]+10;
if(numa[i+1]>0)
numa[i+1]=numa[i+1]-1;
else
{
numa[i+1]=9;
numa[i+2]=numa[i+2]-1;
}
}
}
int M;
for(i=max(lena,lenb);i>=0;i--)
{
if(c[i]!=0)
{
M=i;
break;
}
}
for(i=M;i>=0;i--)
{
printf("%d",c[i]);
}
printf("\n");
}
return 0;
}
|
32
|
15605
|
int main()
{
int n;
scanf("%d",&n);
char a[100][100],b[100][100];
int i;
for(i=0;i<n;i++)
scanf("%s%s",&a[i],&b[i]);
int p,q;
for(i=0;i<n;i++)
{
for(p=0;a[i][p]!='\0';p++);
for(q=0;b[i][q]!='\0';q++);
int j,x=0;
for(j=1;j<=q;j++)
{
if((a[i][p-j]+x)<b[i][q-j])
{
a[i][p-j]=a[i][p-j]+10-(b[i][q-j]-'0')+x;
x=-1;
}
else
{
a[i][p-j]=a[i][p-j]-(b[i][q-j]-'0')+x;
x=0;
}
}
a[i][p-j]+=x;
printf("\n%s",a[i]);
}
return 0;
}
|
32
|
15606
|
int main()
{
char seline1[100][100],seline2[100][100];
int n;
cin>>n;
cin.get();
for(int k=0;k<n-1;k++)
{
cin.getline(seline1[k],100);
cin.getline(seline2[k],100);
cin.get();
}
cin.getline(seline1[n-1],100);
cin.getline(seline2[n-1],100);
for(int k=0;k<n;k++)
{
int l1=strlen(seline1[k]),an1[100],an2[100];
int l2=strlen(seline2[k]);
memset(an1, 0, sizeof(an1));
memset(an2, 0,sizeof(an2));
for(int i=0;i<l1;i++)
an1[i]=seline1[k][l1-i-1]-'0';//???????????????
for(int i=0;i<l2;i++)
an2[i]=seline2[k][l2-i-1]-'0';
for(int j=0;j<l1;j++)
{
if(an1[j]>=an2[j])
an1[j]-=an2[j];
else
{
an1[j+1]--;
an1[j]=an1[j]+10-an2[j];
}
}
int t=99;
while(an1[t]==0) t--;
for(;t>=0;t--)
cout<<an1[t];
cout<<endl;
}
return 0;
}
|
32
|
15607
|
void main()
{
char a[20][101],b[20][101],c[20][101];
int w,x,i,m,carry,lena[20],lenb[20],jump;
scanf("%d",&w);
for(x=0;x<w;x++)
{
scanf("%s",a[x]);
lena[x]=strlen(a[x]);
scanf("%s",b[x]);
lenb[x]=strlen(b[x]);
}
for(x=0;x<w;x++)
{
a[x][100]='\0';jump=99-lena[x];
for(m=lena[x];m>0;m--)
a[x][m+jump]=a[x][m-1];
b[x][100]='\0';jump=99-lenb[x];
for(m=lenb[x];m>0;m--)
b[x][m+jump]=b[x][m-1];
carry=0;
for(m=99;m>99-lenb[x];m--)
if(a[x][m]-carry<b[x][m])
{
c[x][m]=a[x][m]-b[x][m]+10-carry+'0';
carry=1;
}
else
{
c[x][m]=a[x][m]-b[x][m]-carry+'0';
carry=0;
}
c[x][99-lenb[x]]=a[x][99-lenb[x]]-carry;
for(m=98-lenb[x];m>99-lena[x];m--)
c[x][m]=a[x][m];
for(m=99-lena[x]+1;m<100;m++)
printf("%c",c[x][m]);
printf("\n");
}
}
|
32
|
15608
|
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
|
15609
|
/********************************************
*@file 4.cpp *
*@author ?? *
*@date 2013-11-19 *
*@description *
*??????8?????? *
********************************************
*/
int main()
{
int n, i, p, q, nlen1, nlen2;
int num1[101], num2[100];
char str1[101], str2[101];
cin >> n;
for (i = 0; i < n; i++) // ????
{
cin.get();
cin.getline(str1, 101);
cin.getline(str2, 101);
//?????
nlen1 = strlen(str1);
nlen2 = strlen(str2);
memset(num1, 0, sizeof(num1)); // ????
memset(num2, 0, sizeof(num2)); // ????
q = 0;
//????
for (p = nlen1 - 1; p >= 0; p--)
num1[q++] = str1[p] - '0';
q = 0;
for (p = nlen2 - 1; p >= 0; p--)
num2[q++] = str2[p] - '0';
//???
for (p = 0; p < 100; p++)
{
num1[p] -= num2[p];
if (num1[p] < 0)
{
num1[p] += 10;
num1[p+1]--;
}
}
p = 100;
//??0?
while (num1[p] == 0)
p--;
//????
for ( ; p >= 0; p--)
cout << num1[p];
if (i != n - 1 )
cout << endl;
}
return 0;
}
|
32
|
15610
|
int main()
{
char a[150],b[150];
int c[150],d[150],result[150];
int n,la,lb,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
la=strlen(a);
lb=strlen(b);
for(j=0;j<la;j++)
c[j]=a[j]-'0';
for(j=0;j<la-lb;j++)
d[j]=0;
for(j=la-lb;j<la;j++)
d[j]=b[j-la+lb]-'0';
int carry = 0;
for(j=la-1;j>=0;j--)
{
if(c[j]>=d[j]+carry)
{
result[j]=c[j]-d[j]-carry;
carry = 0;
}
else
{
//c[j-1]=c[j-1]-1;
result[j]=c[j]+10-d[j]-carry;
carry = 1;
}
}
for(j=0;j<la;j++)
{
if(result[j]!=0) break;
}
for(k=j;k<la-1;k++)
printf("%d",result[k]);
printf("%d\n",result[la-1]);
}
return 0;
}
|
32
|
15611
|
void main()
{
int n;char a[102],b[102],c[10][102];int i,j,k,m,v,x;
scanf("%d",&n);
for(x=0;x<n;x++)
{
getchar();
for(m=0;m<102;m++)
c[x][m]='0';
for(i=0;i<102;i++)
{
a[i]=getchar();
if(a[i]=='\n') break;
}
for(j=0;j<102;j++)
{
b[j]=getchar();
if(b[j]=='\n') break;
}
for(k=101;k+i-101>=0;k--)
a[k]=a[k+i-101];
for(k=0;k<101-i;k++)
a[k]='0';
for(k=101;k+j-101>=0;k--)
b[k]=b[k+j-101];
for(k=0;k<101-j;k++)
b[k]='0';//?a?b?????
for(k=0;k<=101;k++)
{
if (a[k]!=b[k]) break;//?a,b?????????,????
}
for(m=100;m>=0;m--)
{
if(a[m]<b[m])
{
c[x][m]=a[m]+58-b[m];
a[m-1]=a[m-1]-1;//??
}
else c[x][m]=a[m]+48-b[m];
}
for(i=0;i<102;i++)
a[i]='0';
for(j=0;j<102;j++)
b[i]='0';//??????a?b?0
}
for(x=0;x<n;x++)
{
for(k=0;k<=101;k++)
{
if(c[x][k]!='0') break;
}
for(m=k;m<=100;m++)
printf("%c",c[x][m]);//??
for(k=0;k<=100;k++)
v=v+c[x][k];
if (v==48) printf("0");
printf("\n");
}
}
|
32
|
15612
|
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
|
15613
|
// ??
// ????wayne
// ?????12.30
int main()
{
char a[250],b[250];
int a1[250],b1[250],c[250],i,j,n,k;
cin>>n;
for(k=0;k<n;k++)
{
for(i=0;i<250;i++)
{
a1[i]=0;
b1[i]=0;
c[i]=0;
}
cin.get();
cin.getline(a,250);
cin.getline(b,250);
for(i=strlen(a)-1,j=0;i>=0;i--,j++)
a1[j]=a[i]-'0';
for(i=strlen(b)-1,j=0;i>=0;i--,j++)
b1[j]=b[i]-'0';
if(strlen(a)>strlen(b))
{
for(i=0;i<strlen(a);i++)
{
c[i]+=a1[i]-b1[i];
if(c[i]<0)
{
c[i]=10+c[i];
c[i+1]--;
}
}
while(c[i]==0&&i>0)
i--;
for(;i>=0;i--)
cout<<c[i];
cout<<endl;
}
else if(strlen(a)<strlen(b))
{
for(i=0;i<strlen(b);i++)
{
c[i]+=b1[i]-a1[i];
if(c[i]<0)
{
c[i]=10+c[i];
c[i+1]--;
}
}
while(c[i]==0&&i>0)
i--;
for(;i>=0;i--)
cout<<c[i];
cout<<endl;
}
else
{
for(i=strlen(a)-1;i>=0;i--)
{
if(a1[i]==b1[i])
continue;
else if(a1[i]>b1[i])
{
for(i=0;i<strlen(a);i++)
{
c[i]+=a1[i]-b1[i];
if(c[i]<0)
{
c[i]=10+c[i];
c[i+1]--;
}
}
while(c[i]==0&&i>0)
i--;
for(;i>=0;i--)
cout<<c[i];
cout<<endl;
break;
}
else
{
for(i=0;i<strlen(b);i++)
{
c[i]+=b1[i]-a1[i];
if(c[i]<0)
{
c[i]=10+c[i];
c[i+1]--;
}
}
while(c[i]==0&&i>0)
i--;
for(;i>=0;i--)
cout<<c[i];
cout<<endl;
break;
}
if(i==0)
cout<<"0"<<endl;
}
}
}
return 0;
}
|
32
|
15614
|
int main()
{
int n , i , k , t , z , b , a , len1 , len2 ;
char num1[1000][100] , num2[1000][100] ;
cin >> n ;
cin.get() ;
for ( i = 0 ; i < n ; i++ )
{
cin >> num1[i] >> num2[i] ;
}
for ( i = 0 ; i < n ; i++ )
{
len1 = strlen(num1[i]) ;
len2 = strlen(num2[i]) ;
for ( k = 0 ; k < len2 ; k++ )
{
a = len1-k-1 ;
b = len2-k-1 ;
if ( num1[i][a] >= num2[i][b] )
{
num1[i][a] = num1[i][a] - num2[i][b] + '0';
}
else
{
for ( t = a - 1 ; t >= 0 ; t-- )
if ( num1[i][t] > '0' )
break ;
for ( z = t + 1 ; z <= a - 1 ; z++ )
if ( num1[i][z] == '0' )
num1[i][z] = '9' ;
num1[i][t] = num1[i][t] - '1' + '0' ;
num1[i][a] = num1[i][a] + '1' - '0' + '9' - '0' - num2[i][b] + '0' ;
}
}
while ( 1 )
{
if ( num1[i][0] != '0' )
break ;
else
{
for ( z = 0 ; z < len1 ; z++ )
{
num1[i][z] = num1[i][z+1] ;
}
len1-- ;
}
}
for ( k = 0 ; k < len1 ; k++ )
cout << num1[i][k] ;
cout << endl ;
}
cin.get() ;
cin.get() ;
return 0 ;
}
|
32
|
15615
|
int main()
{
int n,i,leng_a,leng_b,tag=0,a[128],b[128];
char s1[128],s2[128];
scanf("%d",&n);
while(n--)
{
for(i=0;i<128;i++)
{
a[i]=0;
b[i]=0;
}
scanf("%s%s",s1,s2);
leng_a=strlen(s1);
leng_b=strlen(s2);
for(i=0;i<leng_a;i++)
a[i]=s1[leng_a-i-1]-'0';
for(i=0;i<leng_b;i++)
b[i]=s2[leng_b-i-1]-'0';
for(i=0;i<leng_a;i++)
{
if(a[i]>=b[i])
a[i]-=b[i];
else
{
a[i]=a[i]-b[i]+10;
a[i+1]--;
}
}
tag=0;
for ( i =leng_a-1; i >= 0; i--)
{
if (a[i] != 0)
tag = 1;
if (tag == 1)
{
printf("%d",a[i]);
}
if (tag == 0 && i == 0)
printf("0");
}
printf("\n");
}
return 0;
}
|
32
|
15616
|
char *jian(char *x, char *y, int m, int n)
{
char *p1;
char *p2;
char *p3;
p1 = (char *)malloc((m)*sizeof(char));
p2 = (char *)malloc((m)*sizeof(char));
p3 = (char *)malloc((m)*sizeof(char));
strcpy(p1, x);
strcpy(p2, y);
p1 = p1 + m - 1;
p2 = p2 + n - 1;
int t = m - 1;
while(((*p1) >= '0' - 1) && ((*p1) <= '9'))
{
if((*p1) < (*p2))
{
p3[t] = (*p1) - (*p2) + 10 + '0';
p1 --;
*p1 = *p1 - '1' + '0';
p2 --;
}
else if(((*p1) >= (*p2)) && ((*p2) >= '0') && ((*p2) <= '9'))
{
p3[t] = (*p1) - (*p2) + '0';
p1 --;
p2 --;
}
else
{
p3[t] = (*p1);
p1 --;
//p2 --;
}
t --;
}
return(p3);
}
void main()
{
int s;
int i, j, k;
char *a[10], *b[10];
scanf("%d", &s);
for(i = 0; i < s; i ++)
{
a[i] = (char *)malloc(1000*sizeof(char));
b[i] = (char *)malloc(1000*sizeof(char));
}
for(i = 0; i < s; i ++)
{
scanf("%s", a[i]);
scanf("%s", b[i]);
}
for(i = 0; i < s; i ++)
{
for(j = 0; j < strlen(a[i]); j ++)
if(jian(a[i], b[i], strlen(a[i]), strlen(b[i]))[j] != '0')
{
k = j;
break;
}
for(j = k; j < strlen(a[i]); j ++)
printf("%c", jian(a[i], b[i], strlen(a[i]), strlen(b[i]))[j]);
printf("\n");
}
}
|
32
|
15617
|
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
|
15618
|
int main()
{
int j,n,la,lb,i;
char a[101];
char b[101];
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%s",a);
scanf("%s",b);
la=strlen(a);
lb=strlen(b);
for(i=0;i<lb;i++)
{
if(a[la-1-i]>=b[lb-1-i])
a[la-1-i]=a[la-1-i]-b[lb-1-i]+'0';
else if(a[la-1-i]<b[lb-1-i])
{
a[la-1-i]=a[la-1-i]+10-b[lb-1-i]+'0';
a[la-2-i]=a[la-2-i]-1;
}
}
printf("%s\n",a);
}
}
|
32
|
15619
|
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
|
15620
|
int main()
{
char s1[101],s2[101];
int num1[101],num2[101];
int n,i,j,k,q,h,f,len1,len2;
cin>>n;
while(cin>>s1>>s2)
{
memset(num1,0,sizeof(num1));
memset(num2,0,sizeof(num2));
i=0;
j=0;
k=0;
q=0;
len1=strlen(s1);
len2=strlen(s2);
for(i=len1-1;i>=0;i--)
num1[j++]=s1[i]-'0';//??????????
for(k=len2-1;k>=0;k--)
num2[q++]=s2[k]-'0';
for(h=0;h<len1;h++)
{
num1[h]=num1[h]-num2[h];
if(num1[h]<0)//????????=???
{
num1[h]=num1[h]+10;
num1[h+1]=num1[h+1]-1;
}
}
f=len1;
while(num1[f]==0)
f--;
for(;f>=0;f--)
cout<<num1[f];
cout<<endl;
}
return 0;
}
|
32
|
15621
|
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
|
15622
|
/**
* @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
|
15623
|
void main()
{
int i=0,j=0,n=0;
char a[100][205],b[100][205];
int sa[100][205],sb[100][205];
int len1,len2,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %s",a+i,b+i);
for(i=0;i<n;i++)
{
len1=strlen(a[i]);
for(j=0;j<len1;j++)
sa[i][j]=a[i][len1-1-j]-'0';
}
for(i=0;i<n;i++)
{
len2=strlen(b[i]);
for(j=0;j<len2;j++)
sb[i][j]=b[i][len2-1-j]-'0';
}
for(i=0;i<n;i++)
{
len2=strlen(b[i]);
for(j=0;j<len2;j++)
{
sa[i][j]-=sb[i][j];
if(sa[i][j]<0)
{
sa[i][j]+=10;
sa[i][j+1]-=1;
}
}
}
for(i=0;i<n;i++)
{
len1=strlen(a[i]);
for(j=len1-1;j>=0;j--)
{
if(flag==0)
{
if(sa[i][j]!=0)
{
flag=1;
printf("%d",sa[i][j]);
}
}
else printf("%d",sa[i][j]);
}
printf("\n");flag=0;
}
}
|
32
|
15624
|
void main()
{
int n,i,j,len1,len2,t;
char c[100],d[100];
int a[100],b[100];
scanf("%d",&n);
for(j=1;j<=n;j++)
{
for(i=0;i<100;i++)
{
a[i]=b[i]=0;
c[i]=d[i]='\0';
}
scanf("%s %s",c,d);
len1=strlen(c);
len2=strlen(d);
for(i=99;i>99-len1;i--)
{
switch(c[i+len1-100])
{
case'0':a[i]=0;break;
case'1':a[i]=1;break;
case'2':a[i]=2;break;
case'3':a[i]=3;break;
case'4':a[i]=4;break;
case'5':a[i]=5;break;
case'6':a[i]=6;break;
case'7':a[i]=7;break;
case'8':a[i]=8;break;
case'9':a[i]=9;
}
}
for(i=99;i>99-len2;i--)
{
switch(d[i+len2-100])
{
case'0':b[i]=0;break;
case'1':b[i]=1;break;
case'2':b[i]=2;break;
case'3':b[i]=3;break;
case'4':b[i]=4;break;
case'5':b[i]=5;break;
case'6':b[i]=6;break;
case'7':b[i]=7;break;
case'8':b[i]=8;break;
case'9':b[i]=9;
}
}
for(i=0;i<100;i++)
{
a[i]=a[i]-b[i];
}
for(i=99;i>0;i--)
{
if(a[i]<0)
{
a[i]=10+a[i];
a[i-1]--;
}
}
for(i=0;;i++)
if(a[i]!=0)break;
for(t=i;t<100;t++)
printf("%d",a[t]);
printf("\n");
}
}
|
32
|
15625
|
int main()
{
int n,i,j,len1,len2;
char str1[101],str2[101];
int a[100],b[100];
cin>>n;
while(n--)
{
cin.get();
len1=0;
len2=0;
cin.getline(str1,100);
cin.getline(str2,100);
while(str1[len1]!=0)
len1++;
while(str2[len2]!=0)
len2++;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(i=len1-1;i>=0;i--)
a[len1-1-i]=str1[i]-'0';
for(i=len2-1;i>=0;i--)
b[len2-1-i]=str2[i]-'0';
for(i=0;i<len1||i<len2;i++)
{
if(a[i]>=b[i]) a[i]-=b[i];
else
{
a[i]=a[i]+10-b[i];
a[i+1]--;
}
}
int count=99;
while(a[count]==0)
count--;
for(i=count;i>=0;i--)
cout<<a[i];
cout<<endl;
}
return 0;
}
|
32
|
15626
|
void main ()
{
int n,i,j,len1,len2,p,q, a[100],b[100],c[100];
char s1[100],s2[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
for(j=0;j<100;j++)
{
a[j]=0;
b[j]=0;
c[j]=0;
}
scanf("%s %s",s1,s2);
len1=strlen(s1);
len2=strlen(s2);
for (p=0;p<len1;p++)
a[len1-p-1]=s1[p]-'0';
for (p=0;p<len2;p++)
b[len2-p-1]=s2[p]-'0';
for (p=0;p<len1;p++)
{
c[p]=a[p]-b[p];
if (c[p]<0)
{
a[p+1]=a[p+1]-1;
c[p]=c[p]+10;
}
}
while (c[len1]==0&&len1>1)
len1=len1-1;
for (q=len1;q>=0;q--)
printf("%d",c[q]);
printf("\n");
}
}
|
32
|
15627
|
int main()
{
char c[100][4][100]={'\0'};
int i,j,k,n;
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
gets(c[i][0]);
gets(c[i][1]);
gets(c[i][2]);
}
gets(c[n-1][0]);
gets(c[n-1][1]);
for(i=0;i<n;i++)
{
for(j=0;j<strlen(c[i][1]);j++)
{
c[i][3][j+strlen(c[i][0])-strlen(c[i][1])]=c[i][1][j];
}
for(j=0;j<(strlen(c[i][0])-strlen(c[i][1]));j++)
{
c[i][3][j]='0';
}
for(j=(strlen(c[i][0])-1);j>=0;j--)
{
if(c[i][0][j]>=c[i][3][j])
{
c[i][0][j]=c[i][0][j]-c[i][3][j]+48;
}
else
{
c[i][0][j]=58-(c[i][3][j]-c[i][0][j]);
for (k=j-1;k>=0;k--)
{
if (c[i][0][k]!='0')
{
c[i][0][k]=c[i][0][k]-1;
break;
}
else
{
c[i][0][k]='9';
}
}
}
}
printf("%s\n",c[i][0]);
}
return 0;
}
|
32
|
15628
|
char a[100],b[100];
void reverse(char a[])
{int i,m;
char t;
m=strlen(a);
for(i=0;i<m/2;i++)
{t=a[i];
a[i]=a[m-i-1];
a[m-1-i]=t;
}
}
void minus(char a[],char b[])
{int i;
for(i=0;i<strlen(b);i++)
{a[i]=a[i]-b[i];
if(a[i]<0)
{a[i]=a[i]+10;
a[i+1]=a[i+1]-1;
}
a[i]=a[i]+48;
}
}
void main()
{int i,n;char c[2];
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
gets(a); gets(b);
gets(c);
reverse(a); reverse(b);
minus(a,b);
reverse(a);
puts(a);
}
gets(a); gets(b);
reverse(a); reverse(b);
minus(a,b);
reverse(a);
puts(a);
}
|
32
|
15629
|
int main()
{
char a[105],b[105];
int n,i,j,k,chang1,chang2;
cin>>n;
while(n--)
{
cin>>a;
cin>>b;
chang1=strlen(a);
chang2=strlen(b);
i=chang1-1;
j=chang2-1;
while(j>=0)
{
if(a[i]<b[j])
{
if(a[i-1]==0)
{
a[i-2]--;
a[i-1]='9';
a[i]=a[i]+10;
}
else
{
a[i-1]--;
a[i]=a[i]+10;
}
}
a[i]=a[i]-b[j]+'0';
i--;
j--;
}
k=0;
if(a[0]=='0')
{
for(k=0;k<chang1;k++)
{
if(a[k]!='0')
break;
}
}
if(k==chang1-1)
cout<<a[k];
else
for(i=k;i<chang1;i++)
cout<<a[i];
cout<<endl;
}
return 0;
}
|
32
|
15630
|
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
|
15631
|
/*
2736:??????? ?? ?? ?? ????: 1000ms ????: 65536kB
??
?2??????????
??
?1?????????n????????2???1?????a??2????b(a > b)????????????
??????????100???
??
n????????????????????
????
2
9999999999999999999999999999999999999
9999999999999
5409656775097850895687056798068970934546546575676768678435435345
1
????
9999999999999999999999990000000000000
5409656775097850895687056798068970934546546575676768678435435344
*/
void reverse(char temp[101])
{
int i = 0;
for(i = 0; i < strlen(temp) / 2; i ++)
{
char t = '\0';
t = temp[i];
temp[i] = temp[strlen(temp) - i - 1];
temp[strlen(temp) - i - 1] = t;
}
}
int main ()
{
int n = 0;
cin >> n;
while (n --)
{
cin.get();
char a[101] = {'\0'}, b[101] = {'\0'}, temp[101] = {'\0'}, mark = '+';
cin.getline(a, 101, '\n');
cin.getline(b, 101, '\n');
if((strlen(a) == strlen(b) && strcmp(a, b) < 0) || (strlen(a) < strlen(b)))
{
strcpy(temp, a);
strcpy(a, b);
strcpy(b, temp);
mark = '-';
}
reverse(a);
reverse(b);
int i = 0;
for(i = 0; i < strlen(b); i ++)
if(a[i] < b[i])
{
a[i] = a[i] + 10 - b[i] + '0';
a[i + 1] --;
}
else if(a[i] >= b[i])
a[i] = a[i] - b[i] + '0';
reverse(a);
cout << a << endl;
}
return 0;
}
|
32
|
15632
|
void main()
{
int i,n,l,m;
char a[100],b[100];
scanf("%d",&n);
for(;n>0;n--)
{
i=1;
scanf("%s %s",a,b);
l=strlen(b);
m=strlen(a);
while(i<=l)
{
if(a[m-i]>=b[l-i])
a[m-i]=a[m-i]-b[l-i]+48;
else
{
a[m-i]=a[m-i]+58-b[l-i];
a[m-i-1]=a[m-i-1]-1;
}
i++;
}
for(i=m-l-1;m>=0;m--)
{
if(a[i]<'0')
{
a[i]+=10;
a[i-1]=a[i-1]-1;
}
else break;
}
printf("%s\n",a);
}
}
|
32
|
15633
|
//******************************************************
//* ? ? ? ?? ? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 11 ? 17 ? *
//* ? ? ?1000010185 *
//******************************************************
int main()
{
char aa[100], bb[100]; //?????????
int a[100], b[100], c[100];
int n, la, lb;
cin >> n;
for (int i = 0; i < n; i ++)
{
cin >> aa >> bb;
la = strlen(aa);
lb = strlen(bb);
for (int j = 0; j < la; j ++) //???????????
{
a[j] = aa[j] - 48;
b[j] = bb[j] - 48;
}
for (int j = 1; j <= lb; j ++) //????????????
c[la - j] = a[la - j] - b[lb - j];
for (int j = 0; j < la - lb; j ++) //b?????????0??????
c[j] = a[j];
for (int j = la - 1; j > 0; j --) //??????0??????10??????1(????
if (c[j] < 0)
{
c[j] += 10;
c[j - 1] -= 1;
}
int k;
for (int j = 0; j < la; j ++) //???????0??
if (c[j] != 0)
{
k = j;
break;
}
for (int j = k; j < la; j ++) //????
cout << c[j];
cout << endl;
}
return 0;
}
|
32
|
15634
|
int main()
{
int n, i, j, cnt = 0;
cin >> n;
int a[100], b[100], c[100];
char num1[101], num2[101];
while(cnt < n)
{
cin >> num1;
cin >> num2;
int len1 = strlen(num1);
int len2 = strlen(num2);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
j = 0;
for(i = len1 - 1; i >= 0; i--)
a[j++] = num1[i] - '0';
j = 0;
for(i = len2 - 1; i >= 0; i--)
b[j++] = num2[i] - '0';
for(i = 0; i < len2; i++)
{
if(a[i] < b[i])
{
if(a[i] == -1)
a[i] = 9;
else
a[i] += 10;
a[i + 1]--;
}
c[i] = a[i] - b[i];
}
if(len1 > len2)
{
for(i = len2; i < len1; i++)
c[i] = a[i];
}
for(i = len1 - 1; i >= 0; i--)
{
if(c[i] != 0)
break;
}
for( ; i >= 0; i--)
cout << c[i];
cout << endl;
cnt++;
}
return 0;
}
|
32
|
15635
|
int lena,lenb,lenc;
void minus(char a[],char b[],char c[])
{ int carry=0,i;
for(i=lena-1;i>=0;i--)
{if(a[i]-b[i]-carry<0)
{c[i]=a[i]+10-b[i]+'0'-carry;
carry=1;
}
else if(a[i]-b[i]-carry>=0)
{c[i]=a[i]-b[i]+'0'-carry;
carry=0;
}
}
c[lena]='\0';
}
void operate(char b[])
{ int jump=lena-lenb;
int i;
b[lena]='\0';
for(i=lenb;i>=0;--i)
b[i+jump]=b[i];
for(i=0;i<jump;i++)
b[i]='0';
}
void main()
{ char a[ARRAY][N],b[ARRAY][N],c[N];
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s",a[i]);
scanf("%s",b[i]);
printf("\n");
}
for(i=0;i<n;i++)
{lena=strlen(a[i]);lenb=strlen(b[i]);
operate(b[i]);
minus(a[i],b[i],c);
for(j=0;j<lena;j++)
if(c[j]!='0') break;
for(;j<lena;j++)
printf("%c",c[j]);
printf("\n");
}
}
|
32
|
15636
|
void main()
{
int i,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
char a[101],b[101];
scanf("%s",a);
scanf("%s",b);
int ita,itb;
for(ita=0;a[ita]!='\0';ita++)
;
for(itb=0;b[itb]!='\0';itb++)
;
ita--;
itb--;
int temp=0;
for(;itb>=0;itb--)
{
a[ita]=a[ita]-b[itb]-temp;
if(a[ita]<0)
{
temp=1;
a[ita]+=10;
}
else
temp=0;
a[ita]+='0';
ita--;
}
for(;ita>=0;ita--)
{
a[ita]=a[ita]-temp;
if(a[ita]<'0')
{
temp=1;
a[ita]+=10;
}
else
break;
}
printf("%s\n",a);
}
}
|
32
|
15637
|
void main()
{
int n,i,j;
char a[100],b[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",a,b);
for(j=strlen(a)-1;j>=strlen(a)-strlen(b);j--)
if(a[j]>=b[j-strlen(a)+strlen(b)])
a[j]=a[j]-b[j-strlen(a)+strlen(b)]+48;
else
{
a[j]=a[j]-b[j-strlen(a)+strlen(b)]+58;
a[j-1]--;
}
j=0;
while(a[j]=='0')
j++;
for(;j<=strlen(a)-1;j++)
printf("%c",a[j]);
printf("\n");
}
}
|
32
|
15638
|
int n,len1=0,len2=0;
char a1[101];
char b1[101];
int a[101],b[101];
int main()
{
int i,j,k,m,t=0;
cin>>n;
for(i=0;i<n;++i)
{
cin>>a1>>b1;
len1=0;
len2=0;
m=0;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
while(a1[len1]) len1++;
while(b1[len2]) len2++;
for(j=len1-1;j>=0;--j) a[j]=(int)a1[len1-j-1]-48;
for(j=len2-1;j>=0;--j) b[j]=(int)b1[len2-j-1]-48;
if(len1<len2)
{
t=len1;
len1=len2;
len2=t;
for(j=0;j<101;++j)
{
t=a[j];
a[j]=b[j];
b[j]=t;
}
cout<<"-";
}
for(j=0;j<len1;++j)
{
a[j]-=b[j];
}
for(j=0;j<len1;++j)
{
while(a[j]<0)
{
a[j]+=10;
a[j+1]-=1;
}
}
for(j=len1-1;j>=0;--j)
{
if(a[j]) m=1;
if(m) cout<<a[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15639
|
void main()
{
int n,i,lengtha,lengthb,j;
char a[100],b[100],c;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
c=getchar();
lengtha=strlen(a);
lengthb=strlen(b);
for(j=lengthb-1;j>=0;j--)
{
if(a[lengtha-lengthb+j]<b[j])
{
a[lengtha-lengthb+j]='0'+10+a[lengtha-lengthb+j]-b[j];
a[lengtha-lengthb+j-1]=a[lengtha-lengthb+j-1]-1;
}
else
a[lengtha-lengthb+j]='0'+a[lengtha-lengthb+j]-b[j];
}
puts(a);
}
}
|
32
|
15640
|
int main()
{
int i,j,n,a,b,m;
char c[100],d[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c);
scanf("%s",d);
a=strlen(c);
b=strlen(d);
m=b-1;
for(j=a;j>a-b;j--)
{
if(c[j-1]>=d[m])
{
c[j-1]=c[j-1]-d[m]+48;
m--;
}
else
{
c[j-1]=c[j-1]+10-d[m]+48;
c[j-2]--;
m--;
}
}
j=0;
while(c[j]==0)
j++;
for(;j<a;j++)
printf("%c",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15641
|
int main()
{
int n,c,d,i,j;
char a[101]={'\0'},b[101]={'\0'},e[101]={'\0'};
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%s %s",a,b);
c=strlen(a);d=strlen(b);
for(j=d-1;j>=0;j--){
if(a[c-d+j]>=b[j])
e[c-d+j]=a[c-d+j]-b[j]+48;
else {e[c-d+j]=a[c-d+j]+10-b[j]+48; a[c-d+j-1]--;}
}
for(j=c-d-1;j>=1;j--){
if(a[j]<48){
e[j]=a[j]+9;a[j-1]--;}
else e[j]=a[j];
}
e[0]=a[0];
printf("%s\n",e);
for(j=0;j<101;j++){
a[j]='\0';b[j]='\0';e[j]='\0';
}
}
return 0;
}
|
32
|
15642
|
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
|
15643
|
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
|
15644
|
void main()
{
int n,i,j,La,Lb,k=0;
char a[100],b[100],c[50][100]={'\0'};
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
gets(a);
gets(b);
La=strlen(a);
Lb=strlen(b);
for (j=Lb-1;j>=0;j--)
{
a[j+La-Lb]=a[j+La-Lb]-b[j]+48;
if (a[j+La-Lb]<48)
{
a[j+La-Lb]+=10;
a[j+La-Lb-1]-=1;
}
}
getchar();
strcpy(c[k++],a);
}
for (j=0;j<=n-1;j++) puts(c[j]);
}
|
32
|
15645
|
void gui0(char[],int n);
int main()
{
int num;
scanf("%d",&num);
char a[101],b[101];
char**pp=(char**)malloc(num*sizeof(char*));
for(int k=0;k<num;k++)
{
gui0(a,101);
gui0(b,101);
scanf("%s",a);
scanf("%s",b);
int m=strlen(a);
int n=strlen(b);
int j=n-1;
for(int i=m-1;i>=m-n;i--)
{
if(b[j]<=a[i])
a[i]=a[i]-b[j]+'0';
else
{
a[i-1]--;
int t=a[i]-b[j]+10;
a[i]='0'+t;
}
j--;
if(j<0)
break;
}
pp[k]=(char*)malloc(101*sizeof(char));
strcpy(pp[k],a);
}
for(int r=0;r<num;r++)
{
int i;
for(i=0;i<strlen(pp[r]);i++)
if(pp[r][i]=='0')
continue;
else
break;
for(;i<strlen(pp[r]);i++)
printf("%c",pp[r][i]);
printf("\n");
}
return 0;
}
void gui0(char a[],int n)
{
for(int i=0;i<n;i++)
a[i]='\0';
}
|
32
|
15646
|
void main()
{
int n,i,j,*p1,*p2,*p3,x[100],y[100],z[100];
char str1[100][100],str2[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("\n");
gets(str1[i]);
gets(str2[i]);
}
for(i=0;i<n;i++)
{
p1=x;p2=y;
for(j=0;j<strlen(str1[i]);j++,p1++)
*p1=str1[i][j]-'0';
for(j=0;j<strlen(str2[i]);j++,p2++)
*p2=str2[i][j]-'0';
for(p1=p1-1,p2=p2-1,p3=z;p2>=y;p1--,p2--,p3++)
{
if(*p1>=*p2)
*p3=*p1-*p2;
else
{
*p3=(*p1+10)-*p2;
for(j=1;;j++)
if(*(p1-j)>0)break;
*(p1-j)=*(p1-j)-1;
if(j>1)
{
for(j=j-1;j>0;j--)
*(p1-j)=9;
}
}
}
for(;p1>=x;p1--,p3++)
*p3=*p1;
for(p3=p3-1;p3>=z;p3--)
printf("%d",*p3);
printf("\n");
}
}
|
32
|
15647
|
void main()
{
int n,i,j,xa,xb;
char sa[100],sb[100],str[20][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",sa);scanf("%s",sb);
xa=strlen(sa);xb=strlen(sb);
xb=xa-xb;
for(j=xa-1;j>=xb;j--)
{
if (sa[j]>=sb[j-xb] )
sa[j]=sa[j]-sb[j-xb]+48;
else if (sa[j]<sb[j-xb] )
{
sa[j]=sa[j]-sb[j-xb]+48+10;
sa[j-1]=sa[j-1]-1;
}
}
for(j=0;j<xa;j++)
str[i][j]=sa[j];
str[i][xa]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",str[i]);
}
|
32
|
15648
|
/*
* 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
|
15649
|
int main()
{
int n;
cin>>n;
for(int k=1;k<=n;k++)
{
char a[101],b[101],c[101];
//cin.getline(a,101);
//cin.getline(b,101);
cin>>a>>b;
int lena,lenb;
lena=strlen(a);
lenb=strlen(b);
for(int i=1;i<=lenb;i++)
{
if(a[lena-i]>=b[lenb-i])
{
c[lena-i]=a[lena-i]-b[lenb-i]+'0';
}
else
{
c[lena-i]=a[lena-i]+10-b[lenb-i]+'0';
int t;
t=lena-i;
while(a[t-1]=='0')
{
a[t-1]='9';
t--;
}
a[t-1]-=1;
}
}
for(int i=0;i<lena-lenb;i++)
{
c[i]=a[i];
}
for(int i=0;i<lena;i++)
{
cout<<c[i];
}
cout<<endl;
}
return 0;
}
|
32
|
15650
|
void subtract();
const int maxlen=100;
int main()
{
int n,i;
cin>>n;
cin.get();
for(i=1;i<=n;i++)
{
subtract();
cin.get();
}
return 0;
}
void subtract()
{
char str1[maxlen+1],str2[maxlen+1];
int a1[maxlen],a2[maxlen];
int len1,len2;
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
cin.getline(str1,maxlen+1);//???????
cin.getline(str2,maxlen+1);
len1=strlen(str1);
len2=strlen(str2);
int i,j;
for(i=0,j=len1-1;j>=0;j--)//????????????,??????,??????????
a1[i++]=str1[j]-'0';
for(i=0,j=len2-1;j>=0;j--)
a2[i++]=str2[j]-'0';
for(i=0;i<maxlen;i++)
{
if(a1[i]>=a2[i])
a1[i]=a1[i]-a2[i];
else
{
a1[i+1]=a1[i+1]-1;
a1[i]=a1[i]+10-a2[i];
}
}
i=maxlen-1;//?????????????0??,?????
while(a1[i]==0)
i--;
for(j=i;j>=0;j--)
cout<<a1[j];
cout<<endl;
}
|
32
|
15651
|
int main()
{
int n,i,j,q,k,len1[100],len2[100];
int a[100][26]={0},b[100][26]={0};
char s[100][101],d[100][101];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%s",s[i],d[i]);
for(i=0;i<n;i++)
{
len1[i]=strlen(s[i]);
len2[i]=strlen(d[i]);
for(j=0;j<25;j++)
{
if(len1[i]<4) break;
len1[i]-=4;
for(q=0;q<4;q++)
a[i][j]=a[i][j]*10+(s[i]+len1[i])[q]-'0';
}
for(q=0;q<len1[i];q++)
a[i][j]=a[i][j]*10+s[i][q]-'0';
for(j=0;j<25;j++)
{
if(len2[i]<4) break;
len2[i]-=4;
for(q=0;q<4;q++)
b[i][j]=b[i][j]*10+(d[i]+len2[i])[q]-'0';
}
for(q=0;q<len2[i];q++)
b[i][j]=b[i][j]*10+d[i][q]-'0';
}
for(i=0;i<n;i++)
for(j=0;j<25;j++)
{
if(a[i][j]>=b[i][j])
b[i][j]=a[i][j]-b[i][j];
else
{
b[i][j]=a[i][j]+10000-b[i][j];
a[i][j+1]-=1;
}
}
for(i=0;i<n;i++)
{
for(j=25;j>=0;j--)
if(b[i][j]!=0) {k=j;break;}
printf("%d",b[i][k]);
for(j=k-1;j>=0;j--)
printf("%04d",b[i][j]);
printf("\n");
}
return 0;
}
|
32
|
15652
|
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
|
15653
|
void main()
{
char a[100][100],b[100][100];
int n,l1,l2,j=48,i;
scanf("%d",&n);
for(i=1;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s\n",b[i]);
}
scanf("%s",a[i]);
scanf("%s",b[i]);
for(i=1;i<=n;i++)
{
l1=strlen(a[i]);
l2=strlen(b[i]);
for(j=0;j<l2;j++)
{
a[i][l1-j-1]='0'+a[i][l1-j-1]-b[i][l2-j-1];
if((a[i][l1-j-1])<'0')
{
a[i][l1-j-2]=a[i][l1-j-2]-1;
a[i][l1-j-1]=a[i][l1-j-1]+10;
}
}
printf("%s\n",a[i]);
}
}
|
32
|
15654
|
void main()
{
int a,b,c,d,e,f,g;
char num1[101],num2[101],r[101];
scanf("%d",&a);
g=1;
while(g<=a)
{
scanf("%s",&num1);scanf("%s",&num2);
printf("\n");
b=strlen(num1)-1;c=strlen(num2)-1;e=b;
while(c>=0){
if(num1[b]>=num2[c])
r[b]=num1[b]-num2[c]+'0';
else {num1[b]+=10;d=b-1;
while(num1[d]=='0')
{ num1[d]='9';d--;
}
num1[d]-=1;
r[b]=num1[b]-num2[c]+'0';
}b--;c--;
}
while(b>=0)
{r[b]=num1[b];
b--;
}
for(f=e;f>=0;f--)
printf("%c",r[e-f]);
printf("\n");
g++;
}
}
|
32
|
15655
|
void main()
{
int n;
char cint1[101],cint2[101],result[101];
int length1,length2;
scanf("%d",&n);
while(n-->0){
getchar();
scanf("%s",cint1);
scanf("%s",cint2);
length1=strlen(cint1);
length2=strlen(cint2);
int k0=length1-1,i=length1-1,k=k0,j;
for(j=length2-1;j>=0;j--)
result[k--]=cint1[i--]-cint2[j]+'0';
while(i>=0)
result[k--]=cint1[i--];
for(k=k0;k>0;k--)
if(result[k]<'0'){
result[k]+=10;
result[k-1]--;
}
for (k=0;k<k0;k++)
if(result[k]!='0')
break;
while(k<=k0)
printf("%c",result[k++]);
printf("\n");
}
}
|
32
|
15656
|
int main()
{
int n;
char a[120],b[120];
cin>>n;
for(int q=1;q<=n;q++)
{getchar();
cin.getline(a,120);
cin.getline(b,120);
for(int i=0;i<strlen(b);i++)
b[i]=96-b[i];
for(int i=1;i<=strlen(b);i++)
{
a[strlen(a)-i]+=(b[strlen(b)-i]-48);
}
for(int i=strlen(a)-1;i>=0;i--)
{
if(a[i]<48)
{
a[i]+=10;
a[i-1]--;
}
}
for(int i=0;i<strlen(a);i++)
cout<<(int)(a[i]-48);
cout<<endl;
}
return 0;
}
|
32
|
15657
|
void main()
{
int n,i,j,t,len1,len2;
char s1[100],s2[100],answer[100],out[100]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",s1);
scanf("%s",s2);
len1=strlen(s1);
t=99;
for(j=len1-1;j>=0;j--)
{
s1[t]=s1[j];
s1[j]=0;
t--;
}
len2=strlen(s2);
t=99;
for(j=len2-1;j>=0;j--)
{
s2[t]=s2[j];
s2[j]=0;
t--;
}
for(j=len2;j<len1;j++) s2[99-j]='0';
for(j=99;j>=0;j--)
{
if(s1[j]>=s2[j]) answer[j]=s1[j]-s2[j]+48;
else
{
answer[j]=58+s1[j]-s2[j];
s1[j-1]=s1[j-1]-1;
}
}
t=0;
for(j=0;j<=99;j++) out[j]=0;
for(j=99-len1+1;j<=99;j++)
{
out[t]=answer[j];
t++;
}
printf("%s\n",out);
}
}
|
32
|
15658
|
void main()
{
char str1[101],str2[101];
int k,i,n,j,a=102,b=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",str1);
scanf("%s",str2);
k=strlen(str1)-strlen(str2);
for(j=strlen(str1)-1;j>=k;j--)
{
if(b) str1[j]--;
if(str1[j]>=str2[j-k])
{
str1[j]=str1[j]-str2[j-k]+48;
b=0;
}
else
{
str1[j]=str1[j]+10-str2[j-k]+48;
b=1;
}
}
for(j=k-1;j>=0;j--)
{
if(b) str1[j]--;
if(str1[j]<'0')
{
str1[j]=str1[j]+10;
b=1;
}
else b=0;
}
for(j=0;j<strlen(str1);j++)
{
if(str1[j]!='0')
{
a=j;
break;
}
}
for(j=a;j<strlen(str1);j++)
printf("%c",str1[j]);
printf("\n");
}
}
|
32
|
15659
|
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
|
15660
|
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
|
15661
|
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
|
15662
|
int main()
{
int n,i,j,k,m,l;
char a[100],b[100],c[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a,b);
k=strlen(a);
m=strlen(b);
for(j=k-1,l=m-1;j>=k-m,l>=0;j--,l--)
{
if(a[j]>=b[l])
c[j]=a[j]-b[l]+48;
if(a[j]<b[l])
{
c[j]=10+a[j]-b[l]+48;
a[j-1]--;
}
}
for(j=0;j<k-m;j++)
c[j]=a[j];
for(j=0;j<k;j++)
printf("%c",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15663
|
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
|
15664
|
void main()
{
char str1[100],str2[100],str3[100]={0};
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&&b>=0;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
|
15665
|
void main()
{
int i,j,k,x,y,d,n;
char a[101],b[101];
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s",a);
scanf("%s",b);
x=strlen(a);
y=strlen(b);
printf("\n");
d=x-y;
k=0;
for(i=x-1;i>=d;i--)
if(a[i]<b[i-d])
{
a[i]=a[i]-b[i-d]+58;
a[i-1]=a[i-1]-1;
k++;
}
else
{
a[i]=a[i]-b[i-d]+48;
k++;
}
for(i=x-1;i>0;i--)
if(a[i]<48)
{
a[i]=a[i]+10;
a[i-1]=a[i-1]-1;
}
if(a[0]==48)
k=1;
else
k=0;
for(i=k;i<x;i++)
printf("%c",a[i]);
printf("\n");
}
}
|
32
|
15666
|
void main()
{
int n,j,k,l,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char x[100],y[100];
scanf("%s",x);j=strlen(x);
scanf("%s",y);k=strlen(y);
for(l=k-1;l>=0;l--){x[j-k+l]=x[j-k+l]-y[l]+48;if(x[j-k+l]<48){x[j-k+l]+=10;x[j-k+l-1]--;}}
printf("%s",x);printf("\n");
}
}
|
32
|
15667
|
void main()
{
int l,r;
scanf("%d",&r);
for(l=1;l<=r;l++)
{ int max(int,int);
char d[102]={0},e[102]={0},f[102]={0};
signed char a[102]={0},b[102]={0},c[103]={0},t; /*???*/
int m,p=0,i,j,k,x,y,z=0,signa=1,signb=-1; /*??*/
//printf("input a number:\n");
scanf("%s",d);
for(i=0;i<102;i++)
{
a[i]=d[i];
}
if(a[0]=='-')
{
signa=-1;
for(i=0;i<101;i++)
a[i]=a[i+1];
}
for(i=0;a[i]!=0;i++);
x=i-1;
for(j=0;j<x;j++,x--)
{
t=a[j];
a[j]=a[x];
a[x]=t;
} /*?????*/
x=i-1;
for(k=0;k<=x;k++)a[k]-='0'; /*?????????????*/
//?b????
//printf("input another number:\n");
scanf("%s",e);
for(i=0;i<102;i++)
{
b[i]=e[i];
}
if(b[0]=='-')
{
signb=-1;
for(i=0;i<101;i++)
b[i]=b[i+1];
}
for(i=0;b[i]!=0;i++);
y=i-1;
for(j=0;j<y;j++,y--)
{
t=b[j];
b[j]=b[y];
b[y]=t;
} /*?????*/
y=i-1;
for(k=0;k<=y;k++)b[k]-='0'; /*?????????????*/
//?????????????????????????????????????????
//?????????????????fab(a)?fab(b)<?=?>
if(signa==signb)
{
for(i=0;i<=x||i<=y;i++)
{
c[i]=a[i]+b[i]+p;
p=0;
if(c[i]>9)
{
p=1;
c[i]-=10;
}
}
if(p==1){c[i]=1;i++;}
for(k=0;k<i;k++) /*???????????????????????????????*/
c[k]+='0';
for(k=0;k<i-1;k++,i--)
{
t=c[k];
c[k]=c[i-1];
c[i-1]=t;
}
if(signa==-1)printf("-");
for(i=0;i<102;i++)
{
f[i]=c[i];
}
puts(f);
}
else
{
for(m=max(x,y);(m>=0)&&(z==0);m--)
{
if(a[m]>b[m])z=1;
else {if(a[m]<b[m])z=-1;
else z=0;}
}
if(!z)printf("0");
else
{
if(z==-1)for(i=0;i<102;i++) /*for?????????*/
{
t=a[i];
a[i]=b[i];
b[i]=t;
}
for(i=0;i<=max(x,y);i++)
{
c[i]=a[i]-b[i]+p;
p=0;
if(c[i]<0)
{
p=-1;
c[i]+=10;
}
}
for(i-=1;c[i]==0;i--);
for(k=0;k<=i;k++)c[k]+='0';
for(k=0;k<i;k++,i--)
{
t=c[k];
c[k]=c[i];
c[i]=t;
}
if(z*signa!=1)printf("-");
for(i=0;i<102;i++)
{
f[i]=c[i];
}
puts(f);
}
}
}
}
int max(int x ,int y)
{
return(x>y?x:y);
}/*????*/
|
32
|
15668
|
int a1[N],a2[N];
char s1[N+1],s2[N+1];
int main()
{
int n,i,j,k,t;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
getchar();
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
gets(s1);
gets(s2);
j=0;
int len1=strlen(s1);
for(k=len1-1;k>=0;k--)
a1[j++]=s1[k]-'0';
j=0;
int len2=strlen(s2);
for(k=len2-1;k>=0;k--)
a2[j++]=s2[k]-'0';
for(j=0;j<len2;j++)
{
if(a1[j]>=a2[j])
a1[j]-=a2[j];
else
{
a1[j]=a1[j]+10-a2[j];
a1[j+1]--;
}
}
for(j=len1-1;j>=0;j--)
if(a1[j]>0)
{
t=j;
break;
}
for(j=t;j>=0;j--)
printf("%d",a1[j]);
printf("\n");
}
return 0;
}
|
32
|
15669
|
void main()
{
int n,i,j,lena,lenb,t,h;
char a[101],b[101],c[101],d[101];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s\n%s",a,b);
lena=strlen(a);
lenb=strlen(b);
for (j=0;j<lena;j++)
{
c[j]=a[lena-j-1];
}
for (j=0;j<lenb;j++)
{
d[j]=b[lenb-j-1];
}
for (j=0;j<lenb;j++)
{
if (c[j]<d[j])
{
c[j]=c[j]+10-d[j]+'0';
t=j;
for (;c[++t]<'0';)
{
c[t]='9';
}
c[t]--;
}
else c[j]=c[j]-d[j]+'0';
}
for (h=lena-1;h>0;h--)
{
if (c[h]!='0') break;
}
for (;h>=0;h--)
{
printf("%d",c[h]-'0');
}
printf("\n");
}
}
|
32
|
15670
|
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
|
15671
|
//**************************************
//* ????4.cpp *
//* ?????? *
//* ?????2013?11?16? *
//* ???????? *
//**************************************
int main()
{
const int N=110;
int T,i,l1,l2,tw=0,a[N],b[N],c[N];
char s1[N],s2[N];
cin >> T;cin.get();
while (T--)
{
cin.getline(s1,100);
cin.getline(s2,100);
l1=strlen(s1);l2=strlen(s2);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
for (i=1;i<=l1;i++)
a[N-i]=s1[l1-i]-'0';
for (i=1;i<=l2;i++)
b[N-i]=s2[l2-i]-'0';
for (i=N-1;i>=N-l1;i--)
{
c[i]=a[i]-b[i]-tw;
if (c[i]<0)
{
c[i]+=10;
tw=1;
}
else tw=0;
}
while (c[i]==0) i++;
for (;i<N;i++)
cout << c[i];
cout << endl;
cin.get();
}
return 0;
}
|
32
|
15672
|
void main()
{
int n,i,j,p,q;
char a[100],b[100],c[100]={0},a1[100],b1[100];
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s%s",a,b);
strcpy(a1,a);
strcpy(b1,b);
p=strlen(a);
q=strlen(b);
for(i=100-p;i<=99;i++)
a1[i]=a[i-100+p];
for(i=0;i<=99-p;i++)
a1[i]=0;
for(i=100-q;i<=99;i++)
b1[i]=b[i-100+q];
for(i=100-p;i<=99-q;i++)
b1[i]='0';
for(i=0;i<=99-p;i++)
b1[i]=0;
for(i=99;i>=100-p;i--)
if(a1[i]>=b1[i])
c[i]=a1[i]-b1[i]+48;
else
{
c[i]=10+a1[i]-b1[i]+48;
a1[i-1]--;
}
for(i=100-p;i<=99;i++)
printf("%c",c[i]);
printf("\n");
}
}
|
32
|
15673
|
void swi(int l,char s[200]){
int i,t;
for(i=0;i<l/2;i++){
t=s[i];
s[i]=s[l-i-1];
s[l-i-1]=t;
}
return;
}
int main(){
char m[200],n[200],t[200];
int n1,i,j,k,lm,ln,q,flag,num;
scanf("%d",&num);
for(n1=0;n1<num;n1++){
scanf("%s %s",m,n);
flag=0;
lm=strlen(m);
ln=strlen(n);
if(lm<ln)
flag=1;
else if(lm==ln&&strcmp(m,n)<0)
flag=1;
if(flag){
strcpy(t,m);
strcpy(m,n);
strcpy(n,t);
q=lm;
lm=ln;
ln=q;
putchar('-');
}
swi(lm,m);
swi(ln,n);
for(i=0;i<ln;i++){
if(m[i]>=n[i])
m[i]-=n[i];
else{
m[i]=10+m[i]-n[i];
for(k=1;!m[i+k];k++);
for(q=1;q<k;q++)
m[i+q]=9;
m[i+q]--;
}
}
for(i=ln;i<lm;i++)
m[i]-='0';
for(lm--;!m[lm];lm--);
swi(lm+1,m);
for(i=0;i<=lm;i++)
printf("%d",m[i]);
if(n1<num-1)
putchar('\n');
}
return 0;
}
|
32
|
15674
|
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
|
15675
|
/*???1000012904
?????????
?????
???2010?11?19?
*/
int main()
{
int n;
cin >> n;//???????
for(int i = 0; i < n; i++)
{
int numa[101], numb[101];//???????numa?????numb
char stra[101], strb[101];//?????????stra,strb
int lena, lenb;//???????lena,????lenb
cin >> stra;
cin >> strb;
lena = strlen(stra);
lenb = strlen(strb);//??????????????
memset(numa, 0, sizeof(numa));
memset(numb, 0, sizeof(numb));//?????
int j = 0, k = 0;
for(k = lena - 1; k >= 0; k--)
{
numa[j++] = stra[k] - '0';
}//???????????????????numa
j = 0;
for(k = lenb - 1; k >= 0; k--)
{
numb[j++] = strb[k] - '0';
}//??????????????????numb
for(k = 0; k < lena; k++)
{
if(numa[k] < numb[k])
{
numa[k] = numa[k] + 10;
numa[k + 1] = numa[k + 1] - 1;
}//?????????????????????1????10?????1
numb[k] = numa[k] - numb[k];//????????????????????
}
k = lena;
while(numb[k] == 0)
k--;
//???????????????
for( ;k >= 0; k--)
cout << numb[k];
cout << endl;
cin.get();//???????????
}
return 0;
}
|
32
|
15676
|
int main()
{
int n, a[100]={0}, b[100]={0}, c[100]={0}, l1, l2, i, j;
char begin1[101]={0}, begin2[101]={0};
int compare(int a, int b);
scanf("%d\n", &n);
for(i=0;i<n;i++){
scanf("%s", begin1);
scanf("%s", begin2);
if(i!=n-1)
scanf("\n");
l1 = strlen(begin1);
l2 = strlen(begin2);
for(j=0;j<compare(l1, l2);j++){
if(l1>=l2){
a[j] = (int)begin1[j]-48;
if(j<l2)
b[j+l1-l2] = (int)begin2[j]-48;
}
else{
if(j<l1)
a[j+l2-l1] = (int)begin1[j]-48;
b[j] = (int)begin2[j]-48;
}
}
for(j=compare(l1, l2)-1;j>=0;j--){
if(a[j]-b[j]>=0)
c[j] = a[j] - b[j];
else{
c[j] = 10+a[j]-b[j];
a[j-1] = a[j-1]-1;
}
}
for(j=0;j<compare(l1, l2);j++){
printf("%d", c[j]);
c[j]=0;
begin1[j]='\0';
begin2[j]='\0';
a[j]=0;
b[j]=0;
}
printf("\n");
}
return 0;
}
int compare(int a, int b){
if(a>=b)
return a;
else
return b;
}
|
32
|
15677
|
int main(int argc, char* argv[])
{
int n;
scanf("%d\n",&n);
int i,j,k;
for(i=0;i<n;i++)
{
char str1[105];
char str2[105];
int x1[105]={0},x2[105]={0},s[105]={0};
scanf("%s",str1);
scanf("%s",str2);
int a,b;
a=strlen(str1);
b=strlen(str2);
for(j=0;j<a;j++)
x1[j]=str1[j]-'0';
for(j=b-1;j>=0;j--)
x2[j+a-b]=str2[j]-'0';
for(j=0;j<a-b;j++)
x2[j]=0;
for(j=a-1;j>=0;j--)
{
if(x1[j]<x2[j])
{
s[j]=10+x1[j]-x2[j];
x1[j-1]--;
}
else
s[j]=x1[j]-x2[j];
}
for(j=0;j<a;j++)
printf("%d",s[j]);
printf("\n");
}
return 0;
}
|
32
|
15678
|
//
// ????? ?????
// ????? ?2??????????
// ????? ? ? ? ? ?? 1000012733 ?
// ????? 2010 ? 11 ? 19 ?
//
int main()
{
const int max = 100;
char str1[max], str2[max];
int num1[max], num2[max];
int n, i, j, k1, k2, l, p, q, len1, len2;
cin >> n;
for ( i = 1; i <= n; i ++ )
{
cin.get();
memset ( str1, 0, max );
memset ( str2, 0, max );
cin.getline ( str1, max );
cin.getline ( str2, max );
len1 = strlen ( str1 );
len2 = strlen ( str2 );
memset ( num1, 0, sizeof ( num1 ));
memset ( num2, 0, sizeof ( num2 ));
k1 = len1 - 1;
for ( j = 0; j < len1; j ++ )
{
num1[k1] = str1[j] - '0';
k1 --;
}
k2 = len2 - 1;
for ( j = 0; j < len2; j ++ )
{
num2[k2] = str2[j] - '0';
k2 --;
}
for ( l = 0; l < len1; l ++ )
{
if ( num1[l] >= num2[l] )
num1[l] = num1[l] - num2[l];
else
{
num1[l] = num1[l] - num2[l] + 10;
num1[l + 1] --;
}
}
p = max - 1;
while ( num1[p] == 0)
{
p --;
}
for ( q = p; q > 0; q -- )
{
cout << num1[q];
}
cout << num1[0] << endl;
}
return 0;
}
|
32
|
15679
|
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
|
15680
|
main()
{
char **pp;
int n,h,m=100,i,x,y,a=0;
scanf ("%d",&h);
n=2*h;
pp=(char **)malloc(n*sizeof(char *));
for (i=0;i<n;i++)
pp[i]=(char*)malloc(m*sizeof(char));
for (i=0;i<h;i++)
{
scanf ("%s",pp[2*i]);x=strlen (pp[2*i]);
scanf ("%s",pp[2*i+1]);y=strlen (pp[2*i+1]);
for (a=x-1;a>x-y-1;a--)
{
pp[2*i][a]= pp[2*i][a]-pp[2*i+1][a-x+y]+'0';
if ( pp[2*i][a]<'0')
{pp[2*i][a]= pp[2*i][a]+10; pp[2*i][a-1]= pp[2*i][a-1]-1;}
}
}
printf ("\n");
for (i=0;i<h;i++)
printf ("%s\n",pp[2*i]);
for (i=0;i<n;i++)
free (pp[i]);
free (pp);
}
|
32
|
15681
|
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
|
15682
|
void subtract(char a[],char b[],char c[])
{int i,carry=0;
for(i=100;i>=0;i--)
{if(b[i]+carry>a[i])
{c[i]=10+a[i]-b[i]-carry+'0';
carry=1;}
else
{c[i]=a[i]-b[i]-carry+'0';
carry=0;}
}
}
void align(char a[])
{int len,jump,m;
len=strlen(a);
jump=101-len;
for(m=len;m>=0;m--)
{a[m+jump]=a[m];
a[m]='0';}
}
void main()
{int i,x,y,z,m;
scanf("%d",&m);
while(m>0)
{char e[101],f[101],g[101];
for(i=0;i<101;i++)
e[i]=f[i]=g[i]='0';
scanf("%s",e);
scanf("%s",f);
x=strlen(e);
y=strlen(f);
align(e);
align(f);
subtract(e,f,g);
z=100-x;
while(z<=99&&g[z]=='0')
z++;
for(i=z;i<=100;i++)
printf("%c",g[i]);
printf("\n");
m=m-1;
getchar();
}
}
|
32
|
15683
|
//*****************************
//*?????? 1300012809 **
//*???2013.11.16 **
//*???????? **
//*****************************
int main()
{
int n, i, j, k, changdu1, changdu2, jieguo[1005];
char jianshu[1005], beijianshu[1005];
char zhongjian[1005];
cin >> n;
cin.get();
for (k=0; k<n; k++)
{
if (k!=0) cin.get();
cin.getline(beijianshu,1001);
cin.getline(jianshu,1001);
changdu1 = strlen(beijianshu);
changdu2 = strlen(jianshu);
for (i=0; i<changdu1; i++) zhongjian[i] = beijianshu[i];
for (i=0; i<changdu1; i++)
{
beijianshu[i] = zhongjian[changdu1-1-i];
if (beijianshu[i]==' ') beijianshu[i]='0' ;
}
for (i=0; i<changdu2; i++) zhongjian[i] = jianshu[i];
for (i=0; i<changdu2; i++)
{
jianshu[i] = zhongjian[changdu2-1-i];
if (jianshu[i]==' ') jianshu[i]='0' ;
}
//?????
for (i=0; i<changdu2; i++)
{
if (beijianshu[i]<jianshu[i])
{
jieguo[i] = 10 - jianshu[i] + beijianshu[i];
if (beijianshu[i+1] != '0') beijianshu[i+1] -= 1 ;
else
{
j=i;
while(beijianshu[j+1]=='0')
{
beijianshu[j+1] = '9' ;
j = j + 1 ;
}
beijianshu[j+1] -= 1 ;
}
}
else
{
jieguo[i] = beijianshu[i] - jianshu[i] ;
}
}
for (i=changdu2; i<changdu1; i++)
jieguo[i]=beijianshu[i] - '0' ;
if (beijianshu[changdu1-1]=='0') changdu1 -= 1;
for (i=changdu1-1; i>=0; i--) cout << jieguo[i] ;
cout << endl;
}
return 0;
}
|
32
|
15684
|
void main(){
int n,i,j,al,bl,t;
char a[100],b[100],out[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{int anum[100];
int bnum[100];
scanf("%s",a);
scanf("%s",b);
al=strlen(a);
bl=strlen(b);
for(j=0;j<al;j++)
anum[al-1-j]=a[j]-'0';
for(j=0;j<bl;j++)
bnum[bl-1-j]=b[j]-'0';
for(j=0;j<bl;j++)
anum[j]=anum[j]-bnum[j];
for(j=0;j<bl;j++)
{
if(anum[j]<0)
{
anum[j]=anum[j]+10;
anum[j+1]=anum[j+1]-1;
}
}
if(anum[al-1]==0)
{
{for(j=0;j<al-1;j++)
out[j]=anum[al-2-j]+'0';
};
out[al-1]='\0';
}
if(anum[al-1]>0)
{
for(j=0;j<al;j++)
out[j]=anum[al-1-j]+'0';
out[al]='\0';
}
printf("%s\n",out);
}
}
|
32
|
15685
|
/*?????*/
int main()
{
int n,i;
char s1[101],s2[101];
int result[101];
cin>>n;
int n1,n2,hand,j;
while(n--)
{
cin>>s1>>s2;
n1=strlen(s1);
n2=strlen(s2);
hand=0;
for(i=n2-1;i>=0;i--)
{
result[hand]=s1[n1-n2+i]-s2[i];//???
if(result[hand]<0)
{
result[hand]=result[hand]+10;
j=n1-n2+i-1;
while(--s1[j]<48)//??
{
s1[j]=s1[j]+10;
j--;
}
}
hand++;
}
for(i=0;i<n1-n2;i++)
if(s1[i]!='0') break;
for(;i<n1-n2;i++) cout<<(int)s1[i]-48;
for(i=hand-1;i>=0;i--) cout<<result[i];
cout<<endl;
}
return 0;
}
|
32
|
15686
|
int main()
{
int n,i,j,k,m,g,h,temp;
char a[1000]={'0'},b[1000]={'0'};
int c[1000],d[1000]={0},f[1000];
scanf("%d",&n);
while(n>0)
{
memset(a,'0',sizeof(a));
memset(b,'0',sizeof(b));
for(m=0;m<1000;m++)
{
f[m]=0;
c[m]=0;
d[m]=0;
}
scanf("%s",a);
scanf("%s",b);
j=strlen(a);
k=strlen(b);
for(m=0;m<j;m++)
c[m]=a[m]-'0';
for(m=0;m<k;m++)
d[m+j-k]=b[m]-'0';
for(m=j-1;m>=0;m--)
if(c[m]>=d[m])
f[m]=c[m]-d[m];
else
{
c[m]+=10;
c[m-1]-=1;
f[m]=c[m]-d[m];
}
for(m=0;m<j;m++)
{
if(f[m]!=0)
{
g=m;
break;
}
}
for(m=g;m<j-1;m++)
printf("%d",f[m]);
printf("%d\n",f[j-1]);
n--;
}
return 0;
}
|
32
|
15687
|
void main()
{
int n,i,j,an,bn,c[100];
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
an=strlen(a);
bn=strlen(b);
for(j=0;j<an;j++)
{
if(j<an-bn)
c[j]=a[j]-48;
else
if(a[j]>=b[j+bn-an])
c[j]=a[j]-b[j+bn-an];
else
{
c[j]=a[j]+10-b[j+bn-an];
if(c[j-1]!=0)
{
c[j-1]=c[j-1]-1;
}
else
if(c[j-2]!=0)
{
c[j-1]=9;
c[j-2]=c[j-2]-1;
}
else
if(c[j-3]!=0)
{
c[j-1]=9;
c[j-2]=9;
c[j-3]=c[j-3]-1;
}
}
}
for(j=0;j<an;j++)
{
printf("%d",c[j]);
if(j==an-1)
printf("\n");
}
}
}
|
32
|
15688
|
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
|
15689
|
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
|
15690
|
void checkit(char a[101])
{
int i,n;
n=strlen(a);
for(i=0;i<n;i++)
{
a[i]=a[i+1];
}
if(a[0]=='0')checkit(a);
}
void doit(char a[101],char b[101])
{
int x,y,i,m;
x=strlen(a);
y=strlen(b);
for(i=0;i<y;i++)
{
m=a[x-1-i]-b[y-1-i]+48;
if(m<48)
{
a[x-2-i]=a[x-2-i]-1;
m=m+10;
}
a[x-1-i]=m;
}
if(a[0]=='0')checkit(a);
}
void main()
{
char a[20][101],b[20][101];
int n,i;
scanf("%d",&n);
scanf("%s",a[0]);
scanf("%s",b[0]);
for(i=1;i<n;i++)
{
getchar();
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
doit(a[i],b[i]);
printf("%s\n",a[i]);
}
}
|
32
|
15691
|
int main()
{
char c[101], d[101];
int i[101] = {0}, j[101] = {0}, tmp, flag;
int n;
cin >> n;
for (int m = 0; m < n; m++)
{
for (int k = 0; k < 101; k++)
{
c[k] = d[k] = '0';
i[k] = j[k] = 0;
}
cin >> c >> d;
for (int k = strlen(c) - 1; k >= 0; k--)
{
i[k] = c[k] - '0';
}
for (int k = strlen(d) - 1; k >= 0; k--)
{
j[k + strlen(c) - strlen(d)] = d[k] - '0';
}
for (int l = strlen(c) - 1; l >= 0; l--)
{
tmp = i[l] - j[l];
if (tmp < 0)
{
tmp += 10;
i[l - 1]--;
}
i[l] = tmp;
}
for (int k = 0; k < strlen(c); k++)
{
if (i[k] > 0)
{
flag = k;
break;
}
}
for (int k = flag; k < strlen(c); k++)
{
cout << i[k];
}
cout << endl;
}
return 0;
}
|
32
|
15692
|
void f(char a[],char b[],char * p)
{
int m,n;
m=strlen(a);
n=strlen(b);
for (int i=0;i<m;i++)
{
if (b[n-1-i]-a[m-1-i]>=0)
p[n-1-i]=b[n-1-i]-a[m-1-i]+'0';
else
{
p[n-1-i]=b[n-1-i]-a[m-1-i]+'0'+10;
b[n-2-i]--;
}
}
p[n]=0;
for(int i=0;i<n-m;i++)
p[i]=b[i];
if(p[0]=='0'&&p[1]!=0)
{
for(int i=0;i<n+1;i++)
p[i]=p[i+1];
}
}
int main()
{
int n,i;
scanf ("%d",&n);
getchar();
for(i = 0;i<n;i++)
{
char a[101];
char b[101];
char c[101];
gets(a);
gets(b);
f(b,a,c);
printf("%s\n",c);
getchar();
}
}
|
32
|
15693
|
int main()
{
int n=0;
cin>>n;
cin.get();
int i,j,k;
int l1,l2;
char x[201];
char y[201];
int a[201],b[201];
for(k=0;k<n-1;k++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
cin.getline(x,201);
cin.getline(y,201);
cin.get();
l1=strlen(x);
l2=strlen(y);
// cout<<x<<endl;
// cout<<y<<endl;
for(i=0,j=l1-1;i<l1;i++,j--)
{
a[j]=x[i]-'0';
}
for(i=0,j=l2-1;i<l2;i++,j--)
{
b[j]=y[i]-'0';
}
for(i=0;i<l2;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=200;i>=0;i--)
{
if(a[i]!=0)
break;
}
for(i=i;i>=0;i--)
{
cout<<a[i];
}
cout<<endl;
}
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
cin.getline(x,201);
cin.getline(y,201);
l1=strlen(x);
l2=strlen(y);
// cout<<x<<endl;
// cout<<y<<endl;
for(i=0,j=l1-1;i<l1;i++,j--)
{
a[j]=x[i]-'0';
}
for(i=0,j=l2-1;i<l2;i++,j--)
{
b[j]=y[i]-'0';
}
for(i=0;i<l2;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=200;i>=0;i--)
{
if(a[i]!=0)
break;
}
for(i=i;i>=0;i--)
{
cout<<a[i];
}
cout<<endl;
return 0;
}
|
32
|
15694
|
void main()
{
int n,i,j,x,y,k,t,c[101],ii;
scanf("%d",&n);
for(ii=1;ii<=n;ii++)
{
char a[101],b[101];
scanf("%s",a);
scanf("%s",b);
x=strlen(a);
y=strlen(b);
for(j=y-1,k=x-1;j>=0;j--,k--)
{
if(a[k]>=b[j])
c[k]=a[k]-b[j];
else
{
c[k]=a[k]+10-b[j];
a[k-1]=a[k-1]-1;
}
}
for(i=0;i<=x-y-1;i++)
c[i]=a[i]-'0';
for(j=0;j<x;j++)
{
if(c[j]!=0)
{
t=j;
break;
}
}
for(i=t;i<x;i++)
printf("%d",c[i]);
printf("\n");
}
}
|
32
|
15695
|
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
|
15696
|
void main(){
char s1[100],s2[100],s[100];
int a[100],b[100],c[100];
int i,j,k,n,u,v,m;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s1);
scanf("%s",s2);
j=0;
while(s1[j]!='\0'){
a[j]=s1[j]-'0';
j++;
}
k=0;
while(s2[k]!='\0'){
b[k]=s2[k]-'0';
k++;
}
u=0;
m=0;
while(k>0){
c[u]=a[j-1]-b[k-1]-m;
if(c[u]<0)
m=1;
else
m=0;
c[u]=c[u]+10*m;
j--;k--;u++;
}
while(m==1 || j>0){//
c[u]=a[j-1]-m;
if(c[u]<0)
m=1;
else
m=0;
c[u]=c[u]+10*m;
j--;u++;
}//
for(v=0;v<u;v++){
s[v]=c[v]+'0';
}
while(s[u-1]=='0'){
u--;
}
while(u>0){
printf("%c",s[u-1]);
u--;
}
printf("\n");
}
}
|
32
|
15697
|
void main()
{
int n,a,b,c,d,i,j;
char num[101][101];
scanf("%d",&n);
for(i=0;i<(2*n);i++)
scanf("%s",num[i]);
a=0;
b=0;
for(i=0;i<(2*n-1);i=i+2)
{
a=strlen(num[i]);
b=strlen(num[i+1]);
for(j=b;j>=0;j--)
num[i+1][a-b+j]=num[i+1][j];
for(j=0;j<a-b;j++)
num[i+1][j]='0';
c=0;
d=0;
for(j=a-1;j>=0;j--)
{
c=(10+num[i][j]-'0')-(num[i+1][j]-'0')-d;
num[i][j]=c%10+'0';
if(c<10) d=1;
else d=0;
}
printf("%s\n",num[i]);
}
}
|
32
|
15698
|
void main()
{
char a[101],b[101],d;
int n,i,j,k=102,l,f=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
l=strlen(a)-strlen(b);
for(j=strlen(a)-1;j>=l;j--)
{
if(f)
a[j]--;
if(a[j]>=b[j-l])
{
a[j]=a[j]-b[j-l]+'0';
f=0;
}
else
{
a[j]=a[j]+10-b[j-l]+'0';
f=1;
}
}
for(j=l-1;j>=0;j--)
{
if(f)
a[j]--;
if(a[j]<'0')
{
a[j]=a[j]+10;
f=1;
}
else
f=0;
}
for(j=0;j<strlen(a);j++)
{
if(a[j]!='0')
{
k=j;
break;
}
}
if(k==102)
printf("0\n");
else
{
for(j=k;j<strlen(a);j++)
printf("%c",a[j]);
printf("\n");
scanf("%c",&d);
}
}
}
|
32
|
15699
|
/*
* 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();
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.