id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
15,600 |
int main()
{
int n;
char a[108];
char b[108];
char c[108];
int i, j, k;
int la, lb;
int bit;
cin >> n;
for(k = 0; k < n; k ++)
{
cin >> a >> b;
bit = 0;
la = strlen(a);
lb = strlen(b);
for(i = la - 1; i >= la - lb; i --)
{
if(a[i] - b[i - la + lb] - bit >= 0)
{
c[i] = a[i] - b[i - la + lb] - bit + '0';
bit = 0;
}
else
{
c[i] = a[i] - b[i - la + lb] - bit + 10 + '0';
bit = 1;
}
}
c[la - lb - 1] = a[la - lb - 1] - bit;
for(i = 0; i < la - lb - 1; i ++)
c[i] = a[i];
c[la] = '\0';
cout << c << endl;
}
return 0;
}
|
32
|
15,601 |
void main()
{
int a[101],b[101],c[101]={0},n,i,j,k,len1,len2;
char sa[101],sb[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",sa);
scanf("%s",sb);
len1=strlen(sa);
len2=strlen(sb);
for(j=0;j<101;j++)
{
a[j]=0;
b[j]=0;
}
for(j=len1-1,k=0;j>=0;j--,k++)
{
a[k]=sa[j]-'0';
}
for(j=len2-1,k=0;j>=0;j--,k++)
{
b[k]=sb[j]-'0';
}
for(j=0;j<=len1-1;j++)
{
if(a[j]>=b[j])
{
c[j]=a[j]-b[j];
}
if(a[j]<b[j])
{
a[j+1]-=1;
c[j]=a[j]+10-b[j];
}
}
for(j=len1-1;j>=0;j--)
{
printf("%d",c[j]);
}
printf("\n");
}
}
|
32
|
15,602 |
void main()
{
int n;
scanf("%d",&n);
char a[100],b[100];
int i;
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
int ka=strlen(a);
int kb=strlen(b);
int aa[100]={0},bb[100]={0},c[100]={0};
int j;
for(j=0;j<ka;j++)
{
aa[j]=a[ka-1-j]-'0';
}
for(j=0;j<kb;j++)
{
bb[j]=b[kb-1-j]-'0';
}
for(j=0;j<ka;j++)
{
if(aa[j]>=bb[j])
c[j]=aa[j]-bb[j];
else
{
c[j]=aa[j]-bb[j]+10;
aa[j+1]=aa[j+1]-1;
}
}
if(c[ka-1]!=0)
printf("%d",c[ka-1]);
for(j=ka-2;j>=0;j--)
{
printf("%d",c[j]);
}
printf("\n");
}
}
|
32
|
15,603 |
int main ( )
{
int n, i, j, k, len[100];
char number[100][101], exp;
cin >> n;
cin.get();
for (i = 0;i < 2*n;i++)
{
if (i == 2*n-1 || i % 2 == 0)
cin.getline(number[i],101);
else
{
cin.getline(number[i],101);
cin.get(); /*????*/
}
}
for (i = 0;i < 2*n;i++)
{
for (j = 0,k = strlen(number[i])-1;j < k;j++,k--)/*??????????*/
{
exp = number[i][j];
number[i][j] = number[i][k];
number[i][k] = exp;
}
len[i] = strlen(number[i]);
}
for (i = 0;i < 2*n;i = i + 2)
{
for (j = 0;j < len[i + 1];j++)
{
if (number[i][j] < number[i + 1][j])
{
number[i][j] = number[i][j] + ':' - number[i + 1][j];
number[i][j + 1] --;
}
else number[i][j] = number[i][j] - number[i + 1][j] + '0';
}
if (number[i][len[i]-1] == 0)
number[i][len[i]-1] = '\0';
len[i] = strlen(number[i]);
}
for (i = 0;i < 2*n;i = i + 2) /*??????*/
{
for (j = len[i]-1;j >= 0;j--)
{
if (j == 0)
cout << number[i][j] <<endl;
else cout << number[i][j];
}
}
return 0;
}
|
32
|
15,604 |
int main()
{
char str1[100][100],str2[100][100],str3[100][100];
char s[100][100];
int n,i,j,k,a1[100],a2[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
gets(str3[i]);
gets(str1[i]);
gets(str2[i]);
}
for(i=0;i<n;i++)
{
a1[i]=strlen(str1[i]);
a2[i]=strlen(str2[i]);
}
for(i=0;i<n;i++)
{
s[i][a1[i]]='\0';
for(j=a2[i]-1;j>=0;j--)
{
if(str1[i][j+a1[i]-a2[i]]>=str2[i][j])
s[i][j+a1[i]-a2[i]]=str1[i][j+a1[i]-a2[i]]-str2[i][j]+48;
else
{ s[i][j+a1[i]-a2[i]]=str1[i][j+a1[i]-a2[i]]-str2[i][j]+58;
str1[i][j+a1[i]-a2[i]-1]=str1[i][j+a1[i]-a2[i]-1]-1;
}
}
for(k=0;k<a1[i]-a2[i];k++)
s[i][k]=str1[i][k];
}
for(i=0;i<n;i++)
printf("%s\n",s[i]);
}
|
32
|
15,605 |
void stringrev(char *a,char*b)
{
int i,j,k,l,n;
l=strlen(a);
for(i=0;i<l;i++)
{
b[i]=a[l-1-i];
}
b[i]=0;
}
void jianfa(char *a,char*b,char*c)
{
int i,j,k,l=strlen(a),t=0;
char d[101]={0},e[101]={0};
stringrev(a,d);
stringrev(b,e);
for(i=0;i<l;i++)
{
if(e[i]!=0)
d[i]=d[i]-e[i]-t;
else
d[i]=d[i]-'0'-t;
if(d[i]<0)
{
d[i]=d[i]+10+'0';
t=1;
}
else
{
d[i]=d[i]+'0';
t=0;
}
}
for(j=l-1;j>=0;j--)
{
if(d[j]=='0')
d[j]=0;
else break;
}
stringrev(d,c);
}
void main()
{
int n,i,j,k;
char a[101],b[101],c[101]={0};
scanf("%d",&n);
while(n--)
{
scanf("%s %s",a,b);
jianfa(a,b,c);
printf("%s\n",c);
}
}
|
32
|
15,606 |
void main()
{
int i,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
char a[101],b[101];
scanf("%s",a);
scanf("%s",b);
int ita,itb;
for(ita=0;a[ita]!='\0';ita++)
;
for(itb=0;b[itb]!='\0';itb++)
;
ita--;
itb--;
int temp=0;
for(;itb>=0;itb--)
{
a[ita]=a[ita]-b[itb]-temp;
if(a[ita]<0)
{
temp=1;
a[ita]+=10;
}
else
temp=0;
a[ita]+='0';
ita--;
}
for(;ita>=0;ita--)
{
a[ita]=a[ita]-temp;
if(a[ita]<'0')
{
temp=1;
a[ita]+=10;
}
else
break;
}
printf("%s\n",a);
}
}
|
32
|
15,607 |
void jian(char a[100],char b[100])
{
int m,n,i,t=0;
n=strlen(a);
m=strlen(b);
for (i=0;i<=m-1;i++)
{
if (a[n-i-1]>=b[m-i-1]+t)
{
a[n-i-1]=a[n-i-1]-b[m-i-1]-t+48;
t=0;
}
else{
a[n-i-1]=a[n-i-1]+10-b[m-i-1]+48-t;
t=1;
}
}
for (i=m;i<=n-1;i++)
{
if (a[n-i-1]>=t+48)
{
a[n-i-1]=a[n-i-1]-t;
break;
}
else{
a[n-i-1]=a[n-i-1]+10-t;
t=1;
}
}
for (i=0;i<=n-1;i++)
{
if(a[i]=='0')
{
a[i]=0;
}
else{break;}
}
}
void main()
{
int n,i,j;
char a[100][100]={0},b[100][100]={0},c[10];
scanf("%d",&n);
gets(c);
for (i=0;i<=n-1;i++)
{
gets(a[i]);
gets(b[i]);
gets(c);
jian(a[i],b[i]);
}
for (i=0;i<=n-1;i++)
{
for(j=0;j<=99;j++)
{
if(a[i][j]!=0)
{
printf("%c",a[i][j]);
}
}
printf("\n");
}
}
|
32
|
15,608 |
int main()
{
void f(char x[100],char y[100]);
char a[100][100],b[100][100];
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]);
return 0;
}
void f(char x[100],char y[100])
{
int m,n,i,j;
char z[100],s[100];
strcpy(z,x);
m=strlen(x);
n=strlen(y);
for(i=1;i<=n;i++)
{if(x[m-i]<y[n-i])
{x[m-i]+=10;
z[m-i-1]=x[m-i-1]-=1;}
z[m-i]=x[m-i]-y[n-i]+48;
}
for(i=0;i<m;i++)
if(z[i]!='0')
{for(j=0;j<=m-i;j++)
s[j]=z[i+j];
break;}
printf("%s\n",s);
}
|
32
|
15,609 |
int p,len1[100];
char ans[100][100];
void minus(char c[100],char d[100])
{
int len2,i,j;
char e[100];
len1[p]=strlen(c);len2=strlen(d);
for(i=0;i<len1[p];i++) e[i]='0';
for(i=len1[p]-len2;i<len1[p];i++)
{
e[i]=d[i-len1[p]+len2];}
for(i=0;i<len1[p]-1;i++)
{
j=len1[p]-1-i;
if(c[j]>=e[j]) ans[p][j]=c[j]-e[j]+'0';
else {ans[p][j]=c[j]-e[j]+'0'+10;c[j-1]=c[j-1]-1;}
}
ans[p][0]=c[0]-e[0]+'0';
}
void main()
{
int n,i,j,k;
char a[100][100],b[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);}
for(p=0;p<n;p++)
{
minus(a[p],b[p]);
k=0;
for(i=0;i<100;i++)
{
if(ans[p][i]=='0') k=k+1;
else break;
}
for(j=k;j<len1[p];j++)
printf("%c",ans[p][j]);
printf("\n");
}
}
|
32
|
15,610 |
int main()
{
int n,i,l,m,j,k,p,q=0;
char a[100][100],b[100][100],c[100],d[100],e[100];
scanf("%d\n",&n);
for(i=0;i<=n-2;i++)
{
gets(a[i]);
gets(b[i]);
scanf("\n");
}
gets(a[n-1]);
gets(b[n-1]);
for(i=0;i<=n-1;i++)
{
l=strlen(a[i]);
m=strlen(b[i]);
strcpy(c,b[i]);
for(j=0;j<=l-1;j++)
{
if(j<=l-m-1)
b[i][j]='0';
if(j>l-m-1)
b[i][j]=c[j-l+m];
}
for(j=l-1;j>=0;j--)
{
if(a[i][j]<b[i][j])
{
d[j]=a[i][j]-b[i][j]+10+48;
q=0;
for(p=1;;p++)
{
if(a[i][j-p]=='0')
{
q=q+1;
a[i][j-p]='9';
}
if(a[i][j-p]!='0')
break;
}
a[i][j-q-1]=a[i][j-q-1]-1;
}
if(a[i][j]>=b[i][j])
d[j]=a[i][j]-b[i][j]+48;
}
for(j=0;j<=l-1;j++)
if(d[j]!='0')
{
k=j;
break;
}
for(j=k;j<=l-1;j++)
printf("%c",d[j]);
if(i!=n-1)
printf("\n");
for(j=0;j<=99;j++)
d[j]='0';
}
return 0;
}
|
32
|
15,611 |
void main()
{
char a[100][100],b[100][100],c[100][100]={'\0'},enter;
int i,j,k,n,m,len1,len2;
scanf("%d",&n);
scanf("%s%s",a[0],b[0]);
for(i=1;i<n;i++)
{
scanf("%s%s",a[i],b[i]);
}
for(i=0;i<n;i++)
{
len1=strlen(a[i]);
len2=strlen(b[i]);
for(j=0;j<len1;j++)
c[i][j]='0';
for(j=0;j<len2;j++)
{
c[i][j+len1-len2]=b[i][j];
}
for(j=len1-1;j>=0;j--)
{
if(c[i][j]<=a[i][j])a[i][j]=a[i][j]-c[i][j]+'0';
else
{
a[i][j]=a[i][j]-c[i][j]+'0'+10;
a[i][j-1]--;
}
}
printf("%s\n",a[i]);
}
}
|
32
|
15,612 |
int lena,lenb,lenc;
void minus(char a[],char b[],char c[])
{ int carry=0,i;
for(i=lena-1;i>=0;i--)
{if(a[i]-b[i]-carry<0)
{c[i]=a[i]+10-b[i]+'0'-carry;
carry=1;
}
else if(a[i]-b[i]-carry>=0)
{c[i]=a[i]-b[i]+'0'-carry;
carry=0;
}
}
c[lena]='\0';
}
void operate(char b[])
{ int jump=lena-lenb;
int i;
b[lena]='\0';
for(i=lenb;i>=0;--i)
b[i+jump]=b[i];
for(i=0;i<jump;i++)
b[i]='0';
}
void main()
{ char a[ARRAY][N],b[ARRAY][N],c[N];
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s",a[i]);
scanf("%s",b[i]);
printf("\n");
}
for(i=0;i<n;i++)
{lena=strlen(a[i]);lenb=strlen(b[i]);
operate(b[i]);
minus(a[i],b[i],c);
for(j=0;j<lena;j++)
if(c[j]!='0') break;
for(;j<lena;j++)
printf("%c",c[j]);
printf("\n");
}
}
|
32
|
15,613 |
int main()
{
char seline1[100][100],seline2[100][100];
int n;
cin>>n;
cin.get();
for(int k=0;k<n-1;k++)
{
cin.getline(seline1[k],100);
cin.getline(seline2[k],100);
cin.get();
}
cin.getline(seline1[n-1],100);
cin.getline(seline2[n-1],100);
for(int k=0;k<n;k++)
{
int l1=strlen(seline1[k]),an1[100],an2[100];
int l2=strlen(seline2[k]);
memset(an1, 0, sizeof(an1));
memset(an2, 0,sizeof(an2));
for(int i=0;i<l1;i++)
an1[i]=seline1[k][l1-i-1]-'0';//???????????????
for(int i=0;i<l2;i++)
an2[i]=seline2[k][l2-i-1]-'0';
for(int j=0;j<l1;j++)
{
if(an1[j]>=an2[j])
an1[j]-=an2[j];
else
{
an1[j+1]--;
an1[j]=an1[j]+10-an2[j];
}
}
int t=99;
while(an1[t]==0) t--;
for(;t>=0;t--)
cout<<an1[t];
cout<<endl;
}
return 0;
}
|
32
|
15,614 |
int main()
{long int d,n,i,j,l1,l2,a1[10000],a2[10000];
char str1[10000],qq,str2[10000];
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
gets(str1);
gets(str2);
scanf("%c",&qq);
l1=strlen(str1);
l2=strlen(str2);
for(j=0;j<=l1-1;j++)a1[j]=str1[j]-48;
for(j=0;j<=l2-1;j++)a2[j]=str2[j]-48;
j=1;d=0;
while(l2>=j)
{
a1[l1-j]=a1[l1-j]-a2[l2-j]-d;
if (a1[l1-j]<0){a1[l1-j]=a1[l1-j]+10;d=1;}else d=0;
j=j+1;
}
if (l1-j>=0)a1[l1-j]=a1[l1-j]-d;
for (j=0;j<=l1-1;j++)printf("%d",a1[j]);
printf("\n");
}
}
|
32
|
15,615 |
void calc()
{ const int MAX_LEN = 200;
int an1[MAX_LEN]; int an2[MAX_LEN];
char seLine1[MAX_LEN + 1]; char seLine2[MAX_LEN + 1];
//cout << "please input two integers" << endl;
cin >> seLine1;
cin >> seLine2;
int nLen1 = strlen(seLine1);
int nLen2 = strlen(seLine2);
memset(an1, 0, sizeof(an1));
memset(an2, 0, sizeof(an2));
int i, j=0;
for (i = nLen1-1; i>=0; i--)
an1[j++] = seLine1[i] - '0';
j=0;
for (i = nLen2-1; i>=0;i--)
an2[j++] = seLine2[i] - '0';
for (i = 0; i < nLen1 ;i++)
{
//printf("%d\n", an1[i]);
an1[i] -= an2[i];
if(an1[i] < 0)
{
an1[i] +=10;
an1[i + 1]--;
}
}
i = nLen1 - 1;
while(i > 0 && an1[i]==0) i--;
//printf("%d\n", i);
for(;i >= 0; i--)
cout << an1[i];
cout << endl;
}
int main()
{
int n;
cin >> n;
while (n --)
calc();
}
|
32
|
15,616 |
void main()
{
int a[105]={0},b[105]={0},d[105]={0};
int i,j,k,n;
char c[105]="";
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
gets(c);
k=strlen(c);
for (j=0;j<k;j++)
a[j]=c[k-j-1]-'0';
for (j=k;j<105;j++) a[j]=0;
gets(c);
k=strlen(c);
for (j=0;j<k;j++)
b[j]=c[k-j-1]-'0';
for (j=k;j<105;j++) b[j]=0;
//printf("%d %d%d%d%d%s ",k,b[1],b[2],b[3],b[4],c);
gets(c);
for (j=0;j<=102;j++) d[j]=0;
for (j=0;j<=102;j++)
{
d[j]=d[j]+a[j]-b[j];
if (d[j]<0) {d[j]=d[j]+10;d[j+1]=d[j+1]-1;}
//k=j,k=d[j];
}
j=101;
while (d[j]==0) {j--;}
while (j>=0) {printf("%d",d[j]); j--;}
printf("\n");
}
}
|
32
|
15,617 |
/**
* @file 1000012907_1.cpp
* @author ???
* @date 2010?11?17
* @description
* ??????: ?????
*/
int main()
{
int n, i, len1, len2, j, k, char11[101], char22[101], flag = 0, answer[101];
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,618 |
char a[100],b[100];
void reverse(char a[])
{int i,m;
char t;
m=strlen(a);
for(i=0;i<m/2;i++)
{t=a[i];
a[i]=a[m-i-1];
a[m-1-i]=t;
}
}
void minus(char a[],char b[])
{int i;
for(i=0;i<strlen(b);i++)
{a[i]=a[i]-b[i];
if(a[i]<0)
{a[i]=a[i]+10;
a[i+1]=a[i+1]-1;
}
a[i]=a[i]+48;
}
}
void main()
{int i,n;char c[2];
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
gets(a); gets(b);
gets(c);
reverse(a); reverse(b);
minus(a,b);
reverse(a);
puts(a);
}
gets(a); gets(b);
reverse(a); reverse(b);
minus(a,b);
reverse(a);
puts(a);
}
|
32
|
15,619 |
int a1[N],a2[N];
char s1[N+1],s2[N+1];
int main()
{
int n,i,j,k,t;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
getchar();
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
gets(s1);
gets(s2);
j=0;
int len1=strlen(s1);
for(k=len1-1;k>=0;k--)
a1[j++]=s1[k]-'0';
j=0;
int len2=strlen(s2);
for(k=len2-1;k>=0;k--)
a2[j++]=s2[k]-'0';
for(j=0;j<len2;j++)
{
if(a1[j]>=a2[j])
a1[j]-=a2[j];
else
{
a1[j]=a1[j]+10-a2[j];
a1[j+1]--;
}
}
for(j=len1-1;j>=0;j--)
if(a1[j]>0)
{
t=j;
break;
}
for(j=t;j>=0;j--)
printf("%d",a1[j]);
printf("\n");
}
return 0;
}
|
32
|
15,620 |
int main() {
int n,la,lb;
char a[100],b[100];
int a1[100],b1[100],c[100];
cin>>n;
while(n>0)
{
cin>>a>>b;
la=strlen(a);
lb=strlen(b);
for(int i=la-1,j=1;i>=0;i--)
a1[j++]=a[i]-'0';
for(int i=lb-1,j=1;i>=0;i--)
b1[j++]=b[i]-'0';
for(int i=lb+1;i<=la;i++)
b1[i]=0;
int t=0;
for(int i=1;i<=la;i++)
{
c[i]=a1[i]-b1[i]+t;
if(c[i]<0)
{
c[i]=c[i]+10;
t=-1;
}
else
t=0;
}
for(int i=la;i>=1;i--)
if(c[i]!=0)
{
la=i;
break;
}
for(int i=la;i>=1;i--)
cout<<c[i];
cout<<endl;
n--;
}
return 0;
}
|
32
|
15,621 |
int main()
{
int len1,len2,n,i,j,k,result[1000];
char num1[101],num2[101];
cin>>n;
for(i=1;i<=n;i++)
{
int a[1000]={0};
int b[1000]={0};
int result[1000]={0};
cin>>num1>>num2;
len2=strlen(num2);
len1=strlen(num1);
for(j=len1-1,k=0;j>=0;j--,k++)
{
a[k]=num1[j]-'0';
}
for(j=len2-1,k=0;j>=0;j--,k++)
{
b[k]=num2[j]-'0';
}
for(k=0;k<=len1-1;k++)
{
result[k]=result[k]+a[k]-b[k];
if(result[k]<0)
{
result[k+1]--;
result[k]+=10;
}
}
for(k=len1-1;k>=0;k--)
{
cout<<result[k];
}
cout<<endl;
}
return 0;
}
|
32
|
15,622 |
void main()
{
int a[101][101];
int b[101][101];
char c;
int i,k,numa,numb,n,j,j0;
scanf("%d\n",&n);
for(i=0;i<=100;i++)
{
for(j=0;j<=100;j++)
{
a[i][j]='\0';
b[i][j]='\0';
}
}
for(i=1;i<=n;i++)
{
k=1;
while((c=getchar())!='\n') a[i][k++]=c;
k=1;
while((c=getchar())!='\n') b[i][k++]=c;
getchar();
}
for(i=1;i<=n;i++)
{
for(numa=1;;numa++) if(a[i][numa]=='\0') break;
for(numb=1;;numb++) if(b[i][numb]=='\0') break;
numa--;numb--;
for(j=0;j<=numa-1&&b[i][numb-j]>='0'&&b[i][numb-j]<='9';j++)
{
a[i][numa-j]=a[i][numa-j]-b[i][numb-j];
if(a[i][numa-j]<0)
{
a[i][numa-j]=a[i][numa-j]+10;
a[i][numa-j-1]=a[i][numa-j-1]-1;
}
a[i][numa-j]=a[i][numa-j]+'0';
}
}
for(i=1;i<=n;i++)
{
for(j0=1;;j0++) if(a[i][j0]!='0') break;
for(j=j0;a[i][j]!='\0';j++)
{
printf("%c",a[i][j]);
}
printf("\n");
}
}
|
32
|
15,623 |
void minus(char a[],char b[],char result[]);
void main()
{
int n,i;
char a[max][max],b[max][max];
char result[max][max];
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s\n\n",a[i],b[i]);
minus(a[i],b[i],result[i]);
printf("%s\n",result[i]);
}
}
void minus(char a[],char b[],char result[])
{
int la,lb,t=0,s,c=0,i;
char temp;
la=strlen(a)-1;
lb=strlen(b)-1;
while(la >= 0)
{
if(lb < 0)
{
s=a[la--]-48;
}
else
{
s=a[la--]-b[lb--];
}
result[t++]=s-c+48;
if(result[t-1] < 48)
{
result[t-1]+=10;
c=1;
}
else c=0;
}
while(result[t] == 0) t--;
while(result[t] == '0')
{
result[t]=0;t--;
}
for(i=0;i <= t/2;i++)
{
temp=result[i];
result[i]=result[t-i];
result[t-i]=temp;
}
}
|
32
|
15,624 |
int main()
{
char str1[101], str2[101], kongge[101];
int num1[101] , num2[101], result[101] ;
int len1, len2, i, j, n;
cin >> n;
cin.get();
for(i = 1; i <= n; i++)
{
memset(str1, 0, 101);
memset(str2, 0, 101);
memset(num1, 0, 101);
memset(num2, 0, 101);
memset(result, 0, 101);
cin.getline(str1, 101);
len1 = strlen(str1);
for(j = 0; j < len1 ; j++ )
num1[j] = str1[j] - '0';
cin.getline(str2, 101);
len2 = strlen(str2);
for(j = 0; j < len2; j++ )
num2[len1 - 1 - j] = str2[len2 - 1 - j] - '0';
for(j = len1 - 1; j >= len1 - len2; j-- )
{
if(num1[j] >= num2[j])
num1[j] = num1[j] - num2[j];
else
{
num1[j] = 10 + num1[j] - num2[j];
// if(num1[j - 1] > 0)
num1[j - 1] = num1[j - 1] - 1 ;
/* else
{
int t = j - 1;
while(num1[t] == 0)
{
num1[t] = 9;
t--;
}
num1[t] = num1[t] - 1;
}*/
}
}
j = 0;
while(num1[j] == 0)
j++;
for(; j < len1; j++)
cout << num1[j];
cout << endl;
cin.getline(kongge, 101);
}
return 0;
}
|
32
|
15,625 |
void main()
{
int n,i,j,l1[100],l2[100];
char str1[100][100],str2[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",str1[i]);
scanf("%s",str2[i]);
}
for(i=0;i<n;i++)
{
l1[i]=strlen(str1[i]);
l2[i]=strlen(str2[i]);
for(j=1;j<l2[i]+1;j++)
{
if(str1[i][l1[i]-j] >= str2[i][l2[i]-j])
str1[i][l1[i]-j] = str1[i][l1[i]-j] - str2[i][l2[i]-j]+48;
else
{
str1[i][l1[i]-j-1]=str1[i][l1[i]-j-1]-1;
str1[i][l1[i]-j]=str1[i][l1[i]-j]+10-str2[i][l2[i]-j]+48;
}
}
}
for(i=0;i<n;i++)
{
printf("%s\n",str1[i]);
}
}
|
32
|
15,626 |
int main()
{
int n , i , k , t , z , b , a , len1 , len2 ;
char num1[1000][100] , num2[1000][100] ;
cin >> n ;
cin.get() ;
for ( i = 0 ; i < n ; i++ )
{
cin >> num1[i] >> num2[i] ;
}
for ( i = 0 ; i < n ; i++ )
{
len1 = strlen(num1[i]) ;
len2 = strlen(num2[i]) ;
for ( k = 0 ; k < len2 ; k++ )
{
a = len1-k-1 ;
b = len2-k-1 ;
if ( num1[i][a] >= num2[i][b] )
{
num1[i][a] = num1[i][a] - num2[i][b] + '0';
}
else
{
for ( t = a - 1 ; t >= 0 ; t-- )
if ( num1[i][t] > '0' )
break ;
for ( z = t + 1 ; z <= a - 1 ; z++ )
if ( num1[i][z] == '0' )
num1[i][z] = '9' ;
num1[i][t] = num1[i][t] - '1' + '0' ;
num1[i][a] = num1[i][a] + '1' - '0' + '9' - '0' - num2[i][b] + '0' ;
}
}
while ( 1 )
{
if ( num1[i][0] != '0' )
break ;
else
{
for ( z = 0 ; z < len1 ; z++ )
{
num1[i][z] = num1[i][z+1] ;
}
len1-- ;
}
}
for ( k = 0 ; k < len1 ; k++ )
cout << num1[i][k] ;
cout << endl ;
}
cin.get() ;
cin.get() ;
return 0 ;
}
|
32
|
15,627 |
int main()
{
int n;
cin>>n;
for(int k=1;k<=n;k++)
{
char a[101],b[101],c[101];
//cin.getline(a,101);
//cin.getline(b,101);
cin>>a>>b;
int lena,lenb;
lena=strlen(a);
lenb=strlen(b);
for(int i=1;i<=lenb;i++)
{
if(a[lena-i]>=b[lenb-i])
{
c[lena-i]=a[lena-i]-b[lenb-i]+'0';
}
else
{
c[lena-i]=a[lena-i]+10-b[lenb-i]+'0';
int t;
t=lena-i;
while(a[t-1]=='0')
{
a[t-1]='9';
t--;
}
a[t-1]-=1;
}
}
for(int i=0;i<lena-lenb;i++)
{
c[i]=a[i];
}
for(int i=0;i<lena;i++)
{
cout<<c[i];
}
cout<<endl;
}
return 0;
}
|
32
|
15,628 |
char a[105],b[105],c[105];
void minus(int l1,int l2)
{
int i,j;
for(i = 0;i < l2;i ++)
{
if(b[i]>=c[i])
b[i] -= c[i];
else
{
b[i] = b[i] + 10 - c[i];
j = i + 1;
b[j]--;
while(b[j]<0)
{
b[j] += 10;
j++;
b[j]--;
}
}
}
}
int main()
{
int n,i,max,j;
int l1,l2;
char m;
scanf("%d",&n);
for(i = 1;i <= n;i ++)
{
scanf("%s",a);
l1 = strlen(a);
scanf("%c",&m);
for(j = 0;j < l1;j ++)
b[l1-j-1] = a[j] - '0';
memset(a,0,sizeof(a));
scanf("%s",a);
scanf("%c",&m);
l2 = strlen(a);
for(j = 0;j < l2;j ++)
c[l2-j-1] = a[j] - '0';
minus(l1,l2);
while(!b[l1-1])
l1--;
for(j = l1 - 1;j>=0;j --)
printf("%d",b[j]);
printf("\n");
}
return 0;
}
|
32
|
15,629 |
void jf(char *a,int n,char *b,int m)
{
int i,j,k;
for(i=m-1,j=n-1;i>=1;i--,j--)
{
if(a[j]>=b[i])
a[j]=a[j]-b[i]+'0';
else
{
a[j]=a[j]-b[i]+10+'0';
a[j-1]--;
}
}
if(n==m)
{a[0]=a[0]-b[0]+'0';
for(i=0;i<n;i++)
printf("%c",a[i]);
}
else
{
if(a[n-m]>=b[0])
a[n-m]=a[n-m]-b[0]+'0';
else
{
a[n-m]=a[n-m]-b[0]+10+'0';
a[n-m-1]--;
for(k=n-m-1;k>=0;k--)
{
if(a[k]>='0')
break;
else
{
a[k]=9+'0';
a[k-1]--;
}
}
}
for(i=0;i<n;i++)
printf("%c",a[i]);
}
}
int main()
{
int n,i;
scanf("%d",&n);
char **pp;
pp=(char**)malloc(n*sizeof(char*));
for(i=0;i<n;i++)
pp[i]=(char*)malloc(101*sizeof(char));
char **qq;
qq=(char**)malloc(n*sizeof(char*));
for(i=0;i<n;i++)
qq[i]=(char*)malloc(101*sizeof(char));
for(i=0;i<n-1;i++)
{
scanf("%s",pp[i]);
scanf("%s",qq[i]);
printf("\n");
}
scanf("%s",pp[n-1]);
scanf("%s",qq[n-1]);
int *p,*q;
p=(int*)malloc(n*sizeof(int));
q=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
p[i]=strlen(pp[i]);
q[i]=strlen(qq[i]);
}
for(i=0;i<n;i++)
{
jf(pp[i],p[i],qq[i],q[i]);
printf("\n");
}
for(i=0;i<n;i++)
free(pp[i]);
free(pp);
for(i=0;i<n;i++)
free(qq[i]);
free(qq);
free(p);
free(q);
}
|
32
|
15,630 |
int main()
{
char C[1013];
int A[1013],B[1013];
int K1, K2, N;
scanf("%d\n",&N);
for (int I = 1; I <= N; I ++)
{
if (I > 1) scanf("\n");
gets(C);K1 = strlen(C);
for (int J = 0; J < K1; J ++) A[K1 - J] = C[J] - '0';
gets(C);K2 = strlen(C);
for (int J = 0; J < K2; J ++) B[K2 - J] = C[J] - '0';
for (int J = 1; J <= K2; J ++) A[J] -= B[J];
for (int J = 1; J <= K1; J ++)
if (A[J] < 0)
{
A[J] += 10;
A[J + 1] --;
}
for (int J = K1; J >= 1; J --) cout << A[J];
cout << endl;
}
}
|
32
|
15,631 |
int main()
{
int n, i, j, k, t1[1000] = {0}, t2[1000] = {0}, x[1000], l1, l2;
char c1[1000], c2[1000];
cin >> n;
k = n;
while (k != 0)
{
cin.get();
cin.getline(c1,1000);
cin.getline(c2,1000);
l1 = strlen(c1);
l2 = strlen(c2);
for (i = 0; i < 1000; i++)
t2[i] = t1[i] = 0;
for (i = 0; i < l1; i++)
t1[i] = c1[l1 - 1 - i] - '0';
for (i = 0; i < l2; i++)
t2[i] = c2[l2 - 1 - i] - '0';
for (i = 0; i < l1; i++)
{
x[i] = t1[i] - t2[i];
if (x[i] < 0)
{
x[i] += 10;
t1[i + 1]--;
}
}
for (i = l1 - 1; i >= 0; i--)
if(x[i] != 0) break;
for (j = i; j >= 0; j--)
cout << x[j];
cout << '\n';
k--;
}
return 0;
}
|
32
|
15,632 |
int main()
{
char c[100][4][100]={'\0'};
int i,j,k,n;
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
gets(c[i][0]);
gets(c[i][1]);
gets(c[i][2]);
}
gets(c[n-1][0]);
gets(c[n-1][1]);
for(i=0;i<n;i++)
{
for(j=0;j<strlen(c[i][1]);j++)
{
c[i][3][j+strlen(c[i][0])-strlen(c[i][1])]=c[i][1][j];
}
for(j=0;j<(strlen(c[i][0])-strlen(c[i][1]));j++)
{
c[i][3][j]='0';
}
for(j=(strlen(c[i][0])-1);j>=0;j--)
{
if(c[i][0][j]>=c[i][3][j])
{
c[i][0][j]=c[i][0][j]-c[i][3][j]+48;
}
else
{
c[i][0][j]=58-(c[i][3][j]-c[i][0][j]);
for (k=j-1;k>=0;k--)
{
if (c[i][0][k]!='0')
{
c[i][0][k]=c[i][0][k]-1;
break;
}
else
{
c[i][0][k]='9';
}
}
}
}
printf("%s\n",c[i][0]);
}
return 0;
}
|
32
|
15,633 |
void turn(char str[100])
{
int n,i,t;
n=strlen(str);
for(i=0;i<=(n-1)/2;i++)
{
t=str[i];
str[i]=str[n-i-1];
str[n-i-1]=t;
}
}
int min(int x,int y)
{
int z;
if(x>=y)
z=y;
else
z=x;
return(z);
}
void miner(char str1[100],char str2[100],char str3[100])
{
int t,i,m,n;
m=strlen(str1);
n=strlen(str2);
t=min(m,n);
for(i=0;i<t;i++)
{
if(str1[i]>=str2[i])
str3[i]=str1[i]-str2[i]+48;
else
{
str3[i]=str1[i]+10-str2[i]+48;
str1[i+1]--;
str3[i+1]--;
}
}
}
void main()
{
char a[100],b[100],t[2],c[100];
int n,i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
gets(t);
gets(a);
gets(b);
turn(a);
turn(b);
strcpy(c,a);
miner(a,b,c);
turn(c);
puts(c);
}
}
|
32
|
15,634 |
/*
*???
*2010 - 11 - 18
*?????1 - ?????
*/
int main()
{
int m, n;
cin >> n;
for ( m = 1; m <= n; m++ )
{
char str1[100], str2[100];
cin >> str1 >> str2;//?????????
int num1[100], num2[100];
int l1, l2, i, j;
l1 = strlen(str1);
l2 = strlen(str2);
for ( i = l1 - 1, j = 0; i >= 0; i-- )//???????int???????????
{
num1[j] = str1[i] - '0';
j++;
}
for ( i = l2 - 1, j = 0; i >= 0; i-- )
{
num2[j] = str2[i] - '0';
j++;
}
for ( i = 0; i < l2; i++ )//????
num1[i] = num1[i] - num2[i];
for ( i = 0; i < l1; i++ )//???????????1
if ( num1[i] < 0 )
{
num1[i] += 10;
num1[i + 1] -= 1;
}
if ( num1[l1 - 1] != 0 )//???????????????
for ( i = l1 - 1; i >= 0; i-- )
cout << num1[i];
else
for ( i = l1 - 2; i >= 0; i-- )
cout << num1[i];
cout << endl;
}
return 0;
}
|
32
|
15,635 |
char c[100];
void putcc(char a[],char b[])
{
int A,B,i;
A=strlen(a);
B=strlen(b);
for(i=B-1;i>=0;i--)
{
if(b[i]<=a[i-B+A]) c[i-B+A]=a[i-B+A]-b[i]+48;
else
{
c[i-B+A]=a[i-B+A]+10-b[i]+48;
a[i-B+A-1]=a[i-B+A-1]-1;
}
}
for(i=A-B-1;i>=0;i--)
{
c[i]=a[i];
}
}
int main()
{
int n,i,l,A;
char d[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
char a[100],b[100];
scanf("%s",a);
scanf("%s",b);
if(i!=n-1) scanf("\n");
A=strlen(a);
putcc(a,b);
for(l=0;l<A;l++)
{
d[i][l]=c[l];
}
d[i][l]='\0';
}
for(i=0;i<n;i++)
{
l=0;
while(d[i][l]!='\0')
{
printf("%c",d[i][l]);
l=l+1;
}
printf("\n");
}
return 0;
}
|
32
|
15,636 |
void main()
{char str1[200],str2[200];
int zhe1[200],zhe2[200];
memset(zhe1,0,sizeof(zhe1));
memset(zhe2,0,sizeof(zhe2));
int cases;
scanf("%d",&cases);
while(cases>0)
{ int n1,n2,i,j,k;
scanf("%s%s",str1,str2);
n1=strlen(str1);n2=strlen(str2);
for(i=0;i<n1;i++)
zhe1[i]=str1[i]-'0';
for(i=0;i<n1;i++)
zhe2[i]=str2[i]-'0';
for(j=n1-1,k=n2-1;j>=0,k>=0;j--,k--)
{if(zhe1[j]>=zhe2[k]) zhe1[j]-=zhe2[k];
else { zhe1[j]=10+zhe1[j]-zhe2[k];
zhe1[j-1]--;}
}
for(i=0;i<n1;i++)
{if(zhe1[i]!=0) break;}
for(j=i;j<n1;j++) printf("%d",zhe1[j]);
printf("\n");
cases--;
}
}
|
32
|
15,637 |
int num1[101],num2[101];
char char1[101],char2[101];
int main()
{
int n,i,j;
cin>>n;
for (i=1;i<=n;i++)
{
for (j=1;j<=100;j++) {num1[j]=0;num2[j]=0;}
cin>>char1>>char2;
int len1,len2;
for (len1=0;char1[len1]!='\0';len1++);
for (len2=0;char2[len2]!='\0';len2++);
for (j=1;j<=len1;j++)
num1[j]=char1[len1-j]-48;
for (j=1;j<=len2;j++)
num2[j]=char2[len2-j]-48;
for (j=1;j<=len1;j++)
num1[j]=num1[j]-num2[j];
for (j=1;j<=len1;j++)
{
if (num1[j]<0) {num1[j]=num1[j]+10;num1[j+1]--;}
}
int flag=0;
for (j=0;j<len1;j++)
{
if (num1[len1-j]!=0)
flag=1;
cout<<num1[len1-j];
}
if (flag==0) cout<<0;
if (i!=n) cout<<endl;
}
return 0;
}
|
32
|
15,638 |
void main()
{
char str1[100],str2[100];
int count,k,i,j,l1,l2,m,N;
scanf("%d",&N);
for(i=1;i<=N;i++)
{
scanf("%s",str1);
scanf("%s",str2);
count=0;
l1=strlen(str1);
l2=strlen(str2);
j=l1-1;
for(k=l2-1;k>=0;k--)
{
if(str1[j]>=str2[k])
str1[j]=str1[j]-str2[k]+48;
else
{
str1[j]=str1[j]+58-str2[k];
for(m=j-1;m>=0;m--)
{
if(str1[m]!='0')
{
str1[m]--;
break;
}
else
str1[m]='9';
}
}
j--;
}
for(k=0;str1[k]!='\0';k++)
{
if(str1[k]=='0')
count++;
else
break;
}
for(k=count;str1[k]!='\0';k++)
{
printf("%c",str1[k]);
}
printf("\n");
}
}
|
32
|
15,639 |
// ??????????????
// ??
// 1000012768
// 2010.11.19
int main()
{
char a[100], b[100]; //???????????
int anum[100], bnum[100];
int n, i, j, k, p;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a >> b;
p = 0;
int la = strlen(a); //??????????????????
int lb = strlen(b);
for (j = la - 1; j >= 0; j--)
anum[p++] = a[j] - '0';
p = 0;
for (j = lb - 1; j >= 0; j--)
bnum[p++] = b[j] - '0';
for (k = 0; k < lb; k++)
{
anum[k] = anum[k] - bnum[k]; //???????????0??????
if (anum[k] < 0)
{
anum[k] += 10;
anum[k + 1]--;
}
}
for (k = la - 1; k >= 0; k--)
cout << anum[k]; //????anum
cout << endl;
}
return 0;
}
|
32
|
15,640 |
//**********************************
//??: ?????
//???2013.11.16
//**********************************
int sub(int len,int *an1,int *an2)
{
int max=0;
for(int i=0;i<=len;i++)
{
an1[i]=an1[i]-an2[i];
if(an1[i]<0)
{
an1[i]=an1[i]+10;
an1[i+1]=an1[i+1]-1;
}
if(an1[i]!=0)
max=i;
}
return (max);
}
int main()
{
int n=0,i=0;
cin>>n;
for(i=1;i<=n;i++)
{
char bn1[102],bn2[102];
int j=0,k=0,max=0,an1[102],an2[102];
cin>>bn1>>bn2;
memset(an1,0,sizeof(an1));
memset(an2,0,sizeof(an2));
for(j=strlen(bn1)-1,k=0;j>=0;j--)
an1[k++]=bn1[j]-'0';
for(j=strlen(bn2)-1,k=0;j>=0;j--)
an2[k++]=bn2[j]-'0';
max=sub(strlen(bn1),an1,an2);
for(j=max;j>=0;j--)
cout<<an1[j];
cout<<endl;
}
return 0;
}
|
32
|
15,641 |
int main()
{
int n,i,j,len1,len2;
char str1[101],str2[101];
int a[100],b[100];
cin>>n;
while(n--)
{
cin.get();
len1=0;
len2=0;
cin.getline(str1,100);
cin.getline(str2,100);
while(str1[len1]!=0)
len1++;
while(str2[len2]!=0)
len2++;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(i=len1-1;i>=0;i--)
a[len1-1-i]=str1[i]-'0';
for(i=len2-1;i>=0;i--)
b[len2-1-i]=str2[i]-'0';
for(i=0;i<len1||i<len2;i++)
{
if(a[i]>=b[i]) a[i]-=b[i];
else
{
a[i]=a[i]+10-b[i];
a[i+1]--;
}
}
int count=99;
while(a[count]==0)
count--;
for(i=count;i>=0;i--)
cout<<a[i];
cout<<endl;
}
return 0;
}
|
32
|
15,642 |
int main()
{
int n,i,j,m,l,d;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
m=strlen(a);
l=strlen(b);
d=l;
for(j=m-1;j>m-d-1;j--)
{
if(a[j]>=b[l-1])
{
a[j]=a[j]-b[l-1]+48;
l--;
}
else
{
a[j]=a[j]+10-b[l-1]+48;
a[j-1]=a[j-1]-1;
l--;
}
}
j=0;
while(a[j]==0)
j++;
for(;j<m;j++)
printf("%c",a[j]);
printf("\n");
}
return 0;
}
|
32
|
15,643 |
char szline1[maxlen];
char szline2[maxlen];
int an1[maxlen];
int an2[maxlen];
int main()
{
int n;
cin >> n;
while (n --)
{
cin.get();
cin.getline(szline1, maxlen);
cin.getline(szline2, maxlen);
int len1 = strlen(szline1);
int len2 = strlen(szline2);
memset(an1, 0, sizeof(an1));
memset(an2, 0, sizeof(an2));
for (int i = len1 - 1, j = 0; i >= 0; i --)
an1[j ++] = szline1[i] - '0';
for (int i = len2 - 1, j = 0; i >= 0; i --)
an2[j ++] = szline2[i] - '0';
int begin = 0;
for (int i = 0; i < maxlen; i ++)
{
an1[i] -= an2[i];
if (an1[i] < 0)
{
an1[i] += 10;
an1[i + 1] --;
}
if (an1[i])
begin = i;
}
for (int i = begin; i >= 0; i --)
cout << an1[i];
cout << endl;
}
return 0;
}
|
32
|
15,644 |
void main()
{
int n,i,j,x,y;
char a[100],b[100],c[100],d;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
x=strlen(a);y=strlen(b);
for(j=0;j<=(x/2)-1;j++)
{d=a[j];a[j]=a[x-1-j];a[x-1-j]=d;}
for(j=0;j<=(y/2)-1;j++)
{d=b[j];b[j]=b[y-1-j];b[y-1-j]=d;}
for(j=0;j<y;j++)
{
if(a[j]>=b[j]) c[j]=a[j]-b[j]+48;
else {c[j]=a[j]+10-b[j]+48;a[j+1]=a[j+1]-1;}
}
for(j=y;j<x;j++)
c[j]=a[j];
for(j=x;j<100;j++)
c[j]=0;
for(j=0;j<=(x/2)-1;j++)
{d=c[j];c[j]=c[x-1-j];c[x-1-j]=d;}
for(j=0;j<strlen(c);j++)
if(c[j]!='0') break;
for(;j<strlen(c);j++)
printf("%c",c[j]);
printf("\n");
}
}
|
32
|
15,645 |
void main()
{
int n;
int a[100]={0},b[100]={0},r[100][100]={0};
int i,j,t=0,l1,l2;
char c[100];
scanf("%d",&n);
while(1)
{
if(getchar()=='\n') t++;
//a
for(i=0;i<100;i++)
c[i]='\0';
for(i=0;(c[i]=getchar())!='\n';i++);
l1=strlen(c)-1;
for(i=0;i<100;i++)
a[i]=0;
for(i=0;i<l1;i++)
a[l1-1-i]=c[i]-48;
//b
for(i=0;i<100;i++)
c[i]='\0';
for(i=0;(c[i]=getchar())!='\n';i++);
l2=strlen(c)-1;
for(i=0;i<100;i++)
b[i]=0;
for(i=0;i<l2;i++)
b[l2-1-i]=c[i]-48;
for(i=0;i<l1;i++)
{
if(a[i]>=b[i])
a[i]=a[i]-b[i];//??????????????a[]
else if (a[i]<b[i])//??????
{
a[i]=a[i]+10-b[i];
for(j=i+1;j<l1;j++)
{
if (a[j]) //????0??1??????
{
a[j]--;//??
break;//????
}
else if (!a[j]) //????0??9??????????
a[j]=9;
}
}
}
for(i=0;i<l1;i++)
r[t][i]=a[i];
if(t==n) break;
}
for(t=1;t<=n;t++)
{
for(j=l1-1;j>=0;j--)
if(r[t][j]!=0) break;
for(i=j;i>=0;i--)
printf("%d",r[t][i]);
printf("\n");
}
}
|
32
|
15,646 |
void main()
{
int n,i,j,len1,len2,t;
char c[100],d[100];
int a[100],b[100];
scanf("%d",&n);
for(j=1;j<=n;j++)
{
for(i=0;i<100;i++)
{
a[i]=b[i]=0;
c[i]=d[i]='\0';
}
scanf("%s %s",c,d);
len1=strlen(c);
len2=strlen(d);
for(i=99;i>99-len1;i--)
{
switch(c[i+len1-100])
{
case'0':a[i]=0;break;
case'1':a[i]=1;break;
case'2':a[i]=2;break;
case'3':a[i]=3;break;
case'4':a[i]=4;break;
case'5':a[i]=5;break;
case'6':a[i]=6;break;
case'7':a[i]=7;break;
case'8':a[i]=8;break;
case'9':a[i]=9;
}
}
for(i=99;i>99-len2;i--)
{
switch(d[i+len2-100])
{
case'0':b[i]=0;break;
case'1':b[i]=1;break;
case'2':b[i]=2;break;
case'3':b[i]=3;break;
case'4':b[i]=4;break;
case'5':b[i]=5;break;
case'6':b[i]=6;break;
case'7':b[i]=7;break;
case'8':b[i]=8;break;
case'9':b[i]=9;
}
}
for(i=0;i<100;i++)
{
a[i]=a[i]-b[i];
}
for(i=99;i>0;i--)
{
if(a[i]<0)
{
a[i]=10+a[i];
a[i-1]--;
}
}
for(i=0;;i++)
if(a[i]!=0)break;
for(t=i;t<100;t++)
printf("%d",a[t]);
printf("\n");
}
}
|
32
|
15,647 |
void main()
{
int n,i,j,len1,len2;
char a[1000],b[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
len1=strlen(a);
len2=strlen(b);
for(j=0;j<len2;j++)
{
if(a[len1-1-j]-b[len2-1-j]>=0)
a[len1-1-j]=a[len1-1-j]-b[len2-1-j]+'0';
else if(a[len1-1-j]-b[len2-1-j]<0)
{
a[len1-1-j]=a[len1-1-j]+10-b[len2-1-j]+'0';
a[len1-2-j]=a[len1-2-j]-1;
}
}
printf("%s\n",a);
}
}
|
32
|
15,648 |
void main()
{
int n,i,j,len,tlen,t=0;
char num1[100][200];
char num2[100][200];
char temp[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s %s",num1[i],num2[i]);
for(i=0;i<n;i++)
{
strcpy(temp,num2[i]);
t=0;
tlen=strlen(num1[i])-strlen(num2[i]);
for(j=0;j<tlen;j++)
num2[i][j]='0';
num2[i][j]=0;
strcat(num2[i],temp);
len=strlen(num1[i]);
for(j=len-1;j>=0;j--)
{
if(num1[i][j]+t-num2[i][j]>=0){
num1[i][j]=num1[i][j]+t-num2[i][j]+48;
t=0;}
else {num1[i][j]=num1[i][j]+t-num2[i][j]+58;
t=-1;}
}
if(i!=n-1)
printf("%s\n",num1[i]);
else printf("%s",num1[i]);
}
}
|
32
|
15,649 |
void main()
{
int n,a,b,c,d,i,j;
char num[101][101];
scanf("%d",&n);
for(i=0;i<(2*n);i++)
scanf("%s",num[i]);
a=0;
b=0;
for(i=0;i<(2*n-1);i=i+2)
{
a=strlen(num[i]);
b=strlen(num[i+1]);
for(j=b;j>=0;j--)
num[i+1][a-b+j]=num[i+1][j];
for(j=0;j<a-b;j++)
num[i+1][j]='0';
c=0;
d=0;
for(j=a-1;j>=0;j--)
{
c=(10+num[i][j]-'0')-(num[i+1][j]-'0')-d;
num[i][j]=c%10+'0';
if(c<10) d=1;
else d=0;
}
printf("%s\n",num[i]);
}
}
|
32
|
15,650 |
int maxlen(int x, int y);
int main()
{
int N;
char s1[201], s2[201];
int a[201], b[201], maxx, l1, l2,i,j;
N = maxx = l1 = l2 = 0;
scanf("%d", &N);
for (int n = 0; n < N; n++) {
memset(s1, 0, sizeof(s1));
memset(s2, 0, sizeof(s2));
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
scanf("%s", s1);
scanf("%s", s2);
l1 = strlen(s1);
l2 = strlen(s2);
maxx = maxlen(l1, l2);
for ( i = maxx, j = l1 - 1; j>=0; i--, j--)
a[i] = s1[j] - '0';
for ( i = maxx, j = l2 - 1; j>=0; i--, j--)
b[i] = s2[j] - '0';
for ( i = maxx; i > 0; i--)
{
if (a[i] <b[i])
{
a[i] =a[i]+ 10-b[i];
a[i-1] --;
}
else a[i] -= b[i];
}
i = 0;
while (a[i] == 0)
i ++;
for (; i<maxx + 1; i++)
printf("%d", a[i]);
printf("\n");
}
return 0;
}
int maxlen(int x, int y){
if (x > y)
return x;
return y;
}
|
32
|
15,651 |
void main()
{
char a[1000][100],b[1000][100],c[1000][100]={""};
int n,i,j;
int r[1000],l[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a[i],b[i]);
printf("\n");
l[i]=strlen(a[i]);
r[i]=strlen(b[i]);
for(j=0;j<r[i];j++)
{
b[i][l[i]-j-1]=b[i][r[i]-j-1];
}
for(j=0;j<l[i]-r[i];j++)
b[i][j]='0';
for(j=l[i]-1;j>=0;j--)
{
c[i][j]=a[i][j]-b[i][j];
if(c[i][j]<0)
{
a[i][j-1]--;
c[i][j]=c[i][j]+10;
}
c[i][j]=c[i][j]+48;
}
}
for(i=0;i<n;i++)
printf("%s\n",c[i]);
}
|
32
|
15,652 |
void gui0(char[],int n);
int main()
{
int num;
scanf("%d",&num);
char a[101],b[101];
char**pp=(char**)malloc(num*sizeof(char*));
for(int k=0;k<num;k++)
{
gui0(a,101);
gui0(b,101);
scanf("%s",a);
scanf("%s",b);
int m=strlen(a);
int n=strlen(b);
int j=n-1;
for(int i=m-1;i>=m-n;i--)
{
if(b[j]<=a[i])
a[i]=a[i]-b[j]+'0';
else
{
a[i-1]--;
int t=a[i]-b[j]+10;
a[i]='0'+t;
}
j--;
if(j<0)
break;
}
pp[k]=(char*)malloc(101*sizeof(char));
strcpy(pp[k],a);
}
for(int r=0;r<num;r++)
{
int i;
for(i=0;i<strlen(pp[r]);i++)
if(pp[r][i]=='0')
continue;
else
break;
for(;i<strlen(pp[r]);i++)
printf("%c",pp[r][i]);
printf("\n");
}
return 0;
}
void gui0(char a[],int n)
{
for(int i=0;i<n;i++)
a[i]='\0';
}
|
32
|
15,653 |
void main()
{
int l,r;
scanf("%d",&r);
for(l=1;l<=r;l++)
{ int max(int,int);
char d[102]={0},e[102]={0},f[102]={0};
signed char a[102]={0},b[102]={0},c[103]={0},t; /*???*/
int m,p=0,i,j,k,x,y,z=0,signa=1,signb=-1; /*??*/
//printf("input a number:\n");
scanf("%s",d);
for(i=0;i<102;i++)
{
a[i]=d[i];
}
if(a[0]=='-')
{
signa=-1;
for(i=0;i<101;i++)
a[i]=a[i+1];
}
for(i=0;a[i]!=0;i++);
x=i-1;
for(j=0;j<x;j++,x--)
{
t=a[j];
a[j]=a[x];
a[x]=t;
} /*?????*/
x=i-1;
for(k=0;k<=x;k++)a[k]-='0'; /*?????????????*/
//?b????
//printf("input another number:\n");
scanf("%s",e);
for(i=0;i<102;i++)
{
b[i]=e[i];
}
if(b[0]=='-')
{
signb=-1;
for(i=0;i<101;i++)
b[i]=b[i+1];
}
for(i=0;b[i]!=0;i++);
y=i-1;
for(j=0;j<y;j++,y--)
{
t=b[j];
b[j]=b[y];
b[y]=t;
} /*?????*/
y=i-1;
for(k=0;k<=y;k++)b[k]-='0'; /*?????????????*/
//?????????????????????????????????????????
//?????????????????fab(a)?fab(b)<?=?>
if(signa==signb)
{
for(i=0;i<=x||i<=y;i++)
{
c[i]=a[i]+b[i]+p;
p=0;
if(c[i]>9)
{
p=1;
c[i]-=10;
}
}
if(p==1){c[i]=1;i++;}
for(k=0;k<i;k++) /*???????????????????????????????*/
c[k]+='0';
for(k=0;k<i-1;k++,i--)
{
t=c[k];
c[k]=c[i-1];
c[i-1]=t;
}
if(signa==-1)printf("-");
for(i=0;i<102;i++)
{
f[i]=c[i];
}
puts(f);
}
else
{
for(m=max(x,y);(m>=0)&&(z==0);m--)
{
if(a[m]>b[m])z=1;
else {if(a[m]<b[m])z=-1;
else z=0;}
}
if(!z)printf("0");
else
{
if(z==-1)for(i=0;i<102;i++) /*for?????????*/
{
t=a[i];
a[i]=b[i];
b[i]=t;
}
for(i=0;i<=max(x,y);i++)
{
c[i]=a[i]-b[i]+p;
p=0;
if(c[i]<0)
{
p=-1;
c[i]+=10;
}
}
for(i-=1;c[i]==0;i--);
for(k=0;k<=i;k++)c[k]+='0';
for(k=0;k<i;k++,i--)
{
t=c[k];
c[k]=c[i];
c[i]=t;
}
if(z*signa!=1)printf("-");
for(i=0;i<102;i++)
{
f[i]=c[i];
}
puts(f);
}
}
}
}
int max(int x ,int y)
{
return(x>y?x:y);
}/*????*/
|
32
|
15,654 |
int main()
{
int n,i;
cin >> n;
for( i=0;i<n;i++)
{
char a1[100],a2[100];
cin >> a1 >> a2;
cin.get();
int l1=strlen(a1), l2=strlen(a2);
int b1[100],b2[100],i,j;
memset( b1 ,0 ,sizeof(b1) );
memset( b2 ,0 ,sizeof(b2) );
j=0;
for( i=l1-1;i>=0;i--)
b1[j++]=a1[i]-'0';
j=0;
for( i=l2-1;i>=0;i--)
b2[j++]=a2[i]-'0';
for(i=0;i<l1;i++) //??
{
b1[i]=b1[i]-b2[i];
if(b1[i]<0)
{
b1[i]+=10;
b1[i+1]--;
}
}
i=99;
while( b1[i] ==0 )
{
i--;
if( i==0 )
break;
}
while(i>=0)
cout << b1[i--];
cout << endl;
}
return 0;
}
|
32
|
15,655 |
int max(int a,int b)
{
int c;
if(a>b) c=a;
else c=b;
return (c);
}
void main ()
{
char str1[100],str2[100],temp;
char c[100]={0};
int i,j,k,n,l,flag,x,y;
flag=0;
scanf("%d",&n);
for(i=0;i<100;i++)
{
c[i]='0';
str1[i]='0';
str2[i]='0';
}
for(l=0;l<n;l++)
{
for(i=0;i<100;i++)
{
c[i]='0';
str1[i]='0';
str2[i]='0';
}
scanf("%s",str1);
scanf("%s",str2);
x=strlen(str1);
y=strlen(str2);
k=max(x,y);
str1[x]='0';
str2[y]='0';
for(i=0;i<=(x-1)/2;i++)
{
c[0]=str1[i];
str1[i]=str1[x-1-i];
str1[x-1-i]=c[0];
}
for(i=0;i<=(y-1)/2;i++)
{
temp=str2[i];
str2[i]=str2[y-1-i];
str2[y-1-i]=temp;
}
for(i=0;i<k;i++)
{
if(flag==1) {str1[i]-=1;flag=0;}
if(str1[i]<str2[i]) {c[i]=10+(str1[i]-'0')-(str2[i]-'0')+'0';flag=1;}
else if(str1[i]>=str2[i]) {c[i]=(str1[i]-'0')-(str2[i]-'0')+'0';}
}
if(c[k-1]=='0')
{
for(i=0;i<=(k-2)/2;i++)
{
temp=c[i];
c[i]=c[k-2-i];
c[k-2-i]=temp;
}
for(i=0;i<k-1;i++)
{
printf("%c",c[i]);
}
printf("\n");
}
if(c[k-1]!='0')
{
for(i=0;i<=(k-1)/2;i++)
{
temp=c[i];
c[i]=c[k-1-i];
c[k-1-i]=temp;
}
for(i=0;i<k;i++)
{
printf("%c",c[i]);
}
printf("\n");
}
}
}
|
32
|
15,656 |
/*?????*/
int main()
{
int n,i;
char s1[101],s2[101];
int result[101];
cin>>n;
int n1,n2,hand,j;
while(n--)
{
cin>>s1>>s2;
n1=strlen(s1);
n2=strlen(s2);
hand=0;
for(i=n2-1;i>=0;i--)
{
result[hand]=s1[n1-n2+i]-s2[i];//???
if(result[hand]<0)
{
result[hand]=result[hand]+10;
j=n1-n2+i-1;
while(--s1[j]<48)//??
{
s1[j]=s1[j]+10;
j--;
}
}
hand++;
}
for(i=0;i<n1-n2;i++)
if(s1[i]!='0') break;
for(;i<n1-n2;i++) cout<<(int)s1[i]-48;
for(i=hand-1;i>=0;i--) cout<<result[i];
cout<<endl;
}
return 0;
}
|
32
|
15,657 |
const int base=250;
const int start=5;
int ans[300];
main()
{
void trans(char s[],int num[]);
void plus(int a[],int b[]);
int minus(int a[],int b[]);
void print(int num[]);
int judge(int a[],int b[]);
int a[300],b[300];
char sa[300],sb[300];
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
getchar();
gets(sa);
gets(sb);
memset(a,0,300*sizeof(int));
memset(b,0,300*sizeof(int));
memset(ans,0,300*sizeof(int));
trans(sa,a);
trans(sb,b);
b[0]=0-b[0];
if (a[0]*b[0]>0)
{
plus(a,b);
ans[0]=a[0];
}
else
{
int flag=judge(a,b);
if (flag==0) {printf("0\n"); continue;}
if (flag>0)
{minus(a,b);ans[0]=a[0];}
else {minus(b,a);ans[0]=b[0];}
}
print(ans);
}
getchar();getchar();getchar();getchar();
}
void trans(char s[],int num[])
{
int len=strlen(s),b=0;
num[0]=1;
if (s[0]=='-') {len--; b++; num[0]=-1;}
for (int t=0;t<len;t++)
{
num[base-len+t+1]=s[t+b]-'0';
}
num[1]=base-len+1;
}
int judge(int a[],int b[])
{
if (a[1]<b[1]) return 1;
else if (a[1]>b[1]) return -1;
else {
int t,p=0,floor=a[1]<b[1]?a[1]:b[1];
for (t=floor;t<=base&&p==0;t++)
p=a[t]-b[t];
if (p==0) return 0;
else return p>0?1:-1;
}
}
void check(int num[])
{
int p;
for (p=start;num[p]==0&&p<=base;p++);
num[1]=p;
}
void plus(int a[],int b[])
{
int floor=a[1]<b[1]?a[1]:b[1];
for (int t=base;t>=floor;t--)
{
int k=ans[t]+a[t]+b[t];
ans[t]=k%10;
ans[t-1]+=k/10;
}
if (ans[floor-1]!=0) ans[1]=floor-1;
else ans[1]=floor;
}
void minus(int a[],int b[])
{
int floor=a[1]<b[1]?a[1]:b[1];
for (int t=base;t>=floor;t--)
{
int k=ans[t]+a[t]-b[t];
if (k<0) {ans[t-1]-=1; k+=10;}
ans[t]=k%10;
ans[t-1]+=k/10;
}
check(ans);
}
void print(int num[])
{
if (num[0]<0) printf("-");
for (int t=num[1];t<=base;t++)
printf("%d",num[t]);
printf("\n");
}
|
32
|
15,658 |
int main()
{
int n,n1;
scanf("%d",&n);
for(n1=0;n1<n;n1++)
{
char a[101]={"\0"};
char b[101]={"\0"}; //????'\0'
scanf("%s %s",a,b);
int i;
int lena=strlen(a),lenb=strlen(b); //****?????????????strlen(a)???????????????????
//?????strlen(a)????????......*******???????????????????~~~~~·
for(i=99;i>=99-lena+1;i--)
{
a[i]=a[lena+i-100];
}
for(i=99-lena;i>=0;i--)
{
a[i]='0';
}
for(i=99;i>=99-lenb+1;i--)
{
b[i]=b[lenb+i-100];
}
for(i=99-lenb;i>=0;i--)
{
b[i]='0';
}
int c[100]={0};
for(i=0;i<100;i++)
{
c[i]+=a[99-i]-b[99-i];
if(c[i]<0)
{
c[i]=c[i]+10;
c[i+1]--;
}
}
int test=0;
for(i=99;i>=0;i--)
{
if(c[i]==0&&test==0)continue;
if(c[i]!=0&&test==0){printf("%d",c[i]);test++;continue;}
if(test!=0){printf("%d",c[i]);continue;}
}
printf("\n");
}
return 0;
}
|
32
|
15,659 |
void printnum(int a[])
{
int i;
for(i = a[0];i > 0; --i) printf("%d", a[i]);
printf("\n");
}
void getnum(int a[])
{
int i;
char str[100];
for(i = 0;i <100;++ i) a[i] = 0;
scanf("%s", str);
a[0] = strlen(str);
for(i = a[0]-1;i >= 0;-- i)
a[ a[0]-i ] = str[i]-'0';
}
void getdif(int c[], int a[], int b[])
{
int i;
if(a[0] > b[0]) c[0] = a[0];
else c[0] = b[0];
c[1] = 0;
for(i = 1;i <= c[0];++ i)
{
if(c[i] + a[i] - b[i] < 0)
{
c[i+1] = -1;
c[i] += a[i] - b[i] + 10;
}
else
{
c[i+1] = 0;
c[i] += a[i] - b[i];
}
}
while(c[ c[0] ] == 0) -- c[0];
}
void main()
{
int a[100], b[100],c[100],n;
scanf("%d",&n);
for(;n != 0;-- n)
{ getnum(a);
getnum(b);
getdif(c, a, b);
printnum(c);
}
}
|
32
|
15,660 |
int main ()
{
int n,i,c[100][100],j,l1,l2,k;
char l;
scanf("%d",&n);
char a[100][100],b[100][100];
for(i=0;i<n;i++)
{
scanf("%s%s",&a[i],&b[i]);
l1=strlen(a[i]);
l2=strlen(b[i]);
for(j=l1-1;j>=l1-l2;j--)
{
if(a[i][j]>=b[i][j-l1+l2])
{
c[i][j]=a[i][j]-b[i][j-l1+l2];
}
else
{
c[i][j]=a[i][j]+10-b[i][j-l1+l2];
a[i][j-1]=a[i][j-1]-1;
}
}
for(j=l1-l2-1;j>=0;j--)
{
if(a[i][j]==47)
{
a[i][j]=a[i][j]+10;
a[i][j-1]=a[i][j-1]-1;
}
}
for(j=0;j<l1-l2;j++)
{
printf("%d",a[i][j]-48);
}
for(j=l1-l2;j<l1-1;j++)
{
printf("%d",c[i][j]);
}
printf("%d\n",c[i][l1-1]);
}
return 0;
}
|
32
|
15,661 |
int main ()
{
char bjs[100],js[100];
int n,l1,l2,i,j,cha,c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",bjs);
scanf("%s",js);
l1=strlen(bjs);
l2=strlen(js);
cha=l1-l2;
for(j=(l2-1);j>=0;j--)
{
if (bjs[j+cha]<js[j])
{
bjs[j+cha]=bjs[j+cha]+10-js[j]+'0';
c=1;
bjs[j+cha-1]=bjs[j+cha-1]-c;
}
else
bjs[j+cha]=bjs[j+cha]-js[j]+'0';
}
for(j=0;j<l1;j++)
printf("%c",bjs[j]);
printf("\n");
printf("\n");
}
}
|
32
|
15,662 |
//*********************************
//* ????????? **
//* ?????? 1300012948 **
//* ???2013.11.15 **
//*********************************
int main()
{
int n, len1, len2, k, m, g, e[101] = {0};
char a[101], b[101];
cin >> n; // n???
for(int i = 1; i <= n; i++)
{
int c[101] = {0}; // ?????????0
int d[101] = {0};
cin.get(); // ????
k = 0;
m = 0;
cin.getline(a, 101); // ????????????????????????????
cin.getline(b, 101);
len1 = strlen(a);
len2 = strlen(b);
for(int j = len1 - 1; j >= 0; j--) // ??????????????????????????????????????
{
c[k++] = a[j] - '0';
}
for(int l = len2 - 1; l >= 0; l--)
{
d[m++] = b[l] - '0';
}
for(int f = 0; f <= len1 - 1; f++) // ???????????????
{
if(c[f] >= d[f]) // ??????????????????????????
{
e[f] = c[f] - d[f];
}
else // ??,?????????????????????????,????????????
{
e[f] = c[f] + 10 - d[f];
c[f + 1]--;
}
}
g = len1 - 1;
while(e[g] == 0) // ???????0
{
g--;
}
for( ; g >= 0; g--) // ?????0????????
{
cout << e[g];
}
cout << endl;
}
return 0;
}
|
32
|
15,663 |
//**************************
//*???????? **
//*?????? **
//*???20131114 **
//**************************
int main ()
{
int n ,i , j ,k ,nLen1 ,nLen2 ,num1 ,num2;
int a[101] ,b[101] ,c[101];
char str1[101], str2[101];
cin >> n;
for(i = 1; i <= n ;i++)
{
memset(str1,0,sizeof(str1));
memset(str2,0,sizeof(str2));
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
nLen1 = 0;
nLen2 = 0;
num1 = 0;
num2 = 0;
cin >> str1 >> str2;
nLen1 = strlen(str1);
nLen2 = strlen(str2);
for(j = nLen1 - 1; j >= 0; j--)
a[num1++] = str1[j] - '0';
for(k = nLen2 - 1; k >= 0; k--)
b[num2++] = str2[k] - '0';
for(int t = 0; t <= nLen2 - 1; t++)
{
if(a[t] >= b[t])
c[t] = a[t] - b[t];
else
{
c[t] = a[t] - b[t] + 10;
a[t+1] -= 1;
}
}
for(int q = nLen2; q <= nLen1 - 1; q++)
c[q] = a[q];
for(int l = nLen1 - 1; l >= 0; l--)
cout << c[l];
cout << endl;
}
return 0;
}
|
32
|
15,664 |
void main()
{
int n,i,j,t,len1,len2;
char s1[100],s2[100],answer[100],out[100]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",s1);
scanf("%s",s2);
len1=strlen(s1);
t=99;
for(j=len1-1;j>=0;j--)
{
s1[t]=s1[j];
s1[j]=0;
t--;
}
len2=strlen(s2);
t=99;
for(j=len2-1;j>=0;j--)
{
s2[t]=s2[j];
s2[j]=0;
t--;
}
for(j=len2;j<len1;j++) s2[99-j]='0';
for(j=99;j>=0;j--)
{
if(s1[j]>=s2[j]) answer[j]=s1[j]-s2[j]+48;
else
{
answer[j]=58+s1[j]-s2[j];
s1[j-1]=s1[j-1]-1;
}
}
t=0;
for(j=0;j<=99;j++) out[j]=0;
for(j=99-len1+1;j<=99;j++)
{
out[t]=answer[j];
t++;
}
printf("%s\n",out);
}
}
|
32
|
15,665 |
int main()
{
int n,i,j,q,k,len1[100],len2[100];
int a[100][26]={0},b[100][26]={0};
char s[100][101],d[100][101];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s%s",s[i],d[i]);
for(i=0;i<n;i++)
{
len1[i]=strlen(s[i]);
len2[i]=strlen(d[i]);
for(j=0;j<25;j++)
{
if(len1[i]<4) break;
len1[i]-=4;
for(q=0;q<4;q++)
a[i][j]=a[i][j]*10+(s[i]+len1[i])[q]-'0';
}
for(q=0;q<len1[i];q++)
a[i][j]=a[i][j]*10+s[i][q]-'0';
for(j=0;j<25;j++)
{
if(len2[i]<4) break;
len2[i]-=4;
for(q=0;q<4;q++)
b[i][j]=b[i][j]*10+(d[i]+len2[i])[q]-'0';
}
for(q=0;q<len2[i];q++)
b[i][j]=b[i][j]*10+d[i][q]-'0';
}
for(i=0;i<n;i++)
for(j=0;j<25;j++)
{
if(a[i][j]>=b[i][j])
b[i][j]=a[i][j]-b[i][j];
else
{
b[i][j]=a[i][j]+10000-b[i][j];
a[i][j+1]-=1;
}
}
for(i=0;i<n;i++)
{
for(j=25;j>=0;j--)
if(b[i][j]!=0) {k=j;break;}
printf("%d",b[i][k]);
for(j=k-1;j>=0;j--)
printf("%04d",b[i][j]);
printf("\n");
}
return 0;
}
|
32
|
15,666 |
int main()
{
int n,c,d,i,j;
char a[101]={'\0'},b[101]={'\0'},e[101]={'\0'};
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%s %s",a,b);
c=strlen(a);d=strlen(b);
for(j=d-1;j>=0;j--){
if(a[c-d+j]>=b[j])
e[c-d+j]=a[c-d+j]-b[j]+48;
else {e[c-d+j]=a[c-d+j]+10-b[j]+48; a[c-d+j-1]--;}
}
for(j=c-d-1;j>=1;j--){
if(a[j]<48){
e[j]=a[j]+9;a[j-1]--;}
else e[j]=a[j];
}
e[0]=a[0];
printf("%s\n",e);
for(j=0;j<101;j++){
a[j]='\0';b[j]='\0';e[j]='\0';
}
}
return 0;
}
|
32
|
15,667 |
void func(char a[],char b[])
{
int p=0,i=0,j=0;
int lena=strlen(a),lenb=strlen(b);
for(i=lena-1,j=lenb-1;j>=0;i--,j--)
{
if((a[i]-b[j]-p)>=0)
{
a[i]='0'+a[i]-b[j]-p;
p=0;
}
else
{
a[i]='0'+a[i]-b[j]-p+10;
p=1;
}
}
a[i]=a[i]-p;
for(i=0;i<=lena-1;i++)
{
if(a[i]!=0)break;
}
for(j=i;j<=lena-1;j++)
cout<<a[j];
cout<<endl;
return ;
}
int main()
{
int n,i,j;
cin >> n;
for (i=1;i<=n;i++)
{
char a[101],b[101];
cin >> a >> b;
func(a,b);
}
return 0;
}
|
32
|
15,668 |
void main()
{
int n,i,j,k,t;
char a[100][100],b[100][100],c[100][100]={""};
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s%s",a[i],b[i]);/*?????????*/
printf("\n");
}
for(i=0;i<n;i++)
{
for(j=strlen(a[i])-1,k=strlen(b[i])-1;j>=(strlen(a[i])-strlen(b[i]));j--,k--)
{
if(a[i][j]>=b[i][k])
c[i][j]=a[i][j]-b[i][k];
else
{ a[i][j-1]=a[i][j-1]-1;
c[i][j]=10+a[i][j]-b[i][k];
}
c[i][j]=c[i][j]+48;
}
for(t=strlen(a[i])-1;t>=0;t--)
{if(a[i][t]<48)
a[i][t-1]=a[i][t-1]-1;}
for(t=0;t<strlen(a[i]);t++)
if(a[i][t]<48)
a[i][t]='9';
for(j=0;j<strlen(a[i])-strlen(b[i]);j++)
c[i][j]=a[i][j];
c[i][strlen(a[i])]='\0';
printf("%s\n",c[i]);
}
}
|
32
|
15,669 |
struct
{char a[200];
char b[200];
int as[200];
int bs[200];
int ad;
int bd;
}num[200];
void main()
{
int n,i,j,x,y,z[200][200],h=0,k,t;
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
scanf("%s\n%s\n\n",&num[i].a,num[i].b);
num[i].ad=strlen(num[i].a);num[i].bd=strlen(num[i].b);
}
scanf("%s\n%s",&num[n-1].a,&num[n-1].b);
num[n-1].ad=strlen(num[n-1].a);num[n-1].bd=strlen(num[n-1].b);
for(i=0;i<n;i++)
{
for(j=0;j<num[i].ad;j++)
num[i].as[j]=num[i].a[j]-48;
for(k=0;k<num[i].bd;k++)
num[i].bs[k]=num[i].b[k]-48;
}
for(i=0;i<n;i++)
{
h=0;
for(j=num[i].ad-1,k=num[i].bd-1;k>=0;k--,j--)
{
if(num[i].as[j]-num[i].bs[k]<0)
{
z[i][h]=num[i].as[j]-num[i].bs[k]+10;
num[i].as[j-1]=num[i].as[j-1]-1;h=h+1;
}
if(num[i].as[j]-num[i].bs[k]>=0)
{
z[i][h]=num[i].as[j]-num[i].bs[k];
h=h+1;
}
}
for(;j>=0;j--)
{
if(num[i].as[j]>=0)
{
z[i][h]=num[i].as[j];
h=h+1;
}
if(num[i].as[j]<0)
{
z[i][h]=num[i].as[j]+10;
num[i].as[j-1]=num[i].as[j-1]-1;
h=h+1;
}
}
for(t=num[i].ad-1;t>=0;t--)
printf("%d",z[i][t]);
printf("\n");
}
}
|
32
|
15,670 |
void main()
{
int n,i,j,La,Lb,k=0;
char a[100],b[100],c[50][100]={'\0'};
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
gets(a);
gets(b);
La=strlen(a);
Lb=strlen(b);
for (j=Lb-1;j>=0;j--)
{
a[j+La-Lb]=a[j+La-Lb]-b[j]+48;
if (a[j+La-Lb]<48)
{
a[j+La-Lb]+=10;
a[j+La-Lb-1]-=1;
}
}
getchar();
strcpy(c[k++],a);
}
for (j=0;j<=n-1;j++) puts(c[j]);
}
|
32
|
15,671 |
int main ()
{
int n;
int i, j;
char str1[101] , str2[101] ;
int num1[101] = {0}, num2 [101] = {0};
int l1, l2;
int flag = 0;
int k = 0;
cin>> n;
for (k = 1; k <= n; k++ )
{
cin >> str1;
cin >> str2;
l1 = strlen ( str1 ), l2 = strlen ( str2 );
for ( i = 0; i < l1; i++ )
num1[l1 - i - 1] = str1[i] - '0';
for ( i = 0; i < l2; i++ )
num2[l2 - i - 1] = str2[i] - '0';
for ( i = 0; i < l1; i++ )
{
num1[i] = num1[i] - num2[i];
j = i;
while ( num1[j] < 0 )
{
num1[j]+=10, num1[j+1]--;
j++;
}
}
for ( i = l1 - 1; i >= 0 ; i-- )
{
if ( num1[i] == 0 && flag == 0 )
{
continue;
}
flag = 1;
cout << num1[i];
}
cout << endl;
for ( i = 0; i < l1; i++ )
num1[i] = 0, str1[i] = 0;
for ( i = 0; i < l2; i++ )
num2[i] = 0, str2[i] = 0;
flag = 0;
}
return 0;
}
|
32
|
15,672 |
/*
* ???: 1000010191_test4_2.cpp
* ??: ???
* ????: 2010-12-24
* ??: ?????
*/
int main()
{
int n;
cin>>n;
for (int k=1;k<=n;k++)
{
//??
char sa[101],sb[101];
cin>>sa>>sb;
//??
int la=strlen(sa),lb=strlen(sb);
//??
int a[101]={0},b[101]={0};
for (int i=1;i<=la;i++)
a[i]=sa[la-i]-'0';
for (int i=1;i<=lb;i++)
b[i]=sb[lb-i]-'0';
//??
for (int i=1;i<=la;i++)
{
a[i]-=b[i];
if (a[i]<0)
{
a[i]+=10;
a[i+1]--;
}
}
//??
while (a[la]==0) la--;
for (int i=la;i>0;i--) cout<<a[i];
cout<<endl;
}
return 0;
}
|
32
|
15,673 |
int main()
{
int n, i, j, k;
int num1[110]; int num2[110];
char str1[110]; char str2[110];
cin >> n;
getchar();
for(i = 1; i <= n; i++)
{
j = 0;
memset(num1, 0, sizeof(num1));
memset(num2, 0, sizeof(num2));
cin.getline(str1, 110);
cin.getline(str2, 110);
getchar();
int l1 = strlen(str1);
int l2 = strlen(str2);
for(k = l1 - 1; k >= 0; k--)
num1[j++] = str1[k] - '0';
j = 0;
for(k = l2 - 1; k >= 0; k--)
num2[j++] = str2[k] - '0';
for(k = 0; k < l2 || k < l1; k++)
{
num1[k] -= num2[k];
if (k > 0 && num1[k - 1] < 0)
{
num1[k - 1] += 10;
-- num1[k];
}
}
k = 100;
while (k > 0 && num1[k] == 0)
-- k;
for( ; k >= 0; k--)
cout << num1[k];
cout << endl;
}
return 0;
}
|
32
|
15,674 |
int main()
{
int n,s[200],i,j,e,l,k,d[200],h;
char a[200];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(h=0;h<200;h++)
{
a[h]=s[h]=d[h]=0;
}
scanf("%s",a);
l=strlen(a);
for(j=0;j<l;j++)
{
s[j]=a[l-j-1]-'0';
}
scanf("%s",a);
k=strlen(a);
for(j=0;j<k;j++)
{
d[j]=a[k-j-1]-'0';
}
for(j=0;j<l;j++)
{
s[j]=s[j]-d[j];
if(s[j]<0)
{
s[j]=s[j]+10;
s[j+1]=s[j+1]-1;
}
}
for(j=l-1;j>=0;j--)
{
if(s[j]!=0) break;
}
for(h=j;h>=0;h--)
{
printf("%d",s[h]);
}
printf("\n");
}
return 0;
}
|
32
|
15,675 |
int str2(char*str,int*a)
{
int length=(int)strlen(str);
int i;
for(i=0;i<length;i++)
a[length-i-1]=str[i]-'0';
return length;
}
void print_b(int*a,int length)
{
int t=length-1;
int i;
while(a[t]==0 && t>0)
t--;
for(i=t;i>=0;i--)
printf("%d",a[i]);
}
int sub_b(int*a,int alength,int*b,int blength,int*c)
{
int i;
for(i=0;i<alength;i++)
{
c[i]=a[i];
if(i<blength)
c[i]-=b[i];
}
for(i=0;i<alength;i++)
if(c[i]<0)
{
c[i+1]--;
c[i]+=10;
}
return c[alength-1]?alength:(alength-1);
}
void main()
{
char s1[M],s2[M];
int a[M],b[M],c[M];
int alength,blength,clength;
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",s1,s2);
alength=str2(s1,a);
blength=str2(s2,b);
clength=sub_b(a,alength,b,blength,c);
print_b(c,clength);
printf("\n");
}
}
|
32
|
15,676 |
int main()
{
int a[100];
char s1[100],s2[100];
int n;
scanf("%d", &n);
int i;
for (i=0;i<n;i++)
{
scanf("%s%s",s1,s2);
int j=strlen(s1);
int k=strlen(s2);
int w,e;
for (w=0;w<100;w++) a[w]=0;
for (w=j,e=k;w>0;w--,e--)
{
if (e>0) a[w-1]=s1[w-1]-s2[e-1];
else a[w-1]=s1[w-1]-'0';
if (a[w-1]<0)
{
s1[w-2]=s1[w-2]-1;
a[w-1]+=10;
}
}
for (w=0;a[w]==0;w++);
for (;w<j;w++) printf("%d",a[w]);
printf("\n");
}
return 0;
}
|
32
|
15,677 |
int main()
{ int n;
cin>>n;
for(int t=0;t<n;t++)
{cin.get();
const int MAX_LEN = 200;
int an1[MAX_LEN]; int an2[MAX_LEN];
char seLine1[MAX_LEN + 1]; char seLine2[MAX_LEN + 1];
cin.getline(seLine1, MAX_LEN + 1);
cin.getline(seLine2, MAX_LEN + 1);
int nLen1 = strlen(seLine1);
int nLen2 = strlen(seLine2);
//cout<<seLine1<<endl<<seLine2<<endl;
memset(an1, 0, sizeof(an1));
memset(an2, 0,sizeof(an2));
int i, j=0;
for (i = nLen1-1; i>=0; i--)
an1[j++] = seLine1[i] - '0';
j=0;
for (i = nLen2-1; i>=0;i--)
an2[j++] = seLine2[i] - '0';
for (i = 0; i < MAX_LEN ;i++)
{
//printf("%d %d %d ",i, an1[i], an2[i]);
if(an1[i]>=an2[i])
an1[i]-=an2[i];
else{
an1[i]=10+an1[i]-an2[i];
an1[i+1]-=1;
}
//printf("aa%d %d\n", i, an1[i]);
}
i = MAX_LEN - 1;
while(an1[i]==0) i--;
//cout<<i<<endl;
for(;i >= 0; i--)
cout << an1[i];
cout << endl;
}
return 0;
}
|
32
|
15,678 |
main()
{
char **pp;
int n,h,m=100,i,x,y,a=0;
scanf ("%d",&h);
n=2*h;
pp=(char **)malloc(n*sizeof(char *));
for (i=0;i<n;i++)
pp[i]=(char*)malloc(m*sizeof(char));
for (i=0;i<h;i++)
{
scanf ("%s",pp[2*i]);x=strlen (pp[2*i]);
scanf ("%s",pp[2*i+1]);y=strlen (pp[2*i+1]);
for (a=x-1;a>x-y-1;a--)
{
pp[2*i][a]= pp[2*i][a]-pp[2*i+1][a-x+y]+'0';
if ( pp[2*i][a]<'0')
{pp[2*i][a]= pp[2*i][a]+10; pp[2*i][a-1]= pp[2*i][a-1]-1;}
}
}
printf ("\n");
for (i=0;i<h;i++)
printf ("%s\n",pp[2*i]);
for (i=0;i<n;i++)
free (pp[i]);
free (pp);
}
|
32
|
15,679 |
int main()
{
char a[100][100],b[100][100];
char c[100][101];
int i,n;
int p,q,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&a[i]);
scanf("%s",&b[i]);
}
//printf("%s,%s\n",a,b);
for(i=0;i<n;)
{
for(t=0,p=strlen(a[i])-1,q=strlen(b[i])-1;p>=0;p--,q--)
{
if(p>=0&&q>=0&&a[i][p]>=b[i][q]) {
t=0;c[i][p]=a[i][p]-b[i][q]+t;
}
else if(p>=0&&q>=0&&a[i][p]<b[i][q]) {
t=1;
c[i][p]=a[i][p]+t*10-b[i][q];
a[i][p-1]=a[i][p-1]-1;
}
else if(p>=0&&q<0) {
t=0;c[i][p]=a[i][p]-48;
}
//printf("%d,%d\n",p,c[i][p]);
c[i][p]+=48;
}
//printf(" %d\n",strlen(a));
c[i][strlen(a[i])]='\0';
i++;
}
for(i=0;i<n;i++)
{
printf("%s\n",c[i]);
}
return 0;
}
|
32
|
15,680 |
void subtract();
const int maxlen=100;
int main()
{
int n,i;
cin>>n;
cin.get();
for(i=1;i<=n;i++)
{
subtract();
cin.get();
}
return 0;
}
void subtract()
{
char str1[maxlen+1],str2[maxlen+1];
int a1[maxlen],a2[maxlen];
int len1,len2;
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
cin.getline(str1,maxlen+1);//???????
cin.getline(str2,maxlen+1);
len1=strlen(str1);
len2=strlen(str2);
int i,j;
for(i=0,j=len1-1;j>=0;j--)//????????????,??????,??????????
a1[i++]=str1[j]-'0';
for(i=0,j=len2-1;j>=0;j--)
a2[i++]=str2[j]-'0';
for(i=0;i<maxlen;i++)
{
if(a1[i]>=a2[i])
a1[i]=a1[i]-a2[i];
else
{
a1[i+1]=a1[i+1]-1;
a1[i]=a1[i]+10-a2[i];
}
}
i=maxlen-1;//?????????????0??,?????
while(a1[i]==0)
i--;
for(j=i;j>=0;j--)
cout<<a1[j];
cout<<endl;
}
|
32
|
15,681 |
void main()
{
char s1[102],s2[102];
int p,i,j,m,n,len1,t,len2;
scanf("%d\n",&m);
for (t=1;t<=m;t++)
{
gets(s1);
gets(s2);
if (t<m) getchar();
len1=strlen(s1);
len2=strlen(s2);
p=0;
for (i=len2-1;i>=0;i--)
{
if (s1[len1+i-len2]-p<s2[i]) { s1[len1+i-len2]=s1[len1+i-len2]+10-p-s2[i]+48;p=1;}
else {s1[len1+i-len2]=s1[len1+i-len2]-p-s2[i]+48;p=0;}
}
i=1;
while (p==1)
{
if (s1[len1-i-len2]=='0') {s1[len1-i-len2]+=9;i++;}
else {s1[len1-i-len2]=s1[len1-i-len2]-1;p=0;}
}
i=0;
p=1;
while (p==1)
{
if (s1[i]=='0') i++;
else p=0;
}
for (j=i;j<=len1-1;j++)
putchar(s1[j]);
putchar('\n');
}
}
|
32
|
15,682 |
void main()
{
int n,i,j,k,l,m;
char a[50][100];
scanf("%d",&n);
for(i=0;i<=2*n-2;i=i+2)
{
scanf("%s",a[i]);
scanf("%s",a[i+1]);
printf("\n");
}
for(i=0;i<=2*n-2;i=i+2)
{
for(j=0;a[i][j]!='\0';j++)
;
for(k=0;a[i+1][k]!='\0';k++)
;
if(j>k)
{
for(l=j-1;l>=j-k;l=l-1)
a[i+1][l]=a[i+1][l-j+k];
for(l=j-k-1;l>=0;l=l-1)
a[i+1][l]=48;
for(l=j-1;l>=0;l=l-1)
{
if(a[i][l]>=a[i+1][l])a[i][l]=a[i][l]-a[i+1][l]+48;
else
{
a[i][l]=a[i][l]+10-a[i+1][l]+48;
a[i][l-1]=a[i][l-1]-1;
}
}
if(a[i][0]!=48)
for(l=0;l<=j-1;l++)printf("%c",a[i][l]);
else
{
for(l=0;a[i][l]==48;l++);
for(m=0;m<=j-1-l;m++)
{
a[i][m]=a[i][m+l];
printf("%c",a[i][m]);
}
}
printf("\n");
}
if(j<k)
{
printf("-");
for(l=k-1;l>=k-j;l=l-1)
a[i][l]=a[i][l-k+j];
for(l=k-j-1;l>=0;l=l-1)
a[i][l]=48;
for(l=k-1;l>=0;l=l-1)
{
if(a[i+1][l]>=a[i][l])a[i+1][l]=a[i+1][l]-a[i][l]+48;
else
{
a[i+1][l]=a[i+1][l]+10-a[i][l]+48;
a[i+1][l-1]=a[i+1][l-1]-1;
}
}
if(a[i+1][0]!=48)
for(l=0;l<=k-1;l++)printf("%c",a[i+1][l]);
else
{
for(l=0;a[i+1][l]==48;l++);
for(m=0;m<=k-1-l;m++)
{
a[i+1][m]=a[i+1][m+l];
printf("%c",a[i+1][m]);
}
}
printf("\n");
}
if(j==k)
{
for(l=0;l<=j-1;l++)
if(a[i][l]-a[i+1][l]!=0)break;
if(l==j)printf("0");
else
{
for(l=j;l>=1;l=l-1)
a[i][l]=a[i][l-1];
a[i][0]=49;
for(l=j;l>=1;l=l-1)
a[i+1][l]=a[i+1][l-1];
a[i+1][0]=48;
for(l=j;l>=0;l=l-1)
{
if(a[i][l]>=a[i+1][l])a[i][l]=a[i][l]-a[i+1][l]+48;
else
{
a[i][l]=a[i][l]+10-a[i+1][l]+48;
a[i][l-1]=a[i][l-1]-1;
}
}
if(a[i][0]==49)
{
if(a[i][1]!=48)
for(l=1;l<=j;l++)printf("%c",a[i][l]);
else
{
for(l=1;a[i][l]==48;l++);
for(m=0;m<=j-l;m++)
{
a[i][m]=a[i][m+l];
printf("%c",a[i][m]);
}
}
}
else
{
a[i+1][0]=49;
for(l=1;l<=j;l++)
a[i+1][l]=48;
for(l=j;l>=1;l=l-1)
{
if(a[i+1][l]>=a[i][l])a[i+1][l]=a[i+1][l]-a[i][l]+48;
else
{
a[i+1][l]=a[i+1][l]+10-a[i][l]+48;
a[i+1][l-1]=a[i+1][l-1]-1;
}
}
printf("-");
for(l=0;a[i+1][l]!=48;l++);
for(k=l+1;k<=j;k++)printf("%c",a[i+1][k]);
}
}
printf("\n");
}
}
}
|
32
|
15,683 |
void main()
{
int n,i,j,p,q,k;
char a[100][100],b[100][100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
getchar();
gets(a[i]);
gets(b[i]);
}
for (i=0;i<n;i++)
{
p=strlen(a[i]);
q=strlen(b[i]);
for (j=0;j<q;j++)
{
if (a[i][p-j-1]>=b[i][q-j-1])
a[i][p-j-1]=a[i][p-j-1]-b[i][q-j-1]+48;
else
{
a[i][p-j-1]=a[i][p-j-1]-b[i][q-j-1]+58;
if (a[i][p-j-2]!=48)
a[i][p-j-2]=a[i][p-j-2]-1;
else
{
a[i][p-j-2]=57;
for (k=3;;k++)
{
if (a[i][p-j-k]!=48)
{
a[i][p-j-k]--;
break;
}
else
a[i][p-j-k]=57;
}
}
}
}
puts(a[i]);
}
}
|
32
|
15,684 |
int main(int argc, char* argv[])
{
int i,a[101],b[101];
char A[101],B[101];
int n,l1,l2;
int j,t,h;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(h=0;h<101;h++)
a[h]=b[h]=0;
int k=1;
scanf("%s%s",A,B);
l1=strlen(A);
l2=strlen(B);
for(j=0;j<l1;j++)
a[100-l1+j]=A[j]-'0';
for(j=0;j<l2;j++)
b[100-l2+j]=B[j]-'0';
for(j=99;j>0;j--)
{
if(a[j]>=b[j]) a[j]=a[j]-b[j];
else
{
a[j]-=b[j]-10;
a[j-1]-=1;
}
}
for(j=0;j<100;j++)
{
if(a[j]!=0)
{
k=j;
break;
}
}
for(j=k;j<100;j++)
printf("%d",a[j]);
printf("\n");
}
return 0;
}
|
32
|
15,685 |
char b[101];
void reorder(char a[])
{
int i, l;
char temp0;
l = strlen(a);
for (i = 0; i <l; i++)
b[i] = a[l - i - 1];
}
int main()
{
char bjs[101][101], js[101][101], temp;
int i, j, k, p, n, l1, l2, c[101];
cin >> n;
for (i = 1; i <= n; i++)
cin >> bjs[i] >> js[i];
for (i = 1; i <= n; i++)
{
l1 = strlen(bjs[i]);
l2 = strlen(js[i]);
reorder(bjs[i]);
for (j = 0; j < l1; j++)
bjs[i][j] = b[j];
reorder(js[i]);
for (j = 0; j < l2; j++)
js[i][j] = b[j];
for (j = l2; j < l1; j++)
js[i][j] = '0';
for (j = 0; j < l1; j++)
{
if (bjs[i][j] < js[i][j])
{
bjs[i][j] += 10;
bjs[i][j + 1] -= 1;
}
c[j] = bjs[i][j] - js[i][j];
}
for (k = l1 - 1; k >= 0; k--)
if (c[k] != 0)
break;
if (k == -1)
cout << 0;
else
for (p = k; p >= 0; p--)
cout << c[p];
cout << endl;
}
return(0);
}
|
32
|
15,686 |
void checkit(char a[101])
{
int i,n;
n=strlen(a);
for(i=0;i<n;i++)
{
a[i]=a[i+1];
}
if(a[0]=='0')checkit(a);
}
void doit(char a[101],char b[101])
{
int x,y,i,m;
x=strlen(a);
y=strlen(b);
for(i=0;i<y;i++)
{
m=a[x-1-i]-b[y-1-i]+48;
if(m<48)
{
a[x-2-i]=a[x-2-i]-1;
m=m+10;
}
a[x-1-i]=m;
}
if(a[0]=='0')checkit(a);
}
void main()
{
char a[20][101],b[20][101];
int n,i;
scanf("%d",&n);
scanf("%s",a[0]);
scanf("%s",b[0]);
for(i=1;i<n;i++)
{
getchar();
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
doit(a[i],b[i]);
printf("%s\n",a[i]);
}
}
|
32
|
15,687 |
int main()
{
int n, N, a[120], b[120], c[120];
char a1[120], b1[120], hh;
cin >> N;
cin.get(hh);
for(n = 0; n < N; n++)
{
int i, l, j;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
cin.getline(a1, 120);
l = strlen(a1);
for(i = 0; i < l; i++)
{
a[i] = a1[l - 1 - i] - '0';
}
cin.getline(b1, 120);
l = strlen(b1);
for(i = 0; i < l; i++)
{
b[i] = b1[l - 1 - i] - '0';
}
l = strlen(a1);
for(i = 0; i < l; i++)
{
if(a[i] - b[i] >= 0) c[i] = a[i] - b[i];
else
{
c[i] = a[i] - b[i] + 10;
j = i + 1;
while(a[j] == 0)
{
a[j] = 9;
j++;
}
a[j] = a[j] - 1;
}
}
for(i = l - 1; i >= 0; i--) cout << c[i];
cout << endl;
cin.get(hh);
}
return 0;
}
|
32
|
15,688 |
/*
* 88.cpp
*
* Created on: 2011-12-25
* Author: 1
*/
int main()
{
int n,aa,bb,i,j,p,q;
cin>>n;
char a[100];
char b[100];
char d[100];
cin.getline(a,100);
while(n>0)
{
n=n-1;
cin.getline(a,100);
cin.getline(b,100);
cin.getline(d,100);
aa=(strlen)(a);
bb=(strlen)(b);
for(i=aa;i>=0;i--)
{
b[i]=b[i-aa+bb];
}
for(i=0;i<aa-bb;i++)
{
b[i]='0';
}
int c[aa];
for(i=aa-1;i>=0;i--)
{
p=(int)(a[i]);
q=(int)(b[i]);
if(p>=q) c[i]=p-q;
else
{
c[i]=p+10-q;
a[i-1]=(char)((int)(a[i-1])-1);
}
}
for(i=0;i<100;i++)
{
if(c[i]!=0) break;
}
for(j=i;j<100;j++)
{
c[j-i]=c[j];
}
for(j=0;j<aa-i;j++)
{
cout<<c[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15,689 |
void main()
{
char a[200]={"\0"},b[200]={"\0"},c;
int i,j,k,m,n,s,t=0,length;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
k=strlen(a);
m=strlen(b);
length=k-m;
for(j=k-1;j>=length;j--)
{
if(t) a[j]--;
if(a[j]>=b[j-length])
{
a[j]=a[j]-b[j-length]+48;
t=0;
}
else
{
a[j]=a[j]+10-b[j-length]+48;
t=1;
}
}
for(j=length-1;j>=0;j--)
{
if(t) a[j]--;
if(a[j]<48)
{
a[j]=a[j]+10;
t=1;
}
else t=0;
}
for(j=0;j<k;j++)
{
if(a[j]!=48)
{
s=j;
break;
}
}
if(s>200) printf("0\n");
else
{
for(j=s;j<k;j++)
printf("%c",a[j]);
printf("\n");
}
}
}
|
32
|
15,690 |
void main()
{
int a[100],b[100],n,l,m,i,j;
char c[101],d[101];
scanf("%d",&n);
while(n--)
{
scanf("%s%s",c,d);
l=strlen(c);
m=strlen(d);
for(i=0;i<l;i++)
a[i]=c[i]-'0';
for(j=0;j<m;j++)
b[j+l-m]=d[j]-'0';
for(i=l-1;i>=l-m;i--)
{
a[i]=a[i]-b[i];
if(a[i]<0)
{
a[i]+=10;
a[i-1]--;
}
}
while(a[i]<0&&i>0)
{
a[i]+=10;
i--;
a[i]--;
}
for(j=0;j<l;j++)
if(a[j]!=0)
break;
for(i=j;i<l;i++)
printf("%d",a[i]);
printf("\n");
}
}
|
32
|
15,691 |
void minus(char *a,char *b,int na,int nb,char *c)
{
int i;
for(i=0;i<nb;i++)
{
if((a[i]-b[i])<0)
{
c[i]=10+a[i]-b[i]+'0';
a[i+1]--;
}
else
c[i]=a[i]-b[i]+'0';
}
for(i=nb;i<na-1;i++)
{
if(a[i]<'0')
{
a[i]=a[i]+10;
a[i+1]--;
}
c[i]=a[i];
}
c[na-1]=a[na-1];
}
void exchange(char *a,int na)
{
int k;
for(k=1;k<=(na/2);k++)
{
int t;
t=a[k-1];
a[k-1]=a[na-k];
a[na-k]=t;
}
}
void main()
{
int n,i,k,j;
scanf("%d",&n);
char **c;
c=(char**)malloc((n+1)*sizeof(char *));
if(c!=NULL)
{char a[100]
,b[100];
int na,nb;
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
na=strlen(a);
nb=strlen(b);
exchange(a,na);
exchange(b,nb);
c[i]=(char*)malloc((na+1)*sizeof(char));
if(c[i]!=NULL)
minus(a,b,na,nb,c[i]);
}
for(i=0;i<n;i++)
{
for(k=strlen(c[i])-1;k>0;k--)
{
if(c[i][k]>'0')
break;
}
for(j=k;j>=0;j--)
{
printf("%c",c[i][j]);
if(j==0)
printf("\n");
}
free(c[i]);
}
free(c);
}
}
|
32
|
15,692 |
int main()
{
int n;
cin>>n;
int i,j,k;
char c[n][101];
int d[n];
for(j=0;j<n;j++)
{
char a[101],b[101];
cin>>a>>b;
if(j==n-1);
else cin.get();
int sizea,sizeb;
sizea=strlen(a);
d[j]=sizea;
sizeb=strlen(b);
for(i=sizeb-1;i>=0;i--)
{
b[i+sizea-sizeb]=b[i];
}
for(i=0;i<sizea-sizeb;i++)
b[i]='0';
for(i=sizea-1;i>=0;i--)
{
if(a[i]>=b[i])
c[j][i]=a[i]-b[i]+'0';
else if(a[i]<b[i])
{
a[i-1]=a[i-1]-1;
a[i]=a[i]+10;
c[j][i]=a[i]-b[i]+'0';
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
if(c[i][j]!='0')
break;
for(k=j;k<d[i];k++)
cout<<c[i][k];
cout<<endl;
}
return 0;
}
|
32
|
15,693 |
void main()
{
char a[101],b[101];
int n,i,j,c1,c2;
scanf("%d",&n);
for(i=1;i<=n;i++)
{ scanf("%s",a);
scanf("%s",b);
c1=strlen(a);
c2=strlen(b);
for(j=c1-1;j>=c1-c2;j--)
{ if(a[j]<b[j-c1+c2])
{a[j]=a[j]+10-b[j-c1+c2]+48;a[j-1]--;}
else a[j]=a[j]-b[j-c1+c2]+48;
}
printf("%s\n",a);
}
}
|
32
|
15,694 |
int main()
{
int i,j,n,a,b,m;
char c[100],d[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c);
scanf("%s",d);
a=strlen(c);
b=strlen(d);
m=b-1;
for(j=a;j>a-b;j--)
{
if(c[j-1]>=d[m])
{
c[j-1]=c[j-1]-d[m]+48;
m--;
}
else
{
c[j-1]=c[j-1]+10-d[m]+48;
c[j-2]--;
m--;
}
}
j=0;
while(c[j]==0)
j++;
for(;j<a;j++)
printf("%c",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15,695 |
int main()
{
int n, i, j, k, lenth1, lenth2,count;
int num1[101], num2[101];
char str1[101], str2[101];
cin >> n;
// ??/n
for(count = 1; count <= n; count++) //?????
{
cin.get();
cin.getline(str1, 101); //???????1
cin.getline(str2, 101); //?????2
lenth1 = strlen(str1); //????
lenth2 = strlen(str2);
memset(num1, 0, sizeof(num1)); //???????
memset(num2, 0, sizeof(num2));
k = 0;
for(j = lenth1 - 1; j >= 0; j--)
{
num1[k++] = str1[j] -'0'; //???????????
}
k = 0;
for(j = lenth2 - 1; j>=0; j--)
{
num2[k++] = str2[j] - '0';
}
for(k = 0; k < lenth1; k++)
{
if(num1[k] < num2[k]) //???????????
{
num1[k] += 10;
num1[k+1]--;
}
num1[k] -= num2[k];
}
i = 100;
while(num1[i] == 0)i--; //?????????????
for(; i >= 0; i--)
cout << num1[i];
cout << endl;
}
return 0;
}
|
32
|
15,696 |
int main()
{
int a1[Max+10]={0};
int a2[Max+10]={0};
char s1[Max+10];
char s2[Max+10];
int i,j,k=0,e,f,n;
int L1,L2;
scanf("%d",&n);
do{
scanf("%s",s1);
scanf("%s",s2);
L1=strlen(s1);
L2=strlen(s2);
j=0;
if(L1==1&&L2==1)
{
e=s1[0]-'0';
f=s2[0]-'0';
printf("%d",e-f);
}
else
{
for(i=L1-1;i>=0;i--)
a1[j++]=s1[i]-'0';
j=0;
for(i=L2-1;i>=0;i--)
a2[j++]=s2[i]-'0';
for(i=0;i<Max;i++)
{
a1[i]-=a2[i];
if(a1[i]<0)
{
a1[i]+=10;
a1[i+1]--;
}
}
for(i=Max;i>=0;i--)
{
if(a1[i]!=0)
{
j=i;
break;
}
}
for(i=j;i>=0;i--)
{
printf("%d",a1[i]);
if(i==0)
printf("\n");
}
for(i=0;i<Max;i++)
{
a1[i]=0;
a2[i]=0;
}
getchar();
k++;
}
}while(k<n);
return 0;
}
|
32
|
15,697 |
void main()
{
int n,i,j,k,m[60],l[30];
char a[30][100];
scanf("%d",&n);
for(i=0;i<2*n;i++)
scanf("%s",a[i]);
for(i=0;i<2*n;i++)
m[i]=strlen(a[i]);
for(i=0;i<n;i++)
l[i]=m[2*i]-m[2*i+1];
for(i=0;i<n;i++)
{
for(j=m[2*i+1]-1;j>=0;j--)
{
if(a[2*i+1][j]<=a[2*i][j+l[i]])
a[2*i][j+l[i]]=a[2*i][j+l[i]]-a[2*i+1][j]+'0';
else
{
a[2*i][j-1+l[i]]=a[2*i][j-1+l[i]]-1;
a[2*i][j+l[i]]=a[2*i][j+l[i]]-a[2*i+1][j]+10+'0';
}
}
}
for(i=0;i<n;i++)
printf("%s\n",a[2*i]);
}
|
32
|
15,698 |
void main()
{
int i=0,j=0,d=0,n=0,m=0,s=0,lena[100]={0},lenb[100]={0},c[100][100]={0};
char a[100][100]={0},b[100][100]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s",a[i],b[i]);
lena[i]=strlen(a[i]);
lenb[i]=strlen(b[i]);
for(j=lena[i]-1,s=lenb[i]-1;s>=0;j--,s--)
{
if(a[i][j]>=b[i][s])
c[i][j]=a[i][j]-b[i][s];
else
{
c[i][j]=a[i][j]+10-b[i][s];
for(m=j-1;;m--)
{
if(a[i][m]!='0')
{
a[i][m]--;break;}
else
a[i][m]='9';
}
}
}
for(m=lena[i]-lenb[i]-1;m>=0;m--)
c[i][m]=a[i][m];
for(j=0;j<lena[i];j++)
{
if(c[i][j]>=10)c[i][j]=c[i][j]-48;
}
for(j=0;j<lena[i];j++)
if(c[i][j]!=0)break;
for(j=j;j<lena[i];j++)
printf("%d",c[i][j]);
printf("\n");
}
}
|
32
|
15,699 |
void sub(char a[100],char b[100])
{
int l1,l2,i,j,k;
l1=strlen(a);
l2=strlen(b);
for(i=l1-1,j=l2-1;j>=0;i--,j--)
{
if(a[i]>b[j])
a[i]=a[i]-b[j]+48;
else if(a[i]==b[j])
a[i]='0';
else
{
a[i]=a[i]-b[j]+58;
for(k=i-1;a[k]=='0';k--)
a[k]='9';
a[k]=a[k]-1;
}
}
if(a[0]=='0')
{
for(i=1;i<l1;i++)
printf("%c",a[i]);
printf("\n");
}
else
printf("%s\n",a);
}
void main()
{
char a[100],b[100];
int n,m;
scanf("%d",&n);
for(m=1;m<=n;m++)
{
if(m>1)
printf("\n");
scanf("%s%s",a,b);
sub(a,b);
}
}
|
32
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.