label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
32
|
15700
|
//***************************
//*???????? **
//*?????? **
//*???2013.11.15 **
//***************************
int main()
{
int n;
cin>>n;
for(int k=1;k<=n;k++)
{
const int MAX_LEN = 200;
unsigned num1[MAX_LEN+1];
unsigned num2[MAX_LEN];
char str1[MAX_LEN + 1];
char str2[MAX_LEN + 1];
cin.get();
cin.getline(str1, MAX_LEN + 1);
cin.getline(str2, MAX_LEN + 1);
int nLen1 = strlen(str1);
int nLen2 = strlen(str2);
memset(num1, 0, sizeof(num1));
memset(num2, 0, sizeof(num2));
int i, j = 0;
for (i = nLen1 - 1; i >= 0; i--)
num1[j++] = str1[i] - '0'; //???????????????
j = 0;
for (i = nLen2 - 1; i >= 0; i--)
num2[j++] = str2[i] - '0';
for (i = 0; i < MAX_LEN; i++)
{
num1[i] -= num2[i]; //???????????
if(num1[i] >= 10) //????????
{
num1[i] += 10;
num1[i + 1]--; //????
}
}
i = MAX_LEN;
while (num1[i]==0)
i--; //???????0??
for (; i >= 0; i--)
cout << num1[i]; //??????
cout << endl;
}
return 0;
}
|
32
|
15701
|
char a[100];
char b[100];
int l,m,n,i,j,temp;
void main()
{
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%s%s",a,b);
l=strlen(a)-1;
m=strlen(b)-1;
for (j=0;j<=(l-1)/2;j++)
{temp=a[j];a[j]=a[l-j];a[l-j]=temp;}
for (j=0;j<=(m-1)/2;j++)
{temp=b[j];b[j]=b[m-j];b[m-j]=temp;}
for (j=m+1;j<=l;j++)
b[j]='0';
for (j=0;j<=l;j++)
if (a[j]<b[j])
{
a[j+1]--;
a[j]=10+a[j]-b[j];
}
else a[j]=a[j]-b[j];
while (a[l]==0 && l>=0) l--;
for (j=l;j>=0;j--)
printf("%d",a[j]);
if (l==-1) printf("0\n"); else printf("\n");
}
}
|
32
|
15702
|
int main(int argc, char* argv[])
{
int n,i,l1,l2,j,k,s=1;
char a[100],b[100],c[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%s",a,b);
for(l1=strlen(a)-1,l2=strlen(b)-1,j=0;l2>=0;l1--,l2--)
{
c[j]=a[l1]-b[l2];
j++;
}
for(l1=strlen(a)-strlen(b)-1;l1>=0;l1--)
{
c[j]=a[l1]-48;
j++;
}
for(k=0;k<j;k++)
{
if(c[k]<0)
{
c[k]=10+c[k];
c[k+1]--;
}
}
for(k=j-1;k>=0;k--){
if(c[k]!=0){
for(l2=k;l2>0;l2--)
printf("%d",c[l2]);
printf("%d\n",c[0]);
break;
}
}
for(l1=j-1;l1>=0;l1--)
{
if(c[l1]!=0)
{
s=1;
break;
}
else
s=0;
}
if(s==0)
printf("0\n");
}
return 0;
}
|
32
|
15703
|
void main()
{
char str1[100],str2[100],str3[100];
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;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
|
15704
|
int main()
{
int n;
cin>>n;
while(n--)
{
getchar();
char a[260]={0},b[260]={0},c[260]={0};
cin.getline(a,255);
cin.getline(b,255);
int a1[260]={0},b1[260]={0},c1[260]={0},i=0,na,nb;
while(a[++i]!=0)
;
na=i;
while(i-->0)
a1[251-na+i]=a[i]-'0';
while(b[++i]!=0)
;
nb=i;
while(i-->0)
b1[251-nb+i]=b[i]-'0';
for(i=255;i>0;i--)
{
c1[i]+=a1[i]-b1[i];
if(c1[i]<0)
{
c1[i]+=10;
c1[i-1]-=1;
}
}
for(i=0;c1[i]==0&&i<255;i++)
;
if(i==255)
cout<<"0";
else
for(;i<251;i++)
cout<<c1[i];
cout<<endl;
}
return 0;
}
|
32
|
15705
|
int main()
{
int N,i,l1,l2,loop,t,s;
char n1[410],n2[410];
int a[410],b[410],c[410];
int num(char c);
scanf("%d",&N);
for(loop=1;loop<=N;loop++)
{
scanf("%s",n1);
scanf("%s",n2);
memset(a,0,410*sizeof(int));
memset(b,0,410*sizeof(int));
t=0;
s=0;
l1=strlen(n1);
l2=strlen(n2);
for(i=0;i<=l1-1;i++)
a[i]=num(n1[l1-1-i]);
for(i=0;i<=l2-1;i++)
b[i]=num(n2[l2-1-i]);
for(i=0;i<410;i++)
if(a[i]-b[i]-t>=0)
{
c[i]=a[i]-b[i]-t;
t=0;
}
else
{
c[i]=a[i]-b[i]-t+10;
t=1;
}
for(i=409;i>=0;i--)
{
if(c[i]!=0)
s=1;
if(s==1)
printf("%d",c[i]);
}
if(s==0)
printf("0");
printf("\n");
}
return 0;
}
int num(char c)
{
return c-'0';
}
|
32
|
15706
|
void main()
{int n,i,l,al,bl;
char a[101],b[101];
scanf("%d",&n);
l=n;
while(l>0)
{scanf("%s",&a);
scanf("%s",&b);
al=strlen(a);
bl=strlen(b);
for(i=100;i>=101-al;i--)
a[i]=a[i-101+al]-48;
for(i=100;i>=101-bl;i--)
b[i]=b[i-101+bl]-48;
for(i=0;i<=100-al;i++)
a[i]=0;
for(i=0;i<=100-bl;i++)
b[i]=0;
for(i=100;i>=101-al;i--)
{a[i]=a[i]-b[i];
if(a[i]<0)
{a[i]=a[i]+10;
a[i-1]=a[i-1]-1;
}
}
if(a[101-al]!=0)
printf("%d",a[101-al]);
for(i=102-al;i<=100;i++)
printf("%d",a[i]);
printf("\n");
l--;
}
}
|
32
|
15707
|
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
|
15708
|
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
|
15709
|
int main()
{
void align(char a[]);
void substract(char a[],char b[],char c[]);
char a[101],b[101],c[101];
int i,j,t,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
getchar();
gets(a);
gets(b);
align(a);
align(b);
substract(a,b,c);
for(j=0;j<100;j++)if(c[j]!='0'){t=j;break;}
for(j=0;j<100-t;j++)c[j]=c[j+t];
c[100-t]='\0';
puts(c);
}
}
void align(char a[])
{
int jump,m;
a[100]='\0';
jump=100-strlen(a);
for(m=100-jump;m>0;m--)
a[m+jump-1]=a[m-1];
for(m=0;m<jump;m++)
a[m]='0';
}
void substract(char a[],char b[],char c[])
{
int i,carry=0;
for(i=99;i>=0;i--)
{
if(carry+b[i]>a[i]){c[i]=a[i]+10-(b[i]+carry)+'0';carry=1;}
else{c[i]=a[i]-(b[i]+carry)+'0';carry=0;}
}
}
|
32
|
15710
|
char m[20][100],n[20][100],a[20][100];
int lm[20],ln[20];
void minus(int k,int x,int r)
{
int s;
if (x>=101-lm[k])
{ s=m[k][x]-n[k][x]+r;
if (s>=0) r=0;
else
{
r=-1;
s=s+10;
}
minus(k,x-1,r);
a[k][x-101+lm[k]]=s+48;
}
}
void input(int k)
{
int i,j;
scanf("%s",m[k]);
scanf("%s",n[k]);
lm[k]=strlen(m[k]);
ln[k]=strlen(n[k]);
j=100;
for (i=lm[k]-1;i>=0;i--)
{
m[k][j]=m[k][i]-48;
m[k][i]=0;
j--;
}
j=100;
for (i=ln[k]-1;i>=0;i--)
{
n[k][j]=n[k][i]-48;
n[k][i]=0;
j--;
}
}
void main()
{
int i,s;
scanf("%d",&s);
for (i=1;i<=s;i++)
{
input(i);
if(i<s)getchar();
minus(i,100,0);
}
for (i=1;i<=s;i++)
printf("%s\n",a[i]);
}
|
32
|
15711
|
//********************************
//*????? **
//*????? 1300012848 **
//*???2013.11.16 **
//********************************
int main()
{
const int MAX_LEN = 200;
int n, i, j, k, nlen1, nlen2, jinwei[MAX_LEN+1] = {0};
int num1[MAX_LEN+1], num2[MAX_LEN];
char str1[MAX_LEN+1], str2[MAX_LEN+1];
cin >> n;
for (k = 1; k <= n; k++)
{
cin >> str1 >> str2;
nlen1 = strlen(str1);
nlen2 = strlen(str2);
memset(num1,0,sizeof(num1));
memset(num2,0,sizeof(num2));
j = 0;
for (i = nlen1 -1; i >= 0; i--)
{
num1[j] = str1[i] - '0';
j++;
}
j = 0;
for (i = nlen2 -1; i >= 0; i--)
{
num2[j] = str2[i] - '0';
j++;
}
for (i = 0; i < MAX_LEN; i++)
{
num1[i] -= num2[i];
if (num1[i] < 0)
{
num1[i] += 10;
num1[i+1]--;
}
}
i = MAX_LEN;
while (num1[i] == 0)
i--;
for (; i >= 0; i--)
cout << num1[i];
cout << endl;
}
return 0;
}
|
32
|
15712
|
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
|
15713
|
//********************************
//*???????? **
//*?????? 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
|
15714
|
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
|
15715
|
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
|
15716
|
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
|
15717
|
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
|
15718
|
int main()
{
int n , m , len1 , len2 , i = 0 , j = 0 ;
char jian[ 1001 ] , bjian[ 1001 ] ;
int jn[ 1001 ] , bj[ 1001 ] ;
cin >> n ;
for( m = 1 ; m <= n ; m ++ )
{
cin >> bjian >> jian ;
len1 = strlen( bjian ) ;
len2 = strlen( jian ) ;
memset( jn , 0 , sizeof( jian ) ) ;
memset( bj , 0 , sizeof( bjian ) ) ;
//cout << bjian << endl << jian << endl ;
j = 0 ;
//???????????????
for( i = len1 - 1 ; i >= 0 ; i -- )
bj[ j ++ ] = bjian[ i ] - '0' ;
j = 0 ;
//???????????????
for( i = len2 - 1 ; i >= 0 ; i -- )
jn[ j ++ ] = jian[ i ] - '0' ;
if( strcmp( bjian , jian ) != 0)
{
//????
for( i = 0 ; i <= len1 ; i ++ )
{
bj[ i ] = bj[ i ] - jn[ i ] ;
if( bj[ i ] < 0 )
{
bj[ i + 1 ] -- ;
bj[ i ] += 10 ;
}
}
i = len1 ;
//???????0??
while( bj[ i ] == 0 )
i -- ;
for( ; i >= 0 ; i -- )
cout << bj[ i ] ;
cout << endl ;
}
else
cout << '0' << endl ;
}
return 0 ;
}
|
32
|
15719
|
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
|
15720
|
void c(char a[],int h,char b[],int k)
{
int i,j,w=0,y=0;
char c[252];
for(i=h-1,j=k-1;i>=0;i--,j--)
{
if(j>=0)
{
c[i+1]=a[i]+48-b[j];
if(c[i+1]<48)
{
c[i+1]=c[i+1]+10;
a[i-1]=a[i-1]-1;
}
}
else
{
if(a[i]<48)
{c[i+1]=a[i]+10;
a[i-1]=a[i-1]-1;}
else
c[i+1]=a[i];}
}
for(i=1;i<h+1;i++)
{
if(c[i]!='0')
{w=1;y++;}
if(h+1==2||y!=0)
{printf("%c",c[i]);}}
printf("\n");
}
int main()
{
int h,k,n,i;
char a[251],b[251];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s\n",a,b);
h=strlen(a);
k=strlen(b);
if(h>=k)
c(a,h,b,k);
else if(k>h)
c(b,k,a,h);
}
return 0;
}
|
32
|
15721
|
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
|
15722
|
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
|
15723
|
void j(char a[],char b[])
{
int i,m,n;
m=strlen(a);
n=strlen(b);
for(i=m-1;i>=m-n;i--)
{
a[i]=a[i]-b[i-m+n]+48;
}
for(i=m-1;i>=0;i--)
{
if(a[i]<48)
{
a[i]=a[i]+10;
a[i-1]=a[i-1]-1;
}
}
printf("%s\n",a);
}
void main()
{
int i,n;
char a[20][100],b[20][100],c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
c=getchar();
}
for(i=0;i<n;i++)
{
j(a[i],b[i]);
}
}
|
32
|
15724
|
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
|
15725
|
//*********************************
//* ????????? **
//* ?????? 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
|
15726
|
int main(){
int m,y,n,l;
char a[100],b[100];
int aa[100],bb[100],c[100];
cin>>y;
for(int i=1;i<=y;i++){
cin>>a;
cin>>b;
for(int r=0;r<100;r++){
aa[r]=0;bb[r]=0;c[r]=0;
}
m=strlen(a);
n=strlen(b);
for(int i=0;i<m;i++)
aa[m-1-i]=a[i]-'0';
for(int j=0;j<n;j++)
bb[n-1-j]=b[j]-'0';
int carry=0;
for(int k=0;k<m;k++){
c[k]=carry+aa[k]-bb[k];
if(c[k]<0){
c[k]+=10;
carry=-1;
}
else
carry=0;
}
for(l=m-1;l>=0;l--)
if(c[l]!=0)break;
if(l==-1)cout<<"0"<<endl;
else{
for(int x=l;x>=0;x--)
cout<<c[x];
cout<<endl;
}
}
return 0;
}
|
32
|
15727
|
main()
{
int N,i,j,k,l[100]={0};
char a[100][100],b[100];
scanf("%d",&N);
for (i=0;i<2*N;i++)
{
scanf("%s",a[i]);
}
for(j=0;j<2*N;j++)
{for(i=0;a[j][i]!='\0';i++) l[j]++;}
for(i=0;i<N;i++)
{
for(j=0;j<=99;j++) b[j]='\0';
for(j=0;j<=l[2*i+1];j++)
{
b[l[2*i]-l[2*i+1]+j]=a[2*i+1][j];
}
for(j=0;j<=99;j++) a[2*i+1][j]=b[j];
}
for(j=0;j<N;j++)
{
for(i=(l[2*j]-1);i>=0;i--)
{ if(a[2*j][i]<'0') {a[2*j][i]='9';a[2*j][i-1]--;}
if (a[2*j+1][i]=='\0') ;
else if (a[2*j][i]>=a[2*j+1][i]) a[2*j][i]=a[2*j][i]-a[2*j+1][i]+'0';
else if (a[2*j][i]<a[2*j+1][i])
{a[2*j][i]=a[2*j][i]-a[2*j+1][i]+10+'0';a[2*j][i-1]--;}
}
}
for(j=0;j<N;j++)
{
k=0;
for(i=0;i<l[2*j];i++)
{
if((a[2*j][i]!='0')||(k==1))
{
k=1;
printf("%c",a[2*j][i]);
}
}
if(k==0) printf("0");
printf("\n");
}
}
|
32
|
15728
|
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
|
15729
|
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
|
15730
|
void main()
{
long n;
char str1[LENGTH+1], str2[LENGTH+1], ln[LENGTH+1];
int a[LENGTH+1], b[LENGTH+1], len1, len2;
long h, i, t;
scanf("%d\n", &n);
for (h=1;h<=n;h++)
{
gets(str1);
gets(str2);
if (h<n) gets(ln);
len1=strlen(str1);
len2=strlen(str2);
for (i=0;i<=LENGTH;i++)
{
a[i]=0;
b[i]=0;
}
for (i=0;i<len1;i++)
a[LENGTH-i]=str1[len1-i-1]-'0';
for (i=0;i<len2;i++)
b[LENGTH-i]=str2[len2-i-1]-'0';
for (i=0;i<=LENGTH;i++)
a[i]-=b[i];
for (i=LENGTH;i>0;i--)
{
if (a[i]<0)
{
a[i]+=10;
a[i-1]--;
}
}
t=0;
while (a[t]==0)
t++;
for (i=t;i<=LENGTH;i++)
printf("%d", a[i]);
if (h<n) printf("\n");
}
}
|
32
|
15731
|
void main()
{
char a[100],b[100],c[100],r[100],str[100],substr[100];
int i,j,m1,m2,n,k,t;
scanf("%d",&n);
for(k=1;k<=n;k++)
{
str[0]='\0';
substr[0]='\0';
scanf("%s",str);
scanf("%s",substr);
m1=strlen(str);
m2=strlen(substr);
for(i=0,j=m1-1;i<m1;i++,j--)
a[i]=str[j];
a[i]='\0';
for(i=0,j=m2-1;i<m2;i++,j--)
b[i]=substr[j];
if(m1>m2)
for(i=m2;i<m1;i++)
b[i]='0';
b[i]='\0';
for(i=0;i<m1;i++)
{
if(a[i]>=b[i])
c[i]=a[i]-b[i]+48;
else
{
c[i]=a[i]+10-b[i]+48;
a[i+1]--;
}
}
for(i=m1-1;c[i]=='0';i--);
c[i+1]='\0';
t=strlen(c);
for(i=0,j=t-1;i<t;i++,j--)
r[i]=c[j];
r[i]='\0';
puts(r);
}
}
|
32
|
15732
|
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
|
15733
|
/*
* 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
|
15734
|
int main()
{
int n,i,j;
char str1[101],str2[101];
cin>>n;
while(n>0)
{
int anlen1[100]={0,},anlen2[100]={0,};
cin>>str1>>str2;
int len1 = strlen(str1);
int len2 = strlen(str2);
j=0;
for(i = len1-1;i >= 0;i--)
anlen1[j++] = str1[i] - '0';
j=0;
for(i = len2-1;i >= 0;i--)
anlen2[j++] = str2[i] - '0';
for(i = 0;i < len1;i++)
{
if(anlen1[i] >= anlen2[i])
anlen1[i] -= anlen2[i];
else
{
anlen1[i] = anlen1[i] - anlen2[i] + 10;
anlen1[i+1]--;
}
}
i = len1-1;
while(anlen1[i] == 0) i--;
for(;i >= 0;i--)
cout<<anlen1[i];
cout<<endl;
n--;
}
return 0;
}
|
32
|
15735
|
int main()
{
int i, j ,m, n;
scanf ("%d", &n);
for (m=0; m<n; m++)
{
char a[SIZE+1]={0}, b[SIZE+1]={0};
char carry=0;
char a_str[SIZE+1], b_str[SIZE+1];
char ab_minus[SIZE+1] = {0};
int big = 0;
scanf ("%s", a_str);
scanf ("%s", b_str);
for (i = strlen(a_str), j = SIZE ; i>=0 ; i--, j--)
a[j] = a_str[i] - '0';
for (i = strlen(b_str), j = SIZE ; i>=0 ; i--, j--)
b[j] = b_str[i] - '0';
for (i = SIZE-1; i>= 0; i--)
{
if (a[i] - carry < b[i])
{
a[i]+=10;
ab_minus[i] = a[i] - b[i] - carry;
carry = 1;
}
else
{
ab_minus[i] = a[i] - b[i] - carry;
carry = 0;
}
}
for (i=0; i < SIZE-1 && ab_minus[i] == 0; i++);
for (; i < SIZE; i++)
printf ("%c", ab_minus[i] + '0');
printf ("\n");
}
return 0;
}
|
32
|
15736
|
void main()
{
int n,i,j,k,x,la[100],lb[100];
char a[100][100],b[100][100],c[100][100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
printf("\n");
}
for(i=0;i<n;i++)
{
la[i]=strlen(a[i]);
lb[i]=strlen(b[i]);
}
for(i=0;i<n;i++)
{
for(j=la[i]-1,k=lb[i]-1;j>(la[i]-lb[i]),k>=0;j--,k--)
{
if(a[i][j]<b[i][k])
{c[i][j]=58+a[i][j]-b[i][k];a[i][j-1]=a[i][j-1]-1;}
else c[i][j]=a[i][j]-b[i][k]+48;
}
for(j=0;j<la[i]-lb[i];j++)
c[i][j]=a[i][j];
}
for(x=0;x<n;x++)
printf("%s\n",c[x]);
}
|
32
|
15737
|
int main()
{
int n,i,len1,len2,j;
char x[100]={0};
char y[100]={0};
char z[100]={0};
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf ("%s",x);
scanf ("%s",y);
len2=strlen(y);
len1=strlen(x);
z[0]=x[len1-1]+10-y[len2-1]+48;
for(i=1;i<len2;i++)
z[i]=x[len1-1-i]-1+10-y[len2-1-i]+48;
for(i=len2;i<len1;i++)
z[i]=x[len1-1-i]+10-1;
for(i=0;i<len1;i++)
{if(z[i]>57)
{z[i+1]=z[i+1]+1;
z[i]=z[i]-10;
}
}
for(i=len1-1;i>=0;i--)
printf("%d",z[i]-48);
printf("\n");
}
return 0;
}
|
32
|
15738
|
main()
{
int n;
int i;
int j;
int l1;
int l2;
scanf("%d",&n);
char **pp=(char **)malloc((2*n)*sizeof(char *));
for(i=0;i<2*n;i++)
pp[i]=(char *)malloc(100*sizeof(char));
for(i=0;i<2*n;i++)
scanf("%s",pp[i]);
for(i=0;i<2*n;i=i+2)
{
l1=strlen(pp[i]);
l2=strlen(pp[i+1]);
for(j=0;j<l2;j++)
{
pp[i+1][l1-j-1]=pp[i+1][l2-j-1];
}
for(j=0;j<l1-l2;j++)
{
pp[i+1][j]='0';
}
for(j=l1-1;j>l1-l2-1;j=j-1)
{
if(pp[i][j]-pp[i+1][j]<0)
{
pp[i][j-1]=pp[i][j-1]-1;
pp[i][j]='0'+pp[i][j]-pp[i+1][j]+10;
}
else
{
pp[i][j]='0'+pp[i][j]-pp[i+1][j];
}
}
printf("%s\n",pp[i]);
}
for(i=0;i<2*n;i++)
free(pp[i]);
free(pp);
}
|
32
|
15739
|
int main()
{
int n,u,i ,Len1=0,Len2=0,max=0;
const int MAX_LEN = 100;
int num1[MAX_LEN+1]={0};int num2[MAX_LEN+1]={0};
char str1[MAX_LEN + 1];char str2[MAX_LEN + 1];
cin >> n;
cin.get();
for (u=0;u<n;u++)
{
cin.getline(str1, MAX_LEN + 1);
cin.getline(str2, MAX_LEN + 1);
Len1 = strlen(str1);
Len2 = strlen(str2);
for (i = Len1 - 1; i >= 0; i--)
num1[Len1-1-i] = str1[i]-'0';
for (i = Len2 - 1; i >= 0; i--)
num2[Len2-1-i] = str2[i]-'0';
if (Len1>Len2)
{
max=Len1;
}
else
max=Len2;
for (i = 0; i <max; i++)
{
num1[i]=num1[i]- num2[i];
if(num1[i]<0)
{
num1[i]=num1[i]+10;
num1[i+1]=num1[i+1]-1;
}
}
i = MAX_LEN;
while (num1[i]==0)
i--;
for (; i >= 0; i--)
cout << num1[i];
cout << endl;
for (i=0;i<MAX_LEN;i++)
{
num1[i]=0;
num2[i]=0;
}
Len1=0;
Len2=0;
max=0;
if (i!=n-1)
cin.get();
}
return 0;
}
|
32
|
15740
|
int main()
{
int n;cin>>n;
for(int N=0;N<n;N++)
{
char a[110],b[110];
cin>>a>>b;
int A[110]={0},B[110]={0},result[110]={0};
for(int i=strlen(a)-1;i>=0;i--)
{
A[strlen(a)-i-1]=a[i]-'0';
}
for(int i=strlen(b)-1;i>=0;i--)
{
B[strlen(b)-i-1]=b[i]-'0';
}
for(int i=0;i<110;i++)
{
result[i]+=(A[i]-B[i]);
if(result[i]<0) {result[i]+=10;result[i+1]--;}
}
int t;
for(t=109;t>0;t--) if(result[t]) break;
for(;t>0;t--) cout<<result[t];
cout<<result[0]<<endl;
}
cin.get();cin.get();cin.get();cin.get();cin.get();
}
|
32
|
15741
|
/*
* temperary.cpp
*
* Created on: 2011-12-25
* Author: ???
*/
int main() {
int n;
cin>>n;
while(n>0){
n--;
char a[100],b[100];
cin>>a>>b;
int l1=strlen(a),l2=strlen(b),i,c[100];
for(i=0;i<l2;i++){
if(a[l1-1-i]<b[l2-1-i]){
a[l1-2-i]--;
a[l1-1-i]+=10;
}
c[i]=a[l1-1-i]-b[l2-1-i];
}
for(i=l2;i<l1;i++){
if(a[l1-1-i]<'0'){
a[l1-2-i]--;
a[l1-1-i]+=10;
}
c[i]=a[l1-1-i]-48;
}
while(c[i-1]==0)i--;
while(i>0){
i--;cout<<c[i];
}
cout<<endl;
}
return 0;
}
|
32
|
15742
|
void main()
{
int j,b,a,i,x=0,y,z=1,m,n,s,t;
scanf("%d",&a);
char j_shu[65][101],b_shu[65][101],shu[65][101];
for(i=0;i<a;i++)
{
j=0;
while(1)
{
if((y=getchar())!='\n')
j_shu[i][j++]=y;
else
if(j>0)
{
j_shu[i][j]='\0';
break;
}
}
b=0;
while(1)
{
if((y=getchar())!='\n')
b_shu[i][b++]=y;
else
if(b>0)
{
b_shu[i][b]='\0';
break;
}
}
m=strlen(j_shu[i]);
n=strlen(b_shu[i]);
b_shu[i][m]='\0';
for(s=m-1,t=n-1;t>=0;s--,t--)
{
if(j_shu[i][s]<b_shu[i][t])
{
j_shu[i][s]=j_shu[i][s]+10;
j_shu[i][s-1]=j_shu[i][s-1]-1;
}
shu[i][s]=j_shu[i][s]-b_shu[i][t];
}
for(;s>=0;s--)
{
if(j_shu[i][s]<0)
{
j_shu[i][s]=j_shu[i][s]+10;
j_shu[i][s-1]=j_shu[i][s-1]-1;
}
shu[i][s]=j_shu[i][s]-48;
//printf("%d",shu[i][s]);
}
}
for(i=0;i<a;i++)
{
m=strlen(j_shu[i]);
for(s=0,t=0;s<m;s++)
if(shu[i][s]==0&&t==0)
continue;
else
if(shu[i][s]==0)
printf("0");
else
{
t++;
printf("%d",shu[i][s]);
}
if(t==0)
printf("0");
printf("\n",m);
}
}
|
32
|
15743
|
void main()
{
int flag2,flag,j,k,lengtha,lengthb,n,i;
char temp,a[100],b[100];
flag=0;
flag2=0;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
if (flag2) temp=getchar();
else flag2=1;
scanf("%s",a);
scanf("%s",b);
lengtha=strlen(a);
lengthb=strlen(b);
for (j=1;j<=lengthb;j++)
{
a[lengtha-j]=a[lengtha-j]-b[lengthb-j]+48;
k=lengtha-j;
while (a[k]<48)
{
a[k]=a[k]+10;
a[k-1]--;
k--;
}
}
if (flag) printf("\n");
else flag=1;
printf("%s",a);
}
}
|
32
|
15744
|
int beijianshu[200]={0},jianshu[200]={0},cha[200]={0};
int len1,len2;
int flag;
char a[200],b[200];
void reverse(char a[],char b[])
{
int i;
for(i=0;i<len1;i++) beijianshu[i]=a[len1-i-1]-'0';
for(i=0;i<len2;i++) jianshu[i]=b[len2-i-1]-'0';
}
int panduan()
{
if (len1>len2) return 1;
else if (len1==len2)
{
for(int i=0;i<len1;i++)
{
if(a[i]>b[i]) return 1;
else if(a[i]<b[i]) return -1;
}
return 0;
}
else return -1;
}
void calculate()
{
int i;
if(flag!=0)
{
for(i=0;i<len1||i<len2;i++) cha[i]=beijianshu[i]-jianshu[i];
if(flag==1)
{
for(i=0;i<len1;i++)
{
if(cha[i]<0)
{
cha[i+1]--;
cha[i]+=10;
}
}
}
else
{
for(i=0;i<=len2;i++)
{
if(cha[i]>0)
{
cha[i]-=10;
cha[i+1]++;
}
}
}
}
}
void print()
{
int i;
if(flag==0) cout<<0<<endl;
else
{
for(i=199;i>=0;i--) if(cha[i]!=0) break;
if(flag==1) for(;i>=0;i--) cout<<cha[i];
else
{
cout<<'-';
for(;i>=0;i--) cout<<0-cha[i];
}
cout<<endl;
}
}
int main()
{
int n;
cin>>n;
cin.get();
for(int i=0;i<n;i++)
{
memset(a,'\0',sizeof(a));
memset(b,'\0',sizeof(b));
memset(beijianshu,0,sizeof(beijianshu));
memset(jianshu,0,sizeof(jianshu));
memset(cha,0,sizeof(cha));
cin.getline(a,200);
cin.getline(b,200);
cin.get();
len1=strlen(a);
len2=strlen(b);
reverse(a,b);
flag=panduan();
calculate();
print();
}
return 0;
}
|
32
|
15745
|
int main()
{
int n;
char str1[101],str2[101];
int a1[100],a2[100];
cin>>n;
int l1,l2;
for(int i=0;i<n;i++)
{
cin>>str1>>str2;
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
l1=strlen(str1);
l2=strlen(str2);
int k1=0,k2=0;
for(int j=l1-1;j>=0;j--)
a1[k1++]=str1[j]-'0';
for(int j=l2-1;j>=0;j--)
a2[k2++]=str2[j]-'0';
for(int j=0;j<100;j++)
{
a1[j]=a1[j]-a2[j];
if(a1[j]<0)
{
a1[j]+=10;
a1[j+1]--;
}
}
int k=99;
while(a1[k]==0) k--;
for(;k>=0;k--)
cout<<a1[k];
cout<<endl;
}
return 0;
}
|
32
|
15746
|
int main(){
int n,t;
cin>>n;
for(t=1;t<=n;t++){
char a[101],b[101],c[101];
cin>>a;
cin>>b;
int n1,n2,n3,i,j,k=0;
n1=strlen(a),n2=strlen(b),n3=strlen(a);
for(i=n1-1,j=n2-1;i>=0;i--,j--)
{
if(j>=0)
{
if(a[i]-k>=b[j])
{
c[i]=a[i]-b[j]-k+48;
k=0;
}
else
{
c[i]=a[i]+10-b[j]-k+48;
k=1;
}
}
else
{
if(a[i]-48>=k)
{
c[i]=a[i]-k;
k=0;
}
else
{
c[i]=10+a[i]-k;
k=1;
}
}
}
if(c[0]!='0')
cout<<c[0];
for(i=1;i<n1-1;i++)
cout<<c[i];
cout<<c[n1-1]<<endl;}
return 0;
}
|
32
|
15747
|
/*??
?2??????????
????
?1?????????n????????2???1?????a??2????b(a > b)??????????????????????100?
????
n????????????????????
????
2
9999999999999999999999999999999999999
9999999999999
5409656775097850895687056798068970934546546575676768678435435345
1
????
9999999999999999999999990000000000000
5409656775097850895687056798068970934546546575676768678435435344
*/
char imim[101],isub[101],istore[101];
int carry=0;
char *p=NULL,*q=NULL;
void subtraction()
{
if(q==isub)
{
*p=(*p-*q-carry+'0');
}
else
{
if(*p>=(*q+carry))
{
*p=(*p-*q-carry+'0');
carry=0;
}
else
{
*p=(*p+10-*q-carry+'0');
carry=1;
}
p--;q--;
subtraction();
}
}
int main()
{
int n=0;
cin>>n;
for(int i=0;i<n;i++)
{
memset(imim,'0',sizeof(imim));
memset(isub,'0',sizeof(isub));
memset(istore,'0',sizeof(istore));
carry=0;
cin>>imim>>istore;
int gap=0;
gap=strlen(imim)-strlen(istore);
for(int i=0;i<=strlen(istore);i++)
{
isub[i+gap]=istore[i];
}
p=imim+strlen(imim)-1;
q=isub+strlen(isub)-1;
subtraction();
cout<<imim<<endl;
}
return 0;
}
|
32
|
15748
|
//***************************
//*???????? **
//*????? 1300012921 **
//*???2013.11.18 **
//***************************
int main()
{
char a[101], b[101];
int i, j, k, n, len1, len2;
int c[103], d[103], e[103];
cin >> n;
cin.get();
for(k = 1; k <= n; k++)
{
memset(c,0,sizeof(c));
memset(d,0,sizeof(d));
memset(e,0,sizeof(e));
cin.getline(a,101);
cin.getline(b,101);
len1 = strlen(a);
len2 = strlen(b);
for(i = len1 - 1; i >= 0; i--)
c[len1-i] = a[i] - '0';
for(i = len2 - 1; i >= 0; i--)
d[len2-i] = b[i] - '0';
for(i = 1; i <= 101; i++)
{
if(c[i] >= d[i])
e[i] = c[i] - d[i];
else
{
e[i] = c[i] - d[i] + 10;
c[i+1] = c[i+1] - 1;
}
}
for(j = 101; j >= 1; j--)//????
{
if(e[j] != 0)
{
for(i = j; i >= 1; i--)
cout << e[i];
break;
}
}
cout << endl;
cin.get();
}
return 0;
}
|
32
|
15749
|
void main()
{
int n,i,j;
struct num
{
char a[101];
int na;
char b[101];
int nb;
char c[101];
}num[999];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",num[i].a);
scanf("%s",num[i].b);
getchar();
}
for(i=0;i<n;i++)
{
for(j=0;num[i].a[j]!='\0';j++)
num[i].na=j+1;
for(j=0;num[i].b[j]!='\0';j++)
num[i].nb=j+1;
for(j=1;j<=num[i].nb;j++)
{
num[i].c[num[i].na-j]=num[i].a[num[i].na-j]-num[i].b[num[i].nb-j]+'0';
if(num[i].c[num[i].na-j]<'0')
{
num[i].a[num[i].na-j-1]--;
num[i].c[num[i].na-j]+=10;
}
}
for(j=0;j<num[i].na-num[i].nb;j++)
num[i].c[j]=num[i].a[j];
num[i].c[num[i].na]='\0';
printf("%s\n",num[i].c);
}
}
|
32
|
15750
|
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
|
15751
|
int n,i,j;
int a[105],b[105],c[105];
int l1,l2,ml;
char s1[105],s2[105];
void jian()
{
for(i=0;i<ml+3;i++)
a[i]=b[i]=c[i]=0;
for(i=0;i<l1;i++)
{
a[i]=s1[l1-i-1]-'0';
}
for(i=0;i<l2;i++)
{
b[i]=s2[l2-i-1]-'0';
}
for(i=0;i<ml;i++)
{
c[i]=a[i]-b[i];
if(c[i]<0)
{
c[i]+=10;
a[i+1]-=1;
}
}
while(c[ml]==0 && ml>0)
ml--;
for(i=ml;i>=0;i--)
printf("%d",c[i]);
printf("\n");
}
int main()
{
scanf("%d",&n);
while(n--)
{
scanf("%s",s1);
scanf("%s",s2);
l1=strlen(s1);
l2=strlen(s2);
ml=l1;
jian();
}
return 0;
}
|
32
|
15752
|
void main ()
{
int i=0,j=0,k,t,r=0,h;
int x[100],y[100],z[100],s[100]={0};
char a[100][100],b[100][100];
scanf ("%d",&j);
for (i=0;i<j;i++)
{
scanf ("%s%s",a[i],b[i]);
getchar();
x[i]=strlen(a[i]);
y[i]=strlen(b[i]);
}
for (i=0;i<j;i++)
{
for (k=0;k<y[i];k++)
{
if (a[i][x[i]-k-1]>=b[i][y[i]-k-1])
{
a[i][x[i]-k-1]=a[i][x[i]-k-1]-b[i][y[i]-k-1]+'0';
}
else
{
a[i][x[i]-k-1]=a[i][x[i]-k-1]-b[i][y[i]-k-1]+10+'0';
a[i][x[i]-k-2]=a[i][x[i]-k-2]-1;
}
}
}
for (i=0;i<j;i++)
{
printf("%s\n",a[i]);
}
}
|
32
|
15753
|
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
|
15754
|
void minus(char a[],char b[],char result[]);
void main()
{
int n,i;
char a[max][1000]={0},b[max][1000]={0};
char result[max][1000]={0};
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 h[1000]={0};
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
|
15755
|
void main()
{
int n,i,j;
int len1,len2;
char num[2][100],emp[1];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",num[0],num[1]);
len1=strlen(num[0]);
len2=strlen(num[1]);
for(j=0;j<len2;j++)
{
if(num[0][len1-1-j]>=num[1][len2-1-j])
num[0][len1-1-j]=num[0][len1-1-j]-num[1][len2-1-j]+'0';
else
{
num[0][len1-1-j]=num[0][len1-1-j]+10-num[1][len2-1-j]+'0';
num[0][len1-2-j]=num[0][len1-2-j]-1;
}
}
puts(num[0]);
gets(emp);
}
}
|
32
|
15756
|
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
|
15757
|
void change(char ch[],int a[])
{
int i;
int nc;
nc=strlen(ch);
for(i=0;i<nc;i++)
{
a[i]=ch[i]-48;
}
}
void minus(int a[],int b[],int na,int nb)
{
int i;
for(i=1;i<=nb;i++)
{
if(a[na-i]<b[nb-i])
{
a[na-i-1]--;
a[na-i]=a[na-i]-b[nb-i]+10;
}
else
{
a[na-i]-=b[nb-i];
}
}
}
void print(int a[],int na)
{
int i,j=0;
for(j=0;a[j]==0;j++)
i++;
for(i=j;i<na;i++)
printf("%d",a[i]);
}
int main()
{
int a[100],b[100];
char c[100];
int n,i,j,na,nb;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s",c);
na=strlen(c);
change(c,a);
for(j=0;j<100;j++)
c[j]='\0';
scanf("%s",c);
nb=strlen(c);
change(c,b);
minus(a,b,na,nb);
print(a,na);
printf("\n");
}
return 0;
}
|
32
|
15758
|
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
|
15759
|
void minus(char a[],char b[]);
void main()
{
int n,i;
char a[max][max],b[max][max];
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
scanf("%s\n%s\n\n",a[i],b[i]);
minus(a[i],b[i]);
printf("%s\n",a[i]);
}
}
void minus(char a[],char b[])
{
int la,lb,i,t,j,s,c,k=0;
la=strlen(a)-1;
lb=strlen(b)-1;
for(i=la-lb;i<=la;i++)
{
s=a[i];
c=b[k];
a[i]=s-c+48;
t=i;
while(a[i]<'0')
{
a[i]+=10;
a[--i]--;
}
i=t;
k++;
}
i=0;
while(a[i]=='0')
{
for(j=0;j<=strlen(a);)
{
a[j]=a[++j];
}
i++;
}
}
|
32
|
15760
|
void main()
{
int n,i,j,j1,l,l1;
char str[100][100],str1[100][100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%s%s",str[i],str1[i]);
getchar();
}
for(i=1;i<=n;i++)
{
l=strlen(str[i]);
l1=strlen(str1[i]);
j=0;
while(j<l1)
{
str[i][l-1-j]='0'+(int)str[i][l-1-j]-(int)str1[i][l1-1-j];
j1=j;
while(str[i][l-1-j1]<'0')
{
str[i][l-1-j1]=10+str[i][l-1-j1];
j1++;
str[i][l-1-j1]='0'+(int)str[i][l-1-j1]-(int)'1';
}
j++;
}
j1=0;
while(str[i][j1]=='0') j1++;
for(j=j1;j<l;j++)putchar(str[i][j]);
printf("\n");
}
}
|
32
|
15761
|
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
|
15762
|
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
|
15763
|
int main()
{
int n,l1,l2,s3[101],i,j;
char s1[101],s2[101],s6[2];
scanf("%d",&n);
for(i=1;i<=n;i++)
{gets(s6);
gets(s1);
gets(s2);
l1=strlen(s1);l2=strlen(s2);
for(j=1;j<=l2;j++)
{ if (s1[l1-j]>=s2[l2-j]) s3[l1-j]=s1[l1-j]-s2[l2-j];
if (s1[l1-j]<s2[l2-j]) {s3[l1-j]=10+s1[l1-j]-s2[l2-j];s1[l1-j-1]=s1[l1-j-1]-1;}
}
for(j=0;j<l1-l2;j++)
s3[j]=s1[j]-'0';
for(j=0;j<l1;j++)
printf("%d",s3[j]);
printf("\n");
}
}
|
32
|
15764
|
int main()
{
char a[102] , b[102] ;
int n, i=0, j=0 ,lena, lenb;
cin>>n;
for(i=0; i<n; i++)
{
int p[102]={0};
int q[102]={0};
cin>>a>>b;
lena=strlen(a);
lenb=strlen(b);
for(j=0; j<lena; j++)
{
p[j]=a[lena-j-1]-'0';
}
for(j=0; j<lenb; j++)
{
q[j]=b[lenb-j-1]-'0';
}
for(j=0; j<=lena; j++)
{
if(p[j]<q[j])
{
p[j+1]--;
p[j]=p[j]-q[j]+10;
}
else
p[j]-=q[j];
}
int temp=1;
for(j=lena; j>=0; j--)
{
if(p[j]==0 && temp==1)
continue;
if(p[j]!=0)
{
cout<<p[j];
temp=0;
}
if(p[j]==0)
cout<<p[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15765
|
int main()
{
int a1[100], a2[100];
char b1[101],b2[101];
int n;
cin>>n;
for(int k=0;k<n;k++)
{
cin>>b1>>b2;
int l1=strlen(b1),l2=strlen(b2);
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
int j=0;
for(int i=l1-1;i>=0;i--)
{
a1[j++]=b1[i]-'0';
}
j=0;
for(int i=l2-1;i>=0;i--)
{
a2[j++]=b2[i]-'0';
}
for(int i=0;i<100;i++)
{
if(a1[i]<a2[i])
{
a1[i]=10+a1[i]-a2[i];
a1[i+1]--;
}
else
{
a1[i]=a1[i]-a2[i];
}}
int i=99;
while(a1[i]==0) i--;
for(;i>=0;i--)
{cout<<a1[i];}
cout<<endl;
}
return 0;
}
|
32
|
15766
|
int main()
{
char numa[201], numb[201];
int a[201], b[201], result[201];
int n, i, j, k, la, lb;
cin >> n;
for (; n > 0; n--)
{
k = 0;
cin.ignore();
cin.getline(numa, 201);
cin.getline(numb, 201);
la = strlen(numa);
lb = strlen(numb);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(result, 0, sizeof(result));
for(i = 0; i < la; i ++)
{
a[i] = numa[i] - '0';
}
for(j = 0; j < lb; j++)
{
b[j] = numb[j] - '0';
}
for(i = la - 1, j = lb - 1; i >= 0; i--, j--)
{
if(b[j] > a[i])
{
b[j - 1]++;
result[i] = 10 + a[i] - b[j];
}
else
result[i] = a[i] - b[j];
}
while (result[k] == 0)
k++;
for(i = k; i < la; i++)
cout << result[i];
cout << endl;
}
return 0;
}
|
32
|
15767
|
int main()
{
int a[200],b[200],len1,len2,n,k;
char str1[200];char str2[200];
cin>>n;
for(int i=1;i<=n;i++)
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
cin.get();
cin.getline(str1,200);
cin.getline(str2,200);
len1=strlen(str1);
len2=strlen(str2);
k=0;
for(int j=len1-1;j>=0;j--)
{
a[k]=str1[j]-'0';
k++;
}
k=0;
for(int j=len2-1;j>=0;j--)
{
b[k]=str2[j]-'0';
k++;
}
for(int j=0;j<len1;j++)
{
a[j]=a[j]-b[j];
if(a[j]<0)
{
a[j]=a[j]+10;
a[j+1]--;
}
}
for(int j=len1-1;j>=0;j--)
{
cout<<a[j];
}
cout<<endl;
}
return 0;
}
|
32
|
15768
|
int main(int argc, char* argv[])
{
char a[200],b[200],c[200];
int n,i,j,al,bl;
scanf("%d\n",&n);
for (i=0;i<n;i++)
{
if(i>0) scanf("\n");
gets(a);
gets(b);
al=strlen(a);
bl=strlen(b);
for (j=0;j<=bl-1;j++) b[al-1-j]=b[bl-1-j];
for (j=0;j<al-bl;j++) b[j]=48;
b[al]=0;
for (j=al-1;j>=0;j--)
{
if(a[j]>=b[j]) c[j]=a[j]-b[j]+48;
else
{
c[j]=a[j]-b[j]+58;
if(a[j-1]==0) a[j-1]=57;
else a[j-1]=a[j-1]-1;
}
}
c[al]=0;
puts(c);
}
return 0;
}
|
32
|
15769
|
int main()
{
char a[10][100],b[10][100];
int n,i,j,lengtha[10],lengthb[10],begin;
scanf("%d",&n);
for(i=0;i<10;i++)for(j=0;j<100;j++){a[i][j]='\0';b[i][j]='\0';}
for(i=0;i<10;i++){lengtha[i]=0;lengthb[i]=0;}
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
scanf("%s",b[i]);
}
for(i=0;i<n;i++)
{
for(j=0;a[i][j]!='\0';j++)lengtha[i]++;
for(j=0;b[i][j]!='\0';j++)lengthb[i]++;
for(j=lengthb[i]-1;j>=0;j--)b[i][j+lengtha[i]-lengthb[i]]=b[i][j];
for(j=0;j<lengtha[i]-lengthb[i];j++)b[i][j]='0';
for(j=lengtha[i]-1;j>=0;j--)
{
if(b[i][j]<=a[i][j]){a[i][j]=a[i][j]-b[i][j]+48;}
else{a[i][j]=10+a[i][j]-b[i][j]+48;a[i][j-1]--;}
}
begin=0;
for(j=0;j<lengtha[i]-1;j++){if(a[i][j]!='0'){printf("%c",a[i][j]);begin=1;}else if(begin==1)printf("%c",a[i][j]);}
printf("%c",a[i][lengtha[i]-1]);
printf("\n");
}
return 0;
}
|
32
|
15770
|
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
|
15771
|
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
|
15772
|
void minus(char p[110],char a[110])
{
int m,n,i,j;
m=strlen(p);
n=strlen(a);
for(i=n-1;i>=0;i--)
{
if(p[m-n+i]>=a[i]) p[m-n+i]=p[m-n+i]-a[i]+48;
else
{
for(j=m-n+i-1;j>=0;j--)
{
if(p[j]==48) p[j]=57;
else
{
p[j]-=1;
break;
}
}
p[m-n+i]=p[m-n+i]-a[i]+58;
}
}
for(i=0;i<m;i++) if(p[i]!=48)break;
for(j=0;j<m-i;j++) p[j]=p[j+i];
}
void main()
{
int n,i;
char pass[110],act[110],res[100][110];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",pass,act);
minus(pass,act);
strcpy(res[i],pass);
}
for(i=0;i<n;i++) printf("%s\n",res[i]);
}
|
32
|
15773
|
void f(char a[300],char b[300])
{
int n1[300]={0},n2[300]={0},n3[300]={0},i,t,k=0;
//?????????
t=strlen(a);
for(i=0;i<t;i++)
n1[300-t+i]=a[i]-48;
t=strlen(b);
for(i=0;i<t;i++)
n2[300-t+i]=b[i]-48;
//????????????
for(i=0;i<300;i++)
n3[i]=n1[i]-n2[i];
for(i=299;i>=0;i--)
if(n3[i]<0){n3[i]=n3[i]+10;n3[i-1]--;}
//???????0??
//?????0???
for(i=0;i<299;i++)
{
if(n3[i]!=0&&k==0){printf("%d",n3[i]);k++;}
else if(k==1) printf("%d",n3[i]);
}
printf("%d\n",n3[299]);
}
void main()
{
char a[10][300],b[10][300];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{{scanf("%s",a[i]);scanf("%s",b[i]);}}
for(i=0;i<n;i++)
f(a[i],b[i]);
}
|
32
|
15774
|
/*
* 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
|
15775
|
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
|
15776
|
void MINUS(char* a,char* b);
void main()
{
char jian[50][200],beijian[50][200];
int n;
int i=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",beijian[i]);
scanf("%s",jian[i]);
}
for(i=0;i<n;i++)
{
MINUS(beijian[i],jian[i]);
}
}
void MINUS(char* a,char* btemp)
{
int lena,lenb;
int i,j;
char b[200];
int temp=0;
char tt='0';
lena=strlen(a);
lenb=strlen(btemp);
for(i=0;i<lena-lenb;i++)//??
b[i]='0';
for(j=i+1;i<200;i++){
b[i]=btemp[i-lena+lenb];
}
for(i=lena-1;i>=0;i--)
{
if(a[i]-b[i]+temp>=0){a[i]=a[i]-b[i]+temp+48;
temp=0;}
else{
a[i]=a[i]-b[i]+temp+48+10;
temp=-1;
}
}
for(i=0;i<200;i++)
{
if(a[i]=='\0')break;
if(a[i]!=tt){putchar(a[i]);
tt='*';}
}
putchar('\n');
}
|
32
|
15777
|
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
|
15778
|
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
|
15779
|
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
|
15780
|
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
|
15781
|
// @ ?????.cpp
// @ 1000012895
// @ ???
// @ 2010/11/17
int main()
{
int n;
cin >> n;
char a[100], b[100];
int inta[100], intb[100];
int i, j, counta, countb, count0;
for(i = 1; i <= n; i++)
{
cin >> a;
cin >> b;
for(counta = 0; a[counta] != '\0'; counta++)
inta[counta] = a[counta] - '0';
for(countb = 0; b[countb] != '\0'; countb++)
intb[countb] = b[countb] - '0';
for(j = counta - 1; j >= counta - countb; j--)
{
inta[j] = inta[j] - intb[j - counta + countb];
if(inta[j] < 0)
{
inta[j] += 10;
inta[j - 1]--;
}
}
for(count0 = 0; inta[count0] == 0; count0++);
for(j = count0; j < counta; j++)
cout << inta[j];
cout << endl;
cin.get();
}
return 0;
}
|
32
|
15782
|
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
|
15783
|
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
|
15784
|
int main()
{
char num1[200],num2[200];
int result[200];
int n,i,j,k,flag=0;
int len1,len2;
cin>>n;
for (i=1;i<=n;i++)
{
cin.get();
cin.getline (num1,200);
cin.getline (num2,200);
len1=strlen(num1);
len2=strlen(num2);
for (j=len1-1,k=len2-1;j>=0;j--,k--)
{
if (k>=0)
{
if (flag==1)
{
num1[j] -= 1;
flag=0;
}
if (num1[j]<num2[k])
{
num1[j] += 10;
flag=1;
}
result[j]=num1[j]-num2[k];
}
else
{
if (flag==1)
{
num1[j] -=1;
flag=0;
}
result[j]=num1[j]-'0';
}
}
for (j=0;j<len1;j++)
{
if (result[j]!=0)
flag=1;
if (result[j]==0 && flag==0)
continue;
else cout<<result[j];
}
cout<<endl;
flag=0;
}
return 0;
}
|
32
|
15785
|
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
|
15786
|
main()
{
int p;
scanf("%d",&p);
while(p>0)
{
char a[101],b[101],c[101]={0},a1[101]={0},b1[101]={0};int lena,lenb;
int i,j;
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
for(i=0;i<lena;i++)
a1[i+101-lena]=a[i];
for(i=0;i<lenb;i++)
b1[i+101-lenb]=b[i];
int carry=0;
for(j=100;j>=100-(lena-1);j--)
{
if (b1[j]==0) {c[j]=a1[j]-carry;carry=0;}
else
{
if(a1[j]>b1[j]){
c[j]=a1[j]-b1[j]-carry+'0';carry=0;}
else
{
if (a1[j]==b1[j]&&carry==0) c[j]='0';
else
{
c[j]=10+a1[j]-b1[j]-carry+'0';
carry=1;
}
}}
}
int temp=0;
for(i=0;i<101;i++)
{
if(c[i]!=0)
{
temp=i;break;
}
}
for(i=temp;i<101;i++)
printf("%c",c[i]);
printf("\n");
p--;
}
}
|
32
|
15787
|
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
|
15788
|
main()
{
char a[100],b[100],c[20][100];
int n,i,j,j1,j2,lena,lenb;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a);
scanf("%s",b);
lena=strlen(a);
lenb=strlen(b);
j=0;
for(j1=lena-1,j2=lenb-1;j2>=0;j1--,j2--)
{
if(j==1) a[j1]=a[j1]-j;
j=0;
if(a[j1]<b[j2])
{
a[j1]=a[j1]+10-b[j2]+'0';
j=1;
}
else a[j1]=a[j1]-b[j2]+'0';
}
if(j==1) a[j1]=a[j1]-j;
for(j1=0;j1<lena;j1++)
{
if(a[j1]!='0') break;
}
for(j=j1,j2=0;j<lena;j++,j2++)
c[i][j2]=a[j];
c[i][j2]='\0';
}
for(i=0;i<n;i++)
printf("%s\n",c[i]);
}
|
32
|
15789
|
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
|
15790
|
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
|
15791
|
int main ()
{
int l1,l2,i,b,n,j,m,jg[100];
char a1[100],a2[100];
scanf ("%d",&n);
for (j=0;j<n;j++)
{
gets (a1);
gets (a1);
gets (a2);
l1=strlen(a1);
l2=strlen(a2);
b=l1-l2;
for (i=l1-1;i>l1-l2-1;i--)
{
if (a1[i]>a2[i-b] || a1[i]==a2[i-b])
jg[i]=a1[i]-a2[i-b];
else if (a1[i]<a2[i-b])
{
jg[i]=a1[i]+10-a2[i-b];
a1[i-1]=a1[i-1]-1;
}
}
for (i=0;i<l1-l2;i++)
jg[i]=a1[i]-'0';
for (i=0;i<l1;i++)
{
if (jg[i]==0)
continue;
else
{
for (m=i;m<l1;m++)
{
printf ("%d",jg[m]);
}
break;
}
};
printf("\n");
}
return 0;
}
|
32
|
15792
|
// ??????????????
// ??
// 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
|
15793
|
void main()
{
int n,lena,lens,i,j,k;
char str[100],a[100],*pa,*ps,e[20],*p;
scanf("%d",&n);
gets(e);
for(i=1;i<=n;i++)
{
gets(str);
gets(a);
gets(e);
lens=strlen(str);
lena=strlen(a);
pa=a+lena-1;
ps=str+lens-1;
for(;pa>=a;pa--,ps--)
{
if(*ps>=*pa)
*ps=*ps-*pa+48;
else
{
*ps=*ps-*pa+58;
p=ps-1;
while(*p==0)
{
*p=57;
p--;
}
*p=*p-1;
}
}
for(k=0;k<=lens-1;k++)
{
if(str[i]!=0)
break;
}
for(j=k;j<lens-1;j++)
printf("%c",str[j]);
printf("%c\n",str[lens-1]);
}
}
|
32
|
15794
|
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
|
15795
|
int main()
{
int n,l1,l2, c[101],d[101];char a[101],b[101]; //????????????
memset(a,0,sizeof(a));memset(b,0,sizeof(b)); //??????
cin >> n;
while(cin >> a >> b) //?????
{
int i=0,j=0;
memset(c,0,sizeof(c));memset(d,0,sizeof(d));
l1=strlen(a);l2=strlen(b); //?????????????????
for(i=l1-1;i>=0;i--)
c[j++]=a[i]-'0';
j=0;
for(i=l2-1;i>=0;i--)
d[j++]=b[i]-'0';
for(i=0;i<100;i++) //???
{
c[i+1]--;
c[i]=c[i]+10;
c[i]=c[i]-d[i];
if(c[i]>=10)
{
c[i]=c[i]-10;
c[i+1]=c[i+1]+1;
}
}
i=100;
while(c[i]==0&&i>0) //???
i--;
for(j=i;j>=0;j--)
cout <<c[j];
cout << endl;
};
return 0;
}
|
32
|
15796
|
//33453453553
// 34345
char str1[1000];
char str2[1000];
int num1[1000];
int num2[1000];
int main(){
int n;
cin>>n;
getchar();
while (n--){
cin.getline(str1,999);
cin.getline(str2,999);
int len1=strlen(str1);
int len2=strlen(str2);
int i;
for(i=0;i<len1;i++){
num1[i]=str1[i]-'0';
}
for(i=0;i<len2;i++){
num2[i]=str2[i]-'0';
}
int *p1=num1+len1-1;
int *p2=num2+len2-1;
for(i=0;i<len2;i++){
*p1=*p1-*p2;
if (*p1<0){
*p1=*p1+10;
*(p1-1)=*(p1-1)-1;
}
p1--;
p2--;
}
int sum=0;
for(i=0;i<len1;i++){
sum=sum+num1[i];
}
if (sum==0){
cout<<"0"<<endl;
return 0;
}
int state=0;
for(i=0;i<len1;i++){
if ((state==0)&&(num1[i]!=0)){
state++;
cout<<num1[i];
continue;
}
if (state==0){
if (num1[i]==0) continue;
}
if (state==1){
cout<<num1[i];
}
}
cout<<endl;
getchar();
}
return 0;
}
|
32
|
15797
|
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
|
15798
|
main()
{
char str1[10][100],str2[10][100];
int a[10],b[10];
int i,j,k,n,t[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",str1[i],str2[i]);
a[i]=strlen(str1[i]);b[i]=strlen(str2[i]);
}
for(i=0;i<n;i++)
{
for(j=0;j<a[i];j++)
{
if(j<a[i]-b[i])t[j]=str1[i][j]-48;
else t[j]=str1[i][j]-str2[i][j-a[i]+b[i]];
}
for(k=a[i]-1;k>=0;k--)
{
if(t[k]<0)
{
t[k-1]=t[k-1]-1;t[k]=t[k]+10;
}
}
for(k=0;k<a[i];k++)
{
printf("%d",t[k]);
}
printf("\n");
}
}
|
32
|
15799
|
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;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.