id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
15,800 |
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
|
15,801 |
void main()
{
int n,m;
int i=0,j=0;
char a[100][100],b[100][100],c[100][100]={0};
int len1,len2;
scanf("%d",&n);
for(m=0;m<n;m++)
{
scanf("%s %s",a[m],b[m]);
len1=strlen(a[m]);
len2=strlen(b[m]);
for(i=len1-1,j=len2-1;i>=len1-len2,j>=0;i--,j--)
{
if(a[m][i]-b[m][j]>=0)
{
c[m][i]=a[m][i]-b[m][j]+'0';
}
else
{
a[m][i-1]=a[m][i-1]-'1'+'0';
c[m][i]=a[m][i]-b[m][j]+'0'+10;
}
}
for(i=len1-len2-1;i>=0;i--)
{
if(a[m][i]>=0)
{
c[m][i]=a[m][i];
}
else
{
a[m][i-1]=a[m][i-1]-'1'+'0';
c[m][i]=a[m][i]+'0'+10;
}
}
}
for(m=0;m<n;m++)
{
printf("%s\n",c[m]);
}
}
|
32
|
15,802 |
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
|
15,803 |
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
|
15,804 |
int main()
{
char str1[251], str2[251];
int i = 0, j = 0, len1, len2, a[251], b[251], pos = 0, n, k;
cin >> n;
// memset(c,0,sizeof(c));
for(k = 1;k <= n;k++)
{
cin >> str1 >> str2;
len1 = strlen(str1);
len2 = strlen(str2);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
j = 0;
for(i = len1 - 1;i >= 0;i--)
a[j++] = str1[i] - '0';
j = 0;
for(i = len2 - 1;i >= 0;i--)
b[j++] = str2[i] - '0';
for(i = 0;i < len1;i++)
{
a[i] = a[i] - b[i];
if(a[i] < 0)
{
a[i] = a[i] + 10;
a[i+1] = a[i+1] - 1;
}
}
for(i = len1 - 1; i >= 0;i--)
if(a[i] != 0)
{
pos = i;
break;
}
for(i = pos;i >= 0;i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
32
|
15,805 |
void main()
{void min(char a[],char b[]);
int n,i,j,k;
char a[100][110];
char b[100][110];
scanf("%d",&n);
for (i=0;i<n;i++)
{ scanf("%s %s",a[i],b[i]);
printf("\n");
}
for (i=0;i<n;i++)
min(a[i],b[i]);
}
void min(char a[],char b[])
{
int i,j=0,pa[110],pb[110];
int la=strlen(a);
int lb=strlen(b);
for(i=la-1;i>=0;i--)
{
pa[j++]=a[i]-'0';
}
for(i=j;i<109;i++)
pa[i]=0;
j=0;
for(i=lb-1;i>=0;i--)
{
pb[j++]=b[i]-'0';
}
for(i=j;i<109;i++)
pb[i]=0;
for(i=0;i<la;i++)
{
pa[i]-=pb[i];
if(pa[i]<0)
{
pa[i]+=10;
pa[i+1]--;
}
}
int out=0;
for(i=la-1;i>=0;i--)
{
if(out)
printf("%d",pa[i]);
else if(pa[i])
{
printf("%d",pa[i]);
out=1;
}
}
printf("\n");
return;
}
|
32
|
15,806 |
int main()
{
int n,l1,l2,s3[101],i,j;
char s1[101],s2[101],s6[2];
scanf("%d",&n);
for(i=1;i<=n;i++)
{gets(s6);
gets(s1);
gets(s2);
l1=strlen(s1);l2=strlen(s2);
for(j=1;j<=l2;j++)
{ if (s1[l1-j]>=s2[l2-j]) s3[l1-j]=s1[l1-j]-s2[l2-j];
if (s1[l1-j]<s2[l2-j]) {s3[l1-j]=10+s1[l1-j]-s2[l2-j];s1[l1-j-1]=s1[l1-j-1]-1;}
}
for(j=0;j<l1-l2;j++)
s3[j]=s1[j]-'0';
for(j=0;j<l1;j++)
printf("%d",s3[j]);
printf("\n");
}
}
|
32
|
15,807 |
int main()
{
int n,time,i,j,len1,len2;
char a[200],b[200];
scanf("%d",&n);
for(time=0;time<n;time++)
{
scanf("%s",a);
scanf("%s",b);
len1=strlen(a);
len2=strlen(b);
j=0;
for(i=0;i<len1;i++)
{
if(i<len2)
a[len1-i-1]-=(b[len2-i-1]-'0');
if(a[len1-i-1]<'0')
a[len1-i-2]-=1;
}
j=0;
for(i=0;a[i]!=0;i++)
{
if(a[i]!='0')j=1;
if(j)printf("%c",(a[i]>='0'?a[i]:a[i]+10));
}
printf("\n");
}
return 0;
}
|
32
|
15,808 |
void chuli(char a[],char b[]){
int la,m,i,j;
m=strlen(b);
la=strlen(a);
for(i=0;i<m;i++){
if(a[la-1-i]>=b[m-1-i])
a[la-1-i]=a[la-1-i]-b[m-1-i]+48;
else{
a[la-1-i]=a[la-1-i]+10-b[m-1-i]+48;
j=la-2-i;
while(a[j]==48){
a[j]=48+9;
j--;
}
a[j]=a[j]-1;
}//*elsewai end
}//*for end
i=0;
while(a[i]==48){
i=i+1;}
printf("%s\n",a);
}
void main(){
char a[100][100],b[100][100];
char p;
int m,i;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%s",a[i]);scanf("%s",b[i]);
}
for(i=0;i<m;i++)
chuli(a[i],b[i]);
}
|
32
|
15,809 |
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
|
15,810 |
int main(int argc, char* argv[])
{
int n,i,l1,l2,j,k,s=1;
char a[100],b[100],c[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%s",a,b);
for(l1=strlen(a)-1,l2=strlen(b)-1,j=0;l2>=0;l1--,l2--)
{
c[j]=a[l1]-b[l2];
j++;
}
for(l1=strlen(a)-strlen(b)-1;l1>=0;l1--)
{
c[j]=a[l1]-48;
j++;
}
for(k=0;k<j;k++)
{
if(c[k]<0)
{
c[k]=10+c[k];
c[k+1]--;
}
}
for(k=j-1;k>=0;k--){
if(c[k]!=0){
for(l2=k;l2>0;l2--)
printf("%d",c[l2]);
printf("%d\n",c[0]);
break;
}
}
for(l1=j-1;l1>=0;l1--)
{
if(c[l1]!=0)
{
s=1;
break;
}
else
s=0;
}
if(s==0)
printf("0\n");
}
return 0;
}
|
32
|
15,811 |
int a[10000]={0},b[10000]={0},c[10000],d[10000];
void jian(int a[10000],int b[10000])
{
int i,j,k,m;
for (i=0;i<=9000;i++) c[i]=0;
m=a[0]+b[0]-1;
for (i=1;i<=a[0]+b[0]-1;i++)
{
c[i]=c[i]+a[i]-b[i];
if (c[i]<0)
{
c[i+1]=-1;
c[i]+=10;
}
}
j=m+10;
while (j>1&&c[j]==0) j--;
for (i=1;i<=a[0]+1;i++)
a[i]=c[i];
a[0]=j;
for (i=j;i>=1;i--)
cout <<a[i];
cout <<endl;
}
int main()
{
int i,j,k,m,n;
int len1=0,len2=0;
char s1[10000],s2[10000];
cin >>n;
for (j=1;j<=n;j++)
{
for (i=0;i<=9000;i++) {a[i]=0;b[i]=0;}
cin >>s1;
cin >>s2;
len1=strlen(s1);
len2=strlen(s2);
a[0]=len1;
b[0]=len2;
for (i=1;i<=len1;i++)
a[len1-i+1]=((int)s1[i-1])-48;
for (i=1;i<=len2;i++)
b[len2-i+1]=((int)s2[i-1])-48;
jian(a,b);
}
return 0;
}
|
32
|
15,812 |
// ??
// ????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
|
15,813 |
void main()
{
char max[100],min[100],result[100];
int n,i,a,b,j,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",max,min);
a=strlen(max);
b=strlen(min);
k=0;
if(a==b)
{
for(j=(a-1);j>=0;j--)
{
max[j]=max[j]-k;
if(max[j]>=min[j])
{
result[j]=max[j]-min[j]+48;
k=0;
}
else
{
result[j]=max[j]-min[j]+58;
k=1;
}
}
}
else
{
min[a]='\0';
for(j=1;j<=b;j++)
min[a-j]=min[b-j];
for(j=(a-b-1);j>=0;j--)
min[j]='0';
for(j=(a-1);j>=0;j--)
{
max[j]=max[j]-k;
if(max[j]>=min[j])
{
result[j]=max[j]-min[j]+48;
k=0;
}
else
{
result[j]=max[j]-min[j]+58;
k=1;
}
}
}
for(j=0;j<a;j++)
{
if(result[j]!='0')
{
for(k=j;k<a;k++)
printf("%c",result[k]);
printf("\n");
}
break;
}
}
}
|
32
|
15,814 |
int main()
{
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
char s1[101],s2[101]={'0'},s3[101]={'\0'};
scanf("%s",s1);
scanf("%s",s2);
printf("\n");
int l1,l2,j,u=0;
l1=strlen(s1);
l2=strlen(s2);
for(j=1;j<=l2;j++)
{
int x,y,z;
x=s1[l1-j]-'0';
y=s2[l2-j]-'0';
if(x+u>=y)
{
z=x-y+u;
u=0;
}
else
{
z=10+x-y+u;
u=-1;
}
s3[l1-j]=z+'0';
}
if(l1>l2)
{
int k,l;
k=s1[l1-l2-1]-'0';
s3[l1-l2-1]=k+u+'0';
for(l=0;l<l1-l2-1;l++)
s3[l]=s1[l];
}
int l;
for(l=0;l<l1-1;l++)
{
if(s3[l]!='0')
{
printf("%s",s3+l);
break;
}
}
if(l==l1-1)
{
printf("%c",s3[l1-1]);
}
}
return 0;
}
|
32
|
15,815 |
int main()
{
int n;
char str1[101],str2[101];
int a1[100],a2[100];
cin>>n;
int l1,l2;
for(int i=0;i<n;i++)
{
cin>>str1>>str2;
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
l1=strlen(str1);
l2=strlen(str2);
int k1=0,k2=0;
for(int j=l1-1;j>=0;j--)
a1[k1++]=str1[j]-'0';
for(int j=l2-1;j>=0;j--)
a2[k2++]=str2[j]-'0';
for(int j=0;j<100;j++)
{
a1[j]=a1[j]-a2[j];
if(a1[j]<0)
{
a1[j]+=10;
a1[j+1]--;
}
}
int k=99;
while(a1[k]==0) k--;
for(;k>=0;k--)
cout<<a1[k];
cout<<endl;
}
return 0;
}
|
32
|
15,816 |
void main()
{
char a[100]={""};
char b[100]={""};
int n,i,j,k,p;
int c1,c2;
scanf("%d",&n);
for(j=1;j<=n;j++)
{
c1=0;
c2=0;
scanf("%s",a);
scanf("%s",b);
for(;(a[c1]<=58)&&(a[c1]>=48);c1++)
{}
for(;(b[c2]<=58)&&(b[c2]>=48);c2++)
{}
k=0;
for(i=c1-c2;i<c1;i++)
{
if(a[i]-b[k]>=0)
{
a[i]=a[i]-b[k]+48;
}
else if(a[i]-b[k]<0)
{
for(p=i-1;a[p]==48;p--)
{
a[p]=a[p]+9;
}
if(a[p]!=48)
{
a[p]=a[p]-1;
}
else{}
a[i]=a[i]-b[k]+48+10;
}
k++;
}
printf("%s\n",a);
}
}
|
32
|
15,817 |
void dajianfa(char a[],char b[]);
void main ()
{
int n;
char a[100];
char b[100];
int i;
char nouse;
scanf("%d%c",&n,&nouse);
for (i=0;i<n;i++)
{
gets(a);
gets(b);
dajianfa(a,b);
if(i!=n-1) gets(b);
}
}
void dajianfa(char a[],char b[])
{
int len1,len2;
int i;
len1=strlen(a);
len2=strlen(b);
for(i=1;i<=len2;i=i+1)
{
if(a[len1-i]>=b[len2-i]) a[len1-i]=a[len1-i]-b[len2-i]+48;
else {
a[len1-i-1]-=1;a[len1-i]=a[len1-i]-b[len2-i]+58;
}
}
a[len1]='\0';
puts(a);
}
|
32
|
15,818 |
int main()
{
char sn[10];
int n;
gets(sn);
n = atoi(sn);
int k;
char a[250][250];
char b[250][250];
char cc[10];
for(k=0;k<n;k++)
{
if( k==0)
{
gets(a[k]);
gets(b[k]);
}
else
{
gets(cc);
gets(a[k]);
gets(b[k]);
}
}
int lena[250];
int lenb[250];
int i;int j;
for(k=0;k<n;k++)
{
lena[k]=strlen(a[k]);
lenb[k]=strlen(b[k]);
int shua[251][250];int shub[251][250];
memset(shua[k],0,sizeof(shua[k]));
memset(shub[k],0,sizeof(shub[k]));
j=0;
for(i=lena[k]-1;i>=0;i--)
{
shua[k][j++]=a[k][i]-'0';
}
j=0;
for(i=lenb[k]-1;i>=0;i--)
{
shub[k][j++]=b[k][i]-'0';
}
for(i=0;i<250;i++)
{
shua[k][i]-=shub[k][i];
if(shua[k][i]<0)
{
shua[k][i]+=10;
shua[k][i+1]--;
}
}
int bStartOutput = 0;
for(i=249;i>=0;i--)
{
if(bStartOutput)
{
printf("%d",shua[k][i]);
}
else if(shua[k][i] > 0)
{
printf("%d",shua[k][i]);
bStartOutput = 1;
}
}
printf("\n");
if (!bStartOutput)
printf("0\n");
}
return 0;
}
|
32
|
15,819 |
char a[100];
void fuc(char *num0,int n)//??j-1?
{
if(num0[n]>'0') num0[n]=num0[n]-1;
else {
num0[n]='9';
fuc(num0,n-1);
}
}
void minus(char num0[],char num1[])
{
int last[2],i,j,k;
last[0]=strlen(num0)-1;//??????
last[1]=strlen(num1)-1;
a[last[0]+1]='\0';
for (i=last[1],j=last[0];j>=0;i--,j--)
{
if(i>=0)
{
if(num0[j]-num1[i]>=0) a[j]=num0[j]-num1[i]+'0';
else {a[j]=num0[j]-num1[i]+'0'+10;fuc(num0,j-1);}
}
else a[j]=num0[j];
}
if (a[0]=='0')
for(i=0;;i++)
{
if(a[i]=='0') continue;
else {
j=i;
for (k=j;k<=last[0]+1;k++)
a[k-j]=a[k];
break;
}
}
}
void main()
{
int n,i;
char num[3][100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s %s",num[0],num[1]);
minus(num[0],num[1]);
printf("%s\n",a);
}
}
|
32
|
15,820 |
int main(int argc, char *argv[])
{
char a[100],b[100],c[100],f[100],e[100];
int i,m,k,n;
int d[100];
scanf("%d",&n);
while(n>0)
{
scanf("%s",a);
m=strlen(a);
scanf("%s",b);
k=strlen(b);
for(i=0;i<m;i++)
f[i]=a[m-1-i];
for(i=0;i<k;i++)
e[i]=b[k-1-i];
for(i=k;i<m;i++)
e[i]='0';
for(i=0;i<m;i++)
d[i]=f[i]-e[i];
for(i=0;i<m;i++)
if(d[i]<0)
{
d[i]=d[i]+10;
d[i+1]=d[i+1]-1;}
for(i=0;i<m;i++)
c[i]=d[i]+'0';
int num=0;
for(i=m-1;i>=0;i--)
{if(num)
{printf("%c",c[i]);continue;}
if(c[i]!='0')
{printf("%c",c[i]);
num=1;}
}
printf("\n");
n--;
}
return 0;
}
|
32
|
15,821 |
int bigint1(char*str,int*a)
{
int len=(int)strlen(str);
int i;
for(i=0;i<len;i++)
a[len-i-1]=str[i]-'0';
return len;
}
void bigint2(int*a,int len)
{
int k=len-1;
int i;
while(a[k]==0&&k>0)
k--;
for(i=k;i>=0;i--)
printf("%d",a[i]);
}
int bigint3(int*a,int alen,int*b,int blen,int*c)
{
int i;
for(i=0;i<alen;i++)
{
c[i]=a[i];
if(i<blen) c[i]-=b[i];
}
for(i=0;i<alen;i++)
{
if(c[i]<0)
{
c[i+1]--;
c[i]+=10;
}
}
return c[alen-1]?alen:(alen-1);
}
int main(int argc, char* argv[])
{
char s1[300],s2[300];
int a[300],b[300],c[300];
int alen,blen,clen;
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",s1,s2);
alen=bigint1(s1,a);
blen=bigint1(s2,b);
clen=bigint3(a,alen,b,blen,c);
bigint2(c,clen);
printf("\n");
}
return 0;
}
|
32
|
15,822 |
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
|
15,823 |
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
|
15,824 |
void xj(char x[],char a[])
{
int i,j;
char z[100]={0},y[100];
for(i=0;i<100;i++)
y[i]='0';
for(i=0;i<strlen(a);i++)
y[i+strlen(x)-strlen(a)]=a[i];
for(i=strlen(x)-1;i>=0;i--)
{z[i]=x[i]+10-y[i];
if(i-1>=0)
x[i-1]+=z[i]/10-1;
z[i]=z[i]%10+48;
}
for(i=0;i<strlen(x);i++)
if(z[i]!='0')break;
for(j=i;j<strlen(x);j++)
putchar(z[j]);
putchar('\n');
}
void main()
{
int n,i;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s",a);
scanf("%s",b);
xj(a,b);
}
}
|
32
|
15,825 |
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
|
15,826 |
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
|
15,827 |
int main()
{
int n,i=0,A[50][105]={0},B[50][105]={0},k,j;
char a[50][105],b[50][105];
cin>>n;
while(i<n)
{
cin.get();
cin>>a[i];
cin.get();
cin>>b[i];
cin.get();
k=0;
j=0;
for(k=strlen(a[i])-1; k>=0;k--)
{
A[i][j]=a[i][k]-'0';
j++;
}
j=0;
for(k=strlen(b[i])-1;k>=0;k--)
{
B[i][j]=b[i][k]-'0';
j++;
}
for(j=0;j<105;j++)
{
A[i][j]=A[i][j]-B[i][j];
if(A[i][j]<0)
{
A[i][j]=A[i][j]+10;
A[i][j+1]=A[i][j+1]-1;
}
}
j=104;
while(A[i][j]==0)
j--;
for(k=j;k>=0;k--)
cout<<A[i][k];
cout<<endl;
i++;
}
return 0;
}
|
32
|
15,828 |
int main()
{
int n,i;
char a[200]={'0'},b[200]={'0'};
scanf("%d",&n);
for(i=0;i<n;i++)
{
char c[200]={'0'};
int lena,lenb;
int d,j;
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
d=lena-lenb;
for(j=lena-1;j>=d;j--)
{
b[j]=b[j-d];
b[j-d]='0';
}
for(j=0;j<d;j++) b[j]='0';
for(j=lena-1;j>=0;j--)
{
if(a[j]>=b[j])
c[j]=a[j]-b[j]+'0';
else
{
c[j]=a[j]-b[j]+10+'0';
a[j-1]-=1;
}
}
for(j=0;j<lena;j++)
printf("%c",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15,829 |
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
|
15,830 |
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
|
15,831 |
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
|
15,832 |
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
|
15,833 |
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
|
15,834 |
//******************************************************
//* ? ? ? ?????? *
//* ? ? ???? *
//* ? ? ? ??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
|
15,835 |
int main()
{
void usd(char x[100]);
char a[100],b[100],c[100]={'\0'};
int i,j,k,p,n;
scanf("%d",&n);
for (p=0;p<n;p++)
{
scanf("%s",a);
scanf("%s",b);
usd(a);
usd(b);
k=0;
for (i=0;b[i]!='\0';i++)
{
if (a[i]>=b[i]) c[i]=a[i]-b[i]+48;
else
{
c[i]=a[i]+58-b[i];
a[i+1]=a[i+1]-1;
}
k++;
}
for (j=k;a[j]!='\0';j++) c[j]=a[j];
c[j]='\0';
usd(c);
printf("%s\n",c);
}
}
void usd(char x[100])
{
int r,h,i;
char w;
r=strlen(x);
h=r/2;
for (i=0;i<h;i++)
{
w=x[i];x[i]=x[r-1-i];x[r-1-i]=w;
}
}
|
32
|
15,836 |
main()
{
char str1[10][100],str2[10][100];
int a[10],b[10];
int i,j,k,n,t[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",str1[i],str2[i]);
a[i]=strlen(str1[i]);b[i]=strlen(str2[i]);
}
for(i=0;i<n;i++)
{
for(j=0;j<a[i];j++)
{
if(j<a[i]-b[i])t[j]=str1[i][j]-48;
else t[j]=str1[i][j]-str2[i][j-a[i]+b[i]];
}
for(k=a[i]-1;k>=0;k--)
{
if(t[k]<0)
{
t[k-1]=t[k-1]-1;t[k]=t[k]+10;
}
}
for(k=0;k<a[i];k++)
{
printf("%d",t[k]);
}
printf("\n");
}
}
|
32
|
15,837 |
void main()
{
int n, i, j, ta, tb, t;
char a[50][100]={""}, b[50][100]={""}, blank[3];
scanf("%d\n", &n);
for(i=0; i<n; i++)
{
gets(a[i]);
gets(b[i]);
gets(blank);
}
for(i=0; i<n; i++)
{
ta = 0;
tb = 0;
for(j=0; a[i][j]!='\0'; j++)
ta++;
for(j=0; b[i][j]!='\0'; j++)
tb++;
for(j=tb-1; j>=0; j--)
{
if(a[i][ta-tb+j]<b[i][j])
{
a[i][ta-tb+j] = a[i][ta-tb+j]+10-b[i][j]+48;
for(t=ta-tb+j-1; t>=0; t--)
{
if(a[i][t]>48)
{
a[i][t]--;
break;
}
else
{
a[i][t] = 57;
}
}
}
else
a[i][ta-tb+j] = a[i][ta-tb+j]-b[i][j]+48;
}
}
for(i=0; i<n; i++)
{
puts(a[i]);
}
}
|
32
|
15,838 |
int main()
{
int n,i,j;
scanf("%d",&n);
char a[100],b[100];
for(j=0;j<n;j++)
{
scanf("%s",a);
scanf("%s",b);
int r=strlen(a);
int t=strlen(b);
char *p1,*p2,*p3;
p1=a;
p2=b;
p3=(char *)malloc((r+1)*sizeof(char));
strcpy(p3,a);
for( i=1;i<=t;i++)
{
if(p1[r-i]-p2[t-i]<0)
{
p3[r-i]=p1[r-i]+10-p2[t-i]+'0';
p1[r-i-1]--;
p3[r-i-1]--;
}
else
{
p3[r-i]=p1[r-i]-p2[t-i]+'0';
}
}
printf("%s\n",p3);
free(p3);
}
return 0;
}
|
32
|
15,839 |
void main()
{
char str1[100],str2[100],a[100];
int i,l1,l2,l,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",str1,str2);
l2=strlen(str2);
l1=strlen(str1);
l=l1-l2;
for(j=l2-1;j>=0;j--)
{
if(str1[l+j]>=str2[j])
a[l+j]=str1[l+j]-str2[j];
else
{
a[l+j]=str1[l+j]+10-str2[j];
str1[l+j-1]=str1[l+j-1]-1;
}
}
for(j=0;j<l;j++)
a[j]=str1[j]-48;
for(j=0;j<l1;j++)
printf("%d",a[j]);printf("\n");
}
}
|
32
|
15,840 |
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
|
15,841 |
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
|
15,842 |
int main(){
int n,i,j,k,la,lb;
char a[101],b[101];
int c[101];
cin>>n;
while(n!=0){
cin>>a>>b;
la=strlen(a);
lb=strlen(b);
for(i=la-1,j=lb-1,k=0;j>=0;i--,j--,k++){
if(a[i]>=b[j]) c[k]=a[i]-b[j];
else{
c[k]=a[i]-b[j]+10;
a[i-1]=a[i-1]-1;
}
}
for(;i>=0;i--,k++)
c[k]=a[i]-'0';
for(i=k-1;i>=0;i--){
cout<<c[i];
}
cout<<endl;
n--;
}
return 0;
}
|
32
|
15,843 |
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
|
15,844 |
main()
{
char a[10][100],b[10][100];
int i,j,n,k,l=0;
scanf("%d",&n);
getchar();
for(i=0;i<n-1;i++)
{
gets(a[i]);
gets(b[i]);
getchar();
}
gets(a[n-1]);
gets(b[n-1]);
for(i=0;i<n;i++)
{
k=strlen(a[i]);
l=strlen(b[i]);
for(j=0;j<l;j++)
{
if(a[i][k-j-1]<b[i][l-j-1])
{
a[i][k-j-1]=a[i][k-j-1]+10-b[i][l-j-1]+'1'-1;
a[i][k-j-2]--;
}
else
a[i][k-j-1]=a[i][k-j-1]-b[i][l-j-1]+'1'-1;
}
for(j=0;j<k;j++)
printf("%c",a[i][j]);
printf("\n");
}
}
|
32
|
15,845 |
int main()
{
const int ma=200,mx=50;
int i,n,k,j;
int len1[ma]={0},len2[ma]={0};
int zs1[mx][ma]={0},zs2[mx][ma]={0},ans[mx][ma]={0};
char num1[mx][ma]={0},num2[mx][ma]={0};
cin>>n;
for(k=0;k<n;k++)
{
cin.get();
cin.getline(num1[k],ma);
cin.getline(num2[k],ma);
len1[k]=strlen(num1[k]);
len2[k]=strlen(num2[k]);
}
for(k=0;k<n;k++)
{
j=0;
for(i=len1[k]-1;i>=0;i--)
zs1[k][j++]=num1[k][i]-'0';
j=0;
for(i=len2[k]-1;i>=0;i--)
zs2[k][j++]=num2[k][i]-'0';
for(i=0;i<len1[k];i++)
{
if(i<len2[k])
{
if(zs1[k][i]<zs2[k][i])
{
zs1[k][i]=zs1[k][i]+10;
zs1[k][i+1]=zs1[k][i+1]-1;
ans[k][i]=zs1[k][i]-zs2[k][i];
}
else
ans[k][i]=zs1[k][i]-zs2[k][i];
}
else
ans[k][i]=zs1[k][i]-zs2[k][i];
}
}
for(k=0;k<n;k++)
{
if(ans[k][len1[k]]==0)
len1[k]=len1[k]-1;
for(i=len1[k];i>=0;i--)
{
cout<<ans[k][i];
}
cout<<endl;
}
return 0;
}
|
32
|
15,846 |
int main()
{
int n,l1,l2, c[101],d[101];char a[101],b[101]; //????????????
memset(a,0,sizeof(a));memset(b,0,sizeof(b)); //??????
cin >> n;
while(cin >> a >> b) //?????
{
int i=0,j=0;
memset(c,0,sizeof(c));memset(d,0,sizeof(d));
l1=strlen(a);l2=strlen(b); //?????????????????
for(i=l1-1;i>=0;i--)
c[j++]=a[i]-'0';
j=0;
for(i=l2-1;i>=0;i--)
d[j++]=b[i]-'0';
for(i=0;i<100;i++) //???
{
c[i+1]--;
c[i]=c[i]+10;
c[i]=c[i]-d[i];
if(c[i]>=10)
{
c[i]=c[i]-10;
c[i+1]=c[i+1]+1;
}
}
i=100;
while(c[i]==0&&i>0) //???
i--;
for(j=i;j>=0;j--)
cout <<c[j];
cout << endl;
};
return 0;
}
|
32
|
15,847 |
void main()
{
int n,z,p,q,i,j,s,h;
char a[100],b[100];
scanf("%d",&n);
for(z=0;z<n;z++)
{
scanf("%s\n%s",a,b);
p=strlen(a);
q=strlen(b);
for(i=p-1,j=q-1;i>=0;i--,j--)
{
if(j>=0)
{
if(*(a+i)>=*(b+j))
*(a+i)=*(a+i)-*(b+j)+48;
else
{
*(a+i)=*(a+i)-*(b+j)+58;
*(a+i-1)=*(a+i-1)-1;
}
}
else
{
if(*(a+i)<'0')
{
*(a+i)=*(a+i)+10+48;
*(a+i-1)=*(a+i-1)-1;
}
else
break;
}
}
for(s=0;s<p;s++)
{
if(*(a+s)!='0')
{for(h=s;h<p;h++)
printf("%d",*(a+h)-48);
break;}
}
printf("\n");
}
}
|
32
|
15,848 |
main()
{
int n;
int i;
int j;
int l1;
int l2;
scanf("%d",&n);
char **pp=(char **)malloc((2*n)*sizeof(char *));
for(i=0;i<2*n;i++)
pp[i]=(char *)malloc(100*sizeof(char));
for(i=0;i<2*n;i++)
scanf("%s",pp[i]);
for(i=0;i<2*n;i=i+2)
{
l1=strlen(pp[i]);
l2=strlen(pp[i+1]);
for(j=0;j<l2;j++)
{
pp[i+1][l1-j-1]=pp[i+1][l2-j-1];
}
for(j=0;j<l1-l2;j++)
{
pp[i+1][j]='0';
}
for(j=l1-1;j>l1-l2-1;j=j-1)
{
if(pp[i][j]-pp[i+1][j]<0)
{
pp[i][j-1]=pp[i][j-1]-1;
pp[i][j]='0'+pp[i][j]-pp[i+1][j]+10;
}
else
{
pp[i][j]='0'+pp[i][j]-pp[i+1][j];
}
}
printf("%s\n",pp[i]);
}
for(i=0;i<2*n;i++)
free(pp[i]);
free(pp);
}
|
32
|
15,849 |
int main()
{
int n , m , len1 , len2 , i = 0 , j = 0 ;
char jian[ 1001 ] , bjian[ 1001 ] ;
int jn[ 1001 ] , bj[ 1001 ] ;
cin >> n ;
for( m = 1 ; m <= n ; m ++ )
{
cin >> bjian >> jian ;
len1 = strlen( bjian ) ;
len2 = strlen( jian ) ;
memset( jn , 0 , sizeof( jian ) ) ;
memset( bj , 0 , sizeof( bjian ) ) ;
//cout << bjian << endl << jian << endl ;
j = 0 ;
//???????????????
for( i = len1 - 1 ; i >= 0 ; i -- )
bj[ j ++ ] = bjian[ i ] - '0' ;
j = 0 ;
//???????????????
for( i = len2 - 1 ; i >= 0 ; i -- )
jn[ j ++ ] = jian[ i ] - '0' ;
if( strcmp( bjian , jian ) != 0)
{
//????
for( i = 0 ; i <= len1 ; i ++ )
{
bj[ i ] = bj[ i ] - jn[ i ] ;
if( bj[ i ] < 0 )
{
bj[ i + 1 ] -- ;
bj[ i ] += 10 ;
}
}
i = len1 ;
//???????0??
while( bj[ i ] == 0 )
i -- ;
for( ; i >= 0 ; i -- )
cout << bj[ i ] ;
cout << endl ;
}
else
cout << '0' << endl ;
}
return 0 ;
}
|
32
|
15,850 |
void main()
{
int n,lengtha,lengthb,i,j,k,l;
char a[100],b[100],c[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n",a);
scanf("%s\n",b);
lengtha=strlen(a);
lengthb=strlen(b);
for(j=1;j<=lengthb;j++)
{
if (a[lengtha-j]>=b[lengthb-j])
c[lengtha-j]=a[lengtha-j]-b[lengthb-j];
else
{ c[lengtha-j]=a[lengtha-j]-b[lengthb-j]+10;
a[lengtha-j-1]=a[lengtha-j-1]-1;}
}
if(a[lengtha-j]<0)
{
a[lengtha-j]=a[lengtha-j]+10;
a[lengtha-j-1]=a[lengtha-j-1]-1;
}
for(k=lengtha-j;k>=0;k--)
c[k]=a[k]-48;
for(l=0;l<lengtha;l++)
printf("%d",c[l]);
printf("\n");
}
}
|
32
|
15,851 |
void read(char x[]) /* read is used to overturn x[] */
{
char temp[100];
int i,k;
scanf("%s",temp);
k=strlen(temp);
x[k]=0;
for(i=0;i<k;i++)
x[i]=temp[k-1-i];
}
void main()
{
char a[100],b[100];
int i,j,la,lb,k,n;
scanf("%d",&n);
for(k=1;k<=n;k++)
{
read(a);
read(b);
la=strlen(a);
lb=strlen(b);
for(i=0;i<lb;i++)
{
if(a[i]<b[i])
{
a[i]=a[i]+10-b[i]+'0';
a[i+1]--;
}
else
a[i]=a[i]-b[i]+'0';
}
for(i=lb;i<la;i++)
{
if(a[i]<'0')
{
a[i]=a[i]+10;
a[i+1]--;
}
}
for(i=0,j=0;i<la;i++)
{
if(a[la-1-i]!='0' || j!=0)
{
printf("%c",a[la-1-i]);
j=1;
}
}
if(j==0) printf("0");
printf("\n");
}
}
|
32
|
15,852 |
//********************************
//*???????? **
//*?????? 1300012855 **
//*???2013.11.13 **
//********************************
int main(void)
{
int n; // ???
char ac[101], bc[101]; // ??????
int a[101], b[101]; // ??????
int al, bl; // ???????
cin >> n;
for(int i = 1; i <= n ; i++)
{
cin >> ac >> bc;
al = strlen(ac);
bl = strlen(bc);
for(int j = al - 1; j >= 0; j--) // ????
{
a[j] = ac[al - j - 1] - '0';
}
for(int j = bl - 1; j >= 0; j--) // ????
{
b[j] = bc[bl - j - 1] - '0';
}
for(int j = 0; j < bl; j++) // ???
{
a[j] -= b[j]; // ??
if(a[j] < 0) // ?????????
{
a[j] += 10;
a[j + 1]--;
}
}
int x;
for(x = al - 1; a[x] == 0; x--); // ???????
for(; x >= 0; x--)
{
cout << a[x]; // ????
}
cout << endl;
}
return 0;
}
|
32
|
15,853 |
int trans(char str[], int a[])
{
int l=(int)strlen(str);
int i;
for (i=0;i<l;i++)
{ a[l-i-1]=str[i]-'0';
}
return l;
}
void print(int a[], int l)
{
int k=l-1;
int i;
while (a[k]==0 && k>0)
{ k--;
}
for (i=k;i>=0;i--)
{ printf("%d",a[i]);
}
}
int minus(int a[], int al, int b[], int bl,int c[])
{
int i;
for (i=0;i<al;i++)
{ c[i]=a[i];
if (i<bl) c[i]=c[i]-b[i];
}
for (i=0;i<al;i++)
{ if (c[i]<0)
{ c[i+1]--;
c[i]=c[i]+10;
}
}
return al;
}
int main()
{
char s1[101],s2[101];
int a[101],b[101],c[101];
int al,bl,cl,i,n;
scanf("%d",&n);
for (i=0;i<n;i++)
{ scanf ("%s%s",s1,s2);
al=trans(s1,a);
bl=trans(s2,b);
cl=minus(a,al,b,bl,c);
print(c,cl);
printf("\n");
}
return 0;
}
|
32
|
15,854 |
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
|
15,855 |
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
|
15,856 |
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
|
15,857 |
/*???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
|
15,858 |
int main()
{
int k,i,j,m,n;
char str1[100]={'\0'},str2[100]={'\0'},c[100][100]={'\0'};
scanf("%d\n",&k);
for(i=0;i<k;i++)
{ gets(str1);gets(str2);getchar();
m=strlen(str1);n=strlen(str2);
for(j=1;j<=n;j++)
{if((str1[m-j]-str2[n-j])>=0){str1[m-j]=str1[m-j]-str2[n-j];}
else{str1[m-j]=str1[m-j]-str2[n-j]+10;str1[m-j-1]=str1[m-j-1]-1;}
str1[m-j]+=48;}
strcpy(c[i],str1);
}
for(i=0;i<k;i++){printf("%s\n",c[i]);}
}
|
32
|
15,859 |
//
// ????? ?????
// ????? ?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
|
15,860 |
/********************************
*????? *
* *
* Created on: 2010-12-24 *
* Author: ?? *
********************************/
int main()
{
char a[101],b[101]; //????????????????
int n;
cin>>n; //?????????
while(n>0)
{
cin.getline(a,101);
cin.getline(a,101); //???????
cin.getline(b,101);
int k=strlen(a)-1;
for(int i=strlen(b)-1;i>=0;i--) //????????????
{
if(a[k]>=b[i])
{
a[k]=a[k]-b[i]+48; //?????????????????
}
else
{
a[k]=a[k]+10-b[i]+48; //?????????
int j=1;
while(true)
{
if(a[k-j]!='0')
{
a[k-j]=a[k-j]-1;
break;
}
else
{
a[k-j]='9';
j++;
}
}
}
k--;
}
cout<<a<<endl; //????????
n--;
}
return 0;
}
|
32
|
15,861 |
int main()
{
int n,i,j,x,y;
char a[100],b[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
x=strlen(a);
y=strlen(b);
for(j=y-1;j>=0;j--)
{
if(a[x-y+j]<b[j])
{
a[x-y+j]=a[x-y+j]+10-b[j]+48;
a[x-y+j-1]-=1;
}
else
a[x-y+j]=a[x-y+j]-b[j]+48;
}
printf("%s\n",a);
}
return 0;
}
|
32
|
15,862 |
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
|
15,863 |
//********************************
//*???????? **
//*?????? 1300012745 **
//*???2013.11.19 **
//********************************
int main()
{
char stra[102], strb[102];
int n, num1[102] = {0}, num2[102] = {0}, num[102] = {0}, i, lena, lenb, j, k;
cin >> n;
for (i = 1; i <= n; i++)
{
cin.get();
cin.getline(stra,102);
cin.getline(strb,102);
lena = strlen(stra);
lenb = strlen(strb);
memset(num1,0,sizeof(num1));
memset(num2,0,sizeof(num2));
memset(num,0,sizeof(num));
k = 0;
for (j = lena - 1; j >= 0; j--)
{
num1[k++] = stra[j] - '0';
}
k = 0;
for (j = lenb - 1; j >= 0; j--)
{
num2[k++] = strb[j] - '0';
}
for (j = 0; j < 102; j++)
{
num1[j]-=num2[j];
if (num1[j] < 0)
{
num1[j]+=10;
num1[j + 1]--;
}
}
j = lena;
while (num1[j] == 0)
j--;
for (k = j; k >= 0; k--)
cout << num1[k];
cout << endl;
}
return 0;
}
|
32
|
15,864 |
void main()
{
char a[100],b[100],c[100][100];
int n,i,j,k,l1,l2;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
l1=strlen(a);
l2=strlen(b);
for(j=l1-1,k=l2-1;k>=0;j--,k--)
{
a[j]=a[j]-b[k]+'0';
if(a[j]<'0')
{
a[j]=a[j]+10;
a[j-1]=a[j-1]-1;
}
}
strcpy(c[i],a);
}
for(i=0;i<n;i++)
printf("%s\n",c[i]);
}
|
32
|
15,865 |
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
|
15,866 |
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
|
15,867 |
//
// ????? ?????
// ????? ?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
|
15,868 |
/*
? ? ??1000012827_1.cpp
? ?????
?????20101117
??????????????
**/
int main()
{
char minuend[101], subtrahend[101]; //????????
int n, k = 1, c = -1; //??????n????????c??????????????????
cin >> n;
for(k = 1; k <= n; k ++)
{
cin.get(); //????
//????????????????????????a b ????????result????d e????
int m[100] = {0}, s[100] = {0}, a, b, result[100] = {0}, d = 99, e = 99;
cin.getline(minuend, 100); //??????
cin.getline(subtrahend, 100);
a = strlen(minuend); //???????????
b = strlen(subtrahend);
for(int i = a - 1; i >= 0; i --) //???????
{
m[d] = minuend[i] - '0';
d --;
}
for(int i = b - 1; i >= 0; i --)
{
s[e] = subtrahend[i] - '0';
e --;
}
for(int i = 99; i > 99 - a; i --) //????????
{
if(m[i] >= s[i])
result[i] = m[i] - s[i];
else //????????????????????
{
m[i] = m[i] + 10;
m[i - 1] --;
result[i] =m[i] - s[i];
}
}
for(int i = 0; i < 100; i ++)
if(result[i] != 0) //???????????????
{
c = i;
break;
}
if(c == -1) //?????????
cout << "0" << endl;
else //????????????????????99?
{
for(int i = c; i < 99; i ++)
cout << result[i];
cout << result[99] << endl; //?????100?????
}
}
return 0;
}
|
32
|
15,869 |
void calculate(int);
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
calculate(n-i==1?0:1);
return 0;
}
void calculate(int isblank)
{
char large[101],small[101],dif[101];
int large_len,small_len,digit_L,digit_S,digit_dif;
char *p_L,*p_S,*p_dif;
scanf("%s",large);
scanf("%s",small);
large_len=strlen(large);
p_L=large+large_len-1;
small_len=strlen(small);
p_S=small+small_len-1;
p_dif=dif+large_len-1;
*(p_dif+1)=0;
while(p_S-small+1)
{
digit_L=*p_L-'0';
digit_S=*p_S-'0';
digit_dif=digit_L-digit_S;
if(digit_dif<0)
{
digit_dif+=10;
(*(p_L-1))--;
}
*p_dif=digit_dif+'0';
p_L--;
p_S--;
p_dif--;
}
while(p_L>=large)
{
*p_dif=*p_L;
if(*p_L<'0')
{
*p_dif+=10;
(*(p_L-1))--;
}
p_L--;
p_dif--;
}
do
p_dif++;
while(*p_dif=='0');
if(*p_dif)
puts(p_dif);
else
printf("0\n");
if(isblank)
gets(dif);
}
|
32
|
15,870 |
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
|
15,871 |
void main()
{
char a[101],b[101];
int c[100],d[100];
int i,l1,l2,n,j;
scanf("%d",&n);
while(n--)
{
scanf("%s%s",a,b);
l1=strlen(a);
l2=strlen(b);
//printf("%d,%d\n",l1,l2);
for(i=0;i<l1;i++)
c[i]=a[l1-i-1]-'0';
for(i=0;i<l2;i++)
d[i]=b[l2-i-1]-'0';
for(i=0;i<l2;i++)
{
c[i]-=d[i];
if(c[i]<0)
{
c[i]+=10;
c[i+1]--;
}
}
for(i=l1-1;i>=0;i--)
if(c[i]!=0) break;
for(j=i;j>=0;j--)
printf("%d",c[j]);
printf("\n");
}
}
|
32
|
15,872 |
//33453453553
// 34345
char str1[1000];
char str2[1000];
int num1[1000];
int num2[1000];
int main(){
int n;
cin>>n;
getchar();
while (n--){
cin.getline(str1,999);
cin.getline(str2,999);
int len1=strlen(str1);
int len2=strlen(str2);
int i;
for(i=0;i<len1;i++){
num1[i]=str1[i]-'0';
}
for(i=0;i<len2;i++){
num2[i]=str2[i]-'0';
}
int *p1=num1+len1-1;
int *p2=num2+len2-1;
for(i=0;i<len2;i++){
*p1=*p1-*p2;
if (*p1<0){
*p1=*p1+10;
*(p1-1)=*(p1-1)-1;
}
p1--;
p2--;
}
int sum=0;
for(i=0;i<len1;i++){
sum=sum+num1[i];
}
if (sum==0){
cout<<"0"<<endl;
return 0;
}
int state=0;
for(i=0;i<len1;i++){
if ((state==0)&&(num1[i]!=0)){
state++;
cout<<num1[i];
continue;
}
if (state==0){
if (num1[i]==0) continue;
}
if (state==1){
cout<<num1[i];
}
}
cout<<endl;
getchar();
}
return 0;
}
|
32
|
15,873 |
//**************************
//* ????????? *
//* ? ????? *
//* ? ??1000012738 *
//* ? ??2010.11.20 *
//**************************
int main()
{
char a[101], b[101]; //?????????????
int c, d, n, i, j, k; //??????
cin >> n; //??????
for(i = 0; i < n; i ++)
{
cin >> a >> b; //?????
c = strlen(a); //????
d = strlen(b);
int numa[100] = {0}; //????????????
int numb[100] = {0};
k = 0; //?????
for(j = c - 1; j >=0; j --) //??????
{
numa[k ++] = a[j] - '0';
}
k = 0;
for(j = d - 1; j >= 0; j --)
{
numb[k ++] = b[j] - '0';
}
for(j = 0; j <= d; j ++) //???????
{
numa[j] -= numb[j];
if(numa[j] < 0) //????????
{
numa[j] += 10; //????
numa[j + 1] --;
}
}
j = c;
while(numa[j] == 0) //?????????0??
j --;
for( ; j >= 0; j --) //??
cout << numa[j];
cout << endl; //??
}
return 0;
}
|
32
|
15,874 |
void main()
{
int n, i, j, la, lb, k;
char a[100][100], b[100][100], c[100][100]={'\0'};
scanf("%d\n", &n);
gets(a[0]);
gets(b[0]);
for(i=1; i<n; i++)
{
scanf("\n");
gets(a[i]);
gets(b[i]);
}
for(i=0; i<n; i++)
{
la=strlen(a[i]);
lb=strlen(b[i]);
for(j=la-1; j>=la-lb; j--)
{
if(a[i][j]>=b[i][j-la+lb])
a[i][j]=a[i][j]-b[i][j-la+lb]+48;
else
{
a[i][j]=58+a[i][j]-b[i][j-la+lb];
if(a[i][j-1]>'0')
a[i][j-1]--;
else
{
k=j;
while(a[i][k-1]=='0')
{
a[i][k-1]='9';
k--;
}
a[i][k-1]--;
}
}
}
k=0;
for(j=0; a[i][j]!='\0'; j++)
if(a[i][j]!='0') break;
for(j=j; a[i][j]!='\0'; j++)
{
c[i][k]=a[i][j];
k++;
}
puts(c[i]);
}
}
|
32
|
15,875 |
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
|
15,876 |
void main ()
{
int i=0,j=0,k,t,r=0,h;
int x[100],y[100],z[100],s[100]={0};
char a[100][100],b[100][100];
scanf ("%d",&j);
for (i=0;i<j;i++)
{
scanf ("%s%s",a[i],b[i]);
getchar();
x[i]=strlen(a[i]);
y[i]=strlen(b[i]);
}
for (i=0;i<j;i++)
{
for (k=0;k<y[i];k++)
{
if (a[i][x[i]-k-1]>=b[i][y[i]-k-1])
{
a[i][x[i]-k-1]=a[i][x[i]-k-1]-b[i][y[i]-k-1]+'0';
}
else
{
a[i][x[i]-k-1]=a[i][x[i]-k-1]-b[i][y[i]-k-1]+10+'0';
a[i][x[i]-k-2]=a[i][x[i]-k-2]-1;
}
}
}
for (i=0;i<j;i++)
{
printf("%s\n",a[i]);
}
}
|
32
|
15,877 |
/*??
?2??????????
????
?1?????????n????????2???1?????a??2????b(a > b)??????????????????????100?
????
n????????????????????
????
2
9999999999999999999999999999999999999
9999999999999
5409656775097850895687056798068970934546546575676768678435435345
1
????
9999999999999999999999990000000000000
5409656775097850895687056798068970934546546575676768678435435344
*/
char imim[101],isub[101],istore[101];
int carry=0;
char *p=NULL,*q=NULL;
void subtraction()
{
if(q==isub)
{
*p=(*p-*q-carry+'0');
}
else
{
if(*p>=(*q+carry))
{
*p=(*p-*q-carry+'0');
carry=0;
}
else
{
*p=(*p+10-*q-carry+'0');
carry=1;
}
p--;q--;
subtraction();
}
}
int main()
{
int n=0;
cin>>n;
for(int i=0;i<n;i++)
{
memset(imim,'0',sizeof(imim));
memset(isub,'0',sizeof(isub));
memset(istore,'0',sizeof(istore));
carry=0;
cin>>imim>>istore;
int gap=0;
gap=strlen(imim)-strlen(istore);
for(int i=0;i<=strlen(istore);i++)
{
isub[i+gap]=istore[i];
}
p=imim+strlen(imim)-1;
q=isub+strlen(isub)-1;
subtraction();
cout<<imim<<endl;
}
return 0;
}
|
32
|
15,878 |
int main()
{
int i, j ,m, n;
scanf ("%d", &n);
for (m=0; m<n; m++)
{
char a[SIZE+1]={0}, b[SIZE+1]={0};
char carry=0;
char a_str[SIZE+1], b_str[SIZE+1];
char ab_minus[SIZE+1] = {0};
int big = 0;
scanf ("%s", a_str);
scanf ("%s", b_str);
for (i = strlen(a_str), j = SIZE ; i>=0 ; i--, j--)
a[j] = a_str[i] - '0';
for (i = strlen(b_str), j = SIZE ; i>=0 ; i--, j--)
b[j] = b_str[i] - '0';
for (i = SIZE-1; i>= 0; i--)
{
if (a[i] - carry < b[i])
{
a[i]+=10;
ab_minus[i] = a[i] - b[i] - carry;
carry = 1;
}
else
{
ab_minus[i] = a[i] - b[i] - carry;
carry = 0;
}
}
for (i=0; i < SIZE-1 && ab_minus[i] == 0; i++);
for (; i < SIZE; i++)
printf ("%c", ab_minus[i] + '0');
printf ("\n");
}
return 0;
}
|
32
|
15,879 |
void main()
{
int n, result[100];
char a[100], b[100], c[2];
scanf("%d", &n);
int i,s,t,j,k;
for(i=0;i<n;i++)
{
gets(c);
gets(a);
gets(b);
s=strlen(a);
t=strlen(b);
for (j=s-1; ;j--)
{
if (a[j]>=b[j-s+t])
result[j] = a[j]-b[j-s+t];
else
{
result[j] = a[j]-b[j-s+t]+10;
a[j-1]--;
}
if (j-s+t==0)
break;
}
for(k=0; k<j; k++)
result[k]=a[k]-'0';
if(j>0)
{
for(k=0;k<s;k++)
printf("%d",result[k]);
printf("\n");
}
else
{
for(k=0;k<s;k++)
if (result[k]!=0)
break;
for(j=k;j<s;j++)
printf("%d",result[k]);
printf("\n");
}
}
}
|
32
|
15,880 |
void main()
{
void minus(char x[1000],char y[1000]);
int i,n;
char a[1000]={0},b[1000]={0};
scanf("%d",&n);
i=0;
while(i<n)
{
scanf("%s",a);
scanf("%s",b);
if(a[0]!='\0')
{
i=i+1;
minus(a,b);
printf("\n");
}
}
}
void minus(char x[1000],char y[1000])
{
int la,lb,i,s,c=0,t=0,ls;
char str[1000]={0},temp;
la=strlen(x);
lb=strlen(y);
do
{
if(lb>0)s=x[la-1]-y[lb-1];
if(lb<=0)s=x[la-1]-48;
s=s-c+48;
if(s<48)
{
s=s+10;
c=1;
}
else c=0;
str[t]=s;
t++;
la--;
lb--;
}
while(la>0);
ls=strlen(str);
for(i=ls-1;;i--)
{
if(str[i]=='0')str[i]='\0';
if(str[i]!='0')break;
}
ls=strlen(str)-1;
for(i=0;i<=ls/2;i++)
{
temp=str[i];
str[i]=str[ls-i];
str[ls-i]=temp;
}
printf("%s",str);
}
|
32
|
15,881 |
int main()
{
void align(char a[]);
void substract(char a[],char b[],char c[]);
char a[101],b[101],c[101];
int i,j,t,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
getchar();
gets(a);
gets(b);
align(a);
align(b);
substract(a,b,c);
for(j=0;j<100;j++)if(c[j]!='0'){t=j;break;}
for(j=0;j<100-t;j++)c[j]=c[j+t];
c[100-t]='\0';
puts(c);
}
}
void align(char a[])
{
int jump,m;
a[100]='\0';
jump=100-strlen(a);
for(m=100-jump;m>0;m--)
a[m+jump-1]=a[m-1];
for(m=0;m<jump;m++)
a[m]='0';
}
void substract(char a[],char b[],char c[])
{
int i,carry=0;
for(i=99;i>=0;i--)
{
if(carry+b[i]>a[i]){c[i]=a[i]+10-(b[i]+carry)+'0';carry=1;}
else{c[i]=a[i]-(b[i]+carry)+'0';carry=0;}
}
}
|
32
|
15,882 |
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
|
15,883 |
void main()
{
char a[101],b[101];
int n,i,k,j,c[101],l1,l2;
scanf("%d",&n);
for (i=0;i<n;i++)
{
for (j=0;j<=100;j++) c[j]=0;
scanf("%s",a);
scanf("%s",b);
l1=strlen(a);
l2=strlen(b);
for (j=100;j>=101-l1;j--) a[j]=a[l1-101+j]-'0';
for (j=100;j>=101-l2;j--) b[j]=b[l2-101+j]-'0';
for (j=0;j<101-l1;j++) a[j]=0;
for (j=0;j<101-l2;j++) b[j]=0;
for (j=100;j>=100-((l1>l2)?l1:l2);j--)
{
c[j]+=a[j]-b[j];
if (c[j]<0) {c[j]=c[j]+10; c[j-1]--;}
}
j=0;
while (c[j]==0) j++;
for (k=j;k<=100;k++) printf("%d",c[k]);
printf("\n");
}
}
|
32
|
15,884 |
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
|
15,885 |
int p1,p2,p3,i,n,j;
char a[1000];
char b[1000];
char c[1000];
int max(int a,int b)
{
if (a>b) return a;else return b;
}
int za(int m)
{
if (m<0) return 0;else return a[m]-'0';
}
int zb(int m)
{
if (m<0) return 0;else return b[m]-'0';
}
int main()
{
cin>>n;
for (j=1;j<=n;j++)
{
for (i=0;i<=999;i++) {a[i]='\0';b[i]='\0';c[i]='\0';}
cin>>a;
cin>>b;
p1=0;while(a[p1]!='\0')p1++;p1--;
p2=0;while(b[p2]!='\0')p2++;p2--;
c[0]=0;
for (i=0;i<=max(p1,p2)+1;i++) c[i]=za(p1-i)-zb(p2-i);
for (i=0;i<=max(p1,p2)+1;i++)
{
c[i+1]+=(c[i]+10)/10-1;
c[i]=(c[i]+10)%10;
}
p3=900;while((c[p3]==0)&&(p3>=0))p3--;
for (i=p3;i>=0;i--) cout<<(int)c[i];
if (p3<=0) cout<<0;
cout<<endl;
}
return 0;
}
|
32
|
15,886 |
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
|
15,887 |
int main()
{
char temp[101];
int n,a[101]={0},b[101]={0},c[101]={0},i,j,l,m,is;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
is=1;
scanf("%s",temp);
l=strlen(temp);
for(j=l-1;j>=0;j--)
a[l-j]=temp[j]-48;
scanf("%s",temp);
m=strlen(temp);
for(j=m-1;j>=0;j--)
b[m-j]=temp[j]-48;
for(j=m+1;j<=100;j++)b[j]=0;
for(j=1;j<=l;j++)
{
if(a[j]<b[j])
{
a[j]+=10;
a[j+1]--;
}
c[j]=a[j]-b[j];
}
while(c[l]==0){l--;if(l==0){is=0;break;}}
if(is){for(j=l;j>=1;j--)printf("%d",c[j]);
printf("\n");}
else printf("%d\n",0);
}
}
|
32
|
15,888 |
int main()
{
int n,i,j,a[100],b[100],length1,length2;
char s1[100],s2[100];
scanf("%d",&n);
while(n--)
{
scanf("%s",s1);
scanf("%s",s2);
length1=strlen(s1);
length2=strlen(s2);
for(i=0;i<100;i++)
{
a[i]=0;
b[i]=0;
}
for(i=0;i<length1;i++)
a[length1-1-i]=s1[i]-'0';
for(i=0;i<length2;i++)
b[length2-1-i]=s2[i]-'0';
for(i=0;i<length1;i++)
{
a[i]-=b[i];
if(a[i]<0)
{
a[i+1]--;
a[i]+=10;
}
}
for(i=length1-1;i>=0;i--)
if(a[i]!=0)
{j=i;break;}
for(i=j;i>=0;i--)
printf("%d",a[i]);
printf("\n");
}
return 0;
}
|
32
|
15,889 |
void main()
{
char a[100][100],b[100][100],eat;
int i,ca,cb,n,j;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%s",a[j]);
scanf("%s",b[j]);
}
for(j=0;j<n;j++)
{
for(i=0;a[j][i]!='\0';i++)
a[j][i]=a[j][i]-'1'+1;
ca=i-1;
for(i=0;b[j][i]!='\0';i++)
b[j][i]=b[j][i]-'1'+1;
cb=i-1;
for(i=ca;i-ca+cb>=0;i--)
{
if(a[j][i]<b[j][i-ca+cb])
{
a[j][i-1]-=1;
a[j][i]=a[j][i]+10-b[j][i-ca+cb];
}
else
a[j][i]=a[j][i]-b[j][i-ca+cb];
}
for(i=ca;i>=1;i--)
if(a[j][i]==-1)
{
a[j][i]=9;
a[j][i-1]-=1;
}
for(i=0;i<=ca;i++)
a[j][i]=a[j][i]-1+'1';
printf("%s\n",a[j]);
}
}
|
32
|
15,890 |
void main()
{
char str1[100],str2[100];int n,i,j,k,p;
int a[100],b[100];
int yidegeshu,erdegeshu;
scanf("%d",&n);
for(p=0;p<=n-1;p++)
{
scanf("%s",str1);
scanf("%s",str2);
yidegeshu=strlen(str1);
erdegeshu=strlen(str2);
for(i=0;i<=yidegeshu-1;i++)
a[i]=str1[yidegeshu-i-1]-48;
for(i=0;i<=erdegeshu-1;i++)
b[i]=str2[erdegeshu-i-1]-48;
for(j=erdegeshu;j<=yidegeshu-1;j++)
b[j]=0;
for(i=0;i<=yidegeshu-1;i++)
{
if(a[i]>=b[i])
{a[i]=a[i]-b[i];}
else if(a[i]<b[i])
{
a[i]=a[i]+10;
a[i+1]=a[i+1]-1;
a[i]=a[i]-b[i];
}
}
for(k=yidegeshu-1;k>=0;k--)
{ printf("%d",a[k]);}
printf("\n");
}
}
|
32
|
15,891 |
//????????//
//??????//
//???1000011029//
//???2010?11?20?//
int main()
{
int n = 0; //??????????//
char num1[102]; //????????//
char num2[102]; //????????//
int i = 0; //??????????//
int t = 0; //???????????????//
int k = 0; //???????????????//
int m = 0; //????????//
int g = 0; //????????//
cin >> n; //????//
for( i = 1;i <= n;i++ ) //??????//
{
cin.ignore(); //??\0//
memset(num1,'0',102);
memset(num2,'0',102);
cin.getline( num1,102 ); //?????//
cin.getline( num2,102 ); //?????//
t = strlen(num1); //???????????//
k = strlen(num2); //???????????//
t = t - 1; //???????????????//
g = t; //?????????????//
for(k = k - 1 ;k >= 0;k-- ) //??????//
{
if( num1[t] >= num2[k] ) //???//
num1[t] = num1[t] - num2[k] + '0';
else //???//
{
num1[t] = 10 + num1[t] - num2[k] + '0';
num1[t - 1]--;
}
t--;
}
for( m = 0;m <= g;m++ )
{
if( num1[m] != 0 )
{
for( t = m;t <= g;t++ )
cout << num1[t]; //??????//
cout << endl;
break;
}
}
}
return 0;
}
|
32
|
15,892 |
//********************************
//*???????? **
//*?????? 1300012861 **
//*???2013.11.17 **
//********************************
int main()
{
int n, i, j, k, max, str1[110], str2[110];
char num1[110], num2[110];
cin >> n;
for ( i = 1; i <= n; i++ )
{
cin >> num1;
int nlen1 = strlen(num1);
cin >> num2;
int nlen2 = strlen(num2);
memset(str1, 0, sizeof(str1));
memset(str2, 0, sizeof(str2));
j = 0;
for ( k = nlen1 - 1; k >= 0; k-- )
{
str1[j++] = num1[k] - '0';
}
j = 0;
for ( k = nlen2 - 1; k >= 0; k-- )
str2[j++] = num2[k] - '0';
for ( j = 0; j < nlen2; j++ )
{
str1[j] = str1[j] - str2[j];
if ( str1[j] < 0 )
{
str1[j+1]--;
str1[j] = 10 + str1[j];
}
}
j = nlen1;
while ( str1[j] == 0 )
j--;
for ( ; j >= 0; j-- )
cout << str1[j];
cout << endl;
}
return 0;
}
|
32
|
15,893 |
void main()
{
int i,j,k,n;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s%s",a,b);
for(j=strlen(a)-1,k=strlen(b)-1;k>=0;j--,k--)
{
a[j]=a[j]-b[k]+'0';
if(a[j]<'0')
{
a[j]=a[j]+10;
a[j-1]=a[j-1]-1;
}
}
k=strlen(a);
for(j=0;a[j]=='0';j++);
for(;j<k;j++)
printf("%c",a[j]);
printf("\n");
}
}
|
32
|
15,894 |
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
|
15,895 |
void minus(char a[],char b[]);
void main()
{
int n,i;
char a[max][max],b[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]);
printf("%s\n",a[i]);
}
}
void minus(char a[],char b[])
{
int la,lb,i,t,j,s,c,k=0;
la=strlen(a)-1;
lb=strlen(b)-1;
for(i=la-lb;i<=la;i++)
{
s=a[i];
c=b[k];
a[i]=s-c+48;
t=i;
while(a[i]<'0')
{
a[i]+=10;
a[--i]--;
}
i=t;
k++;
}
i=0;
while(a[i]=='0')
{
for(j=0;j<=strlen(a);)
{
a[j]=a[++j];
}
i++;
}
}
|
32
|
15,896 |
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
|
15,897 |
int main()
{
int a[100], b[100], len1, len2, i, j, n, k;
char a1[101], b1[101];
cin >> n;
for(k = 0; k < n; k++)
{
cin.get();
cin.getline(a1, 101);
cin.getline(b1, 101);
len1 = strlen(a1);
len2 = strlen(b1);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
j = 0;
for(i = len1 - 1; i >= 0; i--)
a[j++] = a1[i] - '0';
j = 0;
for(i = len2 - 1; i >= 0; i--)
b[j++] = b1[i] - '0';
for(i = 0; i < 100; i++)
{
a[i] = a[i] - b[i];
if(a[i] < 0)
{
a[i] = 10 + a[i];
a[i + 1]--;
}
}
i = 99;
while(a[i] == 0)
i--;
for(; i >= 0; i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
32
|
15,898 |
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
|
15,899 |
int main()
{
int a1[100], a2[100];
char b1[101],b2[101];
int n;
cin>>n;
for(int k=0;k<n;k++)
{
cin>>b1>>b2;
int l1=strlen(b1),l2=strlen(b2);
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
int j=0;
for(int i=l1-1;i>=0;i--)
{
a1[j++]=b1[i]-'0';
}
j=0;
for(int i=l2-1;i>=0;i--)
{
a2[j++]=b2[i]-'0';
}
for(int i=0;i<100;i++)
{
if(a1[i]<a2[i])
{
a1[i]=10+a1[i]-a2[i];
a1[i+1]--;
}
else
{
a1[i]=a1[i]-a2[i];
}}
int i=99;
while(a1[i]==0) i--;
for(;i>=0;i--)
{cout<<a1[i];}
cout<<endl;
}
return 0;
}
|
32
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.