label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
32
|
15800
|
void main()
{
int n,i,j,k,t;
char a[100][100],b[100][100],c[100][100]={""};
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s%s",a[i],b[i]);/*?????????*/
printf("\n");
}
for(i=0;i<n;i++)
{
for(j=strlen(a[i])-1,k=strlen(b[i])-1;j>=(strlen(a[i])-strlen(b[i]));j--,k--)
{
if(a[i][j]>=b[i][k])
c[i][j]=a[i][j]-b[i][k];
else
{ a[i][j-1]=a[i][j-1]-1;
c[i][j]=10+a[i][j]-b[i][k];
}
c[i][j]=c[i][j]+48;
}
for(t=strlen(a[i])-1;t>=0;t--)
{if(a[i][t]<48)
a[i][t-1]=a[i][t-1]-1;}
for(t=0;t<strlen(a[i]);t++)
if(a[i][t]<48)
a[i][t]='9';
for(j=0;j<strlen(a[i])-strlen(b[i]);j++)
c[i][j]=a[i][j];
c[i][strlen(a[i])]='\0';
printf("%s\n",c[i]);
}
}
|
32
|
15801
|
int main()
{
char s1[102],s2[100];
int a,b,i,j,n,d;
cin >> n;
gets(s1);
for(i=0;i<n;i++)
{
gets(s1);
gets(s2);
a=strlen(s1);
b=strlen(s2);
d=0;
for(j=b-1;j>=0;j--)
{
d=s1[j-b+a]-s2[j]+d;
if (d>=0) {
s1[j-b+a]=d+'0';
d=0;
}
else {
s1[j-b+a]=d+'0'+10;
d=-1;
}
}
while(d==-1&&j-b+a>=0){
d=s1[j-b+a]-1-'0';
if (d>=0) {
s1[j-b+a]=d+'0';
break;
}
else {
s1[j-b+a]='9';
d=-1;
}
j--;
}
j=0;
while(s1[j]=='0')j++;
while(j<a)
{
cout<<s1[j];
j++;
}
cout<<endl;
gets(s1);
}
}
|
32
|
15802
|
void minus(char a[],char b[],char result[]);
void main()
{
int n,i;
char a[max][max],b[max][max];
char result[max][max];
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s\n\n",a[i],b[i]);
minus(a[i],b[i],result[i]);
printf("%s\n",result[i]);
}
}
void minus(char a[],char b[],char result[])
{
int la,lb,t=0,s,c=0,i;
char temp;
la=strlen(a)-1;
lb=strlen(b)-1;
while(la >= 0)
{
if(lb < 0)
{
s=a[la--]-48;
}
else
{
s=a[la--]-b[lb--];
}
result[t++]=s-c+48;
if(result[t-1] < 48)
{
result[t-1]+=10;
c=1;
}
else c=0;
}
while(result[t] == 0) t--;
while(result[t] == '0')
{
result[t]=0;t--;
}
for(i=0;i <= t/2;i++)
{
temp=result[i];
result[i]=result[t-i];
result[t-i]=temp;
}
}
|
32
|
15803
|
int main() {
int n,la,lb;
char a[100],b[100];
int a1[100],b1[100],c[100];
cin>>n;
while(n>0)
{
cin>>a>>b;
la=strlen(a);
lb=strlen(b);
for(int i=la-1,j=1;i>=0;i--)
a1[j++]=a[i]-'0';
for(int i=lb-1,j=1;i>=0;i--)
b1[j++]=b[i]-'0';
for(int i=lb+1;i<=la;i++)
b1[i]=0;
int t=0;
for(int i=1;i<=la;i++)
{
c[i]=a1[i]-b1[i]+t;
if(c[i]<0)
{
c[i]=c[i]+10;
t=-1;
}
else
t=0;
}
for(int i=la;i>=1;i--)
if(c[i]!=0)
{
la=i;
break;
}
for(int i=la;i>=1;i--)
cout<<c[i];
cout<<endl;
n--;
}
return 0;
}
|
32
|
15804
|
void main()
{
char a[200][200],b[200][200];
int i,j,n,A[200],B[200],k;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s\n",&a[i]);
scanf("%s\n",&b[i]);
scanf("\n");
}
for(i=0;i<n;i++)
{
A[i]=strlen(a[i])-1;B[i]=strlen(b[i])-1;
for(j=A[i],k=B[i];k>0,k>=0;j--,k--)
{
a[i][j]=a[i][j]-b[i][k]+48;
while(a[i][j]<'0')
{a[i][j]+=10;
a[i][j-1]--;}
}
}
for(i=0;i<n;i++)
{printf("%s\n",a[i]);}
}
|
32
|
15805
|
/*********************
*file:4.cpp
*author:??
*time:2013-10-19
*description:??????????
***********************/
int main()
{
int a[110], b[110], c[110];
char str1[110], str2[110];
int n, i, j;
int len1, len2;
cin >> n;
while (n--)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c)); //????????0
cin >> str1 >> str2;
len1 = strlen(str1);
len2 = strlen(str2);
j = 0;
for (i = len1 - 1; i >= 0; i--) //?str1???a???
a[j++] = str1[i] - '0';
j = 0;
for (i = len2 - 1; i >= 0; i--) //?str2???b???
b[j++] = str2[i] - '0';
for (i = 0; i < len1; i++) //?????
{
c[i] += (a[i] - b[i]);
if (c[i] < 0) //??
{
c[i+1]--;
c[i] += 10;
}
}
i = len1 - 1;
while (!c[i]) //???0???
{
i--;
if(i == -1)
break;
}
if (i == -1) //????1????
{
cout<< 0 << endl;
continue;
}
while(i >= 0)
{
cout << c[i];
i--;
}
cout << endl;
}
return 0;
}
|
32
|
15806
|
void plus(char a[],char b[])
{
int * p1,* p2,*p;
int c[100],i,l1,l2;
l1=strlen(a);
l2=strlen(b);
for(i=0;i<l2;i++)
{
c[i]=a[l1-1-i]-b[l2-i-1];
}
for(i=l2;i<l1;i++)
{
c[i]=a[l1-i-1]-'0';
}
for(i=0;i<l1;i++)
{
if(c[i]<0)
{
c[i]=10+c[i];
c[i+1]=c[i+1]-1;
}
}
p1=c;
p2=p1+l1-1;
for(p=p2;p!=p1;p--)
{
printf("%d",* p);
}
printf("%d\n",* p1);
}
void main()
{
int n,i;
char a[100][100],b[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
plus(a[i],b[i]);
}
}
|
32
|
15807
|
int main()
{
char a[101],b[101];
int ia[101],ib[101];
int n=0,i=0,j=0,len1=0,len2=0,t=0,ans[101]={0};
cin>>n;
for(t=0;t<n;t++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(ia,0,sizeof(ia));
memset(ib,0,sizeof(ib));
memset(ans,0,sizeof(ans));
cin>>a>>b;
len1=strlen(a);
len2=strlen(b);
int k=0;
for(i=len1-1;i>=0;i--)
{
ia[k]=a[i]-'0';
k++;
}
k=0;
for(i=len2-1;i>=0;i--)
{
ib[k]=b[i]-'0';
k++;
}
for(i=0;i<len2;i++)
{
if(ia[i]<ib[i])
{
ia[i+1]--;
ia[i]=ia[i]+10;
ans[i]=ia[i]-ib[i];
}
else
ans[i]=ia[i]-ib[i];
}
int p=0;
for(i=len1;;i--)
{
if(ia[i]!=0)
{
p=i;
break;
}
}
for(i=p;i>=len2;i--)
{
ans[i]=ia[i];
}
for(i=p;i>=0;i--)
cout<<ans[i];
cout<<endl;
}
return 0;
}
|
32
|
15808
|
int main()
{
int n,la,lb,i,j;
char a[100],b[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
lb=strlen(b);
la=strlen(a);
for (j=lb-1;j>0;j--)
{
if (a[la-lb+j]>=b[j])
a[la-lb+j]=a[la-lb+j]-b[j];
else
{
a[la-lb+j-1]=a[la-lb+j-1]-1;
a[la-lb+j]=a[la-lb+j]+10-b[j];
}
}
if (a[la-lb]<b[0])
{
a[la-lb-1]-=1;
a[la-lb]=a[la-lb]+10-b[0];
}
else a[la-lb]=a[la-lb]-b[0];
for (j=0;j<la-lb;j++)
a[j]=a[j]-48;
for (j=0;j<la;j++)
printf("%d",a[j]);
printf("\n");
}
return 0;
}
|
32
|
15809
|
int main()
{
int n, i, j, k;
int num1[110]; int num2[110];
char str1[110]; char str2[110];
cin >> n;
getchar();
for(i = 1; i <= n; i++)
{
j = 0;
memset(num1, 0, sizeof(num1));
memset(num2, 0, sizeof(num2));
cin.getline(str1, 110);
cin.getline(str2, 110);
getchar();
int l1 = strlen(str1);
int l2 = strlen(str2);
for(k = l1 - 1; k >= 0; k--)
num1[j++] = str1[k] - '0';
j = 0;
for(k = l2 - 1; k >= 0; k--)
num2[j++] = str2[k] - '0';
for(k = 0; k < l2 || k < l1; k++)
{
num1[k] -= num2[k];
if (k > 0 && num1[k - 1] < 0)
{
num1[k - 1] += 10;
-- num1[k];
}
}
k = 100;
while (k > 0 && num1[k] == 0)
-- k;
for( ; k >= 0; k--)
cout << num1[k];
cout << endl;
}
return 0;
}
|
32
|
15810
|
void main()
{
int n,i,j,k,la,lb,t;
char a[1000][100],b[1000][100],c[1000][100];
scanf("%d",&n);
getchar();
for(i=1;i<=n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
printf("\n");
}
for(i=1;i<=n;i++)
{
la=strlen(a[i]);
lb=strlen(b[i]);
for(j=la-1,k=lb-1;k>=0;j--,k--)
{
if(a[i][j]>=b[i][k]) c[i][j]=a[i][j]-b[i][k];
else
{c[i][j]=a[i][j]-b[i][k]+10;
a[i][j-1]--;}
}
for(j=la-lb-1;j>=0;j--)
{
if(a[i][j]>='0') c[i][j]=a[i][j]-'0';
else
{c[i][j]=a[i][j]+10-'0';
a[i][j-1]--;}
}
for(j=0;;j++)
if(c[i][j]!=0) break;
t=j;
for(j=t;j<=la-1;j++)
printf("%d",c[i][j]);
printf("\n");
}
}
|
32
|
15811
|
void main()
{
int n,i,j,k,t,m;
char a[100][100],b[100][100];
scanf("%d",&n);
for(i=0;i<n-1;i++)
{
scanf("%s",a[i]);
scanf("%s\n",b[i]);
}
scanf("%s%s",a[n-1],b[n-1]);
for(i=0;i<n;i++)
{
for(j=strlen(a[i])-1,k=strlen(b[i])-1;k>=0;j--,k--)
{
if(a[i][j]>=b[i][k])
a[i][j]='0'+a[i][j]-b[i][k];
else
{
a[i][j]=10+'0'+a[i][j]-b[i][k];
if(a[i][j-1]>'0') a[i][j-1]--;
else
{
for(t=j-1;a[i][t]=='0';t--)
a[i][t]='9';
a[i][t]--;
}
}
}
printf("%s\n",a[i]);
}
}
|
32
|
15812
|
char a[200],b[200];
int alen;
void init();
void minus();
void output();
int main()
{
int n,i;
cin>>n;
for (i=0;i<n;i++)
{
cin>>a>>b;
init();
minus();
output();
}
}
void init()
{
int len1,len2,temp,i;
alen=len1=strlen(a);
for (i=0;i<(len1+1)/2;i++)
{
temp=a[i];
a[i]=a[len1-i-1];
a[len1-i-1]=temp;
}
for (i=0;i<len1;i++)
{
a[i]-='0';
}
len2=strlen(b);
for (i=0;i<(len2+1)/2;i++)
{
temp=b[i];
b[i]=b[len2-i-1];
b[len2-i-1]=temp;
}
for (i=0;i<len2;i++)
{
b[i]-='0';
}
for (i=len2;i<len1;i++)
{
b[i]=0;
}
}
void minus()
{
int p,len,tp;
p=0;
while (p<alen)
{
if (a[p]>=b[p])
{
a[p]-=b[p];
}
else if (a[p]<b[p])
{
tp=p+1;
while (a[tp]==0)
{
a[tp]=9;
tp++;
}
a[tp]--;
a[p]=a[p]+10-b[p];
}
p++;
}
}
void output()
{
int len,i,t;
while (a[alen]==0)
{
if (alen==0)
{
cout<<0<<endl;
return;
}
alen--;
}
for (i=alen;i>=0;i--)
{
t=a[i];
cout<<t;
}
cout<<endl;
}
|
32
|
15813
|
char n1[100];
char n2[100];
char n3[101];
int w,i;
void do_sub();
void main()
{
scanf("%d",&w);
for(i=0;i<w;i++)
{
scanf("%s", n1);
scanf("%s", n2);
do_sub();
}
}
void do_sub()
{
int iLen1;
int iLen2;
int iBorrow = 0;
int n = 0;
int sign = 0;
iLen1 = strlen(n1);
iLen2 = strlen(n2);
if ((iLen2 > iLen1) || (iLen2 == iLen1) && (strcmp(n2, n1) > 0))
{
strcpy(n3, n1);
strcpy(n1, n2);
strcpy(n2, n3);
sign = -1;
}
for(iLen1 = strlen(n1)-1, iLen2 = strlen(n2)-1; (iLen1 >= 0) && (iLen2 >= 0); iLen1--, iLen2--)
{
n3[n] = n1[iLen1] - n2[iLen2] - iBorrow;
iBorrow = (n3[n] >= 0) ? 0 : 1;
if (n3[n] < 0)
{
n3[n] += 10;
}
n++;
}
for(; iLen1 >= 0; iLen1--)
{
n3[n] = n1[iLen1] - '0' - iBorrow;
iBorrow = (n3[n] >= 0) ? 0 : 1;
if (n3[n] < 0)
{
n3[n] += 10;
}
n++;
}
if (sign == -1)
{
printf("-");
}
for(n--; n >= 0; n--)
{
printf("%d", n3[n]);
}
printf("\n");
}
|
32
|
15814
|
//**********************************
//??: ?????
//???2013.11.16
//**********************************
int sub(int len,int *an1,int *an2)
{
int max=0;
for(int i=0;i<=len;i++)
{
an1[i]=an1[i]-an2[i];
if(an1[i]<0)
{
an1[i]=an1[i]+10;
an1[i+1]=an1[i+1]-1;
}
if(an1[i]!=0)
max=i;
}
return (max);
}
int main()
{
int n=0,i=0;
cin>>n;
for(i=1;i<=n;i++)
{
char bn1[102],bn2[102];
int j=0,k=0,max=0,an1[102],an2[102];
cin>>bn1>>bn2;
memset(an1,0,sizeof(an1));
memset(an2,0,sizeof(an2));
for(j=strlen(bn1)-1,k=0;j>=0;j--)
an1[k++]=bn1[j]-'0';
for(j=strlen(bn2)-1,k=0;j>=0;j--)
an2[k++]=bn2[j]-'0';
max=sub(strlen(bn1),an1,an2);
for(j=max;j>=0;j--)
cout<<an1[j];
cout<<endl;
}
return 0;
}
|
32
|
15815
|
int main()
{
int a1[Max+10]={0};
int a2[Max+10]={0};
char s1[Max+10];
char s2[Max+10];
int i,j,k=0,e,f,n;
int L1,L2;
scanf("%d",&n);
do{
scanf("%s",s1);
scanf("%s",s2);
L1=strlen(s1);
L2=strlen(s2);
j=0;
if(L1==1&&L2==1)
{
e=s1[0]-'0';
f=s2[0]-'0';
printf("%d",e-f);
}
else
{
for(i=L1-1;i>=0;i--)
a1[j++]=s1[i]-'0';
j=0;
for(i=L2-1;i>=0;i--)
a2[j++]=s2[i]-'0';
for(i=0;i<Max;i++)
{
a1[i]-=a2[i];
if(a1[i]<0)
{
a1[i]+=10;
a1[i+1]--;
}
}
for(i=Max;i>=0;i--)
{
if(a1[i]!=0)
{
j=i;
break;
}
}
for(i=j;i>=0;i--)
{
printf("%d",a1[i]);
if(i==0)
printf("\n");
}
for(i=0;i<Max;i++)
{
a1[i]=0;
a2[i]=0;
}
getchar();
k++;
}
}while(k<n);
return 0;
}
|
32
|
15816
|
int main()
{
char a[100],b[100];
int n,k=1,p,q,i,c[100];
scanf("%d",&n);
while (k<=n)
{
scanf("%s%s",&a,&b);
p=strlen(a);//??????
q=strlen(b);//??????
i=p;
for(;p>=0;p--,q--)
{
if (q>=0)
{
c[p]=a[p]-b[q];
if (c[p]<0) {c[p]=10+c[p];a[p-1]=a[p-1]-1;}
}
else if (q<0) c[p]=a[p]-48;
}
for(p=0;p<i;p++) printf("%d",c[p]);
k++;
printf("\n");
}
}
|
32
|
15817
|
void main()
{
int i,j,k,n,t[100],n1,n2;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
n1=strlen(a);
n2=strlen(b);
for(j=n1-1,k=n2-1;k>=0;k--)
{
if(a[j]<b[k])
{
t[j]=a[j]-b[k]+10;
a[j-1]=a[j-1]-1;
}
else
{
t[j]=a[j]-b[k];
}
j--;
}
for(j=0;j<n1-n2;j++)
{
t[j]=a[j]-'0';
}
for(j=0;j<n1;j++)
{
printf("%d",t[j]);
}
printf("\n");
}
}
|
32
|
15818
|
void main()
{
int n,i,j,k,ya,yb,m;
char a[100]={0},b[100]={0};
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s\n",a);
scanf("%s",b);
ya=strlen(a);
yb=strlen(b);
i=ya-1;
for(k=yb-1;k>=0;k--)
{
if(a[i]>=b[k])
{
a[i]=a[i]-b[k]+48;
}
else//if(a[i]<b[k])
{
a[i]=a[i]-b[k]+58;
for(m=i-1;m>=0;m--)
{
if(a[m]>=49)
{
a[m]=a[m]-1;
break;
}
else if(a[m]==48)
a[m]=57;
}
}
i--;
}
printf("%s",a);
printf("\n");
}
}
|
32
|
15819
|
int main()
{
char a[101],b[101];
int A[100],B[100],ans[100];
int line,len1,len2,len3;
cin>>line;
while(line>0)
{
cin>>a;
cin>>b;
len1=strlen(a);
for(int i=len1-1,j=0;i>=0;i--,j++)
A[j]=a[i]-'0';
len2=strlen(b);
for(int i=len2-1,j=0;i>=0;i--,j++)
B[j]=b[i]-'0';
for(int i=0;i<len2;i++)
{
if(A[i]>=B[i])
ans[i]=A[i]-B[i];
else
{
A[i+1]--;
ans[i]=A[i]-B[i]+10;
}
}
for(int i=len2;i<len1;i++)
ans[i]=A[i];
if( len1==len2 && A[len1-1]==B[len2-1] )
len1--;
for(int i=len1-1;i>=0;i--)
cout<<ans[i];
cout<<endl;
line--;
}
return 0;
}
|
32
|
15820
|
/*
* 88.cpp
*
* Created on: 2011-12-25
* Author: 1
*/
int main()
{
int n,aa,bb,i,j,p,q;
cin>>n;
char a[100];
char b[100];
char d[100];
cin.getline(a,100);
while(n>0)
{
n=n-1;
cin.getline(a,100);
cin.getline(b,100);
cin.getline(d,100);
aa=(strlen)(a);
bb=(strlen)(b);
for(i=aa;i>=0;i--)
{
b[i]=b[i-aa+bb];
}
for(i=0;i<aa-bb;i++)
{
b[i]='0';
}
int c[aa];
for(i=aa-1;i>=0;i--)
{
p=(int)(a[i]);
q=(int)(b[i]);
if(p>=q) c[i]=p-q;
else
{
c[i]=p+10-q;
a[i-1]=(char)((int)(a[i-1])-1);
}
}
for(i=0;i<100;i++)
{
if(c[i]!=0) break;
}
for(j=i;j<100;j++)
{
c[j-i]=c[j];
}
for(j=0;j<aa-i;j++)
{
cout<<c[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15821
|
int maxi(int a,int b)
{
if(a>b) return a;
else return b;
}
int main()
{
int n,i;
char a[102],b[102];
int na[102],nb[102],sum[200];
cin>>n;
for(i=0;i<n;i++)
{ int j,k=0;
memset(a,'\0',sizeof(a));
memset(b,'\0',sizeof(b));
memset(na,0,sizeof(na) );
memset(nb,0,sizeof(na) );
memset(sum,0,sizeof(sum) );
cin>>a>>b;
int lena=strlen(a),lenb=strlen(b);
for(j=lena-1;j>=0;j--)
na[k++]=a[j]-'0';
k=0;
for(j=lenb-1;j>=0;j--)
nb[k++]=b[j]-'0';
int MaxLen=maxi(lena,lenb);
for(j=0;j<MaxLen;j++)
{
sum[j]+=na[j]-nb[j];
if(sum[j]<0)
{ sum[j]+=10;
sum[j+1]--;
}
}
int flag=0;
for(j=MaxLen-1;j>=0;j--)
{
if(sum[j]==0&&flag==0)
;
if(sum[j]!=0&&flag==0)
{
flag=1;
cout<<sum[j];
}
else if(flag==1)
cout<<sum[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15822
|
int main()
{
int str_1[100],str_2[100],str_3[100],n,k;
char str_a[101],str_b[101];
int len_a,len_b;
cin>>n;
for(k=0;k<n;k++)
{
cin.get();
cin.getline(str_a,101);
cin.getline(str_b,101);
len_a=strlen(str_a);
len_b=strlen(str_b);
memset(str_1,0,sizeof(str_1));
memset(str_2,0,sizeof(str_2));
memset(str_3,0,sizeof(str_3));
int i,j=0;
for(i=len_a-1;i>=0;i--)
str_1[j++]=str_a[i]-'0';
j=0;
for(i=len_b-1;i>=0;i--)
str_2[j++]=str_b[i]-'0';
for(i=0;i<len_b;i++)
{
if(str_1[i]>=str_2[i])
str_3[i]=str_1[i]-str_2[i];
else
{
str_3[i]=str_1[i]-str_2[i]+10;
str_1[i+1]--;
}
}
for(;i<len_a;i++)
str_3[i]=str_1[i];
for(i=99;i>=0;i--)
{
if(str_3[i]!=0)
break;
}
if(i==-1)
cout<<0;
else
for(;i>=0;i--)
cout<<str_3[i];
cout<<endl;
}
return 0;
}
/*
int main()
{
const int MAX_LEN = 250;
unsigned an1[MAX_LEN];
unsigned an2[MAX_LEN];
char seLine1[MAX_LEN + 1];
char seLine2[MAX_LEN + 1];
cin.getline(seLine1, MAX_LEN + 1);
cin.getline(seLine2, MAX_LEN + 1);
int nLen1 = strlen(seLine1);
int nLen2 = strlen(seLine2);
memset(an1, 0, sizeof(an1));
memset(an2, 0,sizeof(an2));
int i, j=0;
for (i = nLen1-1; i>=0; i--)
an1[j++] = seLine1[i] - '0'; //???????????????
j=0;
for (i = nLen2-1; i>=0;i--)
an2[j++] = seLine2[i] - '0';
for (i = 0; i < MAX_LEN ;i++)
{
an1[i] += an2[i];
if(an1[i] >= 10) //??????
{
an1[i] -=10;
an1[i + 1]++; // i++?
}
}
i = MAX_LEN - 1;
for(;i>=0;i--)
if(an1[i]!=0)
break; //???????0??
if(i==-1)
cout<<0<<endl;
else
{
for(;i >= 0; i--)
cout << an1[i]; //??????
cout << endl;
}
return 0;
}*/
|
32
|
15823
|
/* Note:Your choice is C IDE */
main()
{
void minus(char a[999],char b[999]);
char a[999],b[999];
int n,i,z;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",a,b);
minus(a,b);
}
}
void minus(char a[999],char b[999])
{
int x,y,w;
x=strlen(a);
y=strlen(b);
for(w=x-1;w>=x-y;w--)
{
if(a[w]>=b[w-x+y])
{
a[w]=a[w]-b[w-x+y];
}
else
{
a[w-1]--;
a[w]=a[w]+10-b[w-x+y];
}
}
for(w=0;w<=x-1;w++)
{
if(a[w]==0) continue;
else break;
}
for(w=w;w<=x-y-1;w++)
printf("%c",a[w]);
for(w=x-y;w<=x-1;w++)
printf("%d",a[w]);
printf("\n");
}
|
32
|
15824
|
void main()
{
int i,j,n,k,t;
char c[100][100]={""},a[100]={""},b[100]={""};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
k=strlen(a);
t=strlen(b);
for(;k>0;k--,t--)
{
if(t<=0) c[i][k-1]=a[k-1];
else if(a[k-1]>=b[t-1])
c[i][k-1]=a[k-1]-b[t-1]+48;
else if(a[k-1]<b[t-1])
{
c[i][k-1]=a[k-1]-b[t-1]+58;
a[k-2]--;
}
}
}
for(i=0;i<n;i++)
{
for(j=0;;j++)
if(c[i][j]!='0') break;
printf("%s\n",c[i]+j);
}
}
|
32
|
15825
|
void moin(char a[][100],char b[][100],int k)
{
int c,d,e,f,i,j;
char x[10][100];
c=strlen(a[k]); d=strlen(b[k]); e=0;
for(i=c-1;i>=c-d;i--)
{f=(a[k][i]-48)-(b[k][i-c+d]-48)+e;
if(f>=0) e=0;
else {e=-1;f=f+10;}
x[k][i]=f+48;}
for(i=c-d-1;i>=0;i--)
{f=a[k][i]-48+e;
if(f>=0) e=0;
else {e=-1;f=f+10;}
x[k][i]=f+48;}
for(i=0;x[k][i]=='0';i++);
for(j=i;j<=c-1;j++)
printf("%c",x[k][j]);
printf("\n");
}
int main()
{
int n,i;
char a[10][100],b[10][100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{scanf("%s%s",a[i],b[i]);
printf("\n");}
for(i=0;i<=n-1;i++)
moin(a,b,i);
return(0);
}
|
32
|
15826
|
int main()
{
int n, m; // ????????n?????n
const int MAX_LEN = 100;
cin >> n;
cin.get(); // ????n????
for(m = 0 ; m < n ; m++)
{
int a[MAX_LEN + 1], b[MAX_LEN];
char str1[MAX_LEN + 1], str2[MAX_LEN + 1]; // ????????????
cin.getline(str1,MAX_LEN + 1); //???????
cin.getline(str2,MAX_LEN + 1);
int len1 = strlen(str1), len2 = strlen(str2); // ????????
memset(a,0,sizeof(a)); // ??????
memset(b,0,sizeof(b));
int i, 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 < MAX_LEN ; i++) // ????
{
a[i] -= b[i];
if(a[i] < 0)
{
a[i] += 10;
a[i + 1]--;
}
}
i = MAX_LEN; // ??????????
while(a[i] == 0)
{
i--;
}
for(; i >= 0 ; i--) // ????????
cout << a[i];
cout << endl;
cin.get();
}
return 0;
}
|
32
|
15827
|
int main()
{
int n, i, j, k, lenth1, lenth2,count;
int num1[101], num2[101];
char str1[101], str2[101];
cin >> n;
// ??/n
for(count = 1; count <= n; count++) //?????
{
cin.get();
cin.getline(str1, 101); //???????1
cin.getline(str2, 101); //?????2
lenth1 = strlen(str1); //????
lenth2 = strlen(str2);
memset(num1, 0, sizeof(num1)); //???????
memset(num2, 0, sizeof(num2));
k = 0;
for(j = lenth1 - 1; j >= 0; j--)
{
num1[k++] = str1[j] -'0'; //???????????
}
k = 0;
for(j = lenth2 - 1; j>=0; j--)
{
num2[k++] = str2[j] - '0';
}
for(k = 0; k < lenth1; k++)
{
if(num1[k] < num2[k]) //???????????
{
num1[k] += 10;
num1[k+1]--;
}
num1[k] -= num2[k];
}
i = 100;
while(num1[i] == 0)i--; //?????????????
for(; i >= 0; i--)
cout << num1[i];
cout << endl;
}
return 0;
}
|
32
|
15828
|
int main()
{
int n,i,j,k,str1[100]={0},str2[100]={0},len1,len2;
char a[100]={0},b[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a,b);
len1=strlen(a),len2=strlen(b);
k=0;
for(j=len1-1;j>=0;j--)
{
str1[k++]=a[j]-'0';
}
k=0;
for(j=len2-1;j>=0;j--)
{
str2[k++]=b[j]-'0';
}
for(j=0;j<len1;j++)
{
str1[j]-=str2[j];
if(str1[j]<0)
{
str1[j]+=10;
str1[j+1]--;
}
}
for(j=len1-1;j>=0;j--)
printf("%d",str1[j]);
printf("\n");
for(j=0;j<100;j++)
{
str1[j]=0;
}
for(j=0;j<100;j++)
{
str2[j]=0;
}
for(j=0;j<100;j++)
{
a[j]=0;
}
for(j=0;j<100;j++)
{
b[j]=0;
}
}
return 0;
}
|
32
|
15829
|
int main()
{
int n,i,j,k,l,tem;
char a[100][1000],b[100][1000];
int c[100][1000];
cin>>n;
for(i=0;i<n;i++)
{
cin.get();
cin.get(a[i],900);
cin.get();
cin.get(b[i],900);
cin.get();
for(j=strlen(a[i])-1;j>=strlen(a[i])-strlen(b[i]);j--)
{
c[i][j]=a[i][j]-b[i][j-strlen(a[i])+strlen(b[i])];
if(c[i][j]<0)
{
c[i][j]=c[i][j]+10;
a[i][j-1]=a[i][j-1]-1;
}
}
for(j>=strlen(a[i])-strlen(b[i])-1;j>=0;j--)
{
c[i][j]=a[i][j]-'0';
}
for(j=0;j<strlen(a[i]);j++)
{
if(c[i][j]!=0)
{
tem=j;
break;
}
}
for(j=tem;j<strlen(a[i]);j++)
{
cout<<c[i][j];
}
cout<<endl;
}
}
|
32
|
15830
|
char a[100],b[100];int c[100];
int main()
{
//freopen("1.in","r",stdin);
//freopen("1.out","w",stdout);
int n;
cin>>n;
while(n--)
{
cin>>a>>b;
int lena=strlen(a);
int lenb=strlen(b);
for(int i=0;i<lena/2;i++)
{
char t=a[i];
a[i]=a[lena-1-i];
a[lena-1-i]=t;
}
for(int i=0;i<lenb/2;i++)
{
char t=b[i];
b[i]=b[lenb-1-i];
b[lenb-1-i]=t;
}
for(int i=0;i<lenb;i++)
c[i]=a[i]-b[i];
for(int i=lenb;i<lena;i++)
c[i]=a[i]-'0';
for(int i=0;i<lena-1;i++)
if(c[i]<0) {
c[i]=10+c[i];
c[i+1]-=1;
}
for(int i=lena-1;i>=0;i--)
{
if(c[i]!=0)
{
for(int j=i;j>=0;j--)
cout<<c[j];
cout<<endl;
break;
}
}
}
return 0;
}
|
32
|
15831
|
int main()
{
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++){
char a[101]={'0'},b[101]={'0'};
scanf("%s\n%s",a,b);
int lena,lenb;
lena=strlen(a);
lenb=strlen(b);
int na[101]={0},nb[101]={0},nc[101]={0};
int curr;
for(curr=0;curr<lena;curr++){
na[curr]=a[lena-1-curr]-'0';
}
for(curr=0;curr<lenb;curr++){
nb[curr]=b[lenb-1-curr]-'0';
}
int r=0;
for(curr=0;curr<lena;curr++){
if(na[curr]-r>=nb[curr]){
nc[curr]=na[curr]-r-nb[curr];
r=0;
}
else{
nc[curr]=na[curr]-r+10-nb[curr];
r=1;
}
}
printf("\n");
if(nc[lena-1]!=0)printf("%d",nc[lena-1]);
for(curr=lena-2;curr>=0;curr--)printf("%d",nc[curr]);
}
return 0;
}
|
32
|
15832
|
void main()
{
int i,j,n,p,q;
char a[101],b[101],c[20][101],*s,d[5];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a,b);
gets(d);
for(j=0;j<(p=strlen(a));j++)
{
if(j<(q=strlen(b)))
{
if(a[p-1-j]<b[q-j-1])
{
c[i][p-1-j]=10+a[p-1-j]-b[q-j-1]+'0';
a[p-2-j]--;
}
else c[i][p-j-1]=a[p-1-j]-b[q-j-1]+'0';
}
else
{
if(a[p-1-j]<'0')
{
c[i][p-j-1]=10+a[p-1-j];
a[p-j-2]--;
}
else c[i][p-j-1]=a[p-1-j];
}
c[i][p]='\0';
}
}
for(i=0;i<n;i++)
{
for(j=0;j<p;j++)
{
if(c[i][j]!='0')
{
s=&c[i][j];break;
}
}
printf("%s\n",s);
}
}
|
32
|
15833
|
main()
{
char a[100][100]={0},b[100][100]={0};
int n,m,i,j,c[100][100],k,l;
scanf("%d",&k);
for(l=0;l<k;l++)
{
scanf("%s",a[l]);
//printf("Now input b:\n");
scanf("%s",b[l]);
}
printf("\n");
for(l=0;l<k;l++)
{
n=strlen(a[l]);
m=strlen(b[l]);
for(i=n-1,j=m-1;i>=0;i--,j--)
{
if(j>=0)
{
c[l][i]=a[l][i]-b[l][j];
if(c[l][i]<0)
{
c[l][i]+=10;
a[l][i-1]-=1;
}
}
else
c[l][i]=a[l][i]-'0';
}
//printf("The result is:\n");
for(i=0;i<n;i++)
printf("%d",c[l][i]);
printf("\n");
}
return 0;
}
|
32
|
15834
|
int main()
{
int a,b,i,j,n,m;
char ss1[100],ss2[100];
int s1[100],s2[100],s3[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",ss1);
scanf("%s",ss2);
a=strlen(ss1);
b=strlen(ss2);
for(j=0;j<100;j++)
{
s1[j]=ss1[j]-48;
s2[j]=ss2[j]-48;
}
for(j=b-1;j>=0;j--)
{
s2[j+a-b]=s2[j];
}
for(j=0;j<a-b;j++)
{
s2[j]=0;
}
for(j=a-1;j>=0;j--)
{
if(s1[j]>=s2[j])
s3[j]=s1[j]-s2[j];
else
{
s3[j]=10+s1[j]-s2[j];
s1[j-1]=s1[j-1]-1;
}
}
for(j=0;j<a;j++)
{
if(s3[j]!=0)
m=1;
if(m==1)
printf("%d",s3[j]);
}
printf("\n");
m=0;
}
return 0;
}
|
32
|
15835
|
void main()
{
struct num
{
char a[100],b[100];
}jian[100];
int n,j,i,m,l,p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",jian[i].a,jian[i].b);
m=strlen(jian[i].a);
l=strlen(jian[i].b);
for(j=m-1,p=l-1;j>=m-l,p>=0;j--,p--)
{
jian[i].a[j]=48+jian[i].a[j]-jian[i].b[p];
if (jian[i].a[j] <48)
{
jian[i].a[j] +=10;
jian[i].a[j-1]--;
}
}
}
for(i=0;i<n;i++)
printf("%s\n",jian[i].a);
}
|
32
|
15836
|
char *minus(char *a,char *b)
{
char *c;
int m,n;
int i=0,j=0,k=0;
m=strlen(a);
n=strlen(b);
c=(char *)malloc(sizeof(char)*N);
k=N-1;
c[k]=0;
k--;
i=m-1;
for(j=n-1;j>=0;j--){
if(a[i]>=b[j]){
c[k]=a[i]-b[j]+'0';
}
else{
c[k]=a[i]-b[j]+10+'0';
a[i-1]=a[i-1]-1;
}
k--;
i--;
}
while(i>=0){
c[k]=a[i];
k--;
i--;
}
return c+k+1;
}
void main()
{
char **s1,**s2,**s3;
int n=0,i=0;
scanf("%d",&n);
s1=(char **)malloc(sizeof(char *)*n);
s2=(char **)malloc(sizeof(char *)*n);
s3=(char **)malloc(sizeof(char *)*n);
while(i<n){
s1[i]=(char *)malloc(sizeof(char)*N);
s2[i]=(char *)malloc(sizeof(char)*N);
scanf("%s",s1[i]);
scanf("%s",s2[i]);
printf("\n");
s3[i]=minus(s1[i],s2[i]);
i++;
}
for(i=0;i<n;i++){
puts(s3[i]);
}
}
|
32
|
15837
|
void main()
{
int m1,m2,n,k=1,p,i;
char a[100],b[100],c[100],d[100];
scanf("%d",&n);
while(k<=n)
{
scanf("%s",a);
scanf("%s",b);
k++;
m1=strlen(a);m2=strlen(b);
for(i=0;i<=m1;i++)
a[i]=a[i]-48;
for(i=0;i<=m2;i++)
b[i]=b[i]-48;
p=m1-m2;
for(i=0;i<m2;i++) c[i+p]=b[i];
for(i=0;i<p;i++) c[i] = 0;
for(i=m1-1;i>=0;i--)
{
if(a[i]>=c[i]) d[i]=a[i]-c[i];
else
{
d[i]=a[i]+10-c[i]; a[i-1]=a[i-1]-1;
}
}
for(i=0;i<m1;i++)
printf("%d",d[i]);
printf("\n");
}
}
|
32
|
15838
|
void main()
{
int n,i,j,la,lb,m;
char a[1000],b[1000],c[1000];
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
la=strlen(a);
lb=strlen(b);
for(j=la-1;j>=0;j--)
{
if(j>=la-lb)
{
if(a[j]>=b[j-la+lb]) c[j]=a[j]-b[j-la+lb]+48;
else if(a[j]<b[j-la+lb])
{
c[j]=10+a[j]-b[j-la+lb]+48;
a[j-1]=a[j-1]-1;
}
}
else c[j]=a[j];
}
c[la]=0;
for(j=0;j<la;j++)
if(c[j]!=48){m=j;break;}
for(j=m;j<la;j++)
printf("%c",c[j]);
printf("\n");
}
}
|
32
|
15839
|
int main()
{
char str1[102], str2[102];
int result[102];
int n,i,j,k;
scanf("%d", &n);
for(i = 0; i < n; i++)
{
scanf("%s%s", str1, str2);
int borrow = 0;
int len1 = strlen(str1);
int len2 = strlen(str2);
int len;
len = len1;
for(j=len2-1; j>=0;j--)
{
str2[j + len1 - len2] = str2[j];
}
for(j=0;j<len1-len2;j++)
{
str2[j] = '0';
}
for(k = len - 1; k >= 0; k--)
{
int temp = (str1[k] - '0') - (str2[k] - '0') - borrow;
if(temp < 0)
{
borrow = 1;
result[k] = temp + 10;
}
else
{
borrow = 0;
result[k] = temp;
}
}
int k;
for(k=0; result[k] == 0; k++);
for(k=0;k<len; k++)
{
printf("%d", result[k]);
}
printf("\n");
}
return 0;
}
|
32
|
15840
|
void main()
{
int times,i,j,lena,lenb;
char a[1000],b[1000],c[2];
scanf("%d\n",×);
for(j = 0;j<times;j++)
{
gets(a);
gets(b);
gets(c);
lena = strlen(a);
lenb = strlen(b);
for(i = 1;i<=lenb;i++)
a[lena-i] -= b[lenb-i]-48;
for(i = lena-1;i>0;i--)
{
if(a[i]<'0')
{
a[i] += 10;
a[i-1]--;
}
}
printf("%s\n",a);
}
}
|
32
|
15841
|
/*
* ????BigIntegerSubtraction.cpp
* ?????????????
* Created on: 2010-12-25
* Author: ???
*/
int main()
{
int n;
char a[100],b[100];
char d[100],e[100];
int f[100];
int i,j,k;
int p,q;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(f,0,sizeof(f));
memset(d,0,sizeof(d));
memset(e,0,sizeof(e));
cin>>n;
gets(a);
for(k=1;k<=n;k++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(f,0,sizeof(f));
memset(d,0,sizeof(d));
memset(e,0,sizeof(e));
cin>>a;
cin>>b;
p=strlen(a);
q=strlen(b);
for(j=0;j<p;j++)
d[j]=a[p-1-j];
for(j=0;j<q;j++)
e[j]=b[q-1-j];
for(i=0;i<q;i++)
{
if(d[i]>=e[i])
f[i]=d[i]-e[i];
else
{
f[i]=10+d[i]-e[i];
d[i+1]=d[i+1]-1;
}
}
for(;i<p;i++)
f[i]=d[i]-'0';
for(i=99;i>=0;i--)
{
if(f[i]!=0)
break;
}
for(;i>=0;i--)
cout<<f[i];
cout<<endl;
}
return 0;
}
|
32
|
15842
|
void main()
{
int a[100],b[100],n,l,m,i,j;
char c[101],d[101];
scanf("%d",&n);
while(n--)
{
scanf("%s%s",c,d);
l=strlen(c);
m=strlen(d);
for(i=0;i<l;i++)
a[i]=c[i]-'0';
for(j=0;j<m;j++)
b[j+l-m]=d[j]-'0';
for(i=l-1;i>=l-m;i--)
{
a[i]=a[i]-b[i];
if(a[i]<0)
{
a[i]+=10;
a[i-1]--;
}
}
while(a[i]<0&&i>0)
{
a[i]+=10;
i--;
a[i]--;
}
for(j=0;j<l;j++)
if(a[j]!=0)
break;
for(i=j;i<l;i++)
printf("%d",a[i]);
printf("\n");
}
}
|
32
|
15843
|
void calc()
{ const int MAX_LEN = 200;
int an1[MAX_LEN]; int an2[MAX_LEN];
char seLine1[MAX_LEN + 1]; char seLine2[MAX_LEN + 1];
//cout << "please input two integers" << endl;
cin >> seLine1;
cin >> seLine2;
int nLen1 = strlen(seLine1);
int nLen2 = strlen(seLine2);
memset(an1, 0, sizeof(an1));
memset(an2, 0, sizeof(an2));
int i, j=0;
for (i = nLen1-1; i>=0; i--)
an1[j++] = seLine1[i] - '0';
j=0;
for (i = nLen2-1; i>=0;i--)
an2[j++] = seLine2[i] - '0';
for (i = 0; i < nLen1 ;i++)
{
//printf("%d\n", an1[i]);
an1[i] -= an2[i];
if(an1[i] < 0)
{
an1[i] +=10;
an1[i + 1]--;
}
}
i = nLen1 - 1;
while(i > 0 && an1[i]==0) i--;
//printf("%d\n", i);
for(;i >= 0; i--)
cout << an1[i];
cout << endl;
}
int main()
{
int n;
cin >> n;
while (n --)
calc();
}
|
32
|
15844
|
void main()
{
char a[101],b[101];
int i,j,t=0,A,B,k,n;
scanf("%d",&n);
for(k=1;k<=n;k++){t=0;
scanf("%s",a);
scanf("%s",b);
for(i=0;i<=100;i++)
{
if(a[i]==0)break;
else a[i]=a[i]-'0';
}A=i-1;
for(i=0;i<=100;i++)
{
if(b[i]==0)break;
else b[i]=b[i]-'0';
}B=i-1;
for(i=B;i>=0;i--)
{
if(a[A-B+i]>=b[i])a[A-B+i]=a[A-B+i]-b[i];
else {a[A-B+i]=a[A-B+i]-b[i]+10;a[A-B+i-1]=a[A-B+i-1]-1;}
}
for(j=0;j<=A;j++)
{
if(a[j]!=0)break;
else t++;
}
if(t==0)for(i=0;i<=A;i++){if(i==A)printf("%d\n",a[i]);else printf("%d",a[i]);}
else for(i=0;i<=A-t;i++){if(i==A-t)printf("%d\n",a[i+t]);else printf("%d",a[i]);}
}
}
|
32
|
15845
|
int main()
{
int a[100],b[100],temp;
int n=0;
n=getchar()-48;
while ((temp=getchar())!=10) n=n*10+temp-48;
int i=0,j;
int ca=0,cb=0;
for(int k=1;k<=n;k++)
{
ca=0;cb=0;
while ((temp=getchar())!=10) {a[ca]=temp-48;ca++;}
ca--;
while ((temp=getchar())!=10) {b[cb]=temp-48;cb++;}
cb--;
for(i=cb;i>=0;i--) {a[ca-cb+i]-=b[i];}
for(i=ca;i>=1;i--) if(a[i]<0) {a[i]+=10;a[i-1]-=1;}
i=0;
while(a[i]==0) i++;
for(j=i;j<=ca;j++) cout<<a[j]; cout<<"\n";
if(k!=n) temp=getchar();
}
}
|
32
|
15846
|
void main()
{
char a[100][100],b[100][100],c[100][100]={'\0'},enter;
int i,j,k,n,m,len1,len2;
scanf("%d",&n);
scanf("%s%s",a[0],b[0]);
for(i=1;i<n;i++)
{
scanf("%s%s",a[i],b[i]);
}
for(i=0;i<n;i++)
{
len1=strlen(a[i]);
len2=strlen(b[i]);
for(j=0;j<len1;j++)
c[i][j]='0';
for(j=0;j<len2;j++)
{
c[i][j+len1-len2]=b[i][j];
}
for(j=len1-1;j>=0;j--)
{
if(c[i][j]<=a[i][j])a[i][j]=a[i][j]-c[i][j]+'0';
else
{
a[i][j]=a[i][j]-c[i][j]+'0'+10;
a[i][j-1]--;
}
}
printf("%s\n",a[i]);
}
}
|
32
|
15847
|
int minus(char str2[]);
int main()
{
int n,k;
char str2[100][100]={'\0'};
scanf("%d",&n);
for(k=0;k<n;k++)
minus(str2[k]);
for(k=0;k<n;k++)
printf("%s\n",str2[k]);
return 0;
}
int minus(char str2[])
{
int len1,len2,i;
char str[2][100]={'\0'};
scanf("%s%s",str[0],str[1]);
len1=strlen(str[0]);
len2=strlen(str[1]);
for(i=len1-1;i>=len1-len2;i--)
{
if(str[0][i]>=str[1][i-len1+len2])
{
str[0][i]=str[0][i]-str[1][i-len1+len2]+48;
}
else
{
str[0][i-1]=str[0][i-1]-1;
str[0][i]=str[0][i]-str[1][i-len1+len2]+58;
}
}
for(i=0;i<len1;i++)
{str2[i]=str[0][i];}
return 0;
}
|
32
|
15848
|
void main()
{
char a[200],b[200];
int n,i,k,p,q;
int g=0;//????
int cn;
char c[200];
scanf("%d",&n);
for(k=0;k<n;k++)
{
scanf("%s %s",a,b);
p=strlen(a);
q=strlen(b);
for(i=0;i<=q;i++)
{
b[p-i]=b[q-i];
}
for(i=i;i<=p;i++)
{
b[p-i]='0';
}
for(i=p-1;i>=0;i--)
{
if((a[i]-g)>=b[i])
{
cn=a[i]-'0'-b[i]+'0'-g;
g=0;
c[i]=cn+'0';
}
else
{
cn=a[i]-b[i]-g+10;
g=1;
c[i]=cn+'0';
}
}
for(i=0;i<p;i++)
{
if(c[i]!='0')
{
printf("%c",c[i]);
break;
}
}
for(i=i+1;i<p;i++)
{
printf("%c",c[i]);
}
printf("\n");
}
}
|
32
|
15849
|
int main()
{
int n;
char a[108];
char b[108];
char c[108];
int i, j, k;
int la, lb;
int bit;
cin >> n;
for(k = 0; k < n; k ++)
{
cin >> a >> b;
bit = 0;
la = strlen(a);
lb = strlen(b);
for(i = la - 1; i >= la - lb; i --)
{
if(a[i] - b[i - la + lb] - bit >= 0)
{
c[i] = a[i] - b[i - la + lb] - bit + '0';
bit = 0;
}
else
{
c[i] = a[i] - b[i - la + lb] - bit + 10 + '0';
bit = 1;
}
}
c[la - lb - 1] = a[la - lb - 1] - bit;
for(i = 0; i < la - lb - 1; i ++)
c[i] = a[i];
c[la] = '\0';
cout << c << endl;
}
return 0;
}
|
32
|
15850
|
int main()
{ int i,j,k;
char a[101]={'\0'},b[101]={'\0'},c[101]={'\0'};
int m[100]={0},n[100]={0},ans[100]={0},counter;
cin>>k;
for(counter=0;counter<k;counter++)
{
gets(a);
gets(a);
// puts(a);
gets(b);
// puts(b);
for(j=0;a[j]!='\0';j++)
{
m[j]=a[j]-48;
}
int m_c=j-1;
for(j=0;b[j]!='\0';j++)
{
n[j]=b[j]-48;
}
int n_c=j-1; //??????????????m_c+1?n_c+1?????????
for(i=0;i<=m_c;i++) //??m?n?????????????????????????????
{
if(i<=n_c)
{
if(m[m_c-i]>=n[n_c-i])
ans[i]=m[m_c-i]-n[n_c-i];
else { ans[i]=m[m_c-i]+10-n[n_c-i]; m[m_c-i-1]=m[m_c-i-1]-1;}
}
else
{
ans[i]=m[m_c-i];
}
}
for(i=0;i<=m_c;i++)
{
cout<<ans[m_c-i];
} cout<<'\n';
}
}
|
32
|
15851
|
void main()
{
int n,i,c,j,k,m;
char a[100][100],b[100][100],d[100][100];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%s %s",a[i],b[i]);
for(i=1;i<=n;i++)
{
c=strlen(a[i])-strlen(b[i]);
for(j=strlen(b[i]);j>=0;j--)
b[i][j+c]=b[i][j];
for(k=0;k<c;k++)
b[i][k]='0';
}
for(i=1;i<=n;i++)
{
for(m=(strlen(a[i])-1);m>=0;m--)
{
if(a[i][m]>=b[i][m])
d[i][m]=a[i][m]-b[i][m]+48;
if(a[i][m]<b[i][m])
{
d[i][m]=a[i][m]-b[i][m]+58;
a[i][m-1]=a[i][m-1]-1;
}
}
d[i][strlen(a[i])]='\0';
}
for(i=1;i<=n;i++)
printf("%s\n",d[i]);
}
|
32
|
15852
|
void main()
{
int l1[25],l2[25],n,w,z,q,i,d,k,j;
/* int t;
char c[101]
*/ char c1[25][101],c2[25][101],a[25][101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c1[i]);
l1[i]=strlen(c1[i]);
scanf("%s",c2[i]);
l2[i]=strlen(c2[i]);
d=l1[i]-l2[i];
for(w=l2[i];w<l1[i]-1;w++)
c2[i][w]='0';
c2[i][l1[i]-1]='\0';
q=0;
c2[i][l1[i]]='\0';
c2[i][l1[i]-1]='0';
while(q!=d)
{
for (z=l1[i];z>0;z--)
{
c2[i][z]=c2[i][z-1];
}
c2[i][0]=c2[i][l1[i]];
q++;
}
c2[i][l1[i]]='\0';
for(k=l1[i]-1;k>=0;k--)
{
if(c1[i][k]>=c2[i][k])
a[i][k]=c1[i][k]-c2[i][k]+48;
else
{
a[i][k]=c1[i][k]+10-c2[i][k]+48;
c1[i][k-1]=c1[i][k-1]-1;
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<l1[i];j++)
printf("%c",a[i][j]);
printf("\n");
}
}
|
32
|
15853
|
void main()
{
int n,i,j,a[101][101],len1[101],len2;
char str1[101],str2[101],str3[101],Tempstr2[101];
scanf("%d\n",&n);
for(j=0;j<n;j++)
{
gets(str1);
gets(str2);
if(j!=n-1)
gets(str3);
len1[j]=strlen(str1);
len2=strlen(str2);
for(i=0;i<len1[j]-len2;i++)
Tempstr2[i]='0';
for(;i<len1[j];i++)
Tempstr2[i]=str2[i-(len1[j]-len2)];
for(i=0;i<len1[j];i++)
a[j][i]=str1[i]-Tempstr2[i];
for(i=len1[j]-1;i>=0;i--){
if(a[j][i]<0){
a[j][i]+=10;
a[j][i-1]-=1;
}
}
}
for(j=0;j<n;j++){
for(i=0;i<len1[j];i++)
if(a[j][i]!=0)
break;
for(;i<len1[j];i++)
printf("%d",a[j][i]);
printf("\n");
}
}
|
32
|
15854
|
//******************************************************
//* ? ? ? ?? ? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 11 ? 17 ? *
//* ? ? ?1000010185 *
//******************************************************
int main()
{
char aa[101], bb[101]; //?????????
int a[101], b[101], c[101];
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;
for (int j = 0; j < lb; j ++)
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
|
15855
|
//**************************
//*???????? **
//*?????? **
//*???20131114 **
//**************************
int main ()
{
int n ,i , j ,k ,nLen1 ,nLen2 ,num1 ,num2;
int a[101] ,b[101] ,c[101];
char str1[101], str2[101];
cin >> n;
for(i = 1; i <= n ;i++)
{
memset(str1,0,sizeof(str1));
memset(str2,0,sizeof(str2));
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
nLen1 = 0;
nLen2 = 0;
num1 = 0;
num2 = 0;
cin >> str1 >> str2;
nLen1 = strlen(str1);
nLen2 = strlen(str2);
for(j = nLen1 - 1; j >= 0; j--)
a[num1++] = str1[j] - '0';
for(k = nLen2 - 1; k >= 0; k--)
b[num2++] = str2[k] - '0';
for(int t = 0; t <= nLen2 - 1; t++)
{
if(a[t] >= b[t])
c[t] = a[t] - b[t];
else
{
c[t] = a[t] - b[t] + 10;
a[t+1] -= 1;
}
}
for(int q = nLen2; q <= nLen1 - 1; q++)
c[q] = a[q];
for(int l = nLen1 - 1; l >= 0; l--)
cout << c[l];
cout << endl;
}
return 0;
}
|
32
|
15856
|
void main()
{
char str1[100],str2[100],c;
int n,k,t,i,j,a,q;
scanf("%d",&n);
for(i=1;i<=n;i++)
{ scanf("\n");
for(j=0;(c=getchar())!='\n';j++)
str1[j]=c;
j--;
for(k=0;(c=getchar())!='\n';k++)
str2[k]=c;
k--;
for(t=j;t>=0;t--)
{
if(t>=j-k)
str2[t]=str2[t-j+k];
else str2[t]='0';
}
for(a=j;a>=0;a--)
{
if(str2[a]>str1[a])
{
str2[a]=str1[a]+10-str2[a]+'0';
str1[a-1]=str1[a-1]-1;
}
else
str2[a]=str1[a]-str2[a]+'0';
}
for(q=0;q<=j;q++)
printf("%c",str2[q]);
printf("\n");
}
}
|
32
|
15857
|
void main()
{
int n,i,l[2],k;
char a[100][100],b[100][100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %s",a[i],b[i]);
if (i-n+1) printf("\n");
}
for (i=0;i<n;i++)
{
l[0]=strlen(a[i]);
l[1]=strlen(b[i]);
for (k=1;k<l[1]+1;k++)
{
a[i][l[0]-k]=48+(int)a[i][l[0]-k]-(int)b[i][l[1]-k];
if(a[i][l[0]-k]<48){a[i][l[0]-k]+=10;a[i][l[0]-k-1]=(int)a[i][l[0]-k-1]-1;}
}
for(k=0;k<strlen(a[i]);k++) if(a[i][0]!=48) printf("%c",a[i][k]);else {printf("%c",a[i][k+1]);if (k==strlen(a[i])-2) break;}
printf("\n");
}
}
|
32
|
15858
|
int main()
{
int n,i=0,j=0,c=0,l,k=0;
scanf("%d" ,&n);
char *** ppp;
ppp=(char ***)malloc(n*sizeof(char **));
for(i=0;i<n;i++)
{
ppp[i]=(char **)malloc(2*sizeof(char *));
for(j=0;j<2;j++)
{
ppp[i][j]=(char *)malloc(101*sizeof(char));
}
}
for(i=0;i<n;i++)
{
for(j=0;j<2;j++)
{
scanf("%s" ,ppp[i][j]);
l=strlen(ppp[i][j]);
for(k=0;k<=l;k++) //???
{
ppp[i][j][100-k]=ppp[i][j][l-k];
}
for(k=0;k<100-l;k++)
{
ppp[i][j][k]='0';
}
}
}
for(i=0;i<n;i++)
{
for(k=99;k>=1;k--)
{
//ppp[i][0][k-1] = ppp[i][0][k-1]-1;
c=ppp[i][0][k]-ppp[i][1][k];
//printf("%d\n" ,c);
if(c>=0)
ppp[i][0][k]=c+'0';
else
{
ppp[i][0][k]=c+'0'+10;
ppp[i][0][k-1]--;
}
}
for(k=0;k<100;k++)
{
if(ppp[i][0][k]>'0')
{
c=k;
break;
}
}
for(k=c;k<100;k++)
{
printf("%c" ,ppp[i][0][k]); //?0?
}
printf("\n");
}
for(i=0;i<n;i++)
{
for(j=0;j<2;j++)
{
free(ppp[i][j]);
}
free(ppp[i]);
}
free(ppp);
}
|
32
|
15859
|
void main()
{
int n,j[100][2],i,a[100][100]={0},b,c[100][100]={0},d,p,q,r;
char e[100][100],f[100][100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",&e[i]);
scanf("%s",&f[i]);
}
for (i=0;i<n;i++)
{
j[i][0]=strlen(e[i]);
j[i][1]=strlen(f[i]);
for (p=0;p<j[i][0];p++)
a[i][p]=e[i][j[i][0]-p-1]-48;
for (p=0;p<j[i][1];p++)
c[i][p]=f[i][j[i][1]-p-1]-48;
}
for (i=0;i<n;i++)
{
for(d=0;d<j[i][0];d++)
{
if (a[i][d]>=c[i][d])
a[i][d]-=c[i][d];
else
{
a[i][d]=a[i][d]-c[i][d]+10;
a[i][d+1]--;
}
}
}
for (i=0;i<n;i++)
{
for(d=j[i][0]-1,r=0;d>=0;d--)
{
if (a[i][d]!=0)
r++;
if (r!=0)
printf("%d",a[i][d]);
}
printf("\n");
}
}
|
32
|
15860
|
main()
{char a[200]={'\0'},b[200]={'\0'};
int time,r,i,s,t,u;
scanf("%d",&time);
for(r=1;r<=time;r++)
{
scanf("%s\n%s",a,b);
t=strlen(b);
u=strlen(a);
for(i=t-1;i>=0;i--)
b[i+u-t]=b[i];
for(i=0;i<u-t;i++)
b[i]='0';
for(i=u-1;i>=0;i--)
{if(a[i]>=b[i])a[i]=a[i]-b[i]+'0';
else {a[i]=a[i]-b[i]+'0'+10;a[i-1]--;}
}
s=0;
for(i=0;i<u;i++)
{if(a[i]=='0')s++;
else break;}
for(i=s;i<u;i++)
printf("%c",a[i]);
printf("\n");
}
}
|
32
|
15861
|
int main()
{
int i, j, n, k, lena, lenb, pos;
char a[101], b[101];
cin >> n;
for(k = 1; k <= n; k++)
{
cin.get();
if(i >= 2)
cout << endl;
cin.getline(a, 101);
cin.getline(b, 101);
lena = strlen(a);
lenb = strlen(b);
int numa[100]={0};
int numb[100]={0};
j = 0;
for(i = lena - 1; i >= 0; i--)
numa[j++] = a[i] - '0';
j = 0;
for(i = lenb - 1; i >= 0; i--)
numb[j++] = b[i] - '0';
for(i = 0; i < lena; i++)
{
numa[i] = numa[i] - numb[i];
if(numa[i] < 0)
{
numa[i] += 10;
numa[i + 1]--;
}
}
i = lena - 1;
while(numa[i] != 0)
{
pos = i;
break;
}
for(i = pos; i >= 0; i--)
cout << numa[i];
cout << endl;
}
return 0;
}
|
32
|
15862
|
void main()
{
int n,k,c;
char string[500][300];
int i,d1,d2,d;
char str[2][300];
char t[10];
scanf("%d",&n);
for (k=0;k<n;k++)
{
gets(t); //??????????gets(t)???????????????
for (i=0;i<2;i++)
{
gets(str[i]);
}
d1=strlen(str[0]);
d2=strlen(str[1]);
d=d1-d2;
for (i=0;i<d2;i++) //???????d2???d1
str[1][d1-1-i]= str[1][d2-1-i];
for (i=0;i<d;i++)
str[1][i]='0';
str[1][d1]='\0';
c=0;
for (i=d1-1;i>=0;i--) { //??????????????????????????????
int k1 = (int)(str[0][i]-'0'); //?????????????????
int k2 = (int)(str[1][i]-'0');
if ((k1-c)<(k2)) {
string[k][i]= (char)((k1 +10 - c - k2) + 48);
c=1;
}else {
string[k][i]= (char)((k1 - c - k2) + 48);
c=0;
}
}
string[k][d1]='\0';
}
for (k=0;k<n;k++)
printf("%s\n",string[k]);
}
|
32
|
15863
|
int main ()
{
int n,i,c[100][100],j,l1,l2,k;
char l;
scanf("%d",&n);
char a[100][100],b[100][100];
for(i=0;i<n;i++)
{
scanf("%s%s",&a[i],&b[i]);
l1=strlen(a[i]);
l2=strlen(b[i]);
for(j=l1-1;j>=l1-l2;j--)
{
if(a[i][j]>=b[i][j-l1+l2])
{
c[i][j]=a[i][j]-b[i][j-l1+l2];
}
else
{
c[i][j]=a[i][j]+10-b[i][j-l1+l2];
a[i][j-1]=a[i][j-1]-1;
}
}
for(j=l1-l2-1;j>=0;j--)
{
if(a[i][j]==47)
{
a[i][j]=a[i][j]+10;
a[i][j-1]=a[i][j-1]-1;
}
}
for(j=0;j<l1-l2;j++)
{
printf("%d",a[i][j]-48);
}
for(j=l1-l2;j<l1-1;j++)
{
printf("%d",c[i][j]);
}
printf("%d\n",c[i][l1-1]);
}
return 0;
}
|
32
|
15864
|
void main()
{
char a[1000][100],b[1000][100],c[1000][100]={""};
int n,i,j;
int r[1000],l[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a[i],b[i]);
printf("\n");
l[i]=strlen(a[i]);
r[i]=strlen(b[i]);
for(j=0;j<r[i];j++)
{
b[i][l[i]-j-1]=b[i][r[i]-j-1];
}
for(j=0;j<l[i]-r[i];j++)
b[i][j]='0';
for(j=l[i]-1;j>=0;j--)
{
c[i][j]=a[i][j]-b[i][j];
if(c[i][j]<0)
{
a[i][j-1]--;
c[i][j]=c[i][j]+10;
}
c[i][j]=c[i][j]+48;
}
}
for(i=0;i<n;i++)
printf("%s\n",c[i]);
}
|
32
|
15865
|
//***********************************
//*???Nov 13, 2013 - ????? **
//*?????? 1300012719 **
//*???2013.11.16 **
//***********************************
int main()
{
int a[101], b[101], n, i, j, t, lena, start;
char cha[101], chb[101]; //a[],b[]???????????,cha,chb????a,b??????,n?????,t???????????,lena??????,start??????????0????
cin >> n; //??????n???????
cin.get();
for (i = 1; i <= n; i++)
{
cin.getline(cha,100); //??????,??a?b?????,???a????a,b????
cin.getline(chb,100);
lena = strlen(cha);
t = lena - strlen(chb);
for (j = 0; j < lena; j++) //??b??????a???,???a,b??lena??????????????,??b[]???????,??????
{
a[j] = cha[j] - '0';
b[j] = chb[j] - '0';
}
for (j = lena - 1; j >= t; j--) //????????b?a?????,?a??t+1???lena??b??????lena-t???????
{
a[j] = a[j] - b[j - t]; //a??j???b??j-t?,??b[]????????????
if (a[j] < 0) //?????????????????????10
{
a[j] = a[j] + 10;
a[j - 1]--;
}
}
for (j = 0; j < 101; j++)
{
if (a[j])
{
start = j; //????????????????0???
break;
}
}
for (j = start; j < lena; j++) //????????a??
cout << a[j];
cout << endl;
cin.get(); //???????
}
return 0;
}
|
32
|
15866
|
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];
}
printf("%s",s3);
}
return 0;
}
|
32
|
15867
|
int main(int argc, char *argv[])
{
char a[1000]={'\0'},b[1000]={'\0'},c[1000]={'\0'};
int n,i,j,m,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<1000;j++)
{
c[j]='\0';
a[j]='\0';
b[j]='\0';
}
scanf("%s",a);
scanf("%s",b);
for(j=0;j<1000;j++)
{
if(a[j]=='\0')
{
m=j;
break;
}
}
for(j=0;j<1000;j++)
{
if(b[j]=='\0')
{
k=j;
break;
}
}
for(j=0;j<=k-1;j++)
{
c[j]=a[m-j-1]-b[k-j-1]+'0';
}
for(j=k;j<m;j++)
c[j]=a[m-j-1];
for(j=0;j<1000;j++)
{
if(c[j]<'0')
{
c[j]=c[j]+10;
c[j+1]=c[j+1]-1;
}
}
for(j=m;j>=0;j--)
{
if(c[j]>='1'&&c[j]<='9')
break;
}
for(j=j;j>=0;j--)
printf("%c",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15868
|
struct minus
{
char a[N];
char b[N];
};
int main()
{
struct minus c[N];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c[i].a);
scanf("%s",c[i].b);
printf("\n");
}
for(i=0;i<n;i++)
{
int k1,k2,j,k;
char str[N],d;
k1=strlen(c[i].a);
k2=strlen(c[i].b);
for(j=k1-1,k=k2-1;j>=k1-k2,k>=0;j--,k--)
{
d=c[i].a[j]-c[i].b[k]+'0';
if(d>='0')
str[j]=d;
else
{
str[j]=10+d;
c[i].a[j-1]=c[i].a[j-1]-1;
}
}
//printf("%c",c[i].a[k1-k2-1]);
for(j=0;j<k1-k2;j++)
{
str[j]=c[i].a[j];
}
str[k1]='\0';
printf("%s",str);
printf("\n");
}
return 0;
}
|
32
|
15869
|
void main()
{
int l1[25],l2[25],n,t,w,z,q,i,d,k,j;
char c1[25][101],c2[25][101],c[101],a[25][101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c1[i]);
// gets(c1[i]);????????????????
l1[i]=strlen(c1[i]);
// gets(c2[i]);
scanf("%s",c2[i]);
l2[i]=strlen(c2[i]);
/*if(l1[i]<l2[i]||(l1[i]==l2[i]&&c1[0]<c2[0]))
{
strcpy(c,c1);
strcpy(c1,c2);
strcpy(c2,c);
t=l1[i];l1[i]=l2[i];l2[i]=t;
}*/
d=l1[i]-l2[i];
for(w=l2[i];w<l1[i]-1;w++)
c2[i][w]='0';
c2[i][l1[i]-1]='\0';
q=0;c2[i][l1[i]]='\0';c2[i][l1[i]-1]='0';
while(q!=d)
{
for (z=l1[i];z>0;z--)
{
c2[i][z]=c2[i][z-1];
}
c2[i][0]=c2[i][l1[i]];
q++;
}
c2[i][l1[i]]='\0';
for(k=l1[i];k>=0;k--)
{
if(c1[i][k]>=c2[i][k]) a[i][k]=c1[i][k]-c2[i][k]+48;
if(c1[i][k]<c2[i][k])
{
a[i][k]=c1[i][k]+10-c2[i][k]+48;
c1[i][k-1]=c1[i][k-1]-1;
}
}
a[i][l1[i]]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",a[i]);
}
|
32
|
15870
|
void main()
{
int i=0,j=0,d=0,n=0,m=0,s=0,lena[100]={0},lenb[100]={0},c[100][100]={0};
char a[100][100]={0},b[100][100]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s",a[i],b[i]);
lena[i]=strlen(a[i]);
lenb[i]=strlen(b[i]);
for(j=lena[i]-1,s=lenb[i]-1;s>=0;j--,s--)
{
if(a[i][j]>=b[i][s])
c[i][j]=a[i][j]-b[i][s];
else
{
c[i][j]=a[i][j]+10-b[i][s];
for(m=j-1;;m--)
{
if(a[i][m]!='0')
{
a[i][m]--;break;}
else
a[i][m]='9';
}
}
}
for(m=lena[i]-lenb[i]-1;m>=0;m--)
c[i][m]=a[i][m];
for(j=0;j<lena[i];j++)
{
if(c[i][j]>=10)c[i][j]=c[i][j]-48;
}
for(j=0;j<lena[i];j++)
if(c[i][j]!=0)break;
for(j=j;j<lena[i];j++)
printf("%d",c[i][j]);
printf("\n");
}
}
|
32
|
15871
|
int main(int argc, char* argv[])
{
int n,bei1[100],jian1[100],cha[100];
int j,a,b,i;
char bei[100],jian[100];
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s",bei);
scanf("%s",jian);
a=strlen(bei);
b=strlen(jian);
for(i=0;i<a;i++)
{
bei1[i]=bei[i]-'0';
}
for(i=0;i<b;i++)
{
jian1[i]=jian[i]-'0';
}
for(i=b-1;i>=0;i--)
{
jian1[a-b+i]=jian1[i];
}
for(i=0;i<(a-b);i++)
{
jian1[i]=0;
}
for(i=a-1;i>=0;i--)
{
if(bei1[i]>=jian1[i])
{
cha[i]=bei1[i]-jian1[i];
}
if(bei1[i]<jian1[i])
{
cha[i]=bei1[i]+10-jian1[i];
bei1[i-1]=bei1[i-1]-1;
}
}
if(cha[0]==0)
{
for(i=1;i<a;i++)
{
printf("%d",cha[i]);
}
printf("\n");
}
else
for(i=0;i<a;i++) printf("%d",cha[i]);
printf("\n");
}
return 0;
}
|
32
|
15872
|
void main()
{
char a[100],b[100];
int c,d,e,f,g,k;
scanf("%d",&c);
for(d=0;d<c;d++)
{
scanf("%s %s",a,b);
e=strlen(a);
k=e;
f=strlen(b);
if(e>=f)
{
while(f>=0)
{
if(a[e]<b[f])
{
a[e]=a[e]+10-b[f]+48;
a[e-1]=a[e-1]-1;
}
else
a[e]=a[e]-b[f]+48;
f--;
e--;
}
}
for(g=0;g<k;g++)
printf("%c",a[g]);
printf("\n");
}
}
|
32
|
15873
|
int main()
{
int n,i,j,k,a[105]={0},b[105]={0},c[105]={0},l1,l2,l,cha;
char s1[105],s2[105];
scanf ("%d",&n);
for (k=1;k<=n;k++)
{
scanf("%s %s",s1,s2);
l1=strlen(s1);
l2=strlen(s2);
for (i=0;i<=l1-1;i++)
{
a[i]=s1[l1-i-1]-'0';
}
for (j=0;j<=l2-1;j++)
{
b[j]=s2[l2-j-1]-'0';
}
for (i=0;i<=l1-1;i++)
{
c[i]=a[i]-b[i];
if (c[i]<0)
{
c[i]+=10;
a[i+1]-=1;
}
}
while (c[l1]==0&&l1>0)
{
l1--;
}
for (i=l1;i>=0;i--)
{
printf("%d",c[i]);
}
printf ("\n");
for (i=0;i<=104;i++)
{
a[i]=0;b[i]=0;c[i]=0;
}
}
return 0;
}
|
32
|
15874
|
//
// ????? ?????
// ????? ?2??????????
// ????? ? ? ? ? ?? 1000012733 ?
// ????? 2010 ? 11 ? 19 ?
//
int main()
{
const int max = 100; //max?????????????100?
char str1[max], str2[max]; //str1?str2?????????????????????max
int num1[max], num2[max]; //num1?num2???????????????????????????????
int n, i, j, k1, k2, l, p, q, len1, len2; //n??????????????????len1?len2????????????????????????????????????
cin >> n; //????????????????????n
for ( i = 1; i <= n; i ++ ) //????????n?????n?????????
{
cin.get(); //??????????????????????????????????????
cin.getline ( str1, max ); //?????
cin.getline ( str2, max ); //????
len1 = strlen ( str1 ); //??????????
len2 = strlen ( str2 ); //?????????
memset ( num1, 0, sizeof ( num1 )); //???num1??
memset ( num2, 0, sizeof ( num2 )); //???num2??
k1 = len1 - 1;
for ( j = 0; j < len1; j ++ )
{
num1[k1] = str1[j] - '0';
k1 --;
} //????????????????????num1?????????????????num1??????
k2 = len2 - 1;
for ( j = 0; j < len2; j ++ )
{
num2[k2] = str2[j] - '0';
k2 --;
} //???????????????????num2?????????????????num2??????
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] --; //???????????????????????????????????????10????????????????????1
}
}
p = max - 1;
while ( num1[p] == 0)
{
p --;
} //?????????????????0????
for ( q = p; q > 0; q -- )
{
cout << num1[q]; //?????????????
}
cout << num1[0] << endl; //?????????????????
}
return 0;
}
|
32
|
15875
|
int main()
{
int n;
scanf("%d",&n);
scanf("\n");
char ***p;
int i;
int j;
int k;
p=(char ***)malloc(n*sizeof(char **));
for(i=0;i<n;i++)
{
p[i]=(char **)malloc(2*sizeof(char *));
for(j=0;j<2;j++)
{
p[i][j]=(char *)malloc(100*sizeof(char));
scanf("%s",p[i][j]);
if(j==0)
scanf("\n");
else if(j==1&&i==n-1)
{}
else
{
scanf("\n\n");
}
}
}
int tuiwei;
for(i=0;i<n;i++)
{
int a=strlen(p[i][0]);
int b=strlen(p[i][1]);
for(j=a-1,tuiwei=0;j>=0;j--)
{
if(j>=a-b)
{
k=j-(a-b);
if(p[i][0][j]>=p[i][1][k]+tuiwei)
{
p[i][0][j]=p[i][0][j]-p[i][1][k]-tuiwei+'0';
tuiwei=0;
}
else
{
p[i][0][j]=p[i][0][j]+10-p[i][1][k]-tuiwei+'0';
tuiwei=1;
}
}
else
{
if(p[i][0][j]>=tuiwei)
{
p[i][0][j]=p[i][0][j]-tuiwei;
tuiwei=0;
}
else
{
p[i][0][j]=p[i][0][j]+10-tuiwei;
tuiwei=1;
}
}
}
}
for(i=0;i<n;i++)
{
if(i<=n-2)
printf("%s\n",p[i][0]);
else
printf("%s",p[i][0]);
}
}
|
32
|
15876
|
int main()
{
int n, N, a[120], b[120], c[120];
char a1[120], b1[120], hh;
cin >> N;
cin.get(hh);
for(n = 0; n < N; n++)
{
int i, l, j;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
cin.getline(a1, 120);
l = strlen(a1);
for(i = 0; i < l; i++)
{
a[i] = a1[l - 1 - i] - '0';
}
cin.getline(b1, 120);
l = strlen(b1);
for(i = 0; i < l; i++)
{
b[i] = b1[l - 1 - i] - '0';
}
l = strlen(a1);
for(i = 0; i < l; i++)
{
if(a[i] - b[i] >= 0) c[i] = a[i] - b[i];
else
{
c[i] = a[i] - b[i] + 10;
j = i + 1;
while(a[j] == 0)
{
a[j] = 9;
j++;
}
a[j] = a[j] - 1;
}
}
for(i = l - 1; i >= 0; i--) cout << c[i];
cout << endl;
cin.get(hh);
}
return 0;
}
|
32
|
15877
|
void func(char u[],char v[]);
void main()
{
char u[100][101];
int n,m;
scanf("%d",&n);
for (m=0;m<=2*n-2;m=m+2)
{
scanf("%s",u[m]);
scanf("%s",u[m+1]);
printf("\n");
}
for (m=0;m<=2*n-2;m=m+2) func(u[m],u[m+1]);
}
void func(char u[],char v[])
{
char w[101]={"0"},copy[101]={'0'};
int m,n,p,q,i,j,k,t;
int a[101]={0},b[101]={0},c[101]={0},d[101]={0};
k=0;m=0;n=0;
i=strlen(u);
for (p=i;p>=1;p--) u[p]=u[p-1];
u[0]=48;
j=strlen(v);
for (q=j;q>=1;q--) v[q]=v[q-1];
v[0]=48;
for (p=0;p<=i;p++) a[p]=u[p]-48;
for (q=0;q<=j;q++) b[q]=v[q]-48;
for (q=1;q<=j;q++) d[q]=9-b[q];
for (q=j,p=i;q>=0;q=q-1,p=p-1)
{
c[p]=(a[p]+d[q]+k)%10;
k=(a[p]+d[q]+k)/10;
}
for (;p>=0;p=p-1)
{
c[p]=(a[p]+k)%10;
k=(a[p]+k)/10;
}
for (t=i;t>=1;t=t-1)
{
c[t]=(c[t]+1)%10;
if (c[t]!=0) goto yes;
}
c[0]=c[0]+1;
yes:for (t=i-j;t>=0;t=t-1)
{
c[t]=c[t]-1;
if (c[t]!=-1) goto diong;
else c[t]=9;
}
diong:for (p=0;p<=i;p++) w[p]=c[p]+48;
while (w[0]==48) for (p=0;p<=i;p++) w[p]=w[p+1];
printf("%s\n",w);
}
|
32
|
15878
|
void main()
{
char a[20][100];
char b[20][100];
int k,l,j,t,p,i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
t=(int)strlen(a[i]);
p=(int)strlen(b[i]);
for(k=t-1,l=p-1;l>=0;k--,l--)
if(a[i][k]>=b[i][l])
a[i][k]=a[i][k]-b[i][l];
else
{
a[i][k]=a[i][k]+10-b[i][l];
a[i][k-1]=a[i][k-1]-1;
}
for(j=0;j<(t-p);j++)
printf("%c",a[i][j]);
for(j=t-p;j<t;j++)
printf("%c",a[i][j]+'0');
printf("\n");
}
}
|
32
|
15879
|
char a[105],b[105],c[105];
void minus(int l1,int l2)
{
int i,j;
for(i = 0;i < l2;i ++)
{
if(b[i]>=c[i])
b[i] -= c[i];
else
{
b[i] = b[i] + 10 - c[i];
j = i + 1;
b[j]--;
while(b[j]<0)
{
b[j] += 10;
j++;
b[j]--;
}
}
}
}
int main()
{
int n,i,max,j;
int l1,l2;
char m;
scanf("%d",&n);
for(i = 1;i <= n;i ++)
{
scanf("%s",a);
l1 = strlen(a);
scanf("%c",&m);
for(j = 0;j < l1;j ++)
b[l1-j-1] = a[j] - '0';
memset(a,0,sizeof(a));
scanf("%s",a);
scanf("%c",&m);
l2 = strlen(a);
for(j = 0;j < l2;j ++)
c[l2-j-1] = a[j] - '0';
minus(l1,l2);
while(!b[l1-1])
l1--;
for(j = l1 - 1;j>=0;j --)
printf("%d",b[j]);
printf("\n");
}
return 0;
}
|
32
|
15880
|
void main()
{
int n=20,i,j,x,y,z;
char **p=(char **)malloc(n*sizeof(char *));
scanf("%d",&n);
if(p!=NULL)
{
for(i=0;i<20;i++)
p[i]=(char *)malloc(100*sizeof(char));
for(i=0;i<2*n;i++)
{
scanf("%s",p[i]);
if(i%2==1)
{
x=strlen(p[i-1]);
y=strlen(p[i]);
for(j=x-1;j>=0;j--)
{
if(j-x+y>=0)
{
z=p[i-1][j]-p[i][j-x+y];
if(z<0)
{
p[i-1][j]='9'+1+z;
p[i-1][j-1]--;
}
else p[i-1][j]='0'+z;
}
else
{
z=p[i-1][j]-'0';
if(z<0)
{
p[i-1][j]='9'+1+z;
p[i-1][j-1]--;
}
else p[i-1][j]='0'+z;
}
}
for(z=0;;z++)
if(p[i-1][z]!='0')
break;
for(j=z;j<x;j++)
printf("%c",p[i-1][j]);
printf("\n");
}
}
}
}
|
32
|
15881
|
int maxlen(int x, int y);
int main()
{
int N;
char s1[201], s2[201];
int a[201], b[201], maxx, l1, l2,i,j;
N = maxx = l1 = l2 = 0;
scanf("%d", &N);
for (int n = 0; n < N; n++) {
memset(s1, 0, sizeof(s1));
memset(s2, 0, sizeof(s2));
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
scanf("%s", s1);
scanf("%s", s2);
l1 = strlen(s1);
l2 = strlen(s2);
maxx = maxlen(l1, l2);
for ( i = maxx, j = l1 - 1; j>=0; i--, j--)
a[i] = s1[j] - '0';
for ( i = maxx, j = l2 - 1; j>=0; i--, j--)
b[i] = s2[j] - '0';
for ( i = maxx; i > 0; i--)
{
if (a[i] <b[i])
{
a[i] =a[i]+ 10-b[i];
a[i-1] --;
}
else a[i] -= b[i];
}
i = 0;
while (a[i] == 0)
i ++;
for (; i<maxx + 1; i++)
printf("%d", a[i]);
printf("\n");
}
return 0;
}
int maxlen(int x, int y){
if (x > y)
return x;
return y;
}
|
32
|
15882
|
int str2bigint(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 print_bigint(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 sub_bigint(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[MAX],s2[MAX];
int a[MAX],b[MAX],c[MAX];
int alen,blen,clen;
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",s1,s2);
alen=str2bigint(s1,a);
blen=str2bigint(s2,b);
clen=sub_bigint(a,alen,b,blen,c);
print_bigint(c,clen);
printf("\n");
}
return 0;
}
|
32
|
15883
|
void main()
{
void minus(char x[],char y[]);
char a[100][100],b[100][100];
int i,j,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
}
printf("\n");
for(i=1;i<=n;i++)
minus(a[i],b[i]);
}
void minus(char x[],char y[])
{
int i,j,c,d;
char min[1000];
c=strlen(x);
d=strlen(y);
for(i=c-1,j=d-1;i>=c-d+1;i--,j--)
{
if(x[i]>=y[j])
{
min[i]=x[i]-y[j]+48;
}
else if(x[i]<y[j])
{
min[i]=x[i]+10-y[j]+48;
x[i-1]=x[i-1]-1;
}
}
if(x[c-d]>=y[0])
{
min[c-d]=x[c-d]-y[0]+48;
for(i=0;i<=c-d-1;i++)
printf("%c",x[i]);
for(i=c-d;i<=c-1;i++)
{
if(min[i]==0)printf("0");
else printf("%c",min[i]);
}
}
else
{
min[c-d]=x[c-d]+10-y[0]+48;
x[c-d-1]=x[c-d-1]-1;
for(i=0;i<=c-d-1;i++)
printf("%c",x[i]);
for(i=c-d;i<=c-1;i++)
{
if(min[i]==0)printf("0");
else printf("%c",min[i]);
}
}
printf("\n");
}
|
32
|
15884
|
char a[100];
char b[100];
int l,m,n,i,j,temp;
void main()
{
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s%s",a,b);
l=strlen(a)-1;
m=strlen(b)-1;
for (j=0;j<=(l-1)/2;j++)
{temp=a[j];a[j]=a[l-j];a[l-j]=temp;}
for (j=0;j<=(m-1)/2;j++)
{temp=b[j];b[j]=b[m-j];b[m-j]=temp;}
for (j=m+1;j<=l;j++)
b[j]='0';
for (j=0;j<=l;j++)
if (a[j]<b[j])
{
a[j+1]--;
a[j]=10+a[j]-b[j];
}
else a[j]=a[j]-b[j];
while (a[l]==0) l--;
for (j=l;j>=0;j--)
printf("%d",a[j]);
if (l==-1) printf("0\n"); else printf("\n");
}
}
|
32
|
15885
|
void main()
{
int m,k,i,j,e,d[10][100],t;
char a[10][100],b[10][100];
scanf("%d\n",&m);
for(i=0;i<m;i++)
{
gets(a[i]);
gets(b[i]);
scanf("\n");
}
for(i=0;i<m;i++)
{
k=strlen(a[i]);
t=strlen(b[i]);
for(j=0;j<100;j++)
{
if(a[i][j]!='\0')
a[i][j]=a[i][j]-48;
if(b[i][j]!='\0')
b[i][j]=b[i][j]-48;
}
for(j=k;j>=k-t;j--)
b[i][j]=b[i][j-k+t];
for(j=k-t-1;j>=0;j--)
b[i][j]='\0';
e=0;
for(j=k-1;j>=0;j--)
{
if(a[i][j]-b[i][j]+e<0)
{
d[i][j]=10+a[i][j]-b[i][j]+e;
e=-1;
}
else
{
d[i][j]=a[i][j]-b[i][j]+e;
e=0;
}
}
if(d[i][0]==0)
{
for(j=1;j<k;j++)
printf("%d",d[i][j]);
}
else
{
for(j=0;j<k;j++)
printf("%d",d[i][j]);
}
printf("\n");
}
}
|
32
|
15886
|
main()
{ int n,i,j,k,p,q,x;
char a[20][2][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{ for(j=0;j<2;j++)
scanf("%s",a[i][j]);
printf("\n");
}
for(i=0;i<n;i++)
{ p=strlen(a[i][0]);
q=strlen(a[i][1]);
for(j=0;j<q;j++)
{ x=a[i][0][p-j-1]-a[i][1][q-j-1];
if(x<0){x=x+10;a[i][0][p-j-2]--;}
a[i][0][p-j-1]=x+48;
}
for(k=0;k<p;k++)
printf("%c",a[i][0][k]);
if(i<n-1) printf("\n");
}
}
|
32
|
15887
|
void minus(char a[],char b[],char result[]);
void main()
{
int n,i;
char a[max][max],b[max][max];
char result[max][max];
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s\n\n",a[i],b[i]);
minus(a[i],b[i],result[i]);
printf("%s\n",result[i]);
}
}
void minus(char a[],char b[],char result[])
{
int la,lb,lresult;
int flag=0;
int t=0;
int s,c=0;
int i;
char temp1;
la=strlen(a)-1;
lb=strlen(b)-1;
while(la >= 0)
{
if(lb < 0)
{
s=a[la--]-48;
}
else
{
s=a[la--]-b[lb--];
}
result[t++]=s-c+48;
if(result[t-1] < 48)
{
result[t-1]+=10;
c=1;
}
else c=0;
}
while(result[t] == 0) t--;
while(result[t] == '0')
{
result[t]=0;t--;
}
lresult=t;
for(i=0;i <= lresult/2;i++)
{
temp1=result[i];
result[i]=result[lresult-i];
result[lresult-i]=temp1;
}
}
|
32
|
15888
|
int main(int argc, char *argv[])
{
char a[100]={'0'},b[100]={'0'};
int n,i,la,lb,k,sub[101]={0},p;
scanf("%d",&n);
for(i=0;i<n;i++){
for(k=1;k<=100;k++){
sub[k]=0;
}
scanf("%s",a);scanf("%s",b);
la=strlen(a);lb=strlen(b);
for(k=1;k<=lb;k++){
if(a[la-k]>=b[lb-k])sub[k]=a[la-k]-b[lb-k];
else{
sub[k]=a[la-k]+10-b[lb-k];
a[la-(k+1)]=a[la-(k+1)]-1;
}
}
for(k=lb+1;k<=la;k++){
sub[k]=a[la-k]-48;
}
printf("\n");
for(k=100;k>0;k--){
if(sub[k]!=0){
p=k;
break;
}
}
for(k=p;k>0;k--){
printf("%d",sub[k]);
}
}
return 0;
}
|
32
|
15889
|
struct num
{
char a[100];
char b[100];
};
void main()
{
void f(char num1[100],char num2[100]);
int n,i;
struct num num[10];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s",num[i].a);
scanf("%s",num[i].b);
printf("\n");
}
for(i=0;i<=n-1;i++)
{
f(num[i].a,num[i].b);
printf("\n");
}
printf("\n");
}
void f(char num1[100],char num2[100])
{
int n1,n2,j,k;
char c[100];
n1=strlen(num1);
n2=strlen(num2);
for(j=n1-1;j>=n1-n2;j--)
{
if(num1[j]>=num2[j-n1+n2])
c[j]=num1[j]-num2[j-n1+n2]+48;
else
{
c[j]=num1[j]-num2[j-n1+n2]+58;
num1[j-1]=num1[j-1]-1;
}
}
for(k=0;k<=n1-n2-1;k++)
{
c[k]=num1[k];
}
for(k=0;k<=n1-1;k++)
{
printf("%c",c[k]);
}
}
|
32
|
15890
|
void exchange(int num[],char str[]);
void calculate(int num1[],int num2[]);
void main()
{
int num1[100]={0},num2[100]={0},n,i,j;
char str1[100]={""},str2[100]={""};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",str1,str2);
exchange(num1,str1);
exchange(num2,str2);
calculate(num1,num2);
for(j=0;j<=99;j++)
{
num1[j]=0;
num2[j]=0;
str1[j]=' ';
str2[j]=' ';
}
}
}
void exchange(int num[],char str[])
{
int i,j=99,n=0;
while(str[n]>=48&&str[n]<=58)
{
n+=1;
}
n-=1;
for(i=n,j=99;i>=0;i--,j--)
{
num[j]=str[i]-48;
}
}
void calculate(int num1[],int num2[])
{
int i,n=0;
int num3[100]={0};
for(i=99;i>=0;i--)
{
num3[i]=num1[i]-num2[i];
if(num3[i]<0)
{
num3[i]+=10;
num1[i-1]-=1;
}
}
while(num3[n]==0)
{
n+=1;
}
for(i=n;i<=99;i++)
{
printf("%d",num3[i]);
}
printf("\n");
}
|
32
|
15891
|
void main()
{
int n,i,j,p,l,k,q;
char s1[100][100],s2[100][100],a[100],t[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",s1[i],s2[i]);
}
for(i=0;i<n;i++)
{
l=0;
p=strlen(s1[i]);
q=strlen(s2[i]);
for(j=p-q-1;j<p;j++)
{t[l++]=s1[i][j];}
for(j=q;j>=1;j--)
{
if(t[j]>=s2[i][j-1])
a[j]=(t[j]-s2[i][j-1]);
else
{
a[j]=(t[j]+10-s2[i][j-1]);
t[j-1]=t[j-1]-1;
}
}
a[0]=t[0]-'0';
for(k=0;k<p-1-q;k++)
{
printf("%c",s1[i][k]);
}
for(k=0;k<=q;k++)
{
printf("%d",a[k]);
}
printf("\n");
}
}
|
32
|
15892
|
void main()
{
int changa,changb,n,i,j,k=0,c[20][100]={'\0'};
char a[20][100]={'\0'},b[20][100]={'\0'},d[20][100]={'\0'};
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
changa=strlen(a[i]);
changb=strlen(b[i]);
for(j=changa-changb;j<changa;j++)
{
d[i][j]=b[i][j-changa+changb];
}
for(j=0;j<changa-changb;j++)
{d[i][j]='0';}
for(j=changa-1;j>0;j--)
{
if (a[i][j]<48)
{
a[i][j]=a[i][j]+10;
a[i][j-1]=a[i][j-1]-1;
}
if(a[i][j]<d[i][j])
{
a[i][j-1]=a[i][j-1]-1;
c[i][j]=(int)10+a[i][j]-d[i][j];
}
else
{
c[i][j]=(int)a[i][j]-d[i][j];
}
}
c[i][0]=(int)a[i][0]-d[i][0];
for(j=0;j<changa;j++)
{ if(c[i][j]!=0)
break;
}
for(k=j;k<changa;k++)
printf("%d",c[i][k]);
printf("\n");
}
}
|
32
|
15893
|
void main()
{
char c[100][105];
int i,j,j1,j2,n,len1,len2;
scanf("%d",&n);
for(i=0;i<2*n;i=i+2)
{
scanf("%s%s",c[i],c[i+1]);
}
for(i=0;i<2*n;i=i+2)
{
len1=strlen(c[i]),len2=strlen(c[i+1]);
for(j1=len1-1,j2=len2-1;j2>=0;j1--,j2--)
{
if(c[i][j1]>=c[i+1][j2])
c[i][j1]=c[i][j1]-c[i+1][j2]+48;
else
{
c[i][j1]=c[i][j1]+58-c[i+1][j2];
c[i][j1-1]=c[i][j1-1]-1;
}
}
for(j=0;j<len1;j++)
printf("%c",c[i][j]);
printf("\n");
}
}
|
32
|
15894
|
int main()
{
int n,i,j,k,lena,lenb,x,y,tag=1;
char a[1000]={0},b[1000]={0},c[1000]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
k=lenb;
for(j=lena,k=lenb;j>=0;j--,k--)
{
if(k<0)
{
c[j]=a[j];
}
else
{
if(a[j]>=b[k])
{
c[j]=a[j]-b[k]+'0';
}
else
{
a[j]=a[j]+10;
a[j-1]--;
c[j]=a[j]-b[k]+'0';
}
}
}
for(x=0;x<lena;x++)
{
if(c[x]!=0)
{
for(y=x;y<lena;y++)
printf("%c",c[y]);
printf("\n");
;
tag=0;
break;
}
}
if(tag==1)
printf("0\n");
}
}
|
32
|
15895
|
int main()
{
int n;
scanf ("%d", &n);
while (n > 0)
{
char c[100],b[100];
int j, i, k=0, s=0, t;
scanf ("%s\n%s", &c, &b);
while (c[k]!='\0')
{
k++;
}
while (b[s]!='\0')
{
s++;
}
t=k-s;
for (i=k-1;i>=t;i--)
{
if(c[i]>=b[i-t] )
{
c[i]=c[i]-b[i-t]+'0';
}
else{
c[i-1]--;
c[i]=c[i]+10-b[i-t]+'0';
}
}
s = 0;
for (s;s <k; s++)
printf("%c", c[s]);
printf("\n");
n--;
}
return 0;
}
|
32
|
15896
|
//******************************************************
//* ? ? ? ?????? *
//* ? ? ???? *
//* ? ? ? ??2010 ? 11 ? 17 ? *
//* ? ? ?1000012758 *
//******************************************************
int main()
{
int n, a[3][100] = {0}, size, m;
char temp[101];
cin >> n;
for (int i = 0; i < n; i++)
{
memset(a,0,sizeof(a));
//Input & Convert
for(int j = 0; j < 2; j++)
{
m = 99;
do{
cin.getline(temp,101);
}while(temp[0] == '\0');
size = strlen(temp);
for (int k = size - 1; k >= 0; k--)
a[j][m--] = temp[k] - 48;
}
//Minus
for (int j = 99; j >= 0; j--)
{
a[2][j] = a[0][j] - a[1][j];
if (a[2][j] < 0)
{
a[0][j - 1]--;
a[2][j] += 10;
}
}
//Output
m = 0;
for(int j = 0; j < 100; j++)
{
if (a[2][j])
m = 1;
if (m)
cout << a[2][j];
}
cout << endl;
}
return 0;
}
|
32
|
15897
|
main()
{int n,g;
scanf("%d",&n);
for(g=0;g<n;g++)
{
char a[1000];
char b[1000],c[1000];
memset(c,'0',sizeof(c));
scanf("%s %s",a,b);
int l1,l2;
l1=strlen(a);
l2=strlen(b);
int l;
if(l1>l2)
l=l1;
else l=l2;
//printf("%d\n",l);
int i;
for(i=l;i>l-l1;i--)
{
a[i]=a[i-(l-l1+1)];
}
//printf("%c\n",a[l]);
for(i=l;i>l-l2;i--)
b[i]=b[i-(l-l2+1)];
//printf("%c\n",b[l]);
for(i=0;i<=l-l1;i++)
{
a[i]='0';
}
//printf("%c\n",a[l-l1]);
for(i=0;i<=l-l2;i++)
{
b[i]='0';
}
//printf("%c\n",b[l-l2+1]);
int flag=0;
for(i=l;i>0;i--)
{int sum=0;
if(flag==1)
sum=a[i]-b[i]-1;
if(flag==0)
sum=a[i]-b[i];
if(sum<0)
{c[i]=sum+'0'+10; flag=1;}
else
{c[i]=sum+'0';flag=0;}
}
//printf("%c %c %c %c\n",c[l],c[3],c[2],c[1]);
int flag1=0;
//printf("%c\n",c[0]);
int t;
for(i=0;i<=l;i++)
{
if(c[i]!='0')
{t=i;break;}
}
for(i=t;i<=l;i++)
printf("%c",c[i]);
printf("\n");
/*if(flag)
{
for(i=0;i<=l;i++)
printf("%c",c[i]);
}
else
{for(i=1;i<=l;i++)
printf("%c",c[i]);
}*/
}
}
|
32
|
15898
|
void main()
{
int n,la,lb,i,j;
char a[100][100],b[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
la=strlen(a[i]);
lb=strlen(b[i]);
for(j=1;j<=lb;j++)
{
if(a[i][la-j]>=b[i][lb-j]) a[i][la-j]=a[i][la-j]-b[i][lb-j];
else {a[i][la-j]=a[i][la-j]+10-b[i][lb-j];a[i][la-j-1]-=1;}
}
for(j=0;j<la-lb;j++) a[i][j]=a[i][j]-'0';
for(j=0;j<la;j++)
printf("%d",a[i][j]);
printf("\n");
}
}
|
32
|
15899
|
int main()
{
char a[101],b[101];
int ia[101],ib[101];
int n=0,i=0,j=0,q=0,len1=0,len2=0,t=0,ans[101]={0};
cin>>n;
for(t=0;t<n;t++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(ia,0,sizeof(ia));
memset(ib,0,sizeof(ib));
memset(ans,0,sizeof(ans));
cin>>a>>b;
len1=strlen(a);
len2=strlen(b);
int k=0;
for(i=len1-1;i>=0;i--)
{
ia[k]=a[i]-'0';
k++;
}
k=0;
for(i=len2-1;i>=0;i--)
{
ib[k]=b[i]-'0';
k++;
}
for(i=0;i<len2;i++)
{
if(ia[i]<ib[i])
{
if(ia[i+1]!=0)
{
ia[i+1]--;
ia[i]=ia[i]+10;
ans[i]=ia[i]-ib[i];
}
else
{
for(j=i+2;j<len1;j++)
{
if(ia[j]!=0)
{
q=j;
ia[j]--;
break;
}
}
for(j=i+1;j<q;j++)
ia[j]=9;
ia[i]=ia[i]+10;
ans[i]=ia[i]-ib[i];
}
}
else
ans[i]=ia[i]-ib[i];
}
int p=0;
for(i=len1;;i--)
{
if(ia[i]!=0)
{
p=i;
break;
}
}
for(i=p;i>=len2;i--)
{
ans[i]=ia[i];
}
for(i=p;i>=0;i--)
cout<<ans[i];
cout<<endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.