id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
15,700 |
int main()
{
int n,i,j=0,k=0,l,m,c[101]={0},d[101]={0};
char a[101],b[101];
cin >> n;
for(i=0;i<n;i++)
{
for(j=0;j<101;j++)
{
c[j]=0;
d[j]=0;
}
cin.get();
cin.getline(a,101);
cin.getline(b,101);
l=strlen(a);
m=strlen(b);
for(j = l-1, k = 0;j >= 0;j--)
c[k++]=a[j]-'0';
for(j = m-1, k = 0;j >= 0;j--)
d[k++]=b[j]-'0';
for(j=0;j<l;j++)
{
c[j]-=d[j];
if(c[j]<0)
{
c[j]+=10;
c[j+1]-=1;
}
}
if(c[l-1]==0)
{
for(j=l-2;j>=0;j--)
cout << c[j];
cout << endl;
}
else
{
for(j=l-1;j>=0;j--)
cout << c[j];
cout << endl;
}
}
return 0;
}
|
32
|
15,701 |
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
|
15,702 |
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
|
15,703 |
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
|
15,704 |
int main()
{
void zuocha(void);
int k,n;
cin >> n;
for (k=1;k<=n;k++)
zuocha();
return 0;
}
void zuocha(void)
{
char str1[100],str2[100];
int l1,l2;
cin >> str1 >> str2;
l1=strlen(str1);
l2=strlen(str2);
int num1[100],num2[100],cha[100];
int i,j;
for (i=0;i<l1;i++)
num1[l1-1-i]=str1[i]-'0';
for (i=0;i<l2;i++)
num2[l2-1-i]=str2[i]-'0';
for (i=l2;i<l1;i++)
num2[i]=0;
for (i=0;i<l1;i++)
if (num1[i]>=num2[i])
{
cha[i]=num1[i]-num2[i];
}
else
{
cha[i]=num1[i]+10-num2[i];
num1[i+1] -=1;
}
for (i=l1-1;i>=0;i--)
if (cha[i]!=0)
break;
for (j=i;j>=0;j--)
cout << cha[j];
cout << endl;
}
|
32
|
15,705 |
/********************************************
*@file 4.cpp *
*@author ?? *
*@date 2013-11-19 *
*@description *
*??????8?????? *
********************************************
*/
int main()
{
int n, i, p, q, nlen1, nlen2;
int num1[101], num2[100];
char str1[101], str2[101];
cin >> n;
for (i = 0; i < n; i++) // ????
{
cin.get();
cin.getline(str1, 101);
cin.getline(str2, 101);
//?????
nlen1 = strlen(str1);
nlen2 = strlen(str2);
memset(num1, 0, sizeof(num1)); // ????
memset(num2, 0, sizeof(num2)); // ????
q = 0;
//????
for (p = nlen1 - 1; p >= 0; p--)
num1[q++] = str1[p] - '0';
q = 0;
for (p = nlen2 - 1; p >= 0; p--)
num2[q++] = str2[p] - '0';
//???
for (p = 0; p < 100; p++)
{
num1[p] -= num2[p];
if (num1[p] < 0)
{
num1[p] += 10;
num1[p+1]--;
}
}
p = 100;
//??0?
while (num1[p] == 0)
p--;
//????
for ( ; p >= 0; p--)
cout << num1[p];
if (i != n - 1 )
cout << endl;
}
return 0;
}
|
32
|
15,706 |
int main()
{
char a[150],b[150];
int c[150],d[150],result[150];
int n,la,lb,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
la=strlen(a);
lb=strlen(b);
for(j=0;j<la;j++)
c[j]=a[j]-'0';
for(j=0;j<la-lb;j++)
d[j]=0;
for(j=la-lb;j<la;j++)
d[j]=b[j-la+lb]-'0';
int carry = 0;
for(j=la-1;j>=0;j--)
{
if(c[j]>=d[j]+carry)
{
result[j]=c[j]-d[j]-carry;
carry = 0;
}
else
{
//c[j-1]=c[j-1]-1;
result[j]=c[j]+10-d[j]-carry;
carry = 1;
}
}
for(j=0;j<la;j++)
{
if(result[j]!=0) break;
}
for(k=j;k<la-1;k++)
printf("%d",result[k]);
printf("%d\n",result[la-1]);
}
return 0;
}
|
32
|
15,707 |
void f(char a[300],char b[300])
{
int n1[300]={0},n2[300]={0},n3[300]={0},i,t,k=0;
//?????????
t=strlen(a);
for(i=0;i<t;i++)
n1[300-t+i]=a[i]-48;
t=strlen(b);
for(i=0;i<t;i++)
n2[300-t+i]=b[i]-48;
//????????????
for(i=0;i<300;i++)
n3[i]=n1[i]-n2[i];
for(i=299;i>=0;i--)
if(n3[i]<0){n3[i]=n3[i]+10;n3[i-1]--;}
//???????0??
//?????0???
for(i=0;i<299;i++)
{
if(n3[i]!=0&&k==0){printf("%d",n3[i]);k++;}
else if(k==1) printf("%d",n3[i]);
}
printf("%d\n",n3[299]);
}
void main()
{
char a[10][300],b[10][300];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{{scanf("%s",a[i]);scanf("%s",b[i]);}}
for(i=0;i<n;i++)
f(a[i],b[i]);
}
|
32
|
15,708 |
main()
{
int N,i,j,k,l[100]={0};
char a[100][100],b[100];
scanf("%d",&N);
for (i=0;i<2*N;i++)
{
scanf("%s",a[i]);
}
for(j=0;j<2*N;j++)
{for(i=0;a[j][i]!='\0';i++) l[j]++;}
for(i=0;i<N;i++)
{
for(j=0;j<=99;j++) b[j]='\0';
for(j=0;j<=l[2*i+1];j++)
{
b[l[2*i]-l[2*i+1]+j]=a[2*i+1][j];
}
for(j=0;j<=99;j++) a[2*i+1][j]=b[j];
}
for(j=0;j<N;j++)
{
for(i=(l[2*j]-1);i>=0;i--)
{ if(a[2*j][i]<'0') {a[2*j][i]='9';a[2*j][i-1]--;}
if (a[2*j+1][i]=='\0') ;
else if (a[2*j][i]>=a[2*j+1][i]) a[2*j][i]=a[2*j][i]-a[2*j+1][i]+'0';
else if (a[2*j][i]<a[2*j+1][i])
{a[2*j][i]=a[2*j][i]-a[2*j+1][i]+10+'0';a[2*j][i-1]--;}
}
}
for(j=0;j<N;j++)
{
k=0;
for(i=0;i<l[2*j];i++)
{
if((a[2*j][i]!='0')||(k==1))
{
k=1;
printf("%c",a[2*j][i]);
}
}
if(k==0) printf("0");
printf("\n");
}
}
|
32
|
15,709 |
int main()
{
int n;cin>>n;
for(int N=0;N<n;N++)
{
char a[110],b[110];
cin>>a>>b;
int A[110]={0},B[110]={0},result[110]={0};
for(int i=strlen(a)-1;i>=0;i--)
{
A[strlen(a)-i-1]=a[i]-'0';
}
for(int i=strlen(b)-1;i>=0;i--)
{
B[strlen(b)-i-1]=b[i]-'0';
}
for(int i=0;i<110;i++)
{
result[i]+=(A[i]-B[i]);
if(result[i]<0) {result[i]+=10;result[i+1]--;}
}
int t;
for(t=109;t>0;t--) if(result[t]) break;
for(;t>0;t--) cout<<result[t];
cout<<result[0]<<endl;
}
cin.get();cin.get();cin.get();cin.get();cin.get();
}
|
32
|
15,710 |
int main()
{
int n, i, len1, len2, j, k, char11[101] = {0}, char22[101] = {0}, flag = 0, answer[101] = {0};
char char1[101], char2[101];
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> char1 >> char2;
len1 = strlen(char1);
len2 = strlen(char2);
memset(answer,'\0',sizeof(answer));
memset(char11,'\0',sizeof(char11));
memset(char22,'\0',sizeof(char22));
k = 0;
for (j = len1 - 1; j >= 0; j--)
{
char11[k] = char1[j] - '0';
k++;
}
k = 0;
for (j = len2 - 1; j >= 0; j--)
{
char22[k] = char2[j] - '0';
k++;
}
for (j = 0; j < len1; j++)
{
if (char11[j] < char22[j])
{
char11[j + 1] = char11[j + 1] - 1;
answer[j] = char11[j] + 10 - char22[j];
}
else
{
answer[j] = char11[j] - char22[j];
}
}
for (j = len1 - 1; j >= 0; j--)
{
if (answer[j] != 0)
{
flag = 1;
}
if (flag == 1)
{
cout << answer[j];
}
}
cout << endl;
}
return 0;
}
|
32
|
15,711 |
void main()
{
int n,i,j,longa[100],longb[100],t[100];
char a[100][101],b[100][101],c[100][101];
scanf("%d",&n);getchar();
for(i=0;i<n;i++)
{
gets(a[i]);
gets(b[i]);
getchar();
longa[i]=strlen(a[i])-1;
longb[i]=strlen(b[i])-1;
}
for(i=0;i<n;i++)
{
for(j=0;j<=longa[i];j++)
{
if(j<=longb[i])
{
c[i][longa[i]-j]=a[i][longa[i]-j]-b[i][longb[i]-j]+48;
if(c[i][longa[i]-j]<48)
{
c[i][longa[i]-j]=c[i][longa[i]-j]+10;
a[i][longa[i]-j-1]--;
}
}
else c[i][longa[i]-j]=a[i][longa[i]-j];
}
for(j=0,t[i]=0;j<=longa[i];j++)
{
if(c[i][j]==48) t[i]++;
else break;
}
for(j=t[i];j<longa[i];j++)
printf("%c",c[i][j]);
printf("%c\n",c[i][longa[i]]);
}
}
|
32
|
15,712 |
void main()
{
char a[100]={'\0'},b[100]={'\0'},c[100]={'\0'},d[100]={'\0'},e[100]={'\0'},l;
int n,i,j,h,k,t;
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
t=0;
gets(a);
gets(c);
l=getchar();
h=strlen(a)-1;
for(j=0;j<=h;j++)
b[j]=a[h-j];
k=strlen(c)-1;
for(j=0;j<=k;j++)
d[j]=c[k-j];
for(j=k+1;j<=h;j++)
d[j]='0';
for(j=0;j<=h;j++)
{
if(b[j]>=d[j]) e[j]=b[j]-d[j];
else {
e[j]=b[j]+10-d[j];
b[j+1]=b[j+1]-1;
}
}
for(j=h;j>=0;j--)
{
if (e[j]>0) t=t+1;
if (t>0) printf("%c",e[j]+48);
}
printf("\n");
}
}
|
32
|
15,713 |
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
|
15,714 |
//**************************************
//* ????4.cpp *
//* ?????? *
//* ?????2013?11?16? *
//* ???????? *
//**************************************
int main()
{
const int N=110;
int T,i,l1,l2,tw=0,a[N],b[N],c[N];
char s1[N],s2[N];
cin >> T;cin.get();
while (T--)
{
cin.getline(s1,100);
cin.getline(s2,100);
l1=strlen(s1);l2=strlen(s2);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
for (i=1;i<=l1;i++)
a[N-i]=s1[l1-i]-'0';
for (i=1;i<=l2;i++)
b[N-i]=s2[l2-i]-'0';
for (i=N-1;i>=N-l1;i--)
{
c[i]=a[i]-b[i]-tw;
if (c[i]<0)
{
c[i]+=10;
tw=1;
}
else tw=0;
}
while (c[i]==0) i++;
for (;i<N;i++)
cout << c[i];
cout << endl;
cin.get();
}
return 0;
}
|
32
|
15,715 |
// @ ?????.cpp
// @ 1000012895
// @ ???
// @ 2010/11/17
int main()
{
int n;
cin >> n;
char a[100], b[100];
int inta[100], intb[100];
int i, j, counta, countb, count0;
for(i = 1; i <= n; i++)
{
cin >> a;
cin >> b;
for(counta = 0; a[counta] != '\0'; counta++)
inta[counta] = a[counta] - '0';
for(countb = 0; b[countb] != '\0'; countb++)
intb[countb] = b[countb] - '0';
for(j = counta - 1; j >= counta - countb; j--)
{
inta[j] = inta[j] - intb[j - counta + countb];
if(inta[j] < 0)
{
inta[j] += 10;
inta[j - 1]--;
}
}
for(count0 = 0; inta[count0] == 0; count0++);
for(j = count0; j < counta; j++)
cout << inta[j];
cout << endl;
cin.get();
}
return 0;
}
|
32
|
15,716 |
/*????*/
int a[N],b[N],c[N];
int na,nb,nc;
int i,j;
/*????*/
void input()
{
char ac[N],bc[N];
scanf("%s",ac);
na=strlen(ac);
scanf("%s",bc);
nb=strlen(bc);
for (i=0;i<na;i++)
{
a[i]=ac[na-1-i]-48;
}
for (i=0;i<nb;i++)
{
b[i]=bc[nb-1-i]-48;
}
}
/*????*/
void jian(int a[],int b[],int na,int nb)
{
nc=(na>nb)?na:nb;
for (i=0;i<nc;i++)
{
c[i]+=a[i]-b[i];
if (c[i]<0)
{c[i]+=10;
c[i+1]-=1;}
}
}
/*????*/
void print()
{
if (c[nc]!=0) printf("%d",c[nc]);
for (i=nc-1;i>=0;i--)
printf("%d",c[i]);
}
/*???*/
void main()
{
int cishu,k;
scanf("%d",&cishu);
for(k=1;k<=cishu;k++)
{
for (i=0;i<N;i++) {b[i]=0;a[i]=0;}
for (i=0;i<N;i++) c[i]=0;
input();
jian(a,b,na,nb);
print();
printf("\n");
}
}
|
32
|
15,717 |
int main()
{
int n,i,j;
char str1[101],str2[101];
cin>>n;
while(n>0)
{
int anlen1[100]={0,},anlen2[100]={0,};
cin>>str1>>str2;
int len1 = strlen(str1);
int len2 = strlen(str2);
j=0;
for(i = len1-1;i >= 0;i--)
anlen1[j++] = str1[i] - '0';
j=0;
for(i = len2-1;i >= 0;i--)
anlen2[j++] = str2[i] - '0';
for(i = 0;i < len1;i++)
{
if(anlen1[i] >= anlen2[i])
anlen1[i] -= anlen2[i];
else
{
anlen1[i] = anlen1[i] - anlen2[i] + 10;
anlen1[i+1]--;
}
}
i = len1-1;
while(anlen1[i] == 0) i--;
for(;i >= 0;i--)
cout<<anlen1[i];
cout<<endl;
n--;
}
return 0;
}
|
32
|
15,718 |
int main(int argc, char* argv[])
{
char a[200],b[200],c[200];
int n,i,j,al,bl;
scanf("%d\n",&n);
for (i=0;i<n;i++)
{
if(i>0) scanf("\n");
gets(a);
gets(b);
al=strlen(a);
bl=strlen(b);
for (j=0;j<=bl-1;j++) b[al-1-j]=b[bl-1-j];
for (j=0;j<al-bl;j++) b[j]=48;
b[al]=0;
for (j=al-1;j>=0;j--)
{
if(a[j]>=b[j]) c[j]=a[j]-b[j]+48;
else
{
c[j]=a[j]-b[j]+58;
if(a[j-1]==0) a[j-1]=57;
else a[j-1]=a[j-1]-1;
}
}
c[al]=0;
puts(c);
}
return 0;
}
|
32
|
15,719 |
int main()
{
int n,i,len1,len2,j;
char x[100]={0};
char y[100]={0};
char z[100]={0};
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf ("%s",x);
scanf ("%s",y);
len2=strlen(y);
len1=strlen(x);
z[0]=x[len1-1]+10-y[len2-1]+48;
for(i=1;i<len2;i++)
z[i]=x[len1-1-i]-1+10-y[len2-1-i]+48;
for(i=len2;i<len1;i++)
z[i]=x[len1-1-i]+10-1;
for(i=0;i<len1;i++)
{if(z[i]>57)
{z[i+1]=z[i+1]+1;
z[i]=z[i]-10;
}
}
for(i=len1-1;i>=0;i--)
printf("%d",z[i]-48);
printf("\n");
}
return 0;
}
|
32
|
15,720 |
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
|
15,721 |
void MINUS(char* a,char* b);
void main()
{
char jian[50][200],beijian[50][200];
int n;
int i=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",beijian[i]);
scanf("%s",jian[i]);
}
for(i=0;i<n;i++)
{
MINUS(beijian[i],jian[i]);
}
}
void MINUS(char* a,char* btemp)
{
int lena,lenb;
int i,j;
char b[200];
int temp=0;
char tt='0';
lena=strlen(a);
lenb=strlen(btemp);
for(i=0;i<lena-lenb;i++)//??
b[i]='0';
for(j=i+1;i<200;i++){
b[i]=btemp[i-lena+lenb];
}
for(i=lena-1;i>=0;i--)
{
if(a[i]-b[i]+temp>=0){a[i]=a[i]-b[i]+temp+48;
temp=0;}
else{
a[i]=a[i]-b[i]+temp+48+10;
temp=-1;
}
}
for(i=0;i<200;i++)
{
if(a[i]=='\0')break;
if(a[i]!=tt){putchar(a[i]);
tt='*';}
}
putchar('\n');
}
|
32
|
15,722 |
int main()
{
int n;
int i,j;
char a[101];
char b[101];
int a1[101];
int b1[101]={0};
int c[101]={0};
scanf("%d",&n);
int length1,length2,length;
for(j=1;j<=n;j++)
{
for(i=0;i<=100;i++)
{
a1[i]=b1[i]=c[i]=0;
}
scanf("%s%s",a,b);
length1=strlen(a);
length2=strlen(b);
if(length1>length2)
{length=length1;}
else
{length=length2;}
for(i=0;i<length1;i++)
{
a1[i]=a[length1-i-1]-'0';
}
for(i=0;i<length2;i++)
{
b1[i]=b[length2-i-1]-'0';
}
for(i=0;i<length;i++)
{
c[i]+=a1[i]-b1[i];
while(c[i]<0)
{
c[i]=c[i]+10;
c[i+1]--;
}
}
for(i=0;i<length;i++)
{
printf("%d",c[length-i-1]);
}
printf("\n");
}
return 0;
}
|
32
|
15,723 |
//***************************
//*???????? **
//*????? 1300012921 **
//*???2013.11.18 **
//***************************
int main()
{
char a[101], b[101];
int i, j, k, n, len1, len2;
int c[103], d[103], e[103];
cin >> n;
cin.get();
for(k = 1; k <= n; k++)
{
memset(c,0,sizeof(c));
memset(d,0,sizeof(d));
memset(e,0,sizeof(e));
cin.getline(a,101);
cin.getline(b,101);
len1 = strlen(a);
len2 = strlen(b);
for(i = len1 - 1; i >= 0; i--)
c[len1-i] = a[i] - '0';
for(i = len2 - 1; i >= 0; i--)
d[len2-i] = b[i] - '0';
for(i = 1; i <= 101; i++)
{
if(c[i] >= d[i])
e[i] = c[i] - d[i];
else
{
e[i] = c[i] - d[i] + 10;
c[i+1] = c[i+1] - 1;
}
}
for(j = 101; j >= 1; j--)//????
{
if(e[j] != 0)
{
for(i = j; i >= 1; i--)
cout << e[i];
break;
}
}
cout << endl;
cin.get();
}
return 0;
}
|
32
|
15,724 |
void main()
{
int n,i,j,p,q;
char a[100],b[100],c[100]={0},a1[100],b1[100];
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s%s",a,b);
strcpy(a1,a);
strcpy(b1,b);
p=strlen(a);
q=strlen(b);
for(i=100-p;i<=99;i++)
a1[i]=a[i-100+p];
for(i=0;i<=99-p;i++)
a1[i]=0;
for(i=100-q;i<=99;i++)
b1[i]=b[i-100+q];
for(i=100-p;i<=99-q;i++)
b1[i]='0';
for(i=0;i<=99-p;i++)
b1[i]=0;
for(i=99;i>=100-p;i--)
if(a1[i]>=b1[i])
c[i]=a1[i]-b1[i]+48;
else
{
c[i]=10+a1[i]-b1[i]+48;
a1[i-1]--;
}
for(i=100-p;i<=99;i++)
printf("%c",c[i]);
printf("\n");
}
}
|
32
|
15,725 |
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
|
15,726 |
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
|
15,727 |
main()
{
int n,i,j,t,as,bs;
char a[100][100],b[100][100];
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
getchar();
}
for (i=1;i<=n;i++)
{
as=strlen(a[i]);
bs=strlen(b[i]);
for (j=0;j<as;j++)
a[i][j]-='0';
for (j=0;j<bs;j++)
b[i][j]-='0';
for (j=1;j<=bs;j++)
{
a[i][as-j]-=b[i][bs-j];
if (a[i][as-j]<0)
{
a[i][as-j-1]--;
do
a[i][as-j]+=10;
while (a[i][as-j]<0);
}
}
t=0;
while (a[i][t]==0)
t++;
for (j=t;j<as;j++)
printf("%d",a[i][j]);
printf("\n");
}
return 0;
}
|
32
|
15,728 |
void main()
{
char a[101],b[101],k;
int m,i,n,j,s=102,t=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
m=strlen(a)-strlen(b);
for(j=strlen(a)-1;j>=m;j--)
{
if(t!=0) a[j]--;
if(a[j]>=b[j-m])
{
a[j]=a[j]-b[j-m]+'0';
t=0;
}
else
{
a[j]=a[j]+10-b[j-m]+'0';
t=1;
}
}
for(j=m-1;j>=0;j--)
{
if(t!=0) a[j]--;
if(a[j]<'0')
{
a[j]=a[j]+10;
t=1;
}
else t=0;
}
for(j=0;j<strlen(a);j++)
{
if(a[j]!='0')
{
s=j;
break;
}
}
if(s==102) printf("0\n");
else
{
for(j=s;j<strlen(a);j++)
printf("%c",a[j]);
printf("\n");
scanf("%c",&k);
}
}
}
|
32
|
15,729 |
int main()
{
int n,i,leng_a,leng_b,tag=0,a[128],b[128];
char s1[128],s2[128];
scanf("%d",&n);
while(n--)
{
for(i=0;i<128;i++)
{
a[i]=0;
b[i]=0;
}
scanf("%s%s",s1,s2);
leng_a=strlen(s1);
leng_b=strlen(s2);
for(i=0;i<leng_a;i++)
a[i]=s1[leng_a-i-1]-'0';
for(i=0;i<leng_b;i++)
b[i]=s2[leng_b-i-1]-'0';
for(i=0;i<leng_a;i++)
{
if(a[i]>=b[i])
a[i]-=b[i];
else
{
a[i]=a[i]-b[i]+10;
a[i+1]--;
}
}
tag=0;
for ( i =leng_a-1; i >= 0; i--)
{
if (a[i] != 0)
tag = 1;
if (tag == 1)
{
printf("%d",a[i]);
}
if (tag == 0 && i == 0)
printf("0");
}
printf("\n");
}
return 0;
}
|
32
|
15,730 |
void main()
{
int n,i,j;
int len1,len2;
char num[2][100],emp[1];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",num[0],num[1]);
len1=strlen(num[0]);
len2=strlen(num[1]);
for(j=0;j<len2;j++)
{
if(num[0][len1-1-j]>=num[1][len2-1-j])
num[0][len1-1-j]=num[0][len1-1-j]-num[1][len2-1-j]+'0';
else
{
num[0][len1-1-j]=num[0][len1-1-j]+10-num[1][len2-1-j]+'0';
num[0][len1-2-j]=num[0][len1-2-j]-1;
}
}
puts(num[0]);
gets(emp);
}
}
|
32
|
15,731 |
void main()
{
char a[100][100],b[100][100];
int n,l1,l2,j=48,i;
scanf("%d",&n);
for(i=1;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s\n",b[i]);
}
scanf("%s",a[i]);
scanf("%s",b[i]);
for(i=1;i<=n;i++)
{
l1=strlen(a[i]);
l2=strlen(b[i]);
for(j=0;j<l2;j++)
{
a[i][l1-j-1]='0'+a[i][l1-j-1]-b[i][l2-j-1];
if((a[i][l1-j-1])<'0')
{
a[i][l1-j-2]=a[i][l1-j-2]-1;
a[i][l1-j-1]=a[i][l1-j-1]+10;
}
}
printf("%s\n",a[i]);
}
}
|
32
|
15,732 |
void main()
{
char m1[100],m2[100],n1[100],n2[100],sum[100];
int i,mlen,nlen,t,u;
scanf("%d",&t);
for (u=0;u<t;u++)
{
for (i=0;i<100;i++)
sum[i]='\0';
for (i=0;i<100;i++)
m1[i]='0';
for (i=0;i<100;i++)
n1[i]='0';
scanf("%s",m1);
scanf("%s",n1);
mlen=strlen(m1);
nlen=strlen(n1);
for (i=0;i<100;i++)
m2[i]='0';
for (i=0;i<100;i++)
n2[i]='0';
for (i=0;i<mlen;i++) /**/
m2[100-mlen+i]=m1[i];
for (i=0;i<=nlen;i++)
n2[100-nlen+i]=n1[i];
for (i=99;i>=0;i--)
{
sum[i]=sum[i]+m2[i]-n2[i]+48;
if (sum[i]<'0')
{
sum[i]=sum[i]+10;
sum[i-1]=sum[i-1]-1; /**/
}
}
for (i=0;i<100;i++)
{
if ((sum[i]!='0')&&(sum[i]!='\0'))
break;
}
for (i=i;i<100;i++)
printf("%c",sum[i]);
printf("\n");
}
}
|
32
|
15,733 |
int beijianshu[200]={0},jianshu[200]={0},cha[200]={0};
int len1,len2;
int flag;
char a[200],b[200];
void reverse(char a[],char b[])
{
int i;
for(i=0;i<len1;i++) beijianshu[i]=a[len1-i-1]-'0';
for(i=0;i<len2;i++) jianshu[i]=b[len2-i-1]-'0';
}
int panduan()
{
if (len1>len2) return 1;
else if (len1==len2)
{
for(int i=0;i<len1;i++)
{
if(a[i]>b[i]) return 1;
else if(a[i]<b[i]) return -1;
}
return 0;
}
else return -1;
}
void calculate()
{
int i;
if(flag!=0)
{
for(i=0;i<len1||i<len2;i++) cha[i]=beijianshu[i]-jianshu[i];
if(flag==1)
{
for(i=0;i<len1;i++)
{
if(cha[i]<0)
{
cha[i+1]--;
cha[i]+=10;
}
}
}
else
{
for(i=0;i<=len2;i++)
{
if(cha[i]>0)
{
cha[i]-=10;
cha[i+1]++;
}
}
}
}
}
void print()
{
int i;
if(flag==0) cout<<0<<endl;
else
{
for(i=199;i>=0;i--) if(cha[i]!=0) break;
if(flag==1) for(;i>=0;i--) cout<<cha[i];
else
{
cout<<'-';
for(;i>=0;i--) cout<<0-cha[i];
}
cout<<endl;
}
}
int main()
{
int n;
cin>>n;
cin.get();
for(int i=0;i<n;i++)
{
memset(a,'\0',sizeof(a));
memset(b,'\0',sizeof(b));
memset(beijianshu,0,sizeof(beijianshu));
memset(jianshu,0,sizeof(jianshu));
memset(cha,0,sizeof(cha));
cin.getline(a,200);
cin.getline(b,200);
cin.get();
len1=strlen(a);
len2=strlen(b);
reverse(a,b);
flag=panduan();
calculate();
print();
}
return 0;
}
|
32
|
15,734 |
void main()
{
int j,b,a,i,x=0,y,z=1,m,n,s,t;
scanf("%d",&a);
char j_shu[65][101],b_shu[65][101],shu[65][101];
for(i=0;i<a;i++)
{
j=0;
while(1)
{
if((y=getchar())!='\n')
j_shu[i][j++]=y;
else
if(j>0)
{
j_shu[i][j]='\0';
break;
}
}
b=0;
while(1)
{
if((y=getchar())!='\n')
b_shu[i][b++]=y;
else
if(b>0)
{
b_shu[i][b]='\0';
break;
}
}
m=strlen(j_shu[i]);
n=strlen(b_shu[i]);
b_shu[i][m]='\0';
for(s=m-1,t=n-1;t>=0;s--,t--)
{
if(j_shu[i][s]<b_shu[i][t])
{
j_shu[i][s]=j_shu[i][s]+10;
j_shu[i][s-1]=j_shu[i][s-1]-1;
}
shu[i][s]=j_shu[i][s]-b_shu[i][t];
}
for(;s>=0;s--)
{
if(j_shu[i][s]<0)
{
j_shu[i][s]=j_shu[i][s]+10;
j_shu[i][s-1]=j_shu[i][s-1]-1;
}
shu[i][s]=j_shu[i][s]-48;
//printf("%d",shu[i][s]);
}
}
for(i=0;i<a;i++)
{
m=strlen(j_shu[i]);
for(s=0,t=0;s<m;s++)
if(shu[i][s]==0&&t==0)
continue;
else
if(shu[i][s]==0)
printf("0");
else
{
t++;
printf("%d",shu[i][s]);
}
if(t==0)
printf("0");
printf("\n",m);
}
}
|
32
|
15,735 |
int main()
{
int n;
scanf("%d",&n);
int d[100];
char c[100][100];
for(int i=0;i<n;i++)
{
char a[100]={0};
char b[100]={0};
scanf("%s",a);
scanf("%s",b);
int m=strlen(a);
d[i]=strlen(a);
int o=strlen(b);
for(int j=m-1;j>m-o-1;j--)
c[i][j]=a[j]-b[j-m+o]+'0';
if(m>n)
{
for(int t=m-o-1;t>=0;t--)
c[i][t]=a[t];
}
for(int k=m-1;k>=0;k--)
{
if(c[i][k]<'0')
{
c[i][k]=c[i][k]+10;
c[i][k-1]=c[i][k-1]-1;
}
}
}
for(int h=0;h<n;h++)
{
for(int t=0;t<d[h];t++)
printf("%c",c[h][t]);
printf("\n");
}
}
|
32
|
15,736 |
void main()
{
int n,i,c,d,j,k,x,y;
char a[101],b[101],s[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",a,b);
c=strlen(a);
d=strlen(b);
for(j=c-1,k=d-1;k>=0;k--,j--)
s[j]=a[j]-b[k]+48;
for(x=0;x<c-d;x++)
s[x]=a[x];
for(y=c-1;y>=0;y--)
if(s[y]>=48&&s[y]<=57)
s[y]=s[y];
else
{
s[y]=s[y]+10;
s[y-1]=s[y-1]-1;
}
for(x=0;x<=c-1;x++)
printf("%c",s[x]);
printf("\n\n");
}
}
|
32
|
15,737 |
int main()
{
int n,i,j,an[100][102]={0},bn[100][102]={0};
char a[100][102]={0},b[100][102]={0};
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
int k=0;
gets(a[i]);
gets(b[i]);
scanf("\n");
for(j=strlen(a[i])-1;j>=0;j--)
an[i][k++]=a[i][j]-'0';
// for(j=0;j<strlen(a[i]);j++)
// printf("%d",an[i][j]);
//printf("\n");
k=0;
for(j=strlen(b[i])-1;j>=0;j--)
bn[i][k++]=b[i][j]-'0';
// for(j=0;i<strlen(b[i]);j++)
// printf("%d",bn[i][j]);
// printf("\n");
for(j=0;j<strlen(a[i]);j++)
{
an[i][j]=an[i][j]-bn[i][j];
if(an[i][j]<0)
{
an[i][j]+=10;
an[i][j+1]--;
}
}
}
int notzero=0;
for(i=0;i<n;i++)
{
for(j=strlen(a[i])-1;j>=0;j--)
{
if(an[i][j]==0&¬zero==0)
continue;
else {printf("%d",an[i][j]); notzero++;}
}
printf("\n");
}
return 0;
}
|
32
|
15,738 |
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
|
15,739 |
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
|
15,740 |
int main()
{
int n, len_a, len_b;
char a[101], b[101];
int num[101];
cin >> n;
for(int i = 1; i <= n; i++)
{
cin.get();
cin.getline(a, 101);
len_a = strlen(a);
cin.getline(b, 101);
len_b = strlen(b);
memset(num, 0, sizeof(num));
for(int i = len_a - 1; i >= 0; i--)
num[len_a - i] = a[i] - '0';
for(int i = len_b - 1; i >= 0; i--)
{
int j = len_b - i, b0 = b[i] - '0';
if(num[j] >= b0)
num[j] -= b0;
else
{
num[j + 1]--;
num[j] = num[j] + 10 - b0;
}
}
int i = 100;
while(num[i] == 0 && i != 1)
i--;
for(int j = i; j >= 1; j--)
cout << num[j];
cout << endl;
}
return 0;
}
|
32
|
15,741 |
int main() {
int n;
scanf("%d",&n);
while(n--) {
char t1[1000],t2[1000];
int num1[1000]={0},num2[1000]={0};
scanf("%s",&t1);
scanf("%s",&t2);
int i;
int k=0;
for(i=strlen(t1)-1;i>=0;i--){
num1[k]=t1[i]-'0';
k++;
}
k=0;
for(i=strlen(t2)-1;i>=0;i--){
num2[k]=t2[i]-'0';
k++;
}
for(i=0;i<strlen(t1);i++){
num1[i]=num1[i]-num2[i];
if(num1[i]<0) {
num1[i]=num1[i]+10;
num1[i+1]--;
}
}
int check=0;
for(i=strlen(t1)-1;num1[i]==0;i--);
for(;i>=0;i--){
printf("%d",num1[i]);
check=1;
}
printf("\n");
if ((check==0)&&(i==-1)) printf("%d",0);
}
return 0;
}
|
32
|
15,742 |
int main()
{
int n;
cin>>n;
for(int i=0;i<=n-1;i++)
{
char a[101],b[101];
cin>>a>>b;
int c=strlen(a);
int d=strlen(b);
int e[100],f[100];
int h=0,j=0;
for(int g=c-1;g>=0;g--)
{
e[h]=a[g]-'0';
h++;
}//????????
for(int g=d-1;g>=0;g--)
{
f[j]=b[g]-'0';
j++;
}
for(int g=d;g<100;g++)
f[g]=0;//?????????????????0
int l[100]={0};
for(int k=0;k<=c-1;k++)
{
if(e[k]>=f[k])
{
l[k]=e[k]-f[k];
}
else
{
l[k]=e[k]+10-f[k];
e[k+1]=e[k+1]-1;//????????????????????????
}
}
int t=99;
while(l[t]==0)//?????????
t--;
for(;t>=0;t--)
cout<<l[t];
cout<<endl;
}
return 0;
}
|
32
|
15,743 |
void main()
{
long n;
char str1[LENGTH+1], str2[LENGTH+1], ln[LENGTH+1];
int a[LENGTH+1], b[LENGTH+1], len1, len2;
long h, i, t;
scanf("%d\n", &n);
for (h=1;h<=n;h++)
{
gets(str1);
gets(str2);
if (h<n) gets(ln);
len1=strlen(str1);
len2=strlen(str2);
for (i=0;i<=LENGTH;i++)
{
a[i]=0;
b[i]=0;
}
for (i=0;i<len1;i++)
a[LENGTH-i]=str1[len1-i-1]-'0';
for (i=0;i<len2;i++)
b[LENGTH-i]=str2[len2-i-1]-'0';
for (i=0;i<=LENGTH;i++)
a[i]-=b[i];
for (i=LENGTH;i>0;i--)
{
if (a[i]<0)
{
a[i]+=10;
a[i-1]--;
}
}
t=0;
while (a[t]==0)
t++;
for (i=t;i<=LENGTH;i++)
printf("%d", a[i]);
if (h<n) printf("\n");
}
}
|
32
|
15,744 |
int max(int x,int y)
{
if(x>=y)
return x;
else
return y;
}
int main()
{
int times;
scanf("%d",×);
int flow;
for(flow=0;flow<times;flow++)
{
char a[260];
char b[260];
scanf("%s",a);
scanf("%s",b);
char num[10]={'0','1','2','3','4','5','6','7','8','9'};
int numa[260]={0};
int numb[260]={0};
int c[260]={0};
int i,j,lena,lenb;
lena=strlen(a);
lenb=strlen(b);
int k=0;
for(i=lena-1;i>=0;i--)
{
for(j=0;j<10;j++)
{
if(a[i]==num[j])
{
numa[k]=j; //???a(1234567)?????(7654321)
}
}
k++;
}
k=0; //???!!
for(i=lenb-1;i>=0;i--)
{
for(j=0;j<10;j++)
{
if(b[i]==num[j])
{
numb[k]=j; //???b(12345)?????(54321)
}
}
k++;
}
for(i=0;i<max(lena,lenb);i++)
{
if(numa[i]-numb[i]>=0)
c[i]=numa[i]-numb[i]; //??????,??c
else
{
c[i]=numa[i]-numb[i]+10;
if(numa[i+1]>0)
numa[i+1]=numa[i+1]-1;
else
{
numa[i+1]=9;
numa[i+2]=numa[i+2]-1;
}
}
}
int M;
for(i=max(lena,lenb);i>=0;i--)
{
if(c[i]!=0)
{
M=i;
break;
}
}
for(i=M;i>=0;i--)
{
printf("%d",c[i]);
}
printf("\n");
}
return 0;
}
|
32
|
15,745 |
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
|
15,746 |
int main ()
{
int n , i , j , k,num1[101]={0},num2[101]={0},res[101]={0} ;
cin >> n ;
cin.get();
char str1[101] , str2[101] ;
for (i = 0 ;i < n ;i++)
{
memset(num1 , 0 , sizeof(num1)) ;
memset(num2 , 0 , sizeof(num2)) ;
memset(res , 0 , sizeof(res)) ;
cin.getline(str1,101) ;
cin.getline(str2,101) ;
cin.get() ;
for (j = 0 ; j < strlen(str2) ; j++ )
num2[j] = str2[strlen(str2)-j-1]-'0' ;
for (j = 0 ; j < strlen(str1) ; j++ )
num1[j] = str1[strlen(str1)-j-1]-'0' ;
for(k = 0 ; k < strlen(str1) ; k++)
{
if(num1[k]-num2[k]<0)
{
res[k]=num1[k]-num2[k]+10;
num1[k+1]-- ;
}
else res[k]=num1[k]-num2[k] ;
}
for(k = strlen(str1)-1 ; k >= 0 ; k--)
{
if(res[k]==0)
continue ;
break ;
}
while (k >=0 )
{
cout << res[k];
k-- ;
}
cout << endl;
}
return 0 ;
}
|
32
|
15,747 |
int main()
{
int n;
char a[120],b[120];
cin>>n;
for(int q=1;q<=n;q++)
{getchar();
cin.getline(a,120);
cin.getline(b,120);
for(int i=0;i<strlen(b);i++)
b[i]=96-b[i];
for(int i=1;i<=strlen(b);i++)
{
a[strlen(a)-i]+=(b[strlen(b)-i]-48);
}
for(int i=strlen(a)-1;i>=0;i--)
{
if(a[i]<48)
{
a[i]+=10;
a[i-1]--;
}
}
for(int i=0;i<strlen(a);i++)
cout<<(int)(a[i]-48);
cout<<endl;
}
return 0;
}
|
32
|
15,748 |
void main()
{
char a[800]={'\0'},b[800]={'\0'},c[800]={'\0'},d[800]={'\0'},s;
int i,k,m,n,j,x,y,z;
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%s%s",&a,&b);
m=strlen(a);n=strlen(b);
if(n<m)
{
for(j=0;j<m-n;j++)
c[j]=48;
for(j=m-n;j<m;j++)
c[j]=b[j-m+n];
}
else
strcpy(c,b);
for(j=m-1;j>=0;j--)
{
if(j==0)
{
d[j]=a[j]-c[j]+48;
break;
}
if(a[j]>=c[j])
d[j]=a[j]-c[j]+48;
else
{
d[j]=a[j]-c[j]+58;
for(z=1;z<=j;z++)
{
if(a[j-z]>48)
{
a[j-z]=a[j-z]-1;
break;
}
if(a[j-z]==48)
a[j-z]=57;
}
}
}
for(x=0;x<m;x++)
if(d[x]!=48)
{
y=x;break;
}
for(x=y;x<m;x++)
printf("%c",d[x]);
printf("\n");
}
}
|
32
|
15,749 |
void Inverse(char a[])
{
int len=strlen(a);
for(int i=0;i<len/2;i++)
{
char temp;
temp=a[i];
a[i]=a[len-1-i];
a[len-1-i]=temp;
}
}
int main()
{
char a[110],b[110];
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin.get();
cin.getline(a,101);
cin.getline(b,101);
Inverse(a);
Inverse(b);
int j;
for(j=0;b[j]!='\0';j++)
{
if(a[j]>=b[j])
a[j]=a[j]-b[j]+'0';
else
{
a[j+1]--;
a[j]=a[j]+10-b[j]+'0';
}
}
while(a[j]<'0'&&a[j]!='\0')
{
a[j+1]--;
a[j]=a[j]+10-b[j]+'0';
}
Inverse(a);
j=0;
while(a[j]=='0')
j++;
while(a[j]!='\0')
cout<<a[j++];
cout<<endl;
}
return 0;
}
|
32
|
15,750 |
void main()
{
int flag2,flag,j,k,lengtha,lengthb,n,i;
char temp,a[100],b[100];
flag=0;
flag2=0;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
if (flag2) temp=getchar();
else flag2=1;
scanf("%s",a);
scanf("%s",b);
lengtha=strlen(a);
lengthb=strlen(b);
for (j=1;j<=lengthb;j++)
{
a[lengtha-j]=a[lengtha-j]-b[lengthb-j]+48;
k=lengtha-j;
while (a[k]<48)
{
a[k]=a[k]+10;
a[k-1]--;
k--;
}
}
if (flag) printf("\n");
else flag=1;
printf("%s",a);
}
}
|
32
|
15,751 |
void main()
{
char a[20][101],b[20][101],c[20][101];
int w,x,i,m,carry,lena[20],lenb[20],jump;
scanf("%d",&w);
for(x=0;x<w;x++)
{
scanf("%s",a[x]);
lena[x]=strlen(a[x]);
scanf("%s",b[x]);
lenb[x]=strlen(b[x]);
}
for(x=0;x<w;x++)
{
a[x][100]='\0';jump=99-lena[x];
for(m=lena[x];m>0;m--)
a[x][m+jump]=a[x][m-1];
b[x][100]='\0';jump=99-lenb[x];
for(m=lenb[x];m>0;m--)
b[x][m+jump]=b[x][m-1];
carry=0;
for(m=99;m>99-lenb[x];m--)
if(a[x][m]-carry<b[x][m])
{
c[x][m]=a[x][m]-b[x][m]+10-carry+'0';
carry=1;
}
else
{
c[x][m]=a[x][m]-b[x][m]-carry+'0';
carry=0;
}
c[x][99-lenb[x]]=a[x][99-lenb[x]]-carry;
for(m=98-lenb[x];m>99-lena[x];m--)
c[x][m]=a[x][m];
for(m=99-lena[x]+1;m<100;m++)
printf("%c",c[x][m]);
printf("\n");
}
}
|
32
|
15,752 |
int main()
{
int n,times=0;
cin>>n;
while(true)
{
char ch1[100],ch2[100],ch3[100];
char temp;
memset(ch1,0,100);
memset(ch2,0,100);
memset(ch3,0,100);
cin>>ch1;
cin>>ch2;
int len1=strlen(ch1);
int len2=strlen(ch2);
for(int i=0;i<=len1/2-1;i++)
{
temp=ch1[i];
ch1[i]=ch1[len1-i-1];
ch1[len1-i-1]=temp;
}
for(int i=0;i<=len2/2-1;i++)
{
temp=ch2[i];
ch2[i]=ch2[len2-i-1];
ch2[len2-i-1]=temp;
}
for(int i=len2;i<=len1-1;i++)
ch2[i]='0';
for(int i=0;i<=len1-1;i++)
ch3[i]=ch1[i]-ch2[i]+48;
for(int i=1;i<=len1;i++)
{
for(int j=0;j<=len1-1;j++)
{
if(ch3[j]<'0')
{
ch3[j]+=10;
ch3[j+1]-=1;
}
}
}
if(ch3[len1-1]=='0')
{
for(int i=len1-2;i>=0;i--)
cout<<ch3[i];
}
else
{
for(int i=len1-1;i>=0;i--)
cout<<ch3[i];
}
cout<<endl;
cin.get();
times++;
if(times==n)break;
}
return 0;
}
|
32
|
15,753 |
int main ()
{
int l1,l2,i,b,n,j,m,jg[100];
char a1[100],a2[100];
scanf ("%d",&n);
for (j=0;j<n;j++)
{
gets (a1);
gets (a1);
gets (a2);
l1=strlen(a1);
l2=strlen(a2);
b=l1-l2;
for (i=l1-1;i>l1-l2-1;i--)
{
if (a1[i]>a2[i-b] || a1[i]==a2[i-b])
jg[i]=a1[i]-a2[i-b];
else if (a1[i]<a2[i-b])
{
jg[i]=a1[i]+10-a2[i-b];
a1[i-1]=a1[i-1]-1;
}
}
for (i=0;i<l1-l2;i++)
jg[i]=a1[i]-'0';
for (i=0;i<l1;i++)
{
if (jg[i]==0)
continue;
else
{
for (m=i;m<l1;m++)
{
printf ("%d",jg[m]);
}
break;
}
};
printf("\n");
}
return 0;
}
|
32
|
15,754 |
/*
2736:??????? ?? ?? ?? ????: 1000ms ????: 65536kB
??
?2??????????
??
?1?????????n????????2???1?????a??2????b(a > b)????????????
??????????100???
??
n????????????????????
????
2
9999999999999999999999999999999999999
9999999999999
5409656775097850895687056798068970934546546575676768678435435345
1
????
9999999999999999999999990000000000000
5409656775097850895687056798068970934546546575676768678435435344
*/
void reverse(char temp[101])
{
int i = 0;
for(i = 0; i < strlen(temp) / 2; i ++)
{
char t = '\0';
t = temp[i];
temp[i] = temp[strlen(temp) - i - 1];
temp[strlen(temp) - i - 1] = t;
}
}
int main ()
{
int n = 0;
cin >> n;
while (n --)
{
cin.get();
char a[101] = {'\0'}, b[101] = {'\0'}, temp[101] = {'\0'}, mark = '+';
cin.getline(a, 101, '\n');
cin.getline(b, 101, '\n');
if((strlen(a) == strlen(b) && strcmp(a, b) < 0) || (strlen(a) < strlen(b)))
{
strcpy(temp, a);
strcpy(a, b);
strcpy(b, temp);
mark = '-';
}
reverse(a);
reverse(b);
int i = 0;
for(i = 0; i < strlen(b); i ++)
if(a[i] < b[i])
{
a[i] = a[i] + 10 - b[i] + '0';
a[i + 1] --;
}
else if(a[i] >= b[i])
a[i] = a[i] - b[i] + '0';
reverse(a);
cout << a << endl;
}
return 0;
}
|
32
|
15,755 |
void main()
{
int i=0,j=0,n=0;
char a[100][205],b[100][205];
int sa[100][205],sb[100][205];
int len1,len2,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %s",a+i,b+i);
for(i=0;i<n;i++)
{
len1=strlen(a[i]);
for(j=0;j<len1;j++)
sa[i][j]=a[i][len1-1-j]-'0';
}
for(i=0;i<n;i++)
{
len2=strlen(b[i]);
for(j=0;j<len2;j++)
sb[i][j]=b[i][len2-1-j]-'0';
}
for(i=0;i<n;i++)
{
len2=strlen(b[i]);
for(j=0;j<len2;j++)
{
sa[i][j]-=sb[i][j];
if(sa[i][j]<0)
{
sa[i][j]+=10;
sa[i][j+1]-=1;
}
}
}
for(i=0;i<n;i++)
{
len1=strlen(a[i]);
for(j=len1-1;j>=0;j--)
{
if(flag==0)
{
if(sa[i][j]!=0)
{
flag=1;
printf("%d",sa[i][j]);
}
}
else printf("%d",sa[i][j]);
}
printf("\n");flag=0;
}
}
|
32
|
15,756 |
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
|
15,757 |
int main()
{
char a[200],b[200];
int n;
cin>>n;
while(n>=1)
{
int c[200]={0},d[200]={0},e[200]={0},le1,le2,i,j,m;
cin>>a;
cin>>b;
le1=strlen(a);
le2=strlen(b);
for(i=0,j=le1-1;i<=le1-1,j>=0;i++,j--)
c[i]=a[j]-'0';
for(i=0,j=le2-1;i<=le2-1,j>=0;i++,j--)
d[i]=b[j]-'0';
for(i=0;i<=199;i++)
{
if(c[i]>=d[i])
e[i]=c[i]-d[i];
if(c[i]<d[i])
{
e[i]=10+c[i]-d[i];
c[i+1]=c[i+1]-1;
}
}
for(i=199;i>=0;i--)
if(e[i]!=0)
{
m=i;
break;
}
for(i=m;i>=0;i--)
cout<<e[i];
cout<<endl;
n--;
}
return 0;
}
|
32
|
15,758 |
//********************************
//*????? **
//*????? 1300012848 **
//*???2013.11.16 **
//********************************
int main()
{
const int MAX_LEN = 200;
int n, i, j, k, nlen1, nlen2, jinwei[MAX_LEN+1] = {0};
int num1[MAX_LEN+1], num2[MAX_LEN];
char str1[MAX_LEN+1], str2[MAX_LEN+1];
cin >> n;
for (k = 1; k <= n; k++)
{
cin >> str1 >> str2;
nlen1 = strlen(str1);
nlen2 = strlen(str2);
memset(num1,0,sizeof(num1));
memset(num2,0,sizeof(num2));
j = 0;
for (i = nlen1 -1; i >= 0; i--)
{
num1[j] = str1[i] - '0';
j++;
}
j = 0;
for (i = nlen2 -1; i >= 0; i--)
{
num2[j] = str2[i] - '0';
j++;
}
for (i = 0; i < MAX_LEN; i++)
{
num1[i] -= num2[i];
if (num1[i] < 0)
{
num1[i] += 10;
num1[i+1]--;
}
}
i = MAX_LEN;
while (num1[i] == 0)
i--;
for (; i >= 0; i--)
cout << num1[i];
cout << endl;
}
return 0;
}
|
32
|
15,759 |
void main()
{
char a[101],b[101];
int n,c,d,p,i,j=0,t;
scanf("%d",&n);
for(p=1;p<=n;p++)
{
scanf("%s%s",a,b);
c=strlen(a);
d=strlen(b);
for(i=1;i<=d;i++)
{
if(b[d-i]<=a[c-i])
a[c-i]=a[c-i]-b[d-i]+48;
else
{
a[c-i]=a[c-i]-b[d-i]+58;
if(a[c-1-i]>48)
a[c-1-i]--;
else
{
t=i;
while(a[c-1-t]==48)
{
a[c-1-t]=9+48;
t++;
}
a[c-1-t]--;
}
}
}
while(a[j]==48)
j++;
for(;j<c;j++)
printf("%c",a[j]);
j=0;
printf("\n");
}
}
|
32
|
15,760 |
void main()
{
int n,i,j,k,la,lb,lc;
char a[110],b[110],c[110]={""};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",&a,&b);
la=strlen(a);
lb=strlen(b);
for(j=1;j<=lb;j++)
{
if(a[la-j]>=b[lb-j]) c[la-j]=a[la-j]-b[lb-j]+48;
else
{
c[la-j]=a[la-j]+10-b[lb-j]+48;
a[la-j-1]--;
}
}
for(j=0;j<(la-lb);j++)
c[j]=a[j];
lc=strlen(c);
for(k=0;k<=la-1;k++)
if (c[k]!='0') break;
for(j=k;j<=la-1;j++)
printf("%c",c[j]);
printf("\n");
}
}
|
32
|
15,761 |
int main(int argc, char* argv[])
{
int n;
scanf("%d\n",&n);
int i,j,k;
for(i=0;i<n;i++)
{
char str1[105];
char str2[105];
int x1[105]={0},x2[105]={0},s[105]={0};
scanf("%s",str1);
scanf("%s",str2);
int a,b;
a=strlen(str1);
b=strlen(str2);
for(j=0;j<a;j++)
x1[j]=str1[j]-'0';
for(j=b-1;j>=0;j--)
x2[j+a-b]=str2[j]-'0';
for(j=0;j<a-b;j++)
x2[j]=0;
for(j=a-1;j>=0;j--)
{
if(x1[j]<x2[j])
{
s[j]=10+x1[j]-x2[j];
x1[j-1]--;
}
else
s[j]=x1[j]-x2[j];
}
for(j=0;j<a;j++)
printf("%d",s[j]);
printf("\n");
}
return 0;
}
|
32
|
15,762 |
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
|
15,763 |
/* 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
|
15,764 |
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
|
15,765 |
void main ()
{
int n,i,j,len1,len2,p,q, a[100],b[100],c[100];
char s1[100],s2[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
for(j=0;j<100;j++)
{
a[j]=0;
b[j]=0;
c[j]=0;
}
scanf("%s %s",s1,s2);
len1=strlen(s1);
len2=strlen(s2);
for (p=0;p<len1;p++)
a[len1-p-1]=s1[p]-'0';
for (p=0;p<len2;p++)
b[len2-p-1]=s2[p]-'0';
for (p=0;p<len1;p++)
{
c[p]=a[p]-b[p];
if (c[p]<0)
{
a[p+1]=a[p+1]-1;
c[p]=c[p]+10;
}
}
while (c[len1]==0&&len1>1)
len1=len1-1;
for (q=len1;q>=0;q--)
printf("%d",c[q]);
printf("\n");
}
}
|
32
|
15,766 |
// * * * * * * * * * * * * * * *
// *???????? *
// *?????? 1300013011 *
// *???2013.11.16 *
// * * * * * * * * * * * * * * *
int main()
{
int n, i, j, k, len1, len2, num1[101] = {0}, num2[101] = {0}, num[101] = {0};
char str1[200], str2[200];
cin >> n;
cin.get();
for (i = 1; i <= n; i++)
{
memset (num1, 0, sizeof(num1));
memset (num2, 0, sizeof(num2));
memset (num, 0, sizeof(num));
cin.getline(str1, 101);
cin.getline(str2, 101);
if (i!=n)
cin.get();
len1 = strlen(str1);
len2 = strlen(str2);
for (j = 0, k = len1 - 1; k >= 0; j++, k--)
num1[j] = str1[k] - '0';
for (j = 0, k = len2 - 1; k >= 0; j++, k--)
num2[j] = str2[k] - '0';
for (j = 0; j < len1; j++)
{
if (num1[j] >= num2[j])
num[j] = num1[j] - num2[j];
else
{
num[j] = num1[j] + 10 - num2[j];
k = j + 1;
while (num1[k] == 0)
{
num1[k] = 9;
k++;
}
num1[k]--;
}
}
for (j = len1 - 1; j >= 0; j--)
{
if (num[j] != 0)
{
for (k = j; k >= 0; k--)
cout << num[k];
break;
}
}
cout << endl;
}
return 0;
}
|
32
|
15,767 |
int main()
{
int a[110]={0},i,j,n,l1,l2,e,b[110]={0};
char s[110],s1[110];
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
gets(s);l1=strlen(s);
gets(s1);l2=strlen(s1);
for (j=l1;j>0;j--)
a[l1-j+1]=s[j-1]-48;
for (j=l2;j>0;j--)
b[l2-j+1]=s1[j-1]-48;
e=0;
for (j=1;j<=l1;j++)
{
a[j]=a[j]-e;
if (a[j]<b[j]) e=1;else e=0;
b[j]=a[j]+e*10-b[j];
}
while (b[l1]==0&&l1>0) l1=l1-1;
for (j=l1;j>0;j--) {printf("%d",b[j]);b[j]=0;}
printf("\n");
if (i<n)scanf("\n");
}
}
|
32
|
15,768 |
main()
{
char a[100],b[100],c[30][100];
int n,i,j,m1,m2;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
gets(a);
gets(b);
if(i!=n-1) getchar();
m1=strlen(a);
m2=strlen(b);
for(j=m2-1;j>=0;j--)
b[j+m1-m2]=b[j];
for(j=0;j<m1-m2;j++)
b[j]='0';
for(j=m1-1;j>=0;j--)
{
if(a[j]<b[j]) {c[i][j]=a[j]+10-b[j];a[j-1]--;}
else c[i][j]=a[j]-b[j];
}
c[i][m1]=10;
}
for(i=0;i<n;i++)
{
for(j=0;c[i][j]<10;j++)
printf("%d",c[i][j]);
printf("\n");
}
}
|
32
|
15,769 |
int an1[100];
int an2[100];
char szLine1[100];
char szLine2[100];
void main()
{
int n,p,i,j,nLen1,nLen2,max=0;;
scanf("%d",&n);
for(p=0;p<n;p++)
{
scanf("%s",szLine1);
scanf("%s",szLine2);
memset(an1,0,sizeof(an1));
memset(an2,0,sizeof(an2));
nLen1=strlen(szLine1);
j=0;
for(i=nLen1-1;i>=0;i--)
{
an1[j++]=szLine1[i]-'0';
}
nLen2=strlen(szLine2);
j=0;
for(i=nLen2-1;i>=0;i--)
{
an2[j++]=szLine2[i]-'0';
}
if(nLen1>nLen2)
max=nLen1-1;
else
max=nLen2;
for(i=0;i<max;i++)
{
an1[i]-=an2[i];
if(an1[i]<0)
{
an1[i]+=10;
an1[i+1]--;
}
}
for(i=max;i>=0;i--)
printf("%d",an1[i]);
printf("\n");
}
}
|
32
|
15,770 |
int main(){
int m,y,n,l;
char a[100],b[100];
int aa[100],bb[100],c[100];
cin>>y;
for(int i=1;i<=y;i++){
cin>>a;
cin>>b;
for(int r=0;r<100;r++){
aa[r]=0;bb[r]=0;c[r]=0;
}
m=strlen(a);
n=strlen(b);
for(int i=0;i<m;i++)
aa[m-1-i]=a[i]-'0';
for(int j=0;j<n;j++)
bb[n-1-j]=b[j]-'0';
int carry=0;
for(int k=0;k<m;k++){
c[k]=carry+aa[k]-bb[k];
if(c[k]<0){
c[k]+=10;
carry=-1;
}
else
carry=0;
}
for(l=m-1;l>=0;l--)
if(c[l]!=0)break;
if(l==-1)cout<<"0"<<endl;
else{
for(int x=l;x>=0;x--)
cout<<c[x];
cout<<endl;
}
}
return 0;
}
|
32
|
15,771 |
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
|
15,772 |
main()
{
int p;
scanf("%d",&p);
while(p>0)
{
char a[101],b[101],c[101]={0},a1[101]={0},b1[101]={0};int lena,lenb;
int i,j;
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
for(i=0;i<lena;i++)
a1[i+101-lena]=a[i];
for(i=0;i<lenb;i++)
b1[i+101-lenb]=b[i];
int carry=0;
for(j=100;j>=100-(lena-1);j--)
{
if (b1[j]==0) {c[j]=a1[j]-carry;carry=0;}
else
{
if(a1[j]>b1[j]){
c[j]=a1[j]-b1[j]-carry+'0';carry=0;}
else
{
if (a1[j]==b1[j]&&carry==0) c[j]='0';
else
{
c[j]=10+a1[j]-b1[j]-carry+'0';
carry=1;
}
}}
}
int temp=0;
for(i=0;i<101;i++)
{
if(c[i]!=0)
{
temp=i;break;
}
}
for(i=temp;i<101;i++)
printf("%c",c[i]);
printf("\n");
p--;
}
}
|
32
|
15,773 |
int main (){
char a[101],b[101],d[101];
char c[101];
int n,i,j,k,h;
cin>>n;
for(i=0;i<n;i++){
cin>>a>>b;
for(j=0;j<101;j++)
if(a[j]=='\0')break;
for(k=0;k<101;k++)
if(b[k]=='\0')break;
for(h=0;k>=0;k--,j--,h++){
if(a[j]-b[k]<0){
c[h] = a[j]-b[k]+'0'+10;
a[j-1]=a[j-1]-1;}
else c[h] = a[j]-b[k]+'0';
}
for(;j>=0;j--,h++)
c[h]=a[j];
for(k=h-1;k>0;k--)
if(c[k]!='0')break;
for(;k>0;k--)
cout<<c[k];
cout<<endl;}
return 0;
}
|
32
|
15,774 |
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
|
15,775 |
void main()
{
char str1[60][100],str2[60][100],b[100];
int i,k,c,n,j,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",str1[i],str2[i]);
printf("\n");
}
for(i=0;i<n;i++)
{
t=strlen(str2[i]);
c=strlen(str1[i]);
k=c-t;
for(j=t-1;j>=0;j--)
{
if(str1[i][k+j]>=str2[i][j]) b[k+j]=str1[i][k+j]-str2[i][j];
else {b[k+j]=str1[i][k+j]+10-str2[i][j];str1[i][k+j-1]-=1;}
}
for(j=0;j<k;j++) b[j]=str1[i][j]-48;
for(j=0;j<c;j++) printf("%d",b[j]);
printf("\n");
}
}
|
32
|
15,776 |
int main(){
int i,x[102],y[102],z[102],n;
char s[103];
cin>>n;
while(n--){
for(i=0;i<102;i++){x[i]=0;y[i]=0;z[i]=0;}
cin>>s;
for(i=0;i<strlen(s);i++) x[101-strlen(s)+i+1]=(int)(s[i]-48);
cin>>s;
for(i=0;i<strlen(s);i++) y[101-strlen(s)+i+1]=(int)(s[i]-48);
for(i=101;i>0;i--){
if (x[i]<y[i]) {z[i]=x[i]+10-y[i];x[i-1]--;}
else z[i]=x[i]-y[i];
}
for(i=0;i<102;i++) if (z[i]!=0) break;
if (i==102) {cout<<z[i-1];return 0;}
for(;i<102;i++)cout<<z[i];
cout<<'\n';
}
}
|
32
|
15,777 |
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
|
15,778 |
/*************************
??cpp4
?????
???
2013/11/14
**************************/
int main()
{
int m, n, i, j, k , c[102]={0}, d[102]={0}, e[102]={0} ,l1, l2;
char a[102], b[102];
cin >> n;
cin.get();
for (i=1; i<=n; i++)
{
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
memset(d, 0, sizeof(d));
memset(e, 0, sizeof(e));
cin.getline(a,100);
cin.getline(b,100);
cin.get();
l1 = strlen (a);
l2 = strlen (b);
for (j = l1-1, k=0; j>=0, k<= l1-1; j--, k++)
c[k] = a[j] - '0';
for (j = l2-1, k=0; j>=0, k<= l2-1 ; j--, k++)
d[k] = b[j] -'0';
for (j=0; j<=101; j++)
{
if (c[j]<d[j])
{
e[j]= c[j]+10-d[j];
c[j+1]--;
}
else
e[j] = c[j]-d[j];
}
for(j=101; e[j]== 0 ; j--)
m=j;
for (k=m-1; k>=0; k--)
cout << e[k];
cout << endl;
}
return 0;
}
|
32
|
15,779 |
void main()
{
int n,i,j,k,t,r,c[100];
char a[100],b[100];
scanf("%d",&n);
while(n--)
{
scanf("%s",a);
scanf("%s",b);
r=strlen(a);
t=strlen(b);
for(i=0;i<r;i++)
a[i]=a[i]-'0';
for(i=0;i<t;i++)
b[i]=b[i]-'0';
for(i=r-1,j=t-1;j>=0;i--,j--)
{
if(a[i]>=b[j])
c[i]=a[i]-b[j];
else
{
a[i-1]=a[i-1]-1;
c[i]=a[i]+10-b[j];
}
}
for(i=0;i<r-t;i++)
c[i]=a[i];
for(i=r-1;i>0;i--)
{
if(c[i]<0)
{
c[i-1]=c[i-1]-1;
c[i]=c[i]+10;
}
}
if(c[0]>0)
printf("%d",c[0]);
for(i=1;i<r-1;i++)
printf("%d",c[i]);
printf("%d\n",c[r-1]);
}
}
|
32
|
15,780 |
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
|
15,781 |
void main()
{
char a0[100],b0[100];
int i,j,k,l,add,n,x,y,a[100]={0},b[100]={0},c[100][100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{ for(j=0;j<100;j++)
a0[i]='\0';
b0[i]='\0';
scanf("%s",a0);
scanf("%s",b0);
x=strlen(a0);
y=strlen(b0);
for(j=0;j<x;j++)
if(a0[j]!='\0')
a[j]=a0[j]-48;
for(j=0;j<y;j++)
if(b0[j]!='\0')
b[j]=b0[j]-48;
for(k=x-1,l=99;k>=0;k--,l--)
a[l]=a[k];
for(;l>=0;l--)
a[l]=0;
for(k=y-1,l=99;k>=0;k--,l--)
b[l]=b[k];
for(;l>=0;l--)
b[l]=0;
add=0;
for(j=99;j>=100-x;j--)
{
if((a[j]-add)<b[j])
{c[i][j]=a[j]+10-b[j]-add;add=1;}
else
if((a[j]-add)>=b[j])
{c[i][j]=a[j]-b[j]-add;add=0;}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<100;j++)
if(c[i][j]!=0)
break;
k=j;
for(;k<100;k++)
printf("%d",c[i][k]);
printf("\n");
}
}
|
32
|
15,782 |
void minus(char a[],char b[]);
void ni(char a[]);
void tranvert(char m,char a[]);
void trans(char n,char m,char b[]);
void main()
{
char k,i,m,n,a[30][100]={0},b[30][100]={0};
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
m=strlen(a[i]);
n=strlen(b[i]);//the result at most has m bits
ni(a[i]);
ni(b[i]);
trans(n,m,b[i]);
minus(a[i],b[i]);
tranvert(m,a[i]);
ni(a[i]);
printf("\n");
}
for(i=0;i<k;i++)
{
puts(a[i]);
}
}
void minus(char a[],char b[])
{
char i,t,m=strlen(a),jin=0;//experimental
for(i=0;i<=m-1;i++)
{
t=a[i]-b[i]-jin;
if(t>=0) {a[i]=t; jin=0;}
else {a[i]=t+10; jin=1;}
}
}
void ni(char a[])
{
char i,t,m=strlen(a);
for(i=0;i<m/2;i++)
{
t=a[i];
a[i]=a[m-1-i];
a[m-1-i]=t;
}
}
void tranvert(char m,char a[])
{
char i,j; //n=strlen(a)
for(i=m-1;i>=1;i--)
if(a[i]!=0) break;
for(j=i;j>=0;j--)
a[j]+='0';
}
void trans(char n,char m,char b[])// add 0 so that b is as long as a
{ char i;
for(i=n;i<=m-1;i++)
b[i]='0';
}
|
32
|
15,783 |
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>=0) l--;
for (j=l;j>=0;j--)
printf("%d",a[j]);
if (l==-1) printf("0\n"); else printf("\n");
}
}
|
32
|
15,784 |
void main()
{
int n;
char cint1[101],cint2[101],result[101];
int length1,length2;
scanf("%d",&n);
while(n-->0){
getchar();
scanf("%s",cint1);
scanf("%s",cint2);
length1=strlen(cint1);
length2=strlen(cint2);
int k0=length1-1,i=length1-1,k=k0,j;
for(j=length2-1;j>=0;j--)
result[k--]=cint1[i--]-cint2[j]+'0';
while(i>=0)
result[k--]=cint1[i--];
for(k=k0;k>0;k--)
if(result[k]<'0'){
result[k]+=10;
result[k-1]--;
}
for (k=0;k<k0;k++)
if(result[k]!='0')
break;
while(k<=k0)
printf("%c",result[k++]);
printf("\n");
}
}
|
32
|
15,785 |
int main()
{
char a[100],b[100];
int c[100],d[100],i,j,k,l,n;
scanf("%d",&n);
for(l=0;l<n;l++)
{
scanf("%s\n",a);
scanf("%s",b);
memset(c,0,sizeof(c));
memset(d,0,sizeof(d));
int n1=strlen(a);
j=0;
for(i=n1-1;i>=0;i--) c[j++]=a[i]-'0';
int n2=strlen(b);
j=0;
for(i=n2-1;i>=0;i--) d[j++]=b[i]-'0';
for(i=0;i<100;i++)
{
c[i]=c[i]-d[i];
if(c[i]<0)
{
c[i]=c[i]+10;
c[i+1]--;
}
}
k=99;
while(c[k]==0&&k>0) k--;
for(i=k;i>=0;i--) printf("%d",c[i]);
printf("\n");
}
return 0;
}
|
32
|
15,786 |
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
|
15,787 |
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
|
15,788 |
int main()
{
int n, a[100]={0}, b[100]={0}, c[100]={0}, l1, l2, i, j;
char begin1[101]={0}, begin2[101]={0};
int compare(int a, int b);
scanf("%d\n", &n);
for(i=0;i<n;i++){
scanf("%s", begin1);
scanf("%s", begin2);
if(i!=n-1)
scanf("\n");
l1 = strlen(begin1);
l2 = strlen(begin2);
for(j=0;j<compare(l1, l2);j++){
if(l1>=l2){
a[j] = (int)begin1[j]-48;
if(j<l2)
b[j+l1-l2] = (int)begin2[j]-48;
}
else{
if(j<l1)
a[j+l2-l1] = (int)begin1[j]-48;
b[j] = (int)begin2[j]-48;
}
}
for(j=compare(l1, l2)-1;j>=0;j--){
if(a[j]-b[j]>=0)
c[j] = a[j] - b[j];
else{
c[j] = 10+a[j]-b[j];
a[j-1] = a[j-1]-1;
}
}
for(j=0;j<compare(l1, l2);j++){
printf("%d", c[j]);
c[j]=0;
begin1[j]='\0';
begin2[j]='\0';
a[j]=0;
b[j]=0;
}
printf("\n");
}
return 0;
}
int compare(int a, int b){
if(a>=b)
return a;
else
return b;
}
|
32
|
15,789 |
void main()
{
int n,i;
char a[100][100];
char b[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%s",a[i],b[i]);
int p,q,j,k;
for(i=0;i<n;i++)
{
p=strlen(a[i]);q=strlen(b[i]);
for(j=q-1,k=p-1;j>=0;j--,k--)
{
if(a[i][k]>=b[i][j]) a[i][k]=a[i][k]-b[i][j]+48;
else if(a[i][k]<b[i][j]) {a[i][k]=a[i][k]-b[i][j]+58;a[i][k-1]=a[i][k-1]-1;}
}
for(k=0;k<p;k++)
{if(a[i][k]!=0) {printf("%c",a[i][k]);j=k;break;}}
for(k=j+1;k<p;k++) printf("%c",a[i][k]);
printf("\n");
}
}
|
32
|
15,790 |
int s1[MAX];
int s2[MAX];
char num1[MAX];
char num2[MAX];
int Minus(int maxx, int * s1, int *s2)
{
int i;
int largest = 0;
for(i=0;i<maxx;i++)
{
s1[i]-=s2[i];
if(s1[i]<0)
{s1[i] += 10;
s1[i+1] --; //jiewei
}
if(s1[i])
largest = i;
}
return largest;
}
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
scanf("%s",num1);
scanf("%s",num2);
int i,j;
memset(s1,0,sizeof(s1));
memset(s2,0,sizeof(s2));
int n1=strlen(num1);
for(j=0,i=n1-1;i>=0;i--)
s1[j++]=num1[i]-'0';
int n2=strlen(num2);
for(j=0,i=n2-1;i>=0;i--)
s2[j++]=num2[i]-'0';
int largest = Minus(MAX,s1,s2);
for(i=largest;i>=0;i--)
printf("%d",s1[i]);
printf("\n");
}
return 0;
}
|
32
|
15,791 |
//**********************
//?????************
int main()
{
int n;
cin>>n;
for(int times=1;times<=n;times++)
{
cin.get();
const int max=200;
char str1[max+1],str2[max+1];
long an1[max]={0},an2[max]={0};
cin.getline(str1,max+1);
cin.getline(str2,max+1);
int la=strlen(str1);
int lb=strlen(str2);
memset(an1,0,sizeof(an1));
memset(an2,0,sizeof(an2));
int i=0,j=0;
for (i = la-1;i>=0; i--)
an1[j++] = str1[i] - '0';
j=0;
for (i = lb-1;i>=0;i--)
an2[j++] = str2[i] - '0'; //??
for(i=0;i<max;i++)
{
an1[i]=an1[i]-an2[i];
if(an1[i]<0)
{
an1[i]=an1[i]+10;
an1[i+1]=an1[i+1]-1;
}
} //??
i=max-1;
while(an1[i]==0)
i--;
for(;i>=0;i--)
cout<<an1[i];
cout<<endl;
} //??
return 0;
}
|
32
|
15,792 |
void change(char ch[],int a[])
{
int i;
int nc;
nc=strlen(ch);
for(i=0;i<nc;i++)
{
a[i]=ch[i]-48;
}
}
void minus(int a[],int b[],int na,int nb)
{
int i;
for(i=1;i<=nb;i++)
{
if(a[na-i]<b[nb-i])
{
a[na-i-1]--;
a[na-i]=a[na-i]-b[nb-i]+10;
}
else
{
a[na-i]-=b[nb-i];
}
}
}
void print(int a[],int na)
{
int i,j=0;
for(j=0;a[j]==0;j++)
i++;
for(i=j;i<na;i++)
printf("%d",a[i]);
}
int main()
{
int a[100],b[100];
char c[100];
int n,i,j,na,nb;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",c);
na=strlen(c);
change(c,a);
for(j=0;j<100;j++)
c[j]='\0';
scanf("%s",c);
nb=strlen(c);
change(c,b);
minus(a,b,na,nb);
print(a,na);
printf("\n");
}
return 0;
}
|
32
|
15,793 |
void main()
{
int n,la,lb,length,i,s,j;
char a[100],b[100];
int aArray[100],bArray[100];
scanf("%d",&n);
for(s=1;s<=n;s++)
{
scanf("%s",a);
scanf("%s",b);
la=strlen(a);
lb=strlen(b);
length=la-lb;
for(i=0;i<la;i++)
aArray[i]=a[i]-'0';
for(i=0;i<length;i++)
bArray[i]=0;
for(i=length;i<la;i++)
bArray[i]=b[i-length]-'0';
for(i=la-1;i>=0;i--)
{
if(aArray[i]>=bArray[i])a[i]=aArray[i]-bArray[i];
if(aArray[i]<bArray[i])
{a[i]=aArray[i]+10-bArray[i];aArray[i-1]--;}
}
for(i=0;i<la;i++)
a[i]=a[i]+48;
for(i=0;i<la;i++)
{
if(a[i]!=0)
for(j=i;j<la;j++)
printf("%c",a[j]);
printf("\n");
break;
}
}
}
|
32
|
15,794 |
void main()
{
int i,j,n,k,k1,k2,x[101],y[101],z[101];
char a[11][101],b[11][101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=100;j++)
{
a[i][j]='\0';
b[i][j]='\0';
}
}
for(i=1;i<=n;i++)
{
scanf("%s",&a[i]);
scanf("%s",&b[i]);
}
for(i=1;i<=n;i++)
{
for(j=0;j<=100;j++)
{
x[j]=0;
y[j]=0;
z[j]=0;
}
for(j=100;j>=0;j--)
{
if(a[i][j]!='\0')
{
k1=j+1;
for(j=j;j>=0;j--)
a[i][j]=a[i][j]-48;
if(j==-1)
break;
}
}
for(j=100;j>=0;j--)
{
if(b[i][j]!='\0')
{
k2=j+1;
for(j=j;j>=0;j--)
b[i][j]=b[i][j]-48;
if(j==-1)
break;
}
}
for(j=100;j>=101-k1;j--)
x[j]=a[i][j-101+k1];
for(j=100;j>=101-k2;j--)
y[j]=b[i][j-101+k2];
for(j=100,k=0;j>=101-k1;j--)
{
if(x[j]-k>=y[j])
{
z[j]=x[j]-k-y[j];
k=0;
}
if(x[j]-k<y[j])
{
z[j]=x[j]+10-k-y[j];
k=1;
}
}
for(j=0;i<=100;j++)
{
if(j==100&&z[j]==0)
printf("0\n");
if(z[j]!=0)
{
for(j=j;j<=100;j++)
printf("%d",z[j]);
if(j==101)
{
printf("\n");
break;
}
}
}
}
}
|
32
|
15,795 |
void func2(char o[],int x)
{
for (int u=0;u<x;u++)
o[u]=0;
}
main()
{
char *p1,*p2;
char a[100]={0},b[100]={0},d[100]={0},e[100][100]={0};
int c[100]={0};
int i,j,k,m,n,g=0,t,v,l;
scanf("%d\n",&v);
for (k=0;k<v;k++)
{
scanf("%s\n",a);
scanf("%s",b);
p1=a;
p2=b;
m=strlen(a);
n=strlen(b);
for (i=0;i<m-n;i++)
d[i]='0';
p2=strcat(d,b);
for (j=m-1;j>=0;j--)
{
c[j]=p1[j]-p2[j]+g;
if (c[j]<0)
{
c[j]=c[j]+10;
g=-1;
}
else
g=0;
t=m-j;
e[k][j]=c[j]+'0';
}
for (int h=0;h<m;h++)
{
if (e[k][h]=='0')
e[k][h]=0;
else
break;
}
func2(a,m);
func2(b,m);
func2(d,m);
}
for (l=0;l<v;l++)
printf("%s\n",e[l]);
}
|
32
|
15,796 |
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
|
15,797 |
void main()
{
char beijian[200],jian[200],jian2[200],result[200];
int i=0,j=0,l1,l2,n;
scanf("%d",&n);
for(j=0;j<n;j++)
{
for(i=0;i<100;i++)
{
jian2[i]=48;
result[i]=48;
}
jian2[99]=0;
result[99]=0;
scanf("%s",beijian);
scanf("%s",jian);
l1=strlen(beijian);
l2=strlen(jian);
if(l1==l2)
{
for(i=l1-1;i>=0;i--)
{
if(beijian[i]<jian[i])
{
beijian[i]=beijian[i]+10;
beijian[i-1]=beijian[i-1]-1;
}
result[i]=beijian[i]-jian[i]+48;
}
result[l1]='\0';
}
else
{
for(i=l1-1;i>=l1-l2;i--) jian2[i]=jian[i-l1+l2];
for(i=l1-1;i>=0;i--)
{
if(beijian[i]<jian2[i])
{
beijian[i]=beijian[i]+10;
beijian[i-1]=beijian[i-1]-1;
}
result[i]=beijian[i]-jian2[i]+48;
}
result[l1]='\0';
}
for(i=0;i<l1;i++)
{
if(result[i]!=0&&result[i]!=48) break;
}
while(result[i]!='\0') printf("%c",result[i++]);
printf("\n");
}
}
|
32
|
15,798 |
int main()
{
int i,n,j,x,y,k;
char a[101],b[101],c[101],d[101],e[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
x=strlen(a);
y=strlen(b);
for(j=x-1,k=0;j>=0;j--,k++)
c[k]=a[j];
for(j=y-1,k=0;j>=0;k++,j--)
d[k]=b[j];
for(j=0;j<x;j++)
{
if(j<y)
{
if(c[j]<d[j]) {e[j]=c[j]+58-d[j];c[j+1]=c[j+1]-1;}
else e[j]=c[j]-d[j]+48;
}
else e[j]=c[j];
}
for(j=x-1;j>=0;j--) printf("%c",e[j]);
printf("\n");
}
return 0;
}
|
32
|
15,799 |
void c(char a[],int h,char b[],int k)
{
int i,j,w=0,y=0;
char c[252];
for(i=h-1,j=k-1;i>=0;i--,j--)
{
if(j>=0)
{
c[i+1]=a[i]+48-b[j];
if(c[i+1]<48)
{
c[i+1]=c[i+1]+10;
a[i-1]=a[i-1]-1;
}
}
else
{
if(a[i]<48)
{c[i+1]=a[i]+10;
a[i-1]=a[i-1]-1;}
else
c[i+1]=a[i];}
}
for(i=1;i<h+1;i++)
{
if(c[i]!='0')
{w=1;y++;}
if(h+1==2||y!=0)
{printf("%c",c[i]);}}
printf("\n");
}
int main()
{
int h,k,n,i;
char a[251],b[251];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s\n",a,b);
h=strlen(a);
k=strlen(b);
if(h>=k)
c(a,h,b,k);
else if(k>h)
c(b,k,a,h);
}
return 0;
}
|
32
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.