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_LE... |
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<=... |
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;
... |
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';
s... |
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)
... |
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+... |
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=1... |
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]]='\... |
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]... |
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);
... |
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]);
s... |
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], str... |
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]=... |
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 ... |
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[... |
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;... |
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... |
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... |
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... |
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]... |
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... |
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=... |
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++)
{
... |
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... |
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++)
... |
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++)
{
... |
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++)
... |
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<... |
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)con... |
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[... |
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... |
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... |
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... |
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';
}
... |
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] -... |
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... |
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])... |
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<l... |
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][l... |
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);
... |
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++)
{
resul... |
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];... |
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())!='\... |
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]... |
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(in... |
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-... |
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;
... |
32 | 15747 | /*??
?2??????????
????
?1?????????n????????2???1?????a??2????b(a > b)??????????????????????100?
????
n????????????????????
????
2
9999999999999999999999999999999999999
9999999999999
5409656775097850895687056798068970934546546575676768678435435345
1
????
9999999999999999999999990000000000000
... |
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,... |
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';... |
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;
}
}
... |
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]... |
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]... |
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 ... |
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[... |
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
... |
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-n... |
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 ... |
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]... |
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;... |
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;... |
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++)
{
... |
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... |
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-... |
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<=len... |
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++... |
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(re... |
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]=str... |
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--)
{
... |
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... |
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[10... |
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 = s... |
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... |
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... |
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??????... |
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... |
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];
... |
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)brea... |
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]... |
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);... |
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]-... |
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... |
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 ; ... |
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,t... |
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==... |
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>le... |
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-(l... |
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 ... |
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]... |
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] - ... |
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)????????......*******??????????????... |
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];
... |
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--)
anu... |
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... |
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=... |
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) ... |
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... |
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;
... |
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]... |
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--)
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.