id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
15,500 |
int minus(char str2[]);
int main()
{
int n,k;
char str2[100][100]={'\0'};
scanf("%d",&n);
for(k=0;k<n;k++)
minus(str2[k]);
for(k=0;k<n;k++)
printf("%s\n",str2[k]);
return 0;
}
int minus(char str2[])
{
int len1,len2,i;
char str[2][100]={'\0'};
scanf("%s%s",str[0],str[1]);
len1=strlen(str[0]);
len2=strlen(str[1]);
for(i=len1-1;i>=len1-len2;i--)
{
if(str[0][i]>=str[1][i-len1+len2])
{
str[0][i]=str[0][i]-str[1][i-len1+len2]+48;
}
else
{
str[0][i-1]=str[0][i-1]-1;
str[0][i]=str[0][i]-str[1][i-len1+len2]+58;
}
}
for(i=0;i<len1;i++)
{str2[i]=str[0][i];}
return 0;
}
|
32
|
15,501 |
int main()
{
int n;
cin>>n;
while(n--)
{
//?????? ????????
char num1[101],num2[101];
for(int k=0;k!=101;k++)
num1[k]=num2[k]='\0';
cin>>num1>>num2;
//???len1 len2??????????????
int len1=0,len2=0;
while(num1[len1++]!='\0'){}
while(num2[len2++]!='\0'){}
len1--;
len2--;
//???????????100???? ?????
for(int k=len1-1;k>=0;k--)
{
num1[101+k-len1]=num1[k];
num1[k]='\0';
}
for(int k=len2-1;k>=0;k--)
{
num2[101+k-len2]=num2[k];
num2[k]='\0';
}
//????
for(int k=100;num2[k]!='\0';k--)
{
int temp=num1[k]-num2[k]; //?temp??????????
if(temp<0) //????? ??k???10+temp ?k-1????1
{
num1[k-1]--;
num1[k]=10+temp+'0';
}
else //???k???temp
num1[k]=temp+'0';
}
//????
int k=0; //?k??num1??????'0'?'\0'?? ???????
while(num1[k]=='\0'||num1[k]=='0')
k++;
for(;k!=101;k++)
cout<<num1[k];
cout<<endl;
}
return 0;
}
|
32
|
15,502 |
/**
* ? ? ???????
* ? ?????
* ????: 2010?11?19?
* ???????????????
*/
int main()
{
int k, n; //????n?????????
cin>>n;
for ( k =1; k <= n; k++ ) //????
{
int a1[201]; //????????????a1??????b1????
int b1[201];
char a[201]; //?????????a??????b????
char b[201];
cin>>a>>b;
int len1 = strlen(a); //????????????
int len2 = strlen(b);
memset(a1,0,sizeof(a1)); //????????0
memset(b1,0,sizeof(b1));
int i, j = 0;
for (i = len1 - 1; i >= 0; i--)
a1[j++] = a[i] - '0'; //???????????????
j = 0;
for (i = len2 - 1; i >= 0; i--)
b1[j++] = b[i] - '0';
for (i = 0; i < len1 ; i++) //????
{
if ( a1[i] >= b1[i] ) //????????
{
a1[i]= a1[i]- b1[i];
}
else
if ( a1[i] < b1[i] ) //??????????????????
{
a1[i]= a1[i] + 10 - b1[i];
a1[i+1]--;
}
}
i = len1;
while( a1[i] == 0 )
i--; //???????0??
for(; i >= 0; i--)
cout << a1[i]; //??????
cout << endl;
}
return 0;
}
|
32
|
15,503 |
void main()
{
int n,i,j;
char a[100],b[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",a,b);
for(j=strlen(a)-1;j>=strlen(a)-strlen(b);j--)
if(a[j]>=b[j-strlen(a)+strlen(b)])
a[j]=a[j]-b[j-strlen(a)+strlen(b)]+48;
else
{
a[j]=a[j]-b[j-strlen(a)+strlen(b)]+58;
a[j-1]--;
}
j=0;
while(a[j]=='0')
j++;
for(;j<=strlen(a)-1;j++)
printf("%c",a[j]);
printf("\n");
}
}
|
32
|
15,504 |
int main()
{
int i,j,n;
char a0[110],b0[110];
unsigned int a[110]={0},b[110]={0};
for(cin>>n;n>=1;--n)
{
cin>>a0>>b0;
for(i=0;i<=strlen(a0)-1;++i)
a[i]=a0[i]-'0';
for(i=0;i<=strlen(b0)-1;++i)
b[i-strlen(b0)+strlen(a0)]=b0[i]-'0';
for(i=strlen(a0)-1;i>=strlen(a0)-strlen(b0);--i)
{
if(a[i]>=b[i])
a[i]=a[i]-b[i];
else
{
for(j=i-1;j>=0;--j)
{
if(a[j]!=0)
{
a[j]=a[j]-1;
for(j=j+1;j<=i-1;++j)
{
a[j]=9;
}
a[i]=10+a[i]-b[i];
break;
}
}
}
}
for(i=0;i<=strlen(a0)-1;++i)
cout<<a[i];
cout<<endl;
}
return 0;
}
|
32
|
15,505 |
/*
* integer.cpp
*
* Created on: 2010-12-25
* Author: ???
* Function: ?????
*/
int main()
{
int n,len1,len2;//n??????????len1??a????len2??b???
char a[100],b[100],t;//a??????b????
cin>>n;
for(int i=0;i<n;i++){
cin>>a>>b;
len1=strlen(a);
len2=strlen(b);
for(int j=0;j<len1-j;j++){//????a?????????a[0]????
t=a[j];
a[j]=a[len1-j-1];
a[len1-j-1]=t;
}
for(int j=0;j<len2-j;j++){//???b?????????b[0]????
t=b[j];
b[j]=b[len2-j-1];
b[len2-j-1]=t;
}
for(int j=0;j<len2;j++)//??????????a?
if(a[j]>=b[j]) a[j]=a[j]-b[j]+'0';
else {
a[j+1]--;
a[j]=a[j]+10-b[j]+'0';
}
if(a[len1-1]!='0') cout<<a[len1-1];//????a??????0????????0?????
for(int j=len1-2;j>=0;j--)
cout<<a[j];
cout<<endl;//???
}
}
|
32
|
15,506 |
void main()
{
int n,i,j,k,ya,yb,m;
char a[100]={0},b[100]={0};
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s\n",a);
scanf("%s",b);
ya=strlen(a);
yb=strlen(b);
i=ya-1;
for(k=yb-1;k>=0;k--)
{
if(a[i]>=b[k])
{
a[i]=a[i]-b[k]+48;
}
else//if(a[i]<b[k])
{
a[i]=a[i]-b[k]+58;
for(m=i-1;m>=0;m--)
{
if(a[m]>=49)
{
a[m]=a[m]-1;
break;
}
else if(a[m]==48)
a[m]=57;
}
}
i--;
}
printf("%s",a);
printf("\n");
}
}
|
32
|
15,507 |
void main()
{
int a,j,i;
scanf("%d",&a);
char **pp,**qq;
int m,n;
pp = (char **)malloc(a*sizeof(char*));
qq = (char **)malloc(a*sizeof(char*));
for(i=0;i<a;i++)
{
pp[i]=(char*)malloc(101*sizeof(char));
qq[i]=(char*)malloc(101*sizeof(char));
scanf("%s",pp[i]);
scanf("%s",qq[i]);
}
for(i=0;i<a;i++)
{
m = strlen(pp[i]);
n = strlen(qq[i]);
for(j=m-1;j>=m-n;j--)
{
if(pp[i][j]<qq[i][n-m+j])
{
pp[i][j] = 10 + pp[i][j] - qq[i][n-m+j] + '0';
pp[i][j-1]--;
}
else if(pp[i][j]>=qq[i][n-m+j])
pp[i][j] = pp[i][j] - qq[i][n-m+j] + '0';
}
for(j=m-1;j>=0;j--)
if(pp[i][j]<'0')
{
pp[i][j] += 10;
pp[i][j-1] -= 1;
}
printf("%s\n",pp[i]);
}
}
|
32
|
15,508 |
int main()
{
char a[100],b[100];
int n,k=1,p,q,i,c[100];
scanf("%d",&n);
while (k<=n)
{
scanf("%s%s",&a,&b);
p=strlen(a);//??????
q=strlen(b);//??????
i=p;
for(;p>=0;p--,q--)
{
if (q>=0)
{
c[p]=a[p]-b[q];
if (c[p]<0) {c[p]=10+c[p];a[p-1]=a[p-1]-1;}
}
else if (q<0) c[p]=a[p]-48;
}
for(p=0;p<i;p++) printf("%d",c[p]);
k++;
printf("\n");
}
}
|
32
|
15,509 |
void f(char a[],char b[],char * p)
{
int m,n;
m=strlen(a);
n=strlen(b);
for (int i=0;i<m;i++)
{
if (b[n-1-i]-a[m-1-i]>=0)
p[n-1-i]=b[n-1-i]-a[m-1-i]+'0';
else
{
p[n-1-i]=b[n-1-i]-a[m-1-i]+'0'+10;
b[n-2-i]--;
}
}
p[n]=0;
for(int i=0;i<n-m;i++)
p[i]=b[i];
if(p[0]=='0'&&p[1]!=0)
{
for(int i=0;i<n+1;i++)
p[i]=p[i+1];
}
}
int main()
{
int n,i;
scanf ("%d",&n);
getchar();
for(i = 0;i<n;i++)
{
char a[101];
char b[101];
char c[101];
gets(a);
gets(b);
f(b,a,c);
printf("%s\n",c);
getchar();
}
}
|
32
|
15,510 |
void main()
{
char a[100],b[100];
int n,al,bl,i,j;
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("%s",a);
scanf("%s",b);
al=strlen(a);
bl=strlen(b);
for(i=0;i<bl;i++)
{
if(a[al-1-i]<b[bl-1-i])
{
a[al-1-i]=a[al-1-i]+10-b[bl-1-i];
a[al-2-i]=a[al-2-i]-1;
}
else a[al-1-i]=a[al-1-i]-b[bl-1-i];
}
for(i=0;i<al-bl;i++)
printf("%c",a[i]);
for(i=al-bl;i<al;i++)
printf("%d",a[i]);
printf("\n\n");
}
}
|
32
|
15,511 |
void main()
{
int i,j,k,x,y,d,n;
char a[101],b[101];
scanf("%d",&n);
for(j=1;j<=n;j++)
{
scanf("%s",a);
scanf("%s",b);
x=strlen(a);
y=strlen(b);
printf("\n");
d=x-y;
k=0;
for(i=x-1;i>=d;i--)
if(a[i]<b[i-d])
{
a[i]=a[i]-b[i-d]+58;
a[i-1]=a[i-1]-1;
k++;
}
else
{
a[i]=a[i]-b[i-d]+48;
k++;
}
for(i=x-1;i>0;i--)
if(a[i]<48)
{
a[i]=a[i]+10;
a[i-1]=a[i-1]-1;
}
if(a[0]==48)
k=1;
else
k=0;
for(i=k;i<x;i++)
printf("%c",a[i]);
printf("\n");
}
}
|
32
|
15,512 |
int main()
{
int n,i,j,k,lena,lenb,x,y,tag=1;
char a[1000]={0},b[1000]={0},c[1000]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
k=lenb;
for(j=lena,k=lenb;j>=0;j--,k--)
{
if(k<0)
{
c[j]=a[j];
}
else
{
if(a[j]>=b[k])
{
c[j]=a[j]-b[k]+'0';
}
else
{
a[j]=a[j]+10;
a[j-1]--;
c[j]=a[j]-b[k]+'0';
}
}
}
for(x=0;x<lena;x++)
{
if(c[x]!=0)
{
for(y=x;y<lena;y++)
printf("%c",c[y]);
printf("\n");
;
tag=0;
break;
}
}
if(tag==1)
printf("0\n");
}
}
|
32
|
15,513 |
int main()
{
int n, num1[101], num2[101], len1, len2, m, j;
char str1[102], str2[102];
cin >> n;
cin.get();
for (int k = 1; k <= n; k++)
{
cin.getline(str1,102);
cin.getline(str2,102);
cin.get();
len1 = strlen (str1);
len2 = strlen (str2);
memset(num1, 0, sizeof(num1));
memset(num2, 0, sizeof(num2));
j = 0;
for (int i = len1 - 1; i >= 0; i--)
{
num1[j] = str1[i] - '0';
j++;
}
j = 0;
for (int i = len2 - 1; i >= 0; i--)
{
num2[j] = str2[i] - '0';
j++;
}
for (int i = 0; i < len1; i++)
{
num1[i] = num1[i] - num2[i];
if (num1[i] < 0)
{
num1[i + 1]--;
num1[i] += 10;
}
}
m = len1;
while (num1[m] == 0)
m--;
for (int i = m; i >= 0; i--)
cout << num1[i];
cout << endl;
}
return 0;
}
|
32
|
15,514 |
int main()
{
char a[101],b[101],c[101],d[101];
int n,i,j,n1,n2,k,m,t;
scanf("%d",&n);
for(j=0;j<n;j++)
{
memset(c,0,sizeof(c));
scanf("%s%s",a,b);
n1=strlen(a);
n2=strlen(b);
for (i=0;i<n1;i++)
{
a[i]-='0';
}
for (i=0;i<n2;i++)
{
b[i]-='0';
}
if(n1-n2!=0)
{
for(i=0;i<(n1-n2);i++)
d[i]=0;
}
for(i=n1-n2,k=0;i<n1 || k<n2;i++,k++)
d[i]=b[k];
for(i=1;i<=n1;i++)
{
if(a[n1-i]>=d[n1-i])
c[n1-i]=a[n1-i]-d[n1-i];
else
{
c[n1-i]=a[n1-i]+10-d[n1-i];
if(a[n1-1-i]==0)
{
t=i;
do
{
a[n1-1-i]=a[n1-1-i]+9;
i++;
}while(a[n1-1-i]==0);
a[n1-1-i]--;
i=t;
}
else
a[n1-1-i]--;
}
}
i=0;
while(c[i]==0 && i<n1)
{
i++;
}
if (i==n1)
{
printf("0\n");
continue;
}
m=i;
for(i=m;i<n1;i++)
printf("%d",c[i]);
printf("\n");
}
return 0;
}
|
32
|
15,515 |
int main()
{
int n;
scanf ("%d", &n);
while (n > 0)
{
char c[100],b[100];
int j, i, k=0, s=0, t;
scanf ("%s\n%s", &c, &b);
while (c[k]!='\0')
{
k++;
}
while (b[s]!='\0')
{
s++;
}
t=k-s;
for (i=k-1;i>=t;i--)
{
if(c[i]>=b[i-t] )
{
c[i]=c[i]-b[i-t]+'0';
}
else{
c[i-1]--;
c[i]=c[i]+10-b[i-t]+'0';
}
}
s = 0;
for (s;s <k; s++)
printf("%c", c[s]);
printf("\n");
n--;
}
return 0;
}
|
32
|
15,516 |
char str1[N],str2[N],temp[N];
int max(int x,int y)
{
return(x>y?x:y);
}
void major(char *str1,char *str2)
{
int a[N],b[N];
int len1,len2,len,t,jump,i;
len1=strlen(str1);
len2=strlen(str2);
if(len1<len2)
{
strcpy(temp,str1);t=len1;
strcpy(str1,str2);len1=len2;
strcpy(str2,temp);len2=t;
}
len=max(len1,len2);
jump=len-len2+1;
for(i=len;i>=0;i--)
str1[i]=str1[i-1];
str1[0]='0';
for(i=len;i>=jump;i--)
{
str2[i]=str2[i-jump];
}
for(i=0;i<jump;i++)
str2[i]='0';
for(i=len;i>=0;i--)
{
a[i]=str1[i]-'0';
b[i]=str2[i]-'0';
}
for(i=len;i>=0;i--)
{
if(a[i]>=b[i])
a[i]=a[i]-b[i];
else
{
a[i]=a[i]+10-b[i];
a[i-1]-=1;
}
}
if(a[1]==0)
{
for(i=0;i<=len-2;i++)
temp[i]=a[i+2]+'0';
temp[len-1]='\0';
}
else if(a[1]!=0)
{
for(i=0;i<=len-1;i++)
temp[i]=a[i+1]+'0';
temp[len]='\0';
}
printf("%s\n",temp);
}
void main()
{
char s1[100][N],s2[100][N];
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",s1[i]);
scanf("%s",s2[i]);
if(i<n-1)
printf("\n");
}
printf("\n");
for(i=0;i<n;i++)
major(*(s1+i),*(s2+i));
}
|
32
|
15,517 |
void main(){
int n,i,j,al,bl,t;
char a[100],b[100],out[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{int anum[100];
int bnum[100];
scanf("%s",a);
scanf("%s",b);
al=strlen(a);
bl=strlen(b);
for(j=0;j<al;j++)
anum[al-1-j]=a[j]-'0';
for(j=0;j<bl;j++)
bnum[bl-1-j]=b[j]-'0';
for(j=0;j<bl;j++)
anum[j]=anum[j]-bnum[j];
for(j=0;j<bl;j++)
{
if(anum[j]<0)
{
anum[j]=anum[j]+10;
anum[j+1]=anum[j+1]-1;
}
}
if(anum[al-1]==0)
{
{for(j=0;j<al-1;j++)
out[j]=anum[al-2-j]+'0';
};
out[al-1]='\0';
}
if(anum[al-1]>0)
{
for(j=0;j<al;j++)
out[j]=anum[al-1-j]+'0';
out[al]='\0';
}
printf("%s\n",out);
}
}
|
32
|
15,518 |
int main()
{
char a[201],b[201];
int i,mark;
int a1[201],b1[201],c1[201];
int chang1,chang2,chang3;
scanf("%d",&mark);
while(mark--){
scanf("%s%s",a,b);
//???????
memset(a1,0,sizeof(a1));
memset(b1,0,sizeof(b1));
memset(c1,0,sizeof(c1));
chang1 = strlen(a);
chang2 = strlen(b);
for ( i = 0 ; i <chang1 ; i++)
a1[i] = a[chang1 - 1 - i] - '0';
for ( i = 0 ; i <chang2 ; i++)
b1[i] = b[chang2 - 1 - i] - '0';
chang3 = chang1;
for ( i = 0 ; i < chang3 ; i++){
c1[i] += a1[i]-b1[i];
if (c1[i] < 0){
c1[i+1]--;
c1[i] += 10;
}
}
if (c1[chang3-1] == 0)
chang3--;
for ( i = chang3-1; i >= 0 ; i--)
printf("%d",c1[i]);
printf("\n");
}
return 0;
}
|
32
|
15,519 |
void main()
{
char a[10000],b[10000],c[10000];
int d,i,n,j,m,t,s,w;
scanf("%d",&w);
for(j=0;j<w;j++)
{
scanf("%s",a);
scanf("%s",b);
for(n=1;a[n]!='\0';)
n++;
for(m=1;b[m]!='\0';)
m++;
d=n-m;
for(i=m-1;i>=0;i--)
b[i+d]=b[i];
for(i=0;i<n-m;i++)
b[i]='0';
for(i=n-1;i>=n-m;i--)
{
t=a[i]-b[i];
if(t<0)
{
t=10+a[i]-b[i];
a[i-1]=a[i-1]-1;
}
c[i]=t+'0';
s=i-1;
while(a[s]<'0')
{
a[s]=a[s]+10;
a[s-1]=a[s-1]-1;
s--;
}
}
for(i=0;i<n-m;i++)
c[i]=a[i];
for(i=0;i<n;i++)
printf("%c",c[i]);
printf("\n");
}
}
|
32
|
15,520 |
int maxi(int a,int b)
{
if(a>b) return a;
else return b;
}
int main()
{
int n,i;
char a[102],b[102];
int na[102],nb[102],sum[200];
cin>>n;
for(i=0;i<n;i++)
{ int j,k=0;
memset(a,'\0',sizeof(a));
memset(b,'\0',sizeof(b));
memset(na,0,sizeof(na) );
memset(nb,0,sizeof(na) );
memset(sum,0,sizeof(sum) );
cin>>a>>b;
int lena=strlen(a),lenb=strlen(b);
for(j=lena-1;j>=0;j--)
na[k++]=a[j]-'0';
k=0;
for(j=lenb-1;j>=0;j--)
nb[k++]=b[j]-'0';
int MaxLen=maxi(lena,lenb);
for(j=0;j<MaxLen;j++)
{
sum[j]+=na[j]-nb[j];
if(sum[j]<0)
{ sum[j]+=10;
sum[j+1]--;
}
}
int flag=0;
for(j=MaxLen-1;j>=0;j--)
{
if(sum[j]==0&&flag==0)
;
if(sum[j]!=0&&flag==0)
{
flag=1;
cout<<sum[j];
}
else if(flag==1)
cout<<sum[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15,521 |
void plus(char a[],char b[])
{
int * p1,* p2,*p;
int c[100],i,l1,l2;
l1=strlen(a);
l2=strlen(b);
for(i=0;i<l2;i++)
{
c[i]=a[l1-1-i]-b[l2-i-1];
}
for(i=l2;i<l1;i++)
{
c[i]=a[l1-i-1]-'0';
}
for(i=0;i<l1;i++)
{
if(c[i]<0)
{
c[i]=10+c[i];
c[i+1]=c[i+1]-1;
}
}
p1=c;
p2=p1+l1-1;
for(p=p2;p!=p1;p--)
{
printf("%d",* p);
}
printf("%d\n",* p1);
}
void main()
{
int n,i;
char a[100][100],b[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
plus(a[i],b[i]);
}
}
|
32
|
15,522 |
void main()
{
int n;
scanf("%d",&n);
char miner[20][101],minee[20][101];
int i,sp,k,pr;
int lr,le;
for(i=1;i<=n;i++)
{
scanf("%s%s",&miner[i],&minee[i]);
lr=strlen(miner[i]);
le=strlen(minee[i]);
while(le>=1)
{ if(miner[i][lr-1]>=minee[i][le-1])
miner[i][lr-1]=miner[i][lr-1]-minee[i][le-1]+'0';
else
{sp=lr-2;
while(miner[i][sp]=='0'){miner[i][sp]='9';sp--;}
miner[i][sp]=miner[i][sp]-1;
miner[i][lr-1]=miner[i][lr-1]-minee[i][le-1]+'0'+10;
}
le--;lr--;
}
k=0;lr=strlen(miner[i]);
while(1){if(miner[i][k]=='0')k++;else break;}
for(pr=k;pr<=lr-1;pr++)printf("%c",miner[i][pr]);
printf("\n");
}
}
|
32
|
15,523 |
void main()
{
int n,j,k,l,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char x[100],y[100];
scanf("%s",x);j=strlen(x);
scanf("%s",y);k=strlen(y);
for(l=k-1;l>=0;l--){x[j-k+l]=x[j-k+l]-y[l]+48;if(x[j-k+l]<48){x[j-k+l]+=10;x[j-k+l-1]--;}}
printf("%s",x);printf("\n");
}
}
|
32
|
15,524 |
void main()
{
int n,m,i,j,la,lb;
char a[101],b[101],c[101],r[100][101];
scanf("%d",&n);
for(m=0;m<n;m++)
{
scanf("%s %s",a,b);
la=strlen(a);
lb=strlen(b);
for(i=0;i<la-lb;i++)
c[i]='0';
c[i]=0;
strcat(c,b);
r[m][la]=0;
for(i=la-1;i>=0;i--)
{
if(a[i]>=c[i]) r[m][i]=a[i]-c[i]+'0';
else
{
r[m][i]=a[i]+10-c[i]+'0';
for(j=i-1;;j--)
{if(a[j]>'0') {a[j]--;break;}
else a[j]='9';
}
}
}
}
for(m=0;m<n;m++)
printf("%s\n",r[m]);
}
|
32
|
15,525 |
struct number
{
char a[100];
int lena;
char b[100];
int lenb;
}num[1000];
void main()
{
int n,i,j,ll;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",num[i].a);
num[i].lena=strlen(num[i].a);
scanf("%s",num[i].b);
num[i].lenb=strlen(num[i].b);
}
for(i=0;i<n;i++)
{
ll=num[i].lena-num[i].lenb;
for(j=num[i].lenb-1;j>=0;j--)
{
if(num[i].a[j+ll]-num[i].b[j]>=0)
num[i].a[j+ll]=num[i].a[j+ll]-num[i].b[j]+48;
else
{
num[i].a[j+ll]=num[i].a[j+ll]-num[i].b[j]+48+10;
num[i].a[j+ll-1]--;
}
}
printf("%s\n",num[i].a);
}
}
|
32
|
15,526 |
int main()
{
int n,i,j,x,y;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s\n%s",a,b);
x=strlen(a);
y=strlen(b);
for(j=y;j>0;j--)
{
if(a[j+x-y-1]>b[j-1])
{
a[j+x-y-1]=a[j+x-y-1]-b[j-1]+48;
continue;
}
if(a[j+x-y-1]<b[j-1])
{
a[j+x-y-1]=a[j+x-y-1]-b[j-1]+58;
a[j+x-y-2]--;
continue;
}
if(a[j+x-y-1]==b[j-1])
{
a[j+x-y-1]=48;
}
}
if(a[0]>48)
printf("%s\n",a);
else
{
for(i=1;i<x;i++)
{
printf("%c",a[i]);
}
printf("\n");
}
}
return 0;
}
|
32
|
15,527 |
void minus(char a[100],char b[100])
{
int i,k,m,n;
char c[100];
m=strlen(a);
n=strlen(b);
for(i=m-1;i>m-n-1;i--)
{
if(a[i]=='/')
{
a[i]='9';
a[i-1]=a[i-1]+'0'-'1';
}
if(a[i]>=b[i-m+n]) c[i]=a[i]-b[i-m+n]+'0';
if(a[i]<b[i-m+n])
{
c[i]=a[i]-b[i-m+n]+':';
a[i-1]=a[i-1]+'0'-'1';
}
}
for(i=m-n-1;i>=0;i--)
{
if(a[i]=='/')
{
a[i]='9';
a[i-1]=a[i-1]+'0'-'1';
}
c[i]=a[i];
}
for(i=0;;i++)
{
k=i;
if(c[i]!='0')break;
}
for(i=k;i<m;i++)
printf("%c",c[i]);
printf("\n");
}
void main()
{
int j,i;
char a[10][100],b[10][100];
scanf("%d",&j);
for(i=0;i<j-1;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
printf("\n");
}
scanf("%s",a[j-1]);
scanf("%s",b[j-1]);
for(i=0;i<j;i++)
minus(a[i],b[i]);
}
|
32
|
15,528 |
void minus(char a[],char b[],char result[]);
void main()
{
int n,i;
char a[max][max],b[max][max];
char result[max][max];
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s\n\n",a[i],b[i]);
minus(a[i],b[i],result[i]);
printf("%s\n",result[i]);
}
}
void minus(char a[],char b[],char result[])
{
int la,lb,lresult;
int flag=0;
int t=0;
int s,c=0;
int i;
char temp1;
la=strlen(a)-1;
lb=strlen(b)-1;
while(la >= 0)
{
if(lb < 0)
{
s=a[la--]-48;
}
else
{
s=a[la--]-b[lb--];
}
result[t++]=s-c+48;
if(result[t-1] < 48)
{
result[t-1]+=10;
c=1;
}
else c=0;
}
while(result[t] == 0) t--;
while(result[t] == '0')
{
result[t]=0;t--;
}
lresult=t;
for(i=0;i <= lresult/2;i++)
{
temp1=result[i];
result[i]=result[lresult-i];
result[lresult-i]=temp1;
}
}
|
32
|
15,529 |
int main()
{
int n,i,j,k,m,l;
char a[100],b[100],c[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a,b);
k=strlen(a);
m=strlen(b);
for(j=k-1,l=m-1;j>=k-m,l>=0;j--,l--)
{
if(a[j]>=b[l])
c[j]=a[j]-b[l]+48;
if(a[j]<b[l])
{
c[j]=10+a[j]-b[l]+48;
a[j-1]--;
}
}
for(j=0;j<k-m;j++)
c[j]=a[j];
for(j=0;j<k;j++)
printf("%c",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15,530 |
void main()
{
int n,i,j,xa,xb;
char sa[100],sb[100],str[20][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",sa);scanf("%s",sb);
xa=strlen(sa);xb=strlen(sb);
xb=xa-xb;
for(j=xa-1;j>=xb;j--)
{
if (sa[j]>=sb[j-xb] )
sa[j]=sa[j]-sb[j-xb]+48;
else if (sa[j]<sb[j-xb] )
{
sa[j]=sa[j]-sb[j-xb]+48+10;
sa[j-1]=sa[j-1]-1;
}
}
for(j=0;j<xa;j++)
str[i][j]=sa[j];
str[i][xa]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",str[i]);
}
|
32
|
15,531 |
void main()
{
int i,j,n,len1,len2;
int t[101]; /*????*/
char s1[30][101],s2[30][101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",s1[i]);
scanf("%s",s2[i]);
printf("\n");
} /*??????*/
for(i=1;i<=n;i++)
{
len1=strlen(s1[i]);
len2=strlen(s2[i]);
for(j=0;j<=len2-1;j++)
{
if(s1[i][len1-j-1]<s2[i][len2-j-1]) /*??????*/
{
s1[i][len1-j-2]=s1[i][len1-j-2]-'1'+48; /*s1??????*/
t[j]=s1[i][len1-j-1]-s2[i][len2-j-1]+10;
}
else
{
t[j]=s1[i][len1-j-1]-s2[i][len2-j-1];
}
}
for(j=len2;j<=len1-1;j++)
{
t[j]=s1[i][len1-j-1]-48;
}
for(j=(len1-1);j>=0;j--) /*???????*/
{
printf("%d",t[j]);
}
printf("\n");
}
}
|
32
|
15,532 |
int main()
{
int n,len1,len2;
char a[100],b[100],t;
cin>>n;
for(int i=0;i<n;i++){
memset(a,'0',100);
memset(b,'0',100);
cin>>a>>b;
len1=strlen(a);
len2=strlen(b);
for(int j=0;j<len1-j;j++){
t=a[j];
a[j]=a[len1-j-1];
a[len1-j-1]=t;
}
for(int j=0;j<len2-j;j++){
t=b[j];
b[j]=b[len2-j-1];
b[len2-j-1]=t;
}
for(int j=0;j<len2;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';
}
if(a[len1-1]!='0') cout<<a[len1-1];
for(int j=len1-2;j>=0;j--)
cout<<a[j];
cout<<endl;
}
}
|
32
|
15,533 |
void main()
{
int n,i,j,lg1,lg2,t;
char bjs[100][100],js[100][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&bjs[i]);
scanf("%s",&js[i]);
}
for(j=0;j<n;j++)
{
lg1=strlen(bjs[j]);
lg2=strlen(js[j]);
t=lg1-lg2;
for(i=lg2-1;i>=0;i--)
{
if(bjs[j][t+i]-js[j][i]>=0)
bjs[j][t+i]=bjs[j][t+i]-js[j][i]+48;
else
{
bjs[j][t+i]=bjs[j][t+i]-js[j][i]+48+10;
bjs[j][t+i-1]=bjs[j][t+i-1]-1;
}
}
printf("%s\n",bjs[j]);
}
}
|
32
|
15,534 |
void main()
{
int n,i,j,lena,lenb,t,h;
char a[101],b[101],c[101],d[101];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s\n%s",a,b);
lena=strlen(a);
lenb=strlen(b);
for (j=0;j<lena;j++)
{
c[j]=a[lena-j-1];
}
for (j=0;j<lenb;j++)
{
d[j]=b[lenb-j-1];
}
for (j=0;j<lenb;j++)
{
if (c[j]<d[j])
{
c[j]=c[j]+10-d[j]+'0';
t=j;
for (;c[++t]<'0';)
{
c[t]='9';
}
c[t]--;
}
else c[j]=c[j]-d[j]+'0';
}
for (h=lena-1;h>0;h--)
{
if (c[h]!='0') break;
}
for (;h>=0;h--)
{
printf("%d",c[h]-'0');
}
printf("\n");
}
}
|
32
|
15,535 |
int main(int argc, char* argv[])
{
int n,i,j,k,a,b,carry;
char str1[100],str2[100],str3[100]={'\0'};
scanf("%d",&n);
for(i=0;i<n;i++)
{
a=strlen(str3);
for(j=0;j<a;j++)
{
str3[j]='\0';
}
scanf("%s",&str1);
scanf("%s",&str2);
a=strlen(str1);
b=strlen(str2);
carry=0;
for(j=a-1,k=b-1;j>a-b-1;j--,k--)
{
str3[j]=str1[j]-str2[k]+'0'-carry;
if(str3[j]-'0'<0)
{
carry=1;
str3[j]+=10;
}
else
carry=0;
}
for(j=a-b-1;j>=0;j--)
{
str3[j]=str1[j]-carry;
if(str3[j]-'0'<0)
{
carry=1;
str3[j]+=10;
}
else
carry=0;
}
if(str3[0]=='0')
{
for(j=0;j<a;j++)
{
str3[j]=str3[j+1];
}
}
printf("%s",str3);
if(i!=n-1)
printf("\n");
}
return 0;
}
|
32
|
15,536 |
int main()
{
char a[101], b[101];
int na[101], nb[101];
int la, lb, i, n, j;
cin >> n;
for(j = 1; j <= n; j++)
{
cin >> a >> b;
la = strlen(a);
lb = strlen(b);
memset(na, 0, sizeof(na));
memset(nb, 0, sizeof(nb));
for(i = 0; i < la; i++)
{
na[i] = a[la - i - 1] - '0';
}
for(i = 0; i < lb; i++)
{
nb[i] = b[lb - i - 1] - '0';
}
for(i = 0; a[i] != '\0'; i++)
{
if(na[i] < nb[i])
{
na[i + 1] --;
na[i] = 10 + na[i] - nb[i];
}
else
na[i] = na[i] - nb[i];
}
for(i = i - 1; i >= 0; i--)
cout << na[i];
cout << endl;
}
return 0;
}
|
32
|
15,537 |
main()
{
int x,y,i,j,n;
char test1[100];
char test2[100];
char a[100];
char b[100];
char c[100];
scanf("%d",&n);
for(j=0;j<n;j++)
{ scanf("%s",test1);
x=strlen(test1);
for(i=0;i<x;i++)
a[i]=test1[x-i-1];
for(i=x;i<100;i++)
a[i]='0';
scanf("%s",test2);
y=strlen(test2);
for(i=0;i<y;i++)
b[i]=test2[y-i-1];
for(i=y;i<100;i++)
b[i]='0';
for(i=0;i<x;i++)
{
if(a[i]>=b[i])
c[i]=a[i]-b[i]+'0';
else
{
c[i]=a[i]-b[i]+10+'0';
a[i+1]=a[i+1]-1;
}
}
for(i=x-1;i>=0;i--)
printf("%c",c[i]);
printf("\n");
}
}
|
32
|
15,538 |
char *jian(char *x, char *y, int m, int n)
{
char *p1;
char *p2;
char *p3;
p1 = (char *)malloc((m)*sizeof(char));
p2 = (char *)malloc((m)*sizeof(char));
p3 = (char *)malloc((m)*sizeof(char));
strcpy(p1, x);
strcpy(p2, y);
p1 = p1 + m - 1;
p2 = p2 + n - 1;
int t = m - 1;
while(((*p1) >= '0' - 1) && ((*p1) <= '9'))
{
if((*p1) < (*p2))
{
p3[t] = (*p1) - (*p2) + 10 + '0';
p1 --;
*p1 = *p1 - '1' + '0';
p2 --;
}
else if(((*p1) >= (*p2)) && ((*p2) >= '0') && ((*p2) <= '9'))
{
p3[t] = (*p1) - (*p2) + '0';
p1 --;
p2 --;
}
else
{
p3[t] = (*p1);
p1 --;
//p2 --;
}
t --;
}
return(p3);
}
void main()
{
int s;
int i, j, k;
char *a[10], *b[10];
scanf("%d", &s);
for(i = 0; i < s; i ++)
{
a[i] = (char *)malloc(1000*sizeof(char));
b[i] = (char *)malloc(1000*sizeof(char));
}
for(i = 0; i < s; i ++)
{
scanf("%s", a[i]);
scanf("%s", b[i]);
}
for(i = 0; i < s; i ++)
{
for(j = 0; j < strlen(a[i]); j ++)
if(jian(a[i], b[i], strlen(a[i]), strlen(b[i]))[j] != '0')
{
k = j;
break;
}
for(j = k; j < strlen(a[i]); j ++)
printf("%c", jian(a[i], b[i], strlen(a[i]), strlen(b[i]))[j]);
printf("\n");
}
}
|
32
|
15,539 |
void main()
{
char a[100]={'\0'},b[100]={'\0'},re[100]={'\0'},n,i=0,l1=0,k=0,l2=0;
scanf("%d",&n);
while(scanf("%s\n%s",a,b)!=EOF)
{
l1=strlen(a);
l2=strlen(b);
k=l1-l2;
for(i=l1-1;i>=k;i--)
{
if(a[i]>=b[i-k])
{
re[i]=a[i]-b[i-k]+'0';
}
else
{
re[i]=a[i]+10-b[i-k]+'0';
a[i-1]=a[i-1]-1;
}
}
for(i=k-1;i>=0;i--)
{
re[i]=a[i];
}
printf("%s\n",re);
for(i=0;i<100;i++)
{
a[i]='\0';
b[i]='\0';
re[i]='\0';
}
}
}
|
32
|
15,540 |
int main()
{
int a,b,i,j,n,m;
char ss1[100],ss2[100];
int s1[100],s2[100],s3[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",ss1);
scanf("%s",ss2);
a=strlen(ss1);
b=strlen(ss2);
for(j=0;j<100;j++)
{
s1[j]=ss1[j]-48;
s2[j]=ss2[j]-48;
}
for(j=b-1;j>=0;j--)
{
s2[j+a-b]=s2[j];
}
for(j=0;j<a-b;j++)
{
s2[j]=0;
}
for(j=a-1;j>=0;j--)
{
if(s1[j]>=s2[j])
s3[j]=s1[j]-s2[j];
else
{
s3[j]=10+s1[j]-s2[j];
s1[j-1]=s1[j-1]-1;
}
}
for(j=0;j<a;j++)
{
if(s3[j]!=0)
m=1;
if(m==1)
printf("%d",s3[j]);
}
printf("\n");
m=0;
}
return 0;
}
|
32
|
15,541 |
int main()
{
int n, m; // ????????n?????n
const int MAX_LEN = 100;
cin >> n;
cin.get(); // ????n????
for(m = 0 ; m < n ; m++)
{
int a[MAX_LEN + 1], b[MAX_LEN];
char str1[MAX_LEN + 1], str2[MAX_LEN + 1]; // ????????????
cin.getline(str1,MAX_LEN + 1); //???????
cin.getline(str2,MAX_LEN + 1);
int len1 = strlen(str1), len2 = strlen(str2); // ????????
memset(a,0,sizeof(a)); // ??????
memset(b,0,sizeof(b));
int i, j = 0;
for(i = len1 - 1 ; i >= 0 ; i--) // ??????????????
a[j++] = str1[i] - '0';
j = 0;
for(i = len2 - 1 ; i >= 0 ; i--)
b[j++] = str2[i] - '0';
for(i = 0 ; i < MAX_LEN ; i++) // ????
{
a[i] -= b[i];
if(a[i] < 0)
{
a[i] += 10;
a[i + 1]--;
}
}
i = MAX_LEN; // ??????????
while(a[i] == 0)
{
i--;
}
for(; i >= 0 ; i--) // ????????
cout << a[i];
cout << endl;
cin.get();
}
return 0;
}
|
32
|
15,542 |
void main()
{
int n,i,l[2],k;
char a[100][100],b[100][100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s %s",a[i],b[i]);
if (i-n+1) printf("\n");
}
for (i=0;i<n;i++)
{
l[0]=strlen(a[i]);
l[1]=strlen(b[i]);
for (k=1;k<l[1]+1;k++)
{
a[i][l[0]-k]=48+(int)a[i][l[0]-k]-(int)b[i][l[1]-k];
if(a[i][l[0]-k]<48){a[i][l[0]-k]+=10;a[i][l[0]-k-1]=(int)a[i][l[0]-k-1]-1;}
}
for(k=0;k<strlen(a[i]);k++) if(a[i][0]!=48) printf("%c",a[i][k]);else {printf("%c",a[i][k+1]);if (k==strlen(a[i])-2) break;}
printf("\n");
}
}
|
32
|
15,543 |
int main()
{
char c[101],d[101],e[101],f[101];
int a,b,h,n,i,j,m,o;
int tmp;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s",&c,&d);
a=strlen(d);
b=strlen(c);
for(o=0;o<a;o++) f[o]=d[a-o-1];
for(j=0;j<b;j++) e[j]=c[b-j-1];
for(m = 0; m < a; m++)
{
if(e[m]<f[m])
{
e[m]=e[m]+10 - f[m] + '0';
tmp = m;
while(e[++tmp] < '1')
e[tmp] = '9';
e[tmp]--;
}
else e[m]=e[m]-f[m] + '0';
}
for(h = b-1; h > 0; h--) {
if (e[h] != '0') {
break;
}
}
for(; h >= 0; h--)
printf("%d",e[h] - '0');
printf("\n");
}
return 0;
}
|
32
|
15,544 |
//* * * * * * * * * * * * * * * * * * * * * * * *
//*????????? *
//*????????? *
//*????? *
//*???2010.11.17 *
//* * * * * * * * * * * * * * * * * * * * * * * *
int main()
{
int n, i = 0, j = 0, k; // ????n??????????????i,j,k;
char seline1[101], seline2[101]; // ???????
unsigned int an1[101], an2[101]; // ???????
int len1, len2; // len1,len2?????????
cin >> n; // ??n;
// cin.ignore(); // ???????
for (k = 1; k <= n; k++)
{
for (j = 0; j < 101; j++)
{
seline1[j] = 0;
seline2[j] = 0;
}
cin.ignore();
cin.getline(seline1, 101);
cin.getline(seline2, 101); // ???????
//cout << endl;
len1 = strlen(seline1);
len2 = strlen(seline2); // ?????????
memset(an1, 0, sizeof(an1));
memset(an2, 0, sizeof(an2)); // ?????
j = 0;
for (i = len1 - 1; i >= 0; i--)
an1[j++] = seline1[i] - '0'; // ????????????????
j = 0;
for (i = len2 - 1; i >= 0; i--)
an2[j++] = seline2[i] - '0'; // ???
for (i = 0; i <= len1 - 1; i++)
{
if (an1[i] >= an2[i])
an1[i] -= an2[i]; // ?????????????????????
else
{
an1[i] = an1[i] -an2[i] + 10; // ???????????
an2[i + 1]++;
}
}
i = 100;
while (an1[i] == 0)
i--; // ???????0???
for (; i >= 0; i--)
cout << an1[i]; // ???????
cout << endl; // ?????
}
return 0;
}
|
32
|
15,545 |
void main()
{
int l1[25],l2[25],n,t,w,z,q,i,d,k,j;
char c1[25][101],c2[25][101],c[101],a[25][101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",c1[i]);
// gets(c1[i]);????????????????
l1[i]=strlen(c1[i]);
// gets(c2[i]);
scanf("%s",c2[i]);
l2[i]=strlen(c2[i]);
/*if(l1[i]<l2[i]||(l1[i]==l2[i]&&c1[0]<c2[0]))
{
strcpy(c,c1);
strcpy(c1,c2);
strcpy(c2,c);
t=l1[i];l1[i]=l2[i];l2[i]=t;
}*/
d=l1[i]-l2[i];
for(w=l2[i];w<l1[i]-1;w++)
c2[i][w]='0';
c2[i][l1[i]-1]='\0';
q=0;c2[i][l1[i]]='\0';c2[i][l1[i]-1]='0';
while(q!=d)
{
for (z=l1[i];z>0;z--)
{
c2[i][z]=c2[i][z-1];
}
c2[i][0]=c2[i][l1[i]];
q++;
}
c2[i][l1[i]]='\0';
for(k=l1[i];k>=0;k--)
{
if(c1[i][k]>=c2[i][k]) a[i][k]=c1[i][k]-c2[i][k]+48;
if(c1[i][k]<c2[i][k])
{
a[i][k]=c1[i][k]+10-c2[i][k]+48;
c1[i][k-1]=c1[i][k-1]-1;
}
}
a[i][l1[i]]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",a[i]);
}
|
32
|
15,546 |
int main()
{
char a[100][100], b[100][100];
int s[100][100]={0};
int c=0;
int p=0;
int i, j;
int k;
int n;
cin >> n;
for ( i=0; i<n; i++ )
cin >> a[i] >> b[i];
for ( k=0; k<n; k++ )
{
c=0;
p=0;
for ( i=strlen(a[k])-1, j=strlen(b[k])-1; j >= 0; i--, j-- )
{
s[k][c] += a[k][i]-'0'-(b[k][j]-'0');
if ( s[k][c]<0 )
{
s[k][c] += 10;
s[k][c+1]--;
}
c++;
}
for ( ; i >= 0; i-- )
{
s[k][c] += a[k][i]-'0';
if ( s[k][c]<0 )
{
s[k][c] += 10;
s[k][c+1]--;
}
c++;
}
for ( i=100; i >= 0; i-- )
if ( s[k][i] == 0 && p == 0 )
continue;
else
{
p=1;
cout << s[k][i];
}
if ( p == 0 )
cout << "0";
cout << endl;
}
return 0;
}
|
32
|
15,547 |
void main()
{
int p,i,k,l,n,q,d,j;
char s1[101],s2[101],re[101][101];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",s1,s2);
k=strlen(s1);
d=k;
l=strlen(s2);
for(;l>0;l--)
{
if(s1[k-1]>=s2[l-1])
{
p=s1[k-1]-s2[l-1];
s1[k-1]=p+48;
}
else
{
for(q=k-2;s1[q]=='0';q--)
{
s1[q]='9';
}
s1[q]=s1[q]-1;
p=10+(s1[k-1]-s2[l-1]);
s1[k-1]=p+48;
}
k=k-1;
}
for(q=0;q<d;q++)
{
if(s1[q]!=0)
{
re[i][0]=s1[q];
break;
}
}
q=q+1;
for(j=1;q<d;q++)
{ re[i][j]=s1[q];
j++;}
re[i][j]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",re[i]);
}
|
32
|
15,548 |
int main(int argc, char *argv[])
{
char a[100]={'0'},b[100]={'0'};
int n,i,la,lb,k,sub[101]={0},p;
scanf("%d",&n);
for(i=0;i<n;i++){
for(k=1;k<=100;k++){
sub[k]=0;
}
scanf("%s",a);scanf("%s",b);
la=strlen(a);lb=strlen(b);
for(k=1;k<=lb;k++){
if(a[la-k]>=b[lb-k])sub[k]=a[la-k]-b[lb-k];
else{
sub[k]=a[la-k]+10-b[lb-k];
a[la-(k+1)]=a[la-(k+1)]-1;
}
}
for(k=lb+1;k<=la;k++){
sub[k]=a[la-k]-48;
}
printf("\n");
for(k=100;k>0;k--){
if(sub[k]!=0){
p=k;
break;
}
}
for(k=p;k>0;k--){
printf("%d",sub[k]);
}
}
return 0;
}
|
32
|
15,549 |
int main()
{
char s1[256], s2[256];
int c[256], a, b, i, l1, l2, n, j, l;
scanf("%d", &n);
for (j = 0; j < n; j++) {
l = 0;
memset(c, 0, sizeof(c));
scanf("%s%s", s1, s2);
// ??????????
l1 = (int)strlen(s1);
l2 = (int)strlen(s2);
while (l1 > 0 || l2 > 0) {
// ?????????
a = (l1 > 0) ? s1[--l1] - '0' : 0;
b = (l2 > 0) ? s2[--l2] - '0' : 0;
// ????????????????
// ????????????????????
c[l] += a - b;
c[l + 1] = (c[l] - 9) / 10;
c[l] = (c[l] + 10) % 10;
l++;
}
// ??????????????????
while (c[l] == 0 && l > 0)
l--;
for (i = l; i >= 0; i--)
printf("%d", c[i]);
printf("\n");
}
return 0;
}
|
32
|
15,550 |
int main(int argc, char *argv[])
{
char a[1000]={'\0'},b[1000]={'\0'},c[1000]={'\0'};
int n,i,j,m,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<1000;j++)
{
c[j]='\0';
a[j]='\0';
b[j]='\0';
}
scanf("%s",a);
scanf("%s",b);
for(j=0;j<1000;j++)
{
if(a[j]=='\0')
{
m=j;
break;
}
}
for(j=0;j<1000;j++)
{
if(b[j]=='\0')
{
k=j;
break;
}
}
for(j=0;j<=k-1;j++)
{
c[j]=a[m-j-1]-b[k-j-1]+'0';
}
for(j=k;j<m;j++)
c[j]=a[m-j-1];
for(j=0;j<1000;j++)
{
if(c[j]<'0')
{
c[j]=c[j]+10;
c[j+1]=c[j+1]-1;
}
}
for(j=m;j>=0;j--)
{
if(c[j]>='1'&&c[j]<='9')
break;
}
for(j=j;j>=0;j--)
printf("%c",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15,551 |
main()
{
char s[500],t[500],result[10][500];
int n,i,j,k,m=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
gets(s);
gets(t);
k=strlen(s)-1;
for(j=strlen(t)-1;j>=0;j--)
{
if(s[k]>=t[j]){
s[k]=s[k]-t[j]+'0';
k--;
}
else if(s[k]<t[j])
{
s[k-1]--;
s[k]=s[k]+10-t[j]+'0';
k--;
}
}
strcpy(result[m++],s);
if(i!=n-1) scanf("\n");
}
for(i=0;i<m;i++)
{
for(j=0;result[i][j]!='\0';j++)
{
if(result[i][j]!='0')
break;
}
if(result[i][j]=='\0')
printf("0");
else
for(k=j;result[i][k]!='\0';k++)
{
printf("%c",result[i][k]);
}
printf("\n");
}
}
|
32
|
15,552 |
int main()
{
char a[101],b[101];
int A[100],B[100],ans[100];
int line,len1,len2,len3;
cin>>line;
while(line>0)
{
cin>>a;
cin>>b;
len1=strlen(a);
for(int i=len1-1,j=0;i>=0;i--,j++)
A[j]=a[i]-'0';
len2=strlen(b);
for(int i=len2-1,j=0;i>=0;i--,j++)
B[j]=b[i]-'0';
for(int i=0;i<len2;i++)
{
if(A[i]>=B[i])
ans[i]=A[i]-B[i];
else
{
A[i+1]--;
ans[i]=A[i]-B[i]+10;
}
}
for(int i=len2;i<len1;i++)
ans[i]=A[i];
if( len1==len2 && A[len1-1]==B[len2-1] )
len1--;
for(int i=len1-1;i>=0;i--)
cout<<ans[i];
cout<<endl;
line--;
}
return 0;
}
|
32
|
15,553 |
void main()
{
int m,k,i,j,e,d[10][100],t;
char a[10][100],b[10][100];
scanf("%d\n",&m);
for(i=0;i<m;i++)
{
gets(a[i]);
gets(b[i]);
scanf("\n");
}
for(i=0;i<m;i++)
{
k=strlen(a[i]);
t=strlen(b[i]);
for(j=0;j<100;j++)
{
if(a[i][j]!='\0')
a[i][j]=a[i][j]-48;
if(b[i][j]!='\0')
b[i][j]=b[i][j]-48;
}
for(j=k;j>=k-t;j--)
b[i][j]=b[i][j-k+t];
for(j=k-t-1;j>=0;j--)
b[i][j]='\0';
e=0;
for(j=k-1;j>=0;j--)
{
if(a[i][j]-b[i][j]+e<0)
{
d[i][j]=10+a[i][j]-b[i][j]+e;
e=-1;
}
else
{
d[i][j]=a[i][j]-b[i][j]+e;
e=0;
}
}
if(d[i][0]==0)
{
for(j=1;j<k;j++)
printf("%d",d[i][j]);
}
else
{
for(j=0;j<k;j++)
printf("%d",d[i][j]);
}
printf("\n");
}
}
|
32
|
15,554 |
//***********************************
//*???Nov 13, 2013 - ????? **
//*?????? 1300012719 **
//*???2013.11.16 **
//***********************************
int main()
{
int a[101], b[101], n, i, j, t, lena, start;
char cha[101], chb[101]; //a[],b[]???????????,cha,chb????a,b??????,n?????,t???????????,lena??????,start??????????0????
cin >> n; //??????n???????
cin.get();
for (i = 1; i <= n; i++)
{
cin.getline(cha,100); //??????,??a?b?????,???a????a,b????
cin.getline(chb,100);
lena = strlen(cha);
t = lena - strlen(chb);
for (j = 0; j < lena; j++) //??b??????a???,???a,b??lena??????????????,??b[]???????,??????
{
a[j] = cha[j] - '0';
b[j] = chb[j] - '0';
}
for (j = lena - 1; j >= t; j--) //????????b?a?????,?a??t+1???lena??b??????lena-t???????
{
a[j] = a[j] - b[j - t]; //a??j???b??j-t?,??b[]????????????
if (a[j] < 0) //?????????????????????10
{
a[j] = a[j] + 10;
a[j - 1]--;
}
}
for (j = 0; j < 101; j++)
{
if (a[j])
{
start = j; //????????????????0???
break;
}
}
for (j = start; j < lena; j++) //????????a??
cout << a[j];
cout << endl;
cin.get(); //???????
}
return 0;
}
|
32
|
15,555 |
int main()
{
int n;
scanf("%d",&n);
char a[100][100],b[100][100];
int i;
for(i=0;i<n;i++)
scanf("%s%s",&a[i],&b[i]);
int p,q;
for(i=0;i<n;i++)
{
for(p=0;a[i][p]!='\0';p++);
for(q=0;b[i][q]!='\0';q++);
int j,x=0;
for(j=1;j<=q;j++)
{
if((a[i][p-j]+x)<b[i][q-j])
{
a[i][p-j]=a[i][p-j]+10-(b[i][q-j]-'0')+x;
x=-1;
}
else
{
a[i][p-j]=a[i][p-j]-(b[i][q-j]-'0')+x;
x=0;
}
}
a[i][p-j]+=x;
printf("\n%s",a[i]);
}
return 0;
}
|
32
|
15,556 |
void main()
{
int i,n,l,m;
char a[100],b[100];
scanf("%d",&n);
for(;n>0;n--)
{
i=1;
scanf("%s %s",a,b);
l=strlen(b);
m=strlen(a);
while(i<=l)
{
if(a[m-i]>=b[l-i])
a[m-i]=a[m-i]-b[l-i]+48;
else
{
a[m-i]=a[m-i]+58-b[l-i];
a[m-i-1]=a[m-i-1]-1;
}
i++;
}
for(i=m-l-1;m>=0;m--)
{
if(a[i]<'0')
{
a[i]+=10;
a[i-1]=a[i-1]-1;
}
else break;
}
printf("%s\n",a);
}
}
|
32
|
15,557 |
int main()
{
int n,i,s,j,k,t,sum=0,c[200]={0},d[200]={0},e[200]={0};
char a[200]={0},b[200]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
s=strlen(a);
t=strlen(b);
int e[200]={0},c[200]={0},d[200]={0};
for(j=0;j<s;j++) c[j]=a[s-j-1]-48;
for(j=0;j<t;j++) d[j]=b[t-j-1]-48;
for(j=0;j<s;j++)
{
if(c[j]-d[j]>=0) e[j]=c[j]-d[j];
else {e[j]=10+c[j]-d[j]; c[j+1]--;}
}
for(j=s-1;j>=0;j--)
{
if(e[j]!=0) {k=j;break;}
}
for(j=k;j>=0;j--)
{
printf("%d",e[j]);
}
for(j=0;j<=s-1;j++){if(e[j]==0) sum++;}
if(sum==s) printf("0");
printf("\n");
}
return 0;
}
|
32
|
15,558 |
void main()
{
int n,i,j,flag=0;
char m1[100],m2[100],m3[100],m4[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s",m1);
scanf("%s",m2);
scanf("\n");
for(j=0;j<=(strlen(m1)-strlen(m2)-1);j++) m3[j]='0';
m3[j]='\0';
strcat(m3,m2);
for(j=strlen(m1)-1;j>=0;j--)
{
if (m1[j]<'0')
{
m1[j]=m1[j]+10;
m1[j-1]=m1[j-1]-1;
}
if (m1[j]>=m3[j]) m4[j]=m1[j]-m3[j]+'0';
else
{
m4[j]=m1[j]-m3[j]+10+'0';
m1[j-1]=m1[j-1]-1;
}
}
for(j=0;j<=strlen(m1)-1;j++)
{
if(m4[j]!='0') flag=1;
if (flag==1) printf("%c",m4[j]);
}
printf("\n");
}
}
|
32
|
15,559 |
int main()
{
int i, j, n, k, lena, lenb, pos;
char a[101], b[101];
cin >> n;
for(k = 1; k <= n; k++)
{
cin.get();
if(i >= 2)
cout << endl;
cin.getline(a, 101);
cin.getline(b, 101);
lena = strlen(a);
lenb = strlen(b);
int numa[100]={0};
int numb[100]={0};
j = 0;
for(i = lena - 1; i >= 0; i--)
numa[j++] = a[i] - '0';
j = 0;
for(i = lenb - 1; i >= 0; i--)
numb[j++] = b[i] - '0';
for(i = 0; i < lena; i++)
{
numa[i] = numa[i] - numb[i];
if(numa[i] < 0)
{
numa[i] += 10;
numa[i + 1]--;
}
}
i = lena - 1;
while(numa[i] != 0)
{
pos = i;
break;
}
for(i = pos; i >= 0; i--)
cout << numa[i];
cout << endl;
}
return 0;
}
|
32
|
15,560 |
void main()
{
int n,i,j,t,k,p,lena,lenb;
char a[101]={0};
char b[101]={0};
char c[101]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=0;j<=100;j++)
{
a[j]=0;
b[j]=0;
c[j]=0;
}
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
t=0;
p=0;
for(j=1;j<=lena;j++)
{
if(j>lenb)
{
if(t==0)
c[lena-j]=a[lena-j];
else if(t==1)
{
if(a[lena-j]=='0')
{
c[lena-j]='0'+9;
t=1;
}
else
{
c[lena-j]=a[lena-j]-1;
t=0;
}
}
}
else
{
p=(a[lena-j]-'0')-t-(b[lenb-j]-'0');
if(p>=0)
{
c[lena-j]=p+'0';
t=0;
}
else
{
t=1;
c[lena-j]=p+10+'0';
}
}
}
k=0;
for(j=0;j<=lena-1;j++)
{
if(c[j]!='0')
k=1;
if(k)
printf("%c",c[j]);
}
printf("\n");
}
}
|
32
|
15,561 |
//*****************************
//*?????? 1300012809 **
//*???2013.11.16 **
//*???????? **
//*****************************
int main()
{
int n, i, j, k, changdu1, changdu2, jieguo[1005];
char jianshu[1005], beijianshu[1005];
char zhongjian[1005];
cin >> n;
cin.get();
for (k=0; k<n; k++)
{
if (k!=0) cin.get();
cin.getline(beijianshu,1001);
cin.getline(jianshu,1001);
changdu1 = strlen(beijianshu);
changdu2 = strlen(jianshu);
for (i=0; i<changdu1; i++) zhongjian[i] = beijianshu[i];
for (i=0; i<changdu1; i++)
{
beijianshu[i] = zhongjian[changdu1-1-i];
if (beijianshu[i]==' ') beijianshu[i]='0' ;
}
for (i=0; i<changdu2; i++) zhongjian[i] = jianshu[i];
for (i=0; i<changdu2; i++)
{
jianshu[i] = zhongjian[changdu2-1-i];
if (jianshu[i]==' ') jianshu[i]='0' ;
}
//?????
for (i=0; i<changdu2; i++)
{
if (beijianshu[i]<jianshu[i])
{
jieguo[i] = 10 - jianshu[i] + beijianshu[i];
if (beijianshu[i+1] != '0') beijianshu[i+1] -= 1 ;
else
{
j=i;
while(beijianshu[j+1]=='0')
{
beijianshu[j+1] = '9' ;
j = j + 1 ;
}
beijianshu[j+1] -= 1 ;
}
}
else
{
jieguo[i] = beijianshu[i] - jianshu[i] ;
}
}
for (i=changdu2; i<changdu1; i++)
jieguo[i]=beijianshu[i] - '0' ;
if (beijianshu[changdu1-1]=='0') changdu1 -= 1;
for (i=changdu1-1; i>=0; i--) cout << jieguo[i] ;
cout << endl;
}
return 0;
}
|
32
|
15,562 |
int main()
{
int n ;
cin >> n ;
for (int k = 1 ; k <= n ; k ++)
{
char str1[200], str2[200] ;
int num1[200], num2[200] = {0} , num[200] = {0} ;
cin >> str1 >> str2 ;
int len1 = strlen(str1) , len2 = strlen(str2) ;
for (int i = len1 - 1 ; i >= 0 ; i --)
num1[i] = str1[i] - '0' ;
for (int i = len1 - 1 , j = len2 - 1 ; j >= 0 ; i -- , j --)
num2[i] = str2[j] - '0' ;
for (int i = len1 - 1 ; i >= 0 ; i --)
if (num1[i] >= num2[i])
num[i] = num1[i] - num2[i] ;
else
{
num[i] = 10 + num1[i] - num2[i] ;
for (int a = 1 ; a <= i ; a ++)
{
if (num1[i - a] == 0)
{
num1[i - a] = 9 ;
continue ;
}
num1[i - a] -- ;
break ;
}
}
int b = 0 ;
while (num[b] == 0)
b ++ ;
for ( ; b <= len1 - 1 ; b ++)
cout << num[b] ;
cout << endl ;
}
return 0 ;
}
|
32
|
15,563 |
/*********************
*file:4.cpp
*author:??
*time:2013-10-19
*description:??????????
***********************/
int main()
{
int a[110], b[110], c[110];
char str1[110], str2[110];
int n, i, j;
int len1, len2;
cin >> n;
while (n--)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c)); //????????0
cin >> str1 >> str2;
len1 = strlen(str1);
len2 = strlen(str2);
j = 0;
for (i = len1 - 1; i >= 0; i--) //?str1???a???
a[j++] = str1[i] - '0';
j = 0;
for (i = len2 - 1; i >= 0; i--) //?str2???b???
b[j++] = str2[i] - '0';
for (i = 0; i < len1; i++) //?????
{
c[i] += (a[i] - b[i]);
if (c[i] < 0) //??
{
c[i+1]--;
c[i] += 10;
}
}
i = len1 - 1;
while (!c[i]) //???0???
{
i--;
if(i == -1)
break;
}
if (i == -1) //????1????
{
cout<< 0 << endl;
continue;
}
while(i >= 0)
{
cout << c[i];
i--;
}
cout << endl;
}
return 0;
}
|
32
|
15,564 |
void main()
{
char a[101],b[101],c[101];
int n,i,j,k,p=0,q;
int len1,len2;
scanf("%d",&n);
for(i=0;i<=100;i++)
{
c[i]=0;
}
for(i=1;i<=n;i++)
{
scanf("%s",a);
scanf("%s",b);
len1=strlen(a);
len2=strlen(b);
for(j=len2-1;j>=0;j--)
{
b[j+len1-len2]=b[j];
}
for(j=0;j<len1-len2;j++)
{
b[j]='0';
}
for(k=len1-1;k>=0;k--)
{
if(a[k]>=b[k])
c[k]=a[k]-b[k];
else if(a[k]<b[k])
{
c[k]=a[k]+10-b[k];
a[k-1]--;
}
}
while(c[p]==0)
{
p++;
}
for(q=p;q<len1;q++)
{
printf("%d",c[q]);
}
printf("\n");
}
}
|
32
|
15,565 |
void main()
{
char str1[100],str2[100],str3[100]={0};
int a,b,i,j,n,c=1;
scanf("%d",&n);
while(c<=n)
{
scanf("%s",str1);
scanf("%s",str2);
a=strlen(str1);
b=strlen(str2);
for(i=a-1,j=b-1;i>=a-b&&b>=0;i--,j--)
{
if(str1[i]>=str2[j])
str3[i]=str1[i]-str2[j]+'0';
else
{
str3[i]=str1[i]-str2[j]+10+'0';
str1[i-1]=str1[i-1]-1;
}
}
for(i=a-b-1;i>=0;i--)
str3[i]=str1[i];
for(i=0;i<a;i++)
{
if(str3[i]!='0')
break;
}
for(j=i;j<a;j++)
printf("%c",str3[j]);
printf("\n");
c++;
}
}
|
32
|
15,566 |
void main()
{
int n;char a[102],b[102],c[10][102];int i,j,k,m,v,x;
scanf("%d",&n);
for(x=0;x<n;x++)
{
getchar();
for(m=0;m<102;m++)
c[x][m]='0';
for(i=0;i<102;i++)
{
a[i]=getchar();
if(a[i]=='\n') break;
}
for(j=0;j<102;j++)
{
b[j]=getchar();
if(b[j]=='\n') break;
}
for(k=101;k+i-101>=0;k--)
a[k]=a[k+i-101];
for(k=0;k<101-i;k++)
a[k]='0';
for(k=101;k+j-101>=0;k--)
b[k]=b[k+j-101];
for(k=0;k<101-j;k++)
b[k]='0';//?a?b?????
for(k=0;k<=101;k++)
{
if (a[k]!=b[k]) break;//?a,b?????????,????
}
for(m=100;m>=0;m--)
{
if(a[m]<b[m])
{
c[x][m]=a[m]+58-b[m];
a[m-1]=a[m-1]-1;//??
}
else c[x][m]=a[m]+48-b[m];
}
for(i=0;i<102;i++)
a[i]='0';
for(j=0;j<102;j++)
b[i]='0';//??????a?b?0
}
for(x=0;x<n;x++)
{
for(k=0;k<=101;k++)
{
if(c[x][k]!='0') break;
}
for(m=k;m<=100;m++)
printf("%c",c[x][m]);//??
for(k=0;k<=100;k++)
v=v+c[x][k];
if (v==48) printf("0");
printf("\n");
}
}
|
32
|
15,567 |
void main()
{
char a[100][102],b[100][102],c[100][102];
int n,i,j,m,k,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
k=strlen(a[i]);
m=strlen(b[i]);
for(j=k-1;j>=k-m;j--)
{
if(a[i][j]<b[i][j+m-k])
{
c[i][j]=a[i][j]+58-b[i][j+m-k];
a[i][j-1]--;
}
else c[i][j]=a[i][j]+48-b[i][j+m-k];
}
for(j=0;j<k-m;j++)
{
if(a[i][j]>='0') c[i][j]=a[i][j];
else c[i][j]=a[i][j]+10;
}
c[i][k]='\0';
for(j=0;j<k;j++)
{
if(c[i][j]!='0') break;
}
if(a[i][0]=='0')
{
for(j=0;j<k;j++) c[i][j]=c[i][j+1];
}
}
for(i=0;i<n;i++) puts(c[i]);
}
|
32
|
15,568 |
void main()
{
int n=20,i,j,x,y,z;
char **p=(char **)malloc(n*sizeof(char *));
scanf("%d",&n);
if(p!=NULL)
{
for(i=0;i<20;i++)
p[i]=(char *)malloc(100*sizeof(char));
for(i=0;i<2*n;i++)
{
scanf("%s",p[i]);
if(i%2==1)
{
x=strlen(p[i-1]);
y=strlen(p[i]);
for(j=x-1;j>=0;j--)
{
if(j-x+y>=0)
{
z=p[i-1][j]-p[i][j-x+y];
if(z<0)
{
p[i-1][j]='9'+1+z;
p[i-1][j-1]--;
}
else p[i-1][j]='0'+z;
}
else
{
z=p[i-1][j]-'0';
if(z<0)
{
p[i-1][j]='9'+1+z;
p[i-1][j-1]--;
}
else p[i-1][j]='0'+z;
}
}
for(z=0;;z++)
if(p[i-1][z]!='0')
break;
for(j=z;j<x;j++)
printf("%c",p[i-1][j]);
printf("\n");
}
}
}
}
|
32
|
15,569 |
int main()
{
int n=0;
cin>>n;
cin.get();
int i,j,k;
int l1,l2;
char x[201];
char y[201];
int a[201],b[201];
for(k=0;k<n-1;k++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
cin.getline(x,201);
cin.getline(y,201);
cin.get();
l1=strlen(x);
l2=strlen(y);
// cout<<x<<endl;
// cout<<y<<endl;
for(i=0,j=l1-1;i<l1;i++,j--)
{
a[j]=x[i]-'0';
}
for(i=0,j=l2-1;i<l2;i++,j--)
{
b[j]=y[i]-'0';
}
for(i=0;i<l2;i++)
{
a[i]=a[i]-b[i];
if(a[i]<0)
{
a[i]=a[i]+10;
a[i+1]=a[i+1]-1;
}
}
for(i=200;i>=0;i--)
{
if(a[i]!=0)
break;
}
for(i=i;i>=0;i--)
{
cout<<a[i];
}
cout<<endl;
}
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
cin.getline(x,201);
cin.getline(y,201);
l1=strlen(x);
l2=strlen(y);
// cout<<x<<endl;
// cout<<y<<endl;
for(i=0,j=l1-1;i<l1;i++,j--)
{
a[j]=x[i]-'0';
}
for(i=0,j=l2-1;i<l2;i++,j--)
{
b[j]=y[i]-'0';
}
for(i=0;i<l2;i++)
{
a[i]=a[i]-b[i];
if(a[i]<0)
{
a[i]=a[i]+10;
a[i+1]=a[i+1]-1;
}
}
for(i=200;i>=0;i--)
{
if(a[i]!=0)
break;
}
for(i=i;i>=0;i--)
{
cout<<a[i];
}
cout<<endl;
return 0;
}
|
32
|
15,570 |
void main()
{
int i,j,n,k,l;
char c[200][100],s[200][200];
int a[200][100],b[200][200],d[200][200],x[200],y[200];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",c[i],s[i]);
x[i]=strlen(c[i]);
y[i]=strlen(s[i]);
}
for(i=0;i<n;i++)
for(j=0;j<x[i];j++)
{
a[i][j]=c[i][j]-48;
d[i][j]=a[i][j];
}
for(i=0;i<n;i++)
{
for(j=0;j<y[i];j++)
b[i][j]=s[i][j]-48;
}
for(i=0;i<n;i++)
{
k=x[i]-1;
l=y[i]-1;
for(j=k;j>=k-l;j--)
d[i][j]=a[i][j]-b[i][l-k+j];
}
for(i=0;i<n;i++)
for(j=x[i]-1;j>=0;j--)
{
if(d[i][j]<0)
{
d[i][j]=d[i][j]+10;
d[i][j-1]=d[i][j-1]-1;
}
else continue;
}
for(i=0;i<n;i++)
{
for(j=0;j<x[i];j++)
printf("%d",d[i][j]);
printf("\n");
}
}
|
32
|
15,571 |
void main()
{
int a[101][101],b[101][101],c[101][101],x[101][101],y[101][101],j,m,n,t,s,r,q;
scanf("%d",&n);
int i[101]={0};
for(r=0;r<n;r++)
{
q=getchar();
for(i[r]=1;;i[r]++)
{a[r][i[r]]=getchar();
if(a[r][i[r]]=='\n')
{a[r][i[r]]=0;break;}
}
for(j=1;;j++)
{b[r][j]=getchar();
if(b[r][j]=='\n')
{b[r][j]=0;break;}
}
for(m=1;m<i[r];m++)
a[r][m]=a[r][m]-48;
for(m=1;m<j;m++)
b[r][m]=b[r][m]-48;
for(m=1;m<i[r];m++)
x[r][m]=a[r][i[r]-m];
for(m=1;m<j;m++)
y[r][m]=b[r][j-m];
for(m=i[r];m<101;m++)x[r][m]=0;
for(m=j;m<101;m++)y[r][m]=0;
for(m=0;m<101;m++)c[r][m]=0;
for(m=1;m<i[r];m++)
{c[r][m]=(x[r][m]+10-y[r][m])%10;
x[r][m+1]=x[r][m+1]+(x[r][m]+10-y[r][m])/10-1;
}
}
printf("\n");
for(r=0;r<n;r++)
{
for(s=0,t=i[r]-1;t>0;t--)
{if(c[r][t]==0&&s==0)continue;
printf("%d",c[r][t]);
s=1;
}
printf("\n");
}
}
|
32
|
15,572 |
void swi(int l,char s[200]){
int i,t;
for(i=0;i<l/2;i++){
t=s[i];
s[i]=s[l-i-1];
s[l-i-1]=t;
}
return;
}
int main(){
char m[200],n[200],t[200];
int n1,i,j,k,lm,ln,q,flag,num;
scanf("%d",&num);
for(n1=0;n1<num;n1++){
scanf("%s %s",m,n);
flag=0;
lm=strlen(m);
ln=strlen(n);
if(lm<ln)
flag=1;
else if(lm==ln&&strcmp(m,n)<0)
flag=1;
if(flag){
strcpy(t,m);
strcpy(m,n);
strcpy(n,t);
q=lm;
lm=ln;
ln=q;
putchar('-');
}
swi(lm,m);
swi(ln,n);
for(i=0;i<ln;i++){
if(m[i]>=n[i])
m[i]-=n[i];
else{
m[i]=10+m[i]-n[i];
for(k=1;!m[i+k];k++);
for(q=1;q<k;q++)
m[i+q]=9;
m[i+q]--;
}
}
for(i=ln;i<lm;i++)
m[i]-='0';
for(lm--;!m[lm];lm--);
swi(lm+1,m);
for(i=0;i<=lm;i++)
printf("%d",m[i]);
if(n1<num-1)
putchar('\n');
}
return 0;
}
|
32
|
15,573 |
void main()
{
int n,i,j,an,bn,c[100];
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
an=strlen(a);
bn=strlen(b);
for(j=0;j<an;j++)
{
if(j<an-bn)
c[j]=a[j]-48;
else
if(a[j]>=b[j+bn-an])
c[j]=a[j]-b[j+bn-an];
else
{
c[j]=a[j]+10-b[j+bn-an];
if(c[j-1]!=0)
{
c[j-1]=c[j-1]-1;
}
else
if(c[j-2]!=0)
{
c[j-1]=9;
c[j-2]=c[j-2]-1;
}
else
if(c[j-3]!=0)
{
c[j-1]=9;
c[j-2]=9;
c[j-3]=c[j-3]-1;
}
}
}
for(j=0;j<an;j++)
{
printf("%d",c[j]);
if(j==an-1)
printf("\n");
}
}
}
|
32
|
15,574 |
int main()
{ int i,j,k;
char a[101]={'\0'},b[101]={'\0'},c[101]={'\0'};
int m[100]={0},n[100]={0},ans[100]={0},counter;
cin>>k;
for(counter=0;counter<k;counter++)
{
gets(a);
gets(a);
// puts(a);
gets(b);
// puts(b);
for(j=0;a[j]!='\0';j++)
{
m[j]=a[j]-48;
}
int m_c=j-1;
for(j=0;b[j]!='\0';j++)
{
n[j]=b[j]-48;
}
int n_c=j-1; //??????????????m_c+1?n_c+1?????????
for(i=0;i<=m_c;i++) //??m?n?????????????????????????????
{
if(i<=n_c)
{
if(m[m_c-i]>=n[n_c-i])
ans[i]=m[m_c-i]-n[n_c-i];
else { ans[i]=m[m_c-i]+10-n[n_c-i]; m[m_c-i-1]=m[m_c-i-1]-1;}
}
else
{
ans[i]=m[m_c-i];
}
}
for(i=0;i<=m_c;i++)
{
cout<<ans[m_c-i];
} cout<<'\n';
}
}
|
32
|
15,575 |
int a[10000]={0},b[10000]={0},c[10000],d[10000];
void jian(int a[10000],int b[10000])
{
int i,j,k,m;
for (i=0;i<=9000;i++) c[i]=0;
m=a[0]+b[0]-1;
for (i=1;i<=a[0]+b[0]-1;i++)
{
c[i]=c[i]+a[i]-b[i];
if (c[i]<0)
{
c[i+1]=-1;
c[i]+=10;
}
}
j=m+10;
while (j>1&&c[j]==0) j--;
for (i=j;i>=1;i--)
cout <<c[i];
cout <<endl;
}
int main()
{
int i,j,k,m,n;
int len1=0,len2=0;
char s1[10000],s2[10000];
cin >>n;
for (j=1;j<=n;j++)
{
for (i=0;i<=9000;i++) {a[i]=0;b[i]=0;}
cin >>s1;
cin >>s2;
len1=strlen(s1);
len2=strlen(s2);
a[0]=len1;
b[0]=len2;
for (i=1;i<=len1;i++)
a[len1-i+1]=((int)s1[i-1])-48;
for (i=1;i<=len2;i++)
b[len2-i+1]=((int)s2[i-1])-48;
jian(a,b);
}
return 0;
}
|
32
|
15,576 |
char a[200],b[200];
int alen;
void init();
void minus();
void output();
int main()
{
int n,i;
cin>>n;
for (i=0;i<n;i++)
{
cin>>a>>b;
init();
minus();
output();
}
}
void init()
{
int len1,len2,temp,i;
alen=len1=strlen(a);
for (i=0;i<(len1+1)/2;i++)
{
temp=a[i];
a[i]=a[len1-i-1];
a[len1-i-1]=temp;
}
for (i=0;i<len1;i++)
{
a[i]-='0';
}
len2=strlen(b);
for (i=0;i<(len2+1)/2;i++)
{
temp=b[i];
b[i]=b[len2-i-1];
b[len2-i-1]=temp;
}
for (i=0;i<len2;i++)
{
b[i]-='0';
}
for (i=len2;i<len1;i++)
{
b[i]=0;
}
}
void minus()
{
int p,len,tp;
p=0;
while (p<alen)
{
if (a[p]>=b[p])
{
a[p]-=b[p];
}
else if (a[p]<b[p])
{
tp=p+1;
while (a[tp]==0)
{
a[tp]=9;
tp++;
}
a[tp]--;
a[p]=a[p]+10-b[p];
}
p++;
}
}
void output()
{
int len,i,t;
while (a[alen]==0)
{
if (alen==0)
{
cout<<0<<endl;
return;
}
alen--;
}
for (i=alen;i>=0;i--)
{
t=a[i];
cout<<t;
}
cout<<endl;
}
|
32
|
15,577 |
void main()
{
char c[100][105];
int i,j,j1,j2,n,len1,len2;
scanf("%d",&n);
for(i=0;i<2*n;i=i+2)
{
scanf("%s%s",c[i],c[i+1]);
}
for(i=0;i<2*n;i=i+2)
{
len1=strlen(c[i]),len2=strlen(c[i+1]);
for(j1=len1-1,j2=len2-1;j2>=0;j1--,j2--)
{
if(c[i][j1]>=c[i+1][j2])
c[i][j1]=c[i][j1]-c[i+1][j2]+48;
else
{
c[i][j1]=c[i][j1]+58-c[i+1][j2];
c[i][j1-1]=c[i][j1-1]-1;
}
}
for(j=0;j<len1;j++)
printf("%c",c[i][j]);
printf("\n");
}
}
|
32
|
15,578 |
int main()
{
int n, i, j, cnt = 0;
cin >> n;
int a[100], b[100], c[100];
char num1[101], num2[101];
while(cnt < n)
{
cin >> num1;
cin >> num2;
int len1 = strlen(num1);
int len2 = strlen(num2);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
j = 0;
for(i = len1 - 1; i >= 0; i--)
a[j++] = num1[i] - '0';
j = 0;
for(i = len2 - 1; i >= 0; i--)
b[j++] = num2[i] - '0';
for(i = 0; i < len2; i++)
{
if(a[i] < b[i])
{
if(a[i] == -1)
a[i] = 9;
else
a[i] += 10;
a[i + 1]--;
}
c[i] = a[i] - b[i];
}
if(len1 > len2)
{
for(i = len2; i < len1; i++)
c[i] = a[i];
}
for(i = len1 - 1 ; i >= 0; i--)
cout << c[i];
cout << endl;
cnt++;
}
return 0;
}
|
32
|
15,579 |
int main()
{
int n;
cin>>n;
while( n>0 )
{
n--;
char c1[110],c2[110],c[110];
cin>>c1>>c2;
int len1=strlen(c1);
int len2=strlen(c2);
int len=len1+1;
for( int i=0 ; i<110 ; i++ )
{
c[i]=1;
}
if( len2>len1 )
{
len=len2+1;
}
if( c1[0]=='0' && c2[0]=='0' && len1==1 && len2==1 )
{
cout<<"0"<<endl;
}
else
{
for( int i=len1-1 ; i>=0 ; i-- )
{
c1[i+len-len1]=c1[i];
}
for( int i=len-len1-1 ; i>=0 ; i-- )
{
c1[i]='0';
}
for( int i=len2-1 ; i>=0 ; i-- )
{
c2[i+len-len2]=c2[i];
}
for( int i=len-len2-1 ; i>=0 ; i-- )
{
c2[i]='0';
}
for( int i=len-1 ; i>=0 ; i-- )
{
c[i]+='0'+c1[i]-c2[i]-1;
if( c[i]<'0' )
{
c[i]+=10;
c[i-1]--;
}
}
for( int i=0 ; ; i++ )
{
if( c[i]!='0' )
{
for( int j=i ; j<len ; j++ )
{
cout<<c[j];
}
cout<<endl;
break;
}
}
}
}
}
|
32
|
15,580 |
void main()
{
int n,j[100][2],i,a[100][100]={0},b,c[100][100]={0},d,p,q,r;
char e[100][100],f[100][100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",&e[i]);
scanf("%s",&f[i]);
}
for (i=0;i<n;i++)
{
j[i][0]=strlen(e[i]);
j[i][1]=strlen(f[i]);
for (p=0;p<j[i][0];p++)
a[i][p]=e[i][j[i][0]-p-1]-48;
for (p=0;p<j[i][1];p++)
c[i][p]=f[i][j[i][1]-p-1]-48;
}
for (i=0;i<n;i++)
{
for(d=0;d<j[i][0];d++)
{
if (a[i][d]>=c[i][d])
a[i][d]-=c[i][d];
else
{
a[i][d]=a[i][d]-c[i][d]+10;
a[i][d+1]--;
}
}
}
for (i=0;i<n;i++)
{
for(d=j[i][0]-1,r=0;d>=0;d--)
{
if (a[i][d]!=0)
r++;
if (r!=0)
printf("%d",a[i][d]);
}
printf("\n");
}
}
|
32
|
15,581 |
void main()
{
int n,i,j,l[20],s[20];
char a[20][100],b[20][100],c[20][100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",a[i],b[i]);
l[i]=strlen(a[i]);
s[i]=strlen(b[i]);
}
for(i=0;i<n;i++)
{
for(j=l[i]-1;j>=0;j--)
{
if(s[i]>0)
{
if(a[i][j]>=b[i][s[i]-1])
{
c[i][j]=a[i][j]-b[i][s[i]-1]+48;
s[i]=s[i]-1;
}
else
{
c[i][j]=10+a[i][j]-b[i][s[i]-1]+48;
a[i][j-1]=a[i][j-1]-1;
s[i]=s[i]-1;
}
}
else
{
c[i][j]=a[i][j];
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<l[i];j++)
{
printf("%c",c[i][j]);
}
printf("\n");
}
}
|
32
|
15,582 |
void main()
{int n,d,e,i,k,carry=0;
char a[101]={0},b[101]={0},c[101]={0};
char *p1=a,*p2=b;
void move(char *p,int m);
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{gets(a);
gets(a);
gets(b);
d=strlen(a);
e=strlen(b);
move(p1,d);
move(p2,e);
for(k=99-d+1;k<=99-e;k++)
b[k]='0';
for(k=99;k>=99-d+1;k--)
{
b[k]=b[k]-'0';
a[k]=a[k]-'0';
if(carry+b[k]>a[k])
{c[k]=a[k]-b[k]+10-carry;
carry=1;}
else
{c[k]=a[k]-b[k]-carry;
carry=0;}
c[k]=c[k]+'0';
}
for(k=0;k<=99;k++)
{if(c[k]!=0)
printf("%c",c[k]);}
printf("\n");
for(k=0;k<=100;k++)
c[k]=0;
carry=0;
}}
void move(char *p,int m)
{ int h;
*(p+100)=0;
for(h=99;h>=99-m+1;h--)
*(p+h)=*(p+h-100+m);
for(h=0;h<=99-m;h++)
*(p+h)=0;
}
|
32
|
15,583 |
int main()
{
int n,i,p,q,t,j;
scanf("%d",&n);
scanf("\n");
char a[100],b[100],c[100];
for(i=0;i<=99;i++)
{
a[i]='\0';
}
for(i=0;i<=99;i++)
{
b[i]='\0';
}
for(i=1;i<=n;i++)
{
gets(a);
gets(b);
scanf("\n");
p=strlen(a);
q=strlen(b);
for(t=1;t<=q;t++)
{
if(a[p-t]>=b[q-t])
c[p-t]=a[p-t]-b[q-t]+48;
else
{
c[p-t]=a[p-t]+58-b[q-t];
a[p-t-1]=a[p-t-1]-1;
}
}
for(t=0;t<=p-q-1;t++)
{
c[t]=a[t];
}
for(j=0;j<=p-1;j++)
{
printf("%c",c[j]);
}
printf("\n");
}
return 0;
}
|
32
|
15,584 |
void f(void);
void main()
{
int n,i;
scanf("%d",&n);
for (i=0;i<n;i++)
f();
}
void f()
{
int i,x,y,n=0;
char a[101]={""},b[101]={""};
scanf("%s%s",a,b);
x=strlen(a);
y=strlen(b);
for (i=0;i<=y-1;i++)
if (a[x-1-i]>=b[y-1-i]) a[x-1-i]=a[x-1-i]-b[y-1-i]+48;
else {a[x-2-i]=a[x-2-i]-1;a[x-1-i]=a[x-1-i]-b[y-1-i]+10+48;}
while(a[n]=='0')
{ n++;}
for (i=n;i<=x-1;i++)
printf("%c",a[i]);
printf("\n");
}
|
32
|
15,585 |
int main()
{
char num1[101],num2[101];
int n;
cin>>n;
int i=0;
for(;i<n;i++)
{
cin>>num1;
cin>>num2;
int len=strlen(num1);
int j=strlen(num2);
int k=len,q=j;
for(;k>=len-j;k--,q--)
num2[k]=num2[q];
for(k=0;k<len-j;k++)
num2[k]='0';
num1[len]=num2[len]=0;
for(j=len-1;j>=0;j--)
{
if(num1[j]>=num2[j])
num1[j]=num1[j]-num2[j]+48;
else if(num1[j]>=num2[j] && num1[j-1]==0)
{
num1[j-1]=9;
num1[j]=(10+num1[j]-num2[j]+48);
}
else
{
num1[j]=(10+num1[j]-num2[j]+48);
num1[j-1]--;
}
}
cout<<num1<<endl;
}
return 0;
}
|
32
|
15,586 |
void main()
{
int i,j,k,n,t[100],n1,n2;
char a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",a,b);
n1=strlen(a);
n2=strlen(b);
for(j=n1-1,k=n2-1;k>=0;k--)
{
if(a[j]<b[k])
{
t[j]=a[j]-b[k]+10;
a[j-1]=a[j-1]-1;
}
else
{
t[j]=a[j]-b[k];
}
j--;
}
for(j=0;j<n1-n2;j++)
{
t[j]=a[j]-'0';
}
for(j=0;j<n1;j++)
{
printf("%d",t[j]);
}
printf("\n");
}
}
|
32
|
15,587 |
void main()
{
int n,i,j,t,len1,len2;int k=0;
char a[100],b[100],str3[100];
int c[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",a,b);
len1=strlen(a);
len2=strlen(b);
t=0;
for(j=1;j<=len2;j++)
{
c[j]=t+a[len1-j]-b[len2-j]+10*(a[len1-j]+t<b[len2-j]);
t=-1*(a[len1-j]-b[len2-j]+t<0);
}
if(len1-len2-1>=0)
{
for(j=len2+1;j<=len1;j++)
{
c[j]=t+a[len1-j]-48+10*(a[len1-j]-48+t<0);
t=-1*(a[len1-j]-48+t<0);
}
}
k=0;
for(j=len1;j>=1;j--)
{
if(c[j]==0)
k++;
else break;
}
for(j=len1-k;j>=1;j--)
printf("%d",c[j]);
printf("\n");
}
}
|
32
|
15,588 |
int main()
{
char a[100][101],b[100][101],j[100][101],A[100][101],B[100][101];
int ac,bc,i,k,c,j1,j2,sw,p,n,i2;
scanf("%d", &n);
for (i=0;i<n;i++)
{
scanf("%s%s", a[i],b[i]);
ac=strlen(a[i]);
bc=strlen(b[i]);
if (ac>bc)
{
c=ac;
for (i2=0;i2<ac-bc;i2++)
B[i][i2]='0';
B[i][i2]='\0';
strcat(B[i], b[i]);
strcpy(A[i],a[i]);
}
if (ac<bc)
{
c=bc;
for (i2=0;i2<bc-ac;i2++)
A[i][i2]='0';
A[i][i2]='\0';
strcat(A[i], a[i]);
strcpy(B[i], b[i]);
}
if (ac==bc)
{
c=ac;
strcpy(A[i],a[i]);
strcpy(B[i],b[i]);
}
sw=0;
for (i2=c-1,k=0;i2>=0;i2--,k++)
{
j1=A[i][i2]-'0';
j2=B[i][i2]-'0';
if (j1-sw-j2>=0)
{
j[i][k]=j1-sw-j2+'0';
sw=0;
}
else
{
j[i][k]=10+j1-sw-j2+'0';
sw=1;
}
}
j[i][k]='\0';
if (i!=n-1)
printf("\n");
}
for (i2=0,p=0;i2<n;i2++)
{
c=strlen(j[i2]);
for (i=c-1;j[i2][i]=='0';i--)
p+=1;
for (i=c-p-1;i>=0;i--)
{
printf("%c", j[i2][i]);
}
if (i2!=n-1)
printf("\n");
}
return 0;
}
|
32
|
15,589 |
//********************************
//*???????? **
//*?????? 1300012713 **
//*???2013.11.15 **
//********************************
int main()
{
char a[105], b[105];
int n;
cin >> n;
for(int m = 1; m <= n; m++)
{
cin >> a;
cin >> b;
int aa[105] = {0}, bb[105] = {0};
int aline = strlen(a), bline = strlen(b);
for(int i = 1; i <= aline; i++)
{
aa[aline-i+1] = a[i-1] - '0';
}
for (int j = 1; j <= bline; j++)
{
bb[bline-j+1] = b[j-1]-'0';
}
for(int k = 1; k <= aline; k++)
{
if(aa[k] >= bb[k]) aa[k] = aa[k] - bb[k];
else
{
aa[k] = aa[k] - bb[k] + 10;
aa[k+1] = aa[k+1] - 1;
}
}
for(int l = aline;l >= 1; l--)
{
if(aa[l] == 0 && l == aline)
continue;
cout << aa[l];
}
if(m!=n) cout << "\n";
}
cin.get();
return 0;
}
|
32
|
15,590 |
void f(char a[],char b[])
{
int i,m,n,j;
char c[100];
for(i=0;i<100;i++)
c[i]=0;
m=strlen(a);
for(j=m-1;j>=0;j--)
{
a[j+100-m]=a[j];
a[j]='0';
}
if(a[m]==0) a[m]='0';
n=strlen(b);
for(j=n-1;j>=0;j--)
{
b[j+100-n]=b[j];
b[j]='0';
}
if(b[n]==0) b[n]='0';
for(i=99;i>=0;i--)
{
if(a[i]>=b[i])
c[i]=a[i]-b[i];
else
{
c[i]=a[i]+10-b[i];
a[i-1]=a[i-1]-1;
}
}
for(j=0;j<100;j++)
{
if(c[j]!=0)
break;
}
for(j;j<=99;j++)
printf("%d",c[j]);
printf("\n");
}
void main()
{
char a[100],b[100];
int i,num,j;
scanf("%d",&num);
getchar();
for(i=0;i<num;i++)
{
for(j=0;j<100;j++){
a[j]='0';
b[j]='0';
}
gets(a);
gets(b);
f (a,b);
getchar();
}
}
|
32
|
15,591 |
int leap(int *p,int n)
{
if(n==0) return -1;
if((*p)!=0) return 0;
else return leap(p+1,n-1)+1;
}
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char a[100],b[100];
int j,k=0,f=0,c[100]={0};
scanf("%s %s",a,b);
int len1=strlen(a),len2=strlen(b);
if(len1<len2) f=-1;
else if(len1==len2)
for(j=0;j<len1;j++)
if(a[j]<b[j])
{
f=-1;
break;
}
if(f==-1)
{
printf("-");
char s[100];
strcpy(s,a);
strcpy(a,b);
strcpy(b,s);
int len=len1;
len1=len2;
len2=len;
}
for(j=len2-1;j>=0;j--)
b[j+len1-len2]=b[j];
for(j=len1-len2-1;j>=0;j--)
b[j]='0';
for(j=len1-1;j>=0;j--)
{
c[j]=a[j]-b[j]-k;
if(c[j]<0)
{
c[j]+=10;
k=1;
}
else k=0;
}
j=leap(c,len1);
if(j==-1) printf("0");
else
for( ;j<len1;j++)
printf("%d",c[j]);
printf("\n");
}
return 0;
}
|
32
|
15,592 |
int main(){
char a[20][100],b[20][100];
char c[20][100];
int i,len1,len2,d,n,cycle;
scanf("%d\n",&n);
for(cycle=0;cycle<n;cycle++)
{
gets(a[cycle]);
gets(b[cycle]);
scanf("\n");
len1=strlen(a[cycle]);
len2=strlen(b[cycle]);
d=len1-len2;
for(i=len1-1;i>=0;i--){
if(i>=d){
c[cycle][i]=a[cycle][i]-b[cycle][i-d]+48;
if(a[cycle][i]<b[cycle][i-d]){
a[cycle][i-1]=a[cycle][i-1]-1;
c[cycle][i]+=10;}
}else c[cycle][i]=a[cycle][i];
}
len2=0;d=0;i=0;len1=0;
}
int j;
for(j=0;j<n;j++){
printf("%s\n",c[j]);
}
}
|
32
|
15,593 |
//******************************************************
//* ? ? ? ?? ? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 11 ? 17 ? *
//* ? ? ?1000010185 *
//******************************************************
int main()
{
char aa[101], bb[101]; //?????????
int a[101], b[101], c[101];
int n, la, lb;
cin >> n;
for (int i = 0; i < n; i ++)
{
cin >> aa >> bb;
la = strlen(aa);
lb = strlen(bb);
for (int j = 0; j < la; j ++) //???????????
a[j] = aa[j] - 48;
for (int j = 0; j < lb; j ++)
b[j] = bb[j] - 48;
for (int j = 1; j <= lb; j ++) //????????????
c[la - j] = a[la - j] - b[lb - j];
for (int j = 0; j < la - lb; j ++) //b?????????0??????
c[j] = a[j];
for (int j = la - 1; j > 0; j --) //??????0??????10??????1(????
if (c[j] < 0)
{
c[j] += 10;
c[j - 1] -= 1;
}
int k;
for (int j = 0; j < la; j ++) //???????0??
if (c[j] != 0)
{
k = j;
break;
}
for (int j = k; j < la; j ++) //????
cout << c[j];
cout << endl;
}
return 0;
}
|
32
|
15,594 |
//******************************************************
//* ? ? ? ?? ? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 11 ? 17 ? *
//* ? ? ?1000010185 *
//******************************************************
int main()
{
char aa[100], bb[100]; //?????????
int a[100], b[100], c[100];
int n, la, lb;
cin >> n;
for (int i = 0; i < n; i ++)
{
cin >> aa >> bb;
la = strlen(aa);
lb = strlen(bb);
for (int j = 0; j < la; j ++) //???????????
{
a[j] = aa[j] - 48;
b[j] = bb[j] - 48;
}
for (int j = 1; j <= lb; j ++) //????????????
c[la - j] = a[la - j] - b[lb - j];
for (int j = 0; j < la - lb; j ++) //b?????????0??????
c[j] = a[j];
for (int j = la - 1; j > 0; j --) //??????0??????10??????1(????
if (c[j] < 0)
{
c[j] += 10;
c[j - 1] -= 1;
}
int k;
for (int j = 0; j < la; j ++) //???????0??
if (c[j] != 0)
{
k = j;
break;
}
for (int j = k; j < la; j ++) //????
cout << c[j];
cout << endl;
}
return 0;
}
|
32
|
15,595 |
void main()
{
int n,i,j,p,l,k,q;
char s1[100][100],s2[100][100],a[100],t[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",s1[i],s2[i]);
}
for(i=0;i<n;i++)
{
l=0;
p=strlen(s1[i]);
q=strlen(s2[i]);
for(j=p-q-1;j<p;j++)
{t[l++]=s1[i][j];}
for(j=q;j>=1;j--)
{
if(t[j]>=s2[i][j-1])
a[j]=(t[j]-s2[i][j-1]);
else
{
a[j]=(t[j]+10-s2[i][j-1]);
t[j-1]=t[j-1]-1;
}
}
a[0]=t[0]-'0';
for(k=0;k<p-1-q;k++)
{
printf("%c",s1[i][k]);
}
for(k=0;k<=q;k++)
{
printf("%d",a[k]);
}
printf("\n");
}
}
|
32
|
15,596 |
void subtract(char a[100], char b[100])
{
int re[100];
int lena,lenb,i,j,m=0;
lena=strlen(a);
lenb=strlen(b);
for(i=0;i<lena;i++)
re[i]=a[i]-48;
for(i=lena-1,j=lenb-1;j>=0;i--,j--)
{
re[i]=re[i]+48-b[j];
if(re[i]<0)
{
re[i-1]--;
re[i]+=10;
}
}
for(i=0;i<lena;i++)
{
if(m==0&&re[i]==0)continue;
else {printf("%d",re[i]);m=1;}
}
printf("\n");
}
main()
{
int n,i,k;
char inp[100][100];
scanf("%d",&n);
k=3*n;
// printf("k=%d\n",k);
for(i=0;i<k;i++)
{
// printf("i=%d\n",i);
gets(inp[i]);
// printf("i=%d\n",i);
}
// printf("len=%d\n",strlen(inp[0]));
// printf("str=%s\n",inp[3]);
for(i=0;i<n;i++)
subtract(inp[3*i+1],inp[3*i+2]);
}
|
32
|
15,597 |
main()
{
int i,n,k,m,m1;
int a[100],b[100]={0},c[100];
char str1[100],str2[100];
scanf("%d",&n);
for(k=1;k<=n;k++)
{
scanf("%s%s",str1,str2);
for(i=0;str1[i]!='\0';i++);
m=i;
for(i=1;i<=m;i++)
a[i]=str1[m-i]-48;
for(i=0;str2[i]!='\0';i++);
m1=i;
for(i=1;i<=m1;i++)
b[i]=str2[m1-i]-48;
for(i=1;i<=m;i++)
{
if(a[i]<b[i]) c[i]=a[i]-b[i]+10,a[i+1]=a[i+1]-1;
else c[i]=a[i]-b[i];
}
if(c[m]==0) for(i=m-1;i>0;i--) printf("%d",c[i]);
else for(i=m;i>0;i--) printf("%d",c[i]);
printf("\n");
for(i=1;i<=100;i++) b[i]=0;
}
}
|
32
|
15,598 |
char a[100],b[100];int c[100];
int main()
{
//freopen("1.in","r",stdin);
//freopen("1.out","w",stdout);
int n;
cin>>n;
while(n--)
{
cin>>a>>b;
int lena=strlen(a);
int lenb=strlen(b);
for(int i=0;i<lena/2;i++)
{
char t=a[i];
a[i]=a[lena-1-i];
a[lena-1-i]=t;
}
for(int i=0;i<lenb/2;i++)
{
char t=b[i];
b[i]=b[lenb-1-i];
b[lenb-1-i]=t;
}
for(int i=0;i<lenb;i++)
c[i]=a[i]-b[i];
for(int i=lenb;i<lena;i++)
c[i]=a[i]-'0';
for(int i=0;i<lena-1;i++)
if(c[i]<0) {
c[i]=10+c[i];
c[i+1]-=1;
}
for(int i=lena-1;i>=0;i--)
{
if(c[i]!=0)
{
for(int j=i;j>=0;j--)
cout<<c[j];
cout<<endl;
break;
}
}
}
return 0;
}
|
32
|
15,599 |
/*
* dazhengshujianfa.cpp
*
* Created on: 2010-11-17
* Author: Administrator
*/
int main(){
int n,i,j,lenth1,lenth2,carry;
carry=0;
cin>>n;
char a[101],b[101],c[101];
for(i=1;i<=n;i++){
carry=0;
cin>>a;
cin>>b;
lenth1=strlen(a);
lenth2=strlen(b);
for(j=lenth2;j<lenth1;j++){
b[j]='0';
}
strcpy(c,a);
for(j=1;j<=lenth2;j++){
c[lenth1-j]=a[lenth1-j]-b[lenth2-j]-carry+'0';
if(c[lenth1-j]-'0'<0){
carry=1;
c[lenth1-j]+=10;
}
else carry=0;
}
if(lenth1>lenth2){
if(carry==1){
c[lenth1-lenth2-1]-=1;
}
}
if(c[0]=='0') c[0]='\0';
for(j=0;j<lenth1;j++){
cout<<c[j];
}
cout<<endl;
}
return 0;
}
|
32
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.