id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
27,500 | int main()
{
long a,b,c,i,j;
scanf("%ld",&a);
c=log(a)/log(10)+1;
i=pow(10,c);
j=1;
b=0;
while(i>1)
{
b=b+(a%i)/(i/10)*j;
i=i/10;
j=j*10;
}
printf("%ld\n",b);
return 0;
} | 56 |
27,501 | void main()
{
int a,b,c,d,e,f,g;
scanf("%d",&a);
b=a/10000;
c=a/1000-b*10;
d=a/100-b*100-c*10;
e=a/10-b*1000-c*100-d*10;
f=a-b*10000-c*1000-d*100-e*10;
if(b!=0)
printf("%d%d%d%d%d",f,e,d,c,b);
else if(c!=0)
printf("%d%d%d%d",f,e,d,c);
else if(d!=0)
{
g=100*f+10*e+d;
printf("%d",g);
}
else if(e!=0)
printf("%d%d",f,e);
else if(f!=0)
printf("%d",f);
} | 56 |
27,502 | int main()
{
int n,a,b,c,d,e;
scanf("%d",&n);
a=n/10000;
b=(n-a*10000)/1000;
c=(n-a*10000-b*1000)/100;
d=(n-a*10000-b*1000-c*100)/10;
e=n-a*10000-b*1000-c*100-d*10;
int f[5]={e,d,c,b,a},i;
for(i=0;i<5;i++){
if(f[i]!=0)
printf("%d",f[i]);}
return 0;
}
| 56 |
27,503 | int main ()
{
unsigned long a1, a2, a3, a4, a5, num;
scanf ("%d", &num);
if (num>0&&num<10)
printf ("%ld", num);
else if (num<100)
{
a1=num/10;
a2=num%10;
printf ("%ld", 10*a2+a1);
}
else if (num<1000)
{
a1=num/100;
a2=num/10-10*a1;
a3=num%10;
printf ("%ld", a3*100+a2*10+a1);
}
else if (num<10000)
{
a1=num/1000;
a2=num/100-10*a1;
a3=num/10-10*a2-100*a1;
a4=num%10;
printf ("%ld", a4*1000+a3*100+a2*10+a1);
}
else
{
a1=num/10000;
a2=num/1000-10*a1;
a3=num/100-10*a2-100*a1;
a4=num/10-10*a3-100*a2-1000*a1;
a5=num%10;
printf ("%ld",10000*a5+1000*a4+100*a3+10*a2+a1);
}
return 0;
}
| 56 |
27,504 | int main()
{
int a,l,m,n,i;
int c[5];
int sum=0;
scanf("%d",&a);
n=log10(a);
for(m=a,i=n;i>=0;i--)
{
l=pow(10,i);
c[i]=m/l;
m=m%l;
}
//printf("%d",&c[i]);
for(i=0;i<=n;i++)
{
sum=sum+c[n-i]*pow(10,i);
}
printf("%d",sum);
return 0;
}
| 56 |
27,505 | int main()
{
int s=0,i,j,h,n,u[10],t,v[10];
scanf("%d",&n);
for(i=0;i<=6;i++)
{
h=1;
for(j=1;j<=i;j++)
h*=10;
if(n/h==0)
break;
}
for(j=i-1;j>=0;j--)
{
u[i]=n;
v[i]=0;
u[j]=u[j+1]-v[j+1]*pow(10,j+1);
v[j]=u[j]/pow(10,j);
}
for(j=0;j<=i-1;j++)
{
s+=v[j]*pow(10,i-1-j);
}
printf("%d",s);
return 0;
}
| 56 |
27,506 | void main()
{
int a,b,c,d,e,f,g,h,i,j;
scanf("%d",&a);
b=a/10000;
c=a/1000;
d=a/100;
e=a/10;
if(b>0)
{
f=c%10;
g=(d%100)%10;
h=((e%1000)%100)%10;
i=(((a%10000)%1000)%100)%10;
j=b+f*10+g*100+h*1000+i*10000;
}
else if(c>0)
{
f=d%10;
g=(e%100)%10;
h=((a%1000)%100)%10;
j=c+f*10+g*100+h*1000;
}
else if(d>0)
{
f=e%10;
g=(a%100)%10;
j=d+f*10+g*100;
}
else if(e>0)
{
f=a%10;
j=f*10+e;
}
else
j=a;
printf("%d",j);
} | 56 |
27,507 | int main()
{
char ch,a,b,c,d,e;
int n;
n=0;
while (scanf("%c",&ch)!=EOF)
{
n=n+1;
switch(n)
{
case 1:a=ch;break;
case 2:b=ch;break;
case 3:c=ch;break;
case 4:d=ch;break;
case 5:e=ch;break;
}
}
while (n>0)
{
switch(n)
{
case 5:printf("%c",e);break;
case 4:printf("%c",d);break;
case 3:printf("%c",c);break;
case 2:printf("%c",b);break;
case 1:printf("%c",a);break;
}
n=n-1;
}
return 0;
} | 56 |
27,508 | int main(int argc, char* argv[])
{
int n;
int a,b,c,d,e,s;
scanf("%d",&n);
if(n/10000>0){
a=(n%10);
b=(n%100)/10;
c=(n%1000)/100;
d=(n%10000)/1000;
e=n/10000;
s=a*10000+b*1000+c*100+d*10+e;
}
else if(n/1000>0){
a=(n%10);
b=(n%100)/10;
c=(n%1000)/100;
d=n/1000;
s=a*1000+b*100+c*10+d;
}
else if(n/100>0){
a=n%10;
b=(n%100)/10;
c=n/100;
s=a*100+b*10+c;
}
else if(n/10>0){
a=n%10;
b=n/10;
s=a*10+b;
}
printf("%d",s);
return 0;
}
| 56 |
27,509 | int main()
{
int shu,i,jieguo;
scanf("%d",&shu);
if(shu<10)
printf("%d",shu);
if(shu>=10&&shu<100)
{
jieguo=shu/10+(shu-shu/10*10)*10;
printf("%d",jieguo);
}
if(shu>=100&&shu<1000)
{
jieguo=shu/100+(shu-shu/100*100)/10*10+((shu-shu/100*100)-(shu-shu/100*100)/10*10)*100;
printf("%d",jieguo);
}
if(shu>=1000&&shu<10000)
{
jieguo=shu/1000+(shu-shu/1000*1000)/100*10+(shu-shu/100*100)/10*100+(shu-shu/10*10)*1000;
printf("%d",jieguo);
}
if(shu>=10000&&shu<100000)
{
jieguo=shu/10000+(shu-shu/10000*10000)/1000*10+(shu-shu/1000*1000)/100*100+(shu-shu/100*100)/10*1000+(shu-shu/10*10)*10000;
printf("%d",jieguo);
}
} | 56 |
27,510 | int main()
{
char input[20]={0},i=0;
while(scanf("%c",&input[i])!=-1&&input[i]!='\n')
i++;
for(i--;i>=0;i--)
printf("%c",input[i]);
printf("\n");
} | 56 |
27,511 | int main()
{
char a[10];
int i,j,k,n;
gets(a);
n=strlen(a);
for(i=0;i<=(n-1)/2;i++)
{
k=a[i];
a[i]=a[n-1-i];
a[n-1-i]=k;
}
for(i=0;i<n;i++)
printf("%d",a[i]-'0');
} | 56 |
27,512 | int main()
{
char a,b,c,d,e;
a=b=c=d=e=0;
scanf("%c%c%c%c%c",&a,&b,&c,&d,&e);
if(e!='\n'&&e)
putchar(e);
if(d!='\n'&&d)
putchar(d);
if(c!='\n'&&c)
putchar(c);
if(b!='\n'&&b)
putchar(b);
putchar(a);
} | 56 |
27,513 | int main()
{
int n,a,b,c,d,e,x;
scanf("%d",&n);
if(n>10000)
{
a=n/10000;
b=(n-10000*a)/1000;
c=(n-a*10000-b*1000)/100;
d=(n-a*10000-b*1000-c*100)/10;
e=n-a*10000-b*1000-c*100-d*10;
x=e*10000+d*1000+c*100+b*10+a;
}
if(n>10000)
{
a=n/10000;
b=(n-10000*a)/1000;
c=(n-a*10000-b*1000)/100;
d=(n-a*10000-b*1000-c*100)/10;
e=n-a*10000-b*1000-c*100-d*10;
x=e*10000+d*1000+c*100+b*10+a;
}
if(n>1000&&n<10000)
{
b=n/1000;
c=(n-b*1000)/100;
d=(n-b*1000-c*100)/10;
e=n-b*1000-c*100-d*10;
x=e*1000+d*100+c*10+b;
}
if(n>100&&n<1000)
{
c=n/100;
d=(n-c*100)/10;
e=n-c*100-d*10;
x=e*100+d*10+c;
}
if(n>10&&n<100)
{
d=n/10;
e=n-d*10;
x=e*10+d;
}
if(n>0&&n<10)
x=n;
printf("%d",x);
}
| 56 |
27,514 | void main()
{
char a,b,c,d,e,x,y;
scanf("%c%c%c%c%c",&a,&b,&c,&d,&e);
if(c=='\n')
{x=a;
a=b;
b=x;
printf("%c%c",a,b);}
else if(d=='\n')
{x=a;
a=c;
c=x;
printf("%c%c%c",a,b,c); }
else if(e=='\n')
{x=a;
a=d;
d=a;
y=b;
b=c;
c=y;
printf("%c%c%c%c",a,b,c,d);}
else {x=a;
a=e;
e=x;
y=b;
b=d;
d=y;
printf("%c%c%c%c%c",a,b,c,d,e);}
}
| 56 |
27,515 | /*??????*/
int main()
{
char num[6];
int a;
cin>>num;
a=strlen(num);//???????
int i,j;
char t;
for(i=0,j=a-1;i<=(a-1)/2;i++,j--)//????????
{
t=num[i];
num[i]=num[j];
num[j]=t;
}
for(i=0;i<a;i++)
{
cout<<num[i];
}
cout<<endl;
return 0;
} | 56 |
27,516 | int main()
{
int a,b,c,d,e,f,g;
scanf("%d",&a);
if(a<100)
{
b=a%10;
c=(int)(a/10);
d=10*b+c;
printf("%d\n",d);
}
else if(a>100&&a<1000)
{
b=(int)(a/100);
c=(int)(a/10)-10*b;
d=a-100*b-10*c;
e=100*d+10*c+b;
printf("%d",e);
}
else if(a>1000&&a<10000)
{
b=(int)(a/1000);
c=((a%100)-(a%10))/10;
d=((a%1000)-(a%100))/100;
e=a%10;
f=1000*e+100*c+10*d+b;
printf("%d",f);
}
else
{
b=(int)(a/10000);
c=((a%100)-(a%10))/10;
d=((a%1000)-(a%100))/100;
g=((a%10000)-(a%1000))/1000;
e=a%10;
f=10000*e+1000*c+100*d+10*g+b;
printf("%d",f);
}
return 0;
} | 56 |
27,517 | void main()
{
char a,b,c,d,e;
scanf("%c%c%c%c%c",&a,&b,&c,&d,&e);
printf("%c%c%c%c%c\n",e,d,c,b,a);
} | 56 |
27,518 | int main()
{
int n,a,b,c,d,e;
scanf("%d",&n);
a=n/10000;
b=(n-a*10000)/1000;
c=(n-a*10000-b*1000)/100;
d=(n-a*10000-b*1000-c*100)/10;
e=(n-a*10000-b*1000-c*100-d*10);
if(a!=0&&b!=0&&c!=0&&d!=0&&e!=0)
{
printf("%d%d%d%d%d",e,d,c,b,a);
}
else if(a==0&&b!=0&&c!=0&&d!=0&&e!=0)
{
printf("%d%d%d%d",e,d,c,b);
}
else if(a==0&&b==0&&c!=0&&d!=0&&e!=0)
{
printf("%d%d%d",e,d,c);
}
else if(a==0&&b==0&&c==0&&d!=0&&e!=0)
{
printf("%d%d",e,d);
}
else if(a==0&&b==0&&c==0&&d==0&&e!=0)
{
printf("%d",e);
}
return 0;
}
| 56 |
27,519 | int main( ){
int n,y;
int t=0;
scanf("%d",&n);
if(n>10000){
int i=4;
for(int num=n;num>0;num/=10){
y=pow(10,i);
t=t+num%10*y;
i=i-1;
}
}
else if(n>1000){
int i=3;
for(int num=n;num>0;num/=10){
y=pow(10,i);
t=t+num%10*y;
i=i-1;
}
}
else if(n>100){
int i=2;
for(int num=n;num>0;num/=10){
y=pow(10,i);
t=t+num%10*y;
i=i-1;
}
}
else if(n>10){
int i=1;
for(int num=n;num>0;num/=10){
y=pow(10,i);
t=t+num%10*y;
i=i-1;
}
}
else if(n>1){
t=n;
}
printf("%d",t);
return 0;
} | 56 |
27,520 |
void main()
{
int m = 0;
int n;
scanf("%d", &n);
int a[5];
int i = 0;
while(n>=1)
{
a[i] = n%10;
n = (int)(n/10);
i++;
}
int k = 0 ;
int j = 0 ;
for(j = i; j >0; j--, k ++)
{
m = 10*m + a[k];
}
printf("%d", m);
}
| 56 |
27,521 | void main()
{
int a[10];
int i=1,j,m,n,k,sum=0,t=1;
scanf("%d",&m);
for(i=0;i<=5;i++)
{
if(t<=m&&m<t*10)
{
k=i+1;
break;
}
t*=10;
}
for(j=k-1;j>=0;j--)
{
a[j] = m%10;
m = m/10;
}
for(n=k-1;n>=0;n--)
{
sum=sum+a[n];
sum*=10;
}
sum=sum/10;
printf("%d\n",sum);
}
| 56 |
27,522 | void main()
{
long int n,a,b,c,d,e,sum;
scanf("%ld",&n);
if (n/10==0) {a=n;printf("%ld",a);}
else if(n/100==0) {a=n/10;b=n-a*10; sum=b*10+a;printf("%ld",sum);}
else if(n/1000==0) {a=n/100;b=(n-a*100)/10;c=n-a*100-b*10;sum=100*c+10*b+a;printf("%ld",sum);}
else if (n/10000==0) {a=n/1000;b=(n-a*1000)/100;c=(n-a*1000-b*100)/10;d=n-a*10000-b*100-c*10;sum=d*1000+c*100+b*10+a;printf("%ld",sum);}
else if (n/100000==0) {a=n/10000;b=(n-a*10000)/1000;c=(n-a*10000-b*1000)/100;d=(n-a*10000-b*1000-c*100)/10;e=n-a*10000-b*1000-c*100-d*10;sum=e*10000+d*1000+c*100+b*10+a;printf("%ld",sum);}
}
| 56 |
27,523 | void main()
{int a,b,c,d,e,f,g,h,i;
scanf("%d",&a);
if(a>9999)
{ b=a/10000;
c=a%10000;
d=c/1000;
e=c%1000;
f=e/100;
g=e%100;
h=g/10;
i=g%10;
printf("%d%d%d%d%d",i,h,f,d,b);}
else if(a>999)
{d=a/1000;
e=a%1000;
f=e/100;
g=e%100;
h=g/10;
i=g%10;
printf("%d%d%d%d",i,h,f,d);}
else if(a>99)
{ f=a/100;
g=a%100;
h=g/10;
i=g%10;
printf("%d%d%d",i,h,f);}
else if(a>9)
{h=a/10;
i=a%10;
printf("%d%d",i,h);}
else printf("%d",a);
}
| 56 |
27,524 | void main()
{
int n,t=0;
scanf("%d",&n);
while(n!=0)
{
t=t*10+n%10;
n=(n-n%10)/10;
}
printf("%d",t);
}
| 56 |
27,525 | int main(){
int n,m=0,a=0;
scanf("%d",&n);
while(n!=a){
a=n%10;
if(a==n)
break;
else{
m=m*10+a*10;
}
n=n/10;
}
m=m+a;
printf("%d",m);
return 0;
}
| 56 |
27,526 | void main()
{int a,b,c,d,e,f;
scanf("%d",&a);
b=a/10000;
c=a/1000-b*10;
d=a/100-b*100-c*10;
e=a/10-b*1000-c*100-d*10;
f=a-b*10000-c*1000-d*100-e*10;
if(b!=0)
{printf("%d",f*10000+e*1000+d*100+c*10+b);}
else if (c!=0)
{printf("%d",f*1000+e*100+d*10+c);}
else if (d!=0)
{printf("%d",f*100+e*10+d);}
else if (e!=0)
{printf("%d",f*10+e);}
else if (f!=0)
{printf("%d",f);}
else {printf("0");}
} | 56 |
27,527 | int main ()
{
int n;
scanf ("%d",&n);
int i,r = 0,t = n,a,tmp;
do
{
t=(int)(t/10);
r++;
}while (t>0);
for (i=0;i<r;i++)
{
t = n/(int)pow(10,i);
a = t%10;
printf ("%d",a);
}
return 0;
} | 56 |
27,528 | int main()
{
int a[10];
int i,k,s;
cin>>s;
for(i=0;i<5;i++)
{
a[i]=s%10;
s=s/10;
if(s==0) {k=i;break;}
}
for(i=0;i<=k;i++)
{
cout<<a[i];
}
cout<<endl;
return 0;
} | 56 |
27,529 | int main()
{
int a,b,c,d,e,n,m;
scanf("%d",&n);
a=(int)(n/10000);
b=(int)((n-a*10000)/1000);
c=(int)((n-a*10000-b*1000)/100);
d=(int)((n-a*10000-b*1000-c*100)/10);
e=n-a*10000-b*1000-c*100-d*10;
if(a!=0){
m=e*10000+d*1000+c*100+b*10+a;}
else if(a=0&&b!=0){
m=e*1000+d*100+c*10+b;}
else if(a==0&&b==0&&c!=0){
m=e*100+d*10+c;}
else if(a==0&&b==0&&c==0&&d!=0){
m=e*10+d;}
else if(a==0&&b==0&&c==0&&d==0&&e!=0){
m=e;}
printf("%d",m);
return 0;
} | 56 |
27,530 | void main()
{
int a,m,n,p,q,r;
scanf("%d",&a);
if(a/10000!=0)
m=a/10000;
else if(a/10000==0)
m=0;
if(a/1000!=0)
n=(a-10000*m)/1000;
else if(a/1000==0)
n=0;
if(a/100!=0)
p=(a-10000*m-1000*n)/100;
else if(a/100==0)
p=0;
if(a/10!=0)
q=(a-10000*m-1000*n-100*p)/10;
else if(a/10==0)
q=0;
r=a-10000*m-1000*n-100*p-10*q;
if(a/10000!=0)
printf("%d%d%d%d%d",r,q,p,n,m);
else if(a/1000!=0)
printf("%d%d%d%d",r,q,p,n);
else if(a/100!=0)
printf("%d%d%d",r,q,p);
else if(a/10!=0)
printf("%d%d",r,q);
else if(a/10==0)
printf("%d",r);
}
| 56 |
27,531 |
int main(int argc, char* argv[])
{
int n,a[5],i;
scanf("%d",&n);
a[0]=n/10000;
a[1]=(n%10000)/1000;
a[2]=(n%1000)/100;
a[3]=(n%100)/10;
a[4]=(n%10);
for(i=4;i>=0;i--){
if(a[i]==0)
continue;
printf("%d",a[i]);
}
return 0;
} | 56 |
27,532 | int main()
{
int m,i;
char a[6];
scanf("%s",a);
m=strlen(a);
for(i=m;i>=0;i--)
{
if(a[i]=='\0') continue;
else printf("%c",a[i]);
}
return 0;
}
| 56 |
27,533 |
int main()
{
int i,k;
char list[5],list1[5];
gets(list);
for(k=0;k<5;k++)
if(list[k]=='\0')
break;
for(i=0;i<k;i++)
list1[i]=list[k-i-1];
for(i=0;i<k;i++)
{
printf("%c",list1[i]);
}
return 0;
}
| 56 |
27,534 | void main()
{
int n;
scanf("%d",&n);
r(n);
}
r(int m)
{
printf("%d",m%10);
m=m/10;
if(m!=0)
return r(m);
} | 56 |
27,535 | void main()
{
int n,a,b,c,d,e;
scanf("%d",&n);
a=n/10000;
b=(n-10000*a)/1000;
c=(n-10000*a-1000*b)/100;
d=(n-10000*a-1000*b-100*c)/10;
e=(n-10000*a-1000*b-100*c-10*d)/1;
if (a==0&&b!=0)
printf("%d%d%d%d\n",e,d,c,b);
else if (b==0&&c!=0)
printf("%d%d%d\n",e,d,c);
else if (c==0&&d!=0)
printf("%d%d\n",e,d);
else if (d==0)
printf("%d\n",e);
else printf("%d%d%d%d%d\n",e,d,c,b,a);
} | 56 |
27,536 | int main()
{
long int n;
int a,b,c,d,e,p;
scanf("%ld",&n);
if(n>9999)
p=5;
else
{
if(n>999&&n<=9999)
p=4;
else
{
if(n>99&&n<=999)
p=3;
else
{
if(n>9&&n<=99)
p=2;
else
p=1;
}
}
}
switch(p)
{
case 5:
a=n/10000;
b=(n-a*10000)/1000;
c=(n-10000*a-1000*b)/100;
d=(n-10000*a-1000*b-100*c)/10;
e=(n-10000*a-1000*b-100*c-10*d)/1;
printf("%d%d%d%d%d",e,d,c,b,a);
break;
case 4:
b=n/1000;
c=(n-1000*b)/100;
d=(n-1000*b-100*c)/10;
e=(n-1000*b-100*c-10*d)/1;
printf("%d%d%d%d",e,d,c,b);
break;
case 3:
c=n/100;
d=(n-100*c)/10;
e=(n-100*c-10*d)/1;
printf("%d%d%d",e,d,c);
break;
case 2:
d=n/10;
e=(n-10*d)/1;
printf("%d%d",e,d);
break;
case 1:
e=n/1;
printf("%d",e);
}
return 0;
}
| 56 |
27,537 | int main()
{
int a, n1, n2, n3, n4, n5, b;
scanf("%d", &a);
n1 = a/10000;
n2 = a/1000 - n1 * 10;
n3 = a/100 - n1 * 100 - n2 * 10;
n4 = a/10 - n1 * 1000 - n2 * 100 - n3 * 10;
n5 = a - n1 * 10000 - n2 * 1000 - n3 * 100 - n4 * 10;
b = n5 * 10000 + n4 * 1000 + n3 * 100 + n2 * 10 + n1;
if(a/10==0)
printf("%d", b/10000);
else if(a/100==0)
printf("%d", b/1000);
else if(a/1000==0)
printf("%d", b/100);
else if(a/10000==0)
printf("%d", b/10);
else
printf("%d", b);
return 0;
} | 56 |
27,538 | int main()
{
int a,i,j,n;
int b[5],tem[6];
scanf("%d",&a);
tem[0]=a;
for(i=0;i<5;i++)
{
b[i]=tem[i]%10;
tem[i+1]=(tem[i]-b[i])/10;
if(tem[i+1]==0)
{
n=i;
break;
}
}
for(j=0;j<=n;j++)
printf("%d",b[j]);
return 0;
} | 56 |
27,539 |
int main(int argc, char * argv[])
{
int x,a,b,c,d,e,m=0;
scanf("%d",&x);
a=x%10;m=10*m+a;
b=(x/10)%10;m=10*m+b;
c=(x/100)%10;m=10*m+c;
d=(x/1000)%10;m=10*m+d;
e=(x/10000)%10;m=10*m+e;
if(e==0) m=m/10;
else m=m;
if(e==0,d==0) m=m/10;
else m=m;
if(e==0,d==0,c==0) m=m/10;
else m=m;
if(e==0,d==0,c==0,b==0) m=m/10;
else m=m;printf("%d",m);
}
| 56 |
27,540 | void main()
{ int a,b,c,d,e,g;
scanf("\n%d",&g);
e=g/10000;
d=g/1000-10*e;
c=g/100-10*(g/1000);
b=g/10-10*(g/100);
a=g-10*(g/10);
if(g>=10000) printf("%d%d%d%d%d",a,b,c,d,e);
else if(g<10000&&g>=1000) printf("%d%d%d%d",a,b,c,d);
else if(g<1000&&g>=100) printf("%d%d%d",a,b,c);
else if(g<100&&g>=10) printf("%d%d",a,b);
else printf("%d",a);
}
| 56 |
27,541 | int main()
{
int p1,p2,p3,p4,p5,n,x; //????????????????????
cin>>n;
if (n>=10000) //????5??
{
p1=n/10000; //????
p2=(n-10000*p1)/1000; //????
p3=(n-10000*p1-1000*p2)/100; //????
p4=(n-10000*p1-1000*p2-100*p3)/10; //????
p5=n-10000*p1-1000*p2-100*p3-10*p4; //????
x=p5*10000+p4*1000+p3*100+p2*10+p1; //?????
}
else if (n>=1000) //???????
{
p1=n/1000;
p2=(n-1000*p1)/100;
p3=(n-1000*p1-100*p2)/10;
p4=n-1000*p1-100*p2-10*p3;
x=p4*1000+p3*100+p2*10+p1;
}
else if (n>=100) //???????
{
p1=n/100;
p2=(n-100*p1)/10;
p3=n-100*p1-10*p2;
x=p3*100+p2*10+p1;
}
else if (n>=10) //???????
{
p1=n/10;
p2=n-10*p1;
x=p2*10+p1;
}
else //???????
x=n;
cout<<x;
return 0;
} | 56 |
27,542 | int main()
{
int n;
scanf("%d",&n);
if(n>9999)
{
int a,b,c,d,e;
a=n%10;
b=(n%100-a)/10;
c=(n%1000-10*b-a)/100;
d=(n%10000-100*c-10*b-a)/1000;
e=n/10000;
printf("%d%d%d%d%d\n",a,b,c,d,e);
}
else
if(n>999)
{
int a,b,c,d;
a=n%10;
b=(n%100-a)/10;
c=(n%1000-10*b-a)/100;
d=n/1000;
printf("%d%d%d%d\n",a,b,c,d);
}
else
if(n>99)
{
int a,b,c;
a=n%10;
b=(n%100-a)/10;
c=n/100;
printf("%d%d%d\n",a,b,c);
}
else
if(n>9)
{
int a,b;
a=n%10;
b=n/10;
printf("%d%d\n",a,b);
}
else
printf("%d\n",n);
return 0;
} | 56 |
27,543 | int main(int argc, char* argv[])
{
int n;
int a,b,c,d,e;
scanf("%d",&n);
if(n<10)
printf("%d\n",n);
if(10<n&&n<100)
{
a=n/10;
b=n-10*a;
printf("%d\n",10*b+a);
}
if(100<n&&n<1000)
{
a=n/100;
b=(n-a*100)/10;
c=n-a*100-b*10;
printf("%d\n",100*c+10*b+a);
}
if(1000<n&&n<10000)
{
a=n/1000;
b=(n-a*1000)/100;
c=(n-a*1000-b*100)/10;
d=n-a*1000-b*100-c*10;
printf("%d\n",1000*d+100*c+10*b+a);
}
if(10000<n&&n<100000)
{
a=n/10000;
b=(n-a*10000)/1000;
c=(n-a*10000-b*1000)/100;
d=(n-a*10000-b*1000-c*100)/10;
e=n-a*10000-b*1000-c*100-d*10;
printf("%d\n",10000*e+1000*d+100*c+10*b+a);
}
return 0;
}
| 56 |
27,544 | int main()
{
short length,i,j=1;
char number[6];
while(j<=4)
{
scanf("%s",number);
length=strlen(number);
for(i=length-1;i!=-1;i--)
{
printf("%c",number[i]);
}
putchar('\n');
j++;
}
return(0);
} | 56 |
27,545 | void main()
{
char a[10],b[10]="";
int i,j,k,n;
scanf("%s",a);
n=strlen(a);
for (i=0;i<=n-1;i++)
b[i]=a[n-i-1];
puts(b);
} | 56 |
27,546 | int main()
{
int n,i,a,b=0;
scanf("%d",&n);
for(i=0;i<=4;i++)
{
a=n%10;
n=n/10;
b=10*b+a;
if(n==0)
break;
}
printf("%d\n",b);
return 0;
} | 56 |
27,547 | int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
int x1,x2,x3,x4,x5;
x1=n%10;
x2=((n-x1)%100)/10;
x3=((n-x1-x2*10)%1000)/100;
x4=((n-x1-x2*10-x3*100)%10000)/1000;
x5=((n-x1-x2*10-x3*100-x4*1000)%100000)/10000;
if(x5!=0)
{
printf("%d%d%d%d%d",x1,x2,x3,x4,x5);
}
else if(x5==0&&x4!=0)
{
printf("%d%d%d%d",x1,x2,x3,x4);
}
else if(x5==0&&x4==0&&x3!=0)
{
printf("%d%d%d",x1,x2,x3);
}
else if(x5==0&&x4==0&&x3==0&&x2!=0)
{
printf("%d%d",x1,x2);
}
return 0;
} | 56 |
27,548 | void main()
{
int x,a,b,c,d,e;
scanf("%d",&x);
if(x>9999)
{a=x/10000;b=(x-a*10000)/1000;c=(x-a*10000-b*1000)/100;d=(x-a*10000-b*1000-c*100)/10;e=x-a*10000-b*1000-c*100-d*10;printf("%d",e*10000+d*1000+c*100+b*10+a);}
else if(x>999)
{a=x/1000;b=(x-a*1000)/100;c=(x-a*1000-b*100)/10;d=(x-a*1000-b*100-c*10);printf("%d",d*1000+c*100+b*10+a);}
else if(x>99)
{a=x/100;b=(x-a*100)/10;c=x-a*100-b*10;printf("%d",c*100+b*10+a);}
else if(x>9)
{a=x/10;b=x-a*10;printf("%d",b*10+a);}
}
| 56 |
27,549 | void main()
{
int n,a,b,c,d,e;
scanf("%d",&n);
a=n%10;n=n/10;
b=n%10;n=n/10;
c=n%10;n=n/10;
d=n%10;n=n/10;
e=n%10;n=10000*a+1000*b+100*c+10*d+e;
if(n%10==0) n=n/10;
if(n%10==0) n=n/10;
if(n%10==0) n=n/10;
if(n%10==0) n=n/10;
printf("%d\n",n);
}
| 56 |
27,550 |
main()
{
int a;
cin>>a;
int b;int c;int d;int e;int f;int k=0;
if(10000<=a)
{b=a/10000;
c=(a-10000*b)/1000;
d=(a-10000*b-1000*c)/100;
e=(a-10000*b-1000*c-100*d)/10;
f=a-10000*b-1000*c-100*d-10*e;
k=10000*f+1000*e+100*d+10*c+b;
cout<<k;}
else if(1000<=a)
{c=(a)/1000;
d=(a-1000*c)/100;
e=(a-1000*c-100*d)/10;
f=a-1000*c-100*d-10*e;
k=1000*f+100*e+10*d+c;
cout<<k;
}
else if(100<=a)
{
d=(a)/100;
e=(a-100*d)/10;
f=a-100*d-10*e;
k=100*f+10*e+d;
cout<<k;
}
else if(10<=a)
{
e=(a)/10;
f=10*e;
k=10*f+e;
cout<<k;
}
else cout<<k;
} | 56 |
27,551 |
int main(int argc, char* argv[])
{
int a,b;
int shu[5];
int i;
scanf("%d",&a);
b=a;
int wei=0;
do{
a=a/10;
wei++;
}while(a!=0);
for(i=0;i<wei;i++){
shu[i]=b/pow(10,wei-1-i);
b=b-shu[i]*pow(10,wei-1-i);
}
int sum=0;
for(i=0;i<wei;i++){
sum=sum+shu[i]*pow(10,i);
}
printf("\n%d",sum);
return 0;
}
| 56 |
27,552 | void main()
{
int di,number,k,j,n;
n=1;
di=10;
scanf("%d",&number);
do
{
j=number-di;
if(j>0)
{
n=n+1;
di=di*10;
}
}
while(j>0);
j=0;
di=10;
do
{
k=((number%di)-(number%(di/10)))/(di/10);
printf("%d",k);
di=di*10;
j=j+1;
}
while(j<n);
}
| 56 |
27,553 | int main()
{
int m,i,a[5],s;
scanf("%d",&m);
for(i=4,s=0;i>=0;i--)
if(m/(int)pow(10,i)!=0)
{
a[s]=m/(int)pow(10,i);
m=m-a[s]*(int)pow(10,i);
s++;
}
for(;s-1>=0;s--)
printf("%d",a[s-1]);
return 0;
} | 56 |
27,554 | void main()
{
int n,a,b,c,d,e,q;
scanf("%d",&n);
a=n/10000;
if(a!=0) b=(n-a*10000)/1000;
else b=n/1000;
if(b!=0) c=(n-a*10000-b*1000)/100;
else c=n/100;
if(c!=0) d=(n-a*10000-b*1000-c*100)/10;
else d=n/10;
if(d!=0) e=n-a*10000-b*1000-c*100-d*10;
else e=n;
if(n>10000) q=e*10000+d*1000+c*100+b*10+a;
else if(n>1000&n<10000) q=e*1000+d*100+c*10+b;
else if(n>100&n<1000) q=e*100+d*10+c;
else if(n>10&n<100) q=e*10+d;
else q=e;
printf("%d",q);
} | 56 |
27,555 |
void change(char s[],int i);
void main()
{
char s[6];
int i;
gets(s);
for(i=0;i<6;i++)
if(s[i]=='\0')break;
change(s,i);
}
void change(char s[],int i)
{
if(i==1)putchar(s[0]);
else
{
printf("%c",s[i-1]);
change(s,i-1);
}
} | 56 |
27,556 | void main()
{
int a,s;
int b,c;
int q,w,e,r,t;
scanf("%d",&a);
b=1;
c=0;
while(a/b>0)
{b=b*10;
c=c+1;
}
if(c==5)
{
q=a/10000;
w=(a-q*10000)/1000;
e=(a-q*10000-w*1000)/100;
r=(a-q*10000-w*1000-e*100)/10;
t=(a-q*10000-w*1000-e*100-r*10);
s=t*10000+r*1000+e*100+w*10+q;
}
if(c==4)
{
q=a/1000;
w=(a-q*1000)/100;
e=(a-q*1000-w*100)/10;
r=(a-q*1000-w*100-e*10);
s=r*1000+e*100+w*10+q;
}
if(c==3)
{
q=a/100;
w=(a-q*100)/10;
e=(a-q*100-w*10);
s=e*100+w*10+q;
}
if(c==2)
{
q=a/10;
w=a-q*10;
s=w*10+q;
}
if(c==1)s=a;
printf("%d\n",s);
} | 56 |
27,557 |
int main()
{
int a,b,c,d;
void f(int x);
scanf("%d%d%d%d",&a,&b,&c,&d);
f(a);
f(b);
f(c);
f(d);
return 0;
}
void f(int x)
{
int y=0;
while(x>9)
{
y=(y+x-x/10*10)*10;
x/=10;
}
y+=x;
printf("%d\n",y);
} | 56 |
27,558 | int main()
{
int n,a,b,c,d,e,result; //???????n?????????a,b,c,d,e?????result???
cin>>n; //??n
e=n%10;
d=(n%100-e)/10;
c=(n%1000-d*10-e)/100;
b=(n%10000-c*100-d*10-e)/1000;
a=(n-n%10000)/10000; //????n?????????
if(n>10000) result=e*10000+d*1000+c*100+b*10+a;
else if(n>1000) result=e*1000+d*100+c*10+b;
else if(n>100) result=e*100+d*10+c;
else if(n>10) result=e*10+d;
else result=e; //????n???????????
cout<<result<<endl; //??????
return 0;
} | 56 |
27,559 | int main()
{
int a,b,c,d,e,f,g,h;
scanf("%d",&a);
b=a%10;
c=(a-b)%100;
d=(a-b-c)%1000;
e=(a-b-c-d)/1000;
f=e%10;
g=(e-f)/10;
if(a/10000>=1&&a/10000<10)
h=10000*b+100*c+d+10*f+g;
else if(a/1000>=1&&a/1000<10)
h=1000*b+10*c+d/10+e;
else if(a/100>=1&&a/100<10)
h=100*b+c+d/100;
else if(a/10>=1&&a/10<10)
h=10*b+c/10;
else if(a>=1&&a<10)
h=b;
printf("%d\n",h);
return 0;
}
| 56 |
27,560 | void main()
{
int a,b,c,d,e,f;
scanf("%d",&a);
if(a/10000>=1&&a/10000<10)
{f=a%10;e=(a%100-f)/10;d=(a%1000-e*10-f)/100;c=(a%10000-d*100-e*10-f)/1000;b=(a%1000000-c*1000-d*100-e*10-f)/10000;
printf("%d%d%d%d%d\n",f,e,d,c,b);}
else if(a/1000>=1&&a/1000<10)
{f=a%10;e=(a%100-f)/10;d=(a%1000-e*10-f)/100;c=(a%10000-d*100-e*10-f)/1000;
printf("%d%d%d%d\n",f,e,d,c);}
else if(a/100>=1&&a/100<10)
{f=a%10;e=(a%100-f)/10;d=(a%1000-e*10-f)/100;
printf("%d%d%d\n",f,e,d);}
else if(a/10>=1&&a/10<10)
{f=a%10;e=(a%100-f)/10;
printf("%d%d\n",f,e);}
else if(a>=1&&a<=10)
{f=a%10;
printf("%d\n",f);}
else
printf("error\n");
} | 56 |
27,561 | int main()
{
int n,m;
int a,b,c,d,e;
scanf("%d",&n);
a=n/10000;
b=(n-10000*a)/1000;
c=(n-10000*a-1000*b)/100;
d=(n-10000*a-1000*b-100*c)/10;
e=n-10000*a-1000*b-100*c-10*d;
if(a!=0&&b!=0&&c!=0&&d!=0&&e!=0){
m=10000*e+1000*d+100*c+10*b+1*a;
printf("%d",m);}
if(a==0&&b!=0&&c!=0&&d!=0&&e!=0){
m=1000*e+100*d+10*c+1*b;
printf("%d",m);}
if(a==0&&b==0&&c!=0&&d!=0&&e!=0){
m=100*e+10*d+1*c;
printf("%d",m);}
if(a==0&&b==0&&c==0&&d!=0&&e!=0){
m=10*e+1*d;
printf("%d",m);}
if(a==0&&b==0&&c==0&&d==0&&e!=0){
m=1*e;
printf("%d",m);}
return 0;
}
| 56 |
27,562 | main()
{int a[6],l,i;
l=1;
while(scanf("%1d",&a[l])==1)l++;
l--;
for(i=l;i>=1;i--)printf("%d",a[i]);
}
| 56 |
27,563 | void main()
{
void NIXU(int x);
int n;
scanf("%d",&n);
NIXU(n);
}
void NIXU(int x)
{
int i;
if((i=x/10)!=0)
{
putchar(x%10+'0');
NIXU(i);
}
else putchar(x+'0');
} | 56 |
27,564 | int main()
{
char a[5],b[5];
int i,j;
gets(a);
int length=(int)strlen(a);
for(i=length-1,j=0;i>=0;i--,j++)
b[j]=a[i];
b[j]='\0';
puts(b);
return 0;
}
| 56 |
27,565 |
int main(int argc, char* argv[])
{
int n;
int a,b,c,d,e,f;
scanf("%d",&n);
a=n%10;
b=(n%100-a)/10;
c=(n%1000-n%100)/100;
d=(n%10000-n%1000)/1000;
e=(n-n%10000)/10000;
if(n/10==0)
{
f=a;
}
else if(n/100==0)
{
f=10*a+b;
}
else if(n/1000==0)
{
f=100*a+10*b+c;
}
else if(n/10000==0)
{
f=1000*a+100*b+10*c+d;
}
else if(n/100000==0)
{
f=10000*a+1000*b+100*c+10*d+e;
}
printf("%d\n",f);
return 0;
}
| 56 |
27,566 | void main()
{
int n,w,q,b,s,g,k,a[200],i;
scanf ("%d",&n);
w=n/10000;
q=(n-w*10000)/1000;
b=(n-w*10000-q*1000)/100;
s=(n-w*10000-q*1000-b*100)/10;
g=n-w*10000-q*1000-b*100-s*10;
if (w==0&&q!=0&&b!=0&&s!=0) k=4;
else if (w==0&&q==0&&b!=0&&s!=0) k=3;
else if (w==0&&q==0&&b==0&&s!=0) k=2;
else if (w==0&&q==0&&b==0&&s==0) k=1;
else k=5;
a[0]=g;a[1]=s;a[2]=b;a[3]=q;a[4]=w;
for (i=0;i<k;i++)
{ printf ("%d",a[i]);}
}
| 56 |
27,567 | void main()
{
int i=0;
char str[10];
scanf("%s",str);
while(str[i]!='\0')
i++;
for(i--;i>=0;i--)
printf("%c",str[i]);
printf("\n");
}
| 56 |
27,568 | void main()
{
int x,a,b,c,d,e;
scanf("%d",&x);
if (x>=10000)
{
a=x/10000;
b=(x-a*10000)/1000;
c=(x-a*10000-b*1000)/100;
d=(x-a*10000-b*1000-c*100)/10;
e=x-a*10000-b*1000-c*100-d*10;
x=e*10000+d*1000+c*100+b*10+a;
}
else if(x>=1000)
{
b=x/1000;
c=(x-b*1000)/100;
d=(x-b*1000-c*100)/10;
e=x-b*1000-c*100-d*10;
x=e*1000+d*100+c*10+b;
}
else if(x>=100)
{
c=x/100;
d=(x-c*100)/10;
e=x-c*100-d*10;
x=e*100+d*10+c;
}
else if(x>=10)
{
d=x/10;
e=x-d*10;
x=e*10+d;
}
else
{
e=x;
x=e;
}
printf("%d",x);
}
| 56 |
27,569 |
void main()
{
int n;
int a[5]={0,0,0,0,0};
scanf("%d",&n);
if((n-10000)>0){
a[0]=n-(n/10*10);
a[1]=n/10-(n/100*10);
a[2]=n/100-(n/1000*10);
a[3]=n/1000-(n/10000*10);
a[4]=n/10000;
printf("%d%d%d%d%d",a[0],a[1],a[2],a[3],a[4]);
}
else if((n-1000)>0){
a[0]=n-(n/10*10);
a[1]=n/10-(n/100*10);
a[2]=n/100-(n/1000*10);
a[3]=n/1000;
printf("%d%d%d%d",a[0],a[1],a[2],a[3]);
}
else if((n-100)>0){
a[0]=n-(n/10*10);
a[1]=n/10-(n/100*10);
a[2]=n/100;
printf("%d%d%d",a[0],a[1],a[2]);
}
else if((n-10)>0){
a[0]=n-(n/10*10);
a[1]=n/10;
printf("%d%d",a[0],a[1]);
}
else if((n-10)<0){
a[0]=n;
printf("%d",a[0]);
}
}
| 56 |
27,570 | int main()
{
int j,i,a,m,k,n;
scanf("%d",&j);
i=(int)(j/10000);
a=(int)((j-i*10000)/1000);
m=(int)((j-i*10000-a*1000)/100);
k=(int)((j-i*10000-a*1000-m*100)/10);
n=j-i*10000-a*1000-m*100-k*10;
if(i!=0)printf("%d%d%d%d%d\n",n,k,m,a,i);
if(i==0&&a!=0)printf("%d%d%d%d\n",n,k,m,a);
if(i==0&&a==0&&m!=0)printf("%d%d%d\n",n,k,m);
if(i==0&&a==0&&m==0&&k!=0)printf("%d%d\n",n,k);
if(i==0&&a==0&&m==0&&k==0)printf("%d\n",n);
return 0;
}
| 56 |
27,571 | int main()
{
int a,b;
b=0;
scanf("%d",&a);
if(a<9)
{
printf("%d",a);
}
while(a>9)
{
b=(b+a-a/10*10)*10;
a=a/10;
}
printf("%d",b+a);
return 0;
} | 56 |
27,572 | int main()
{
long b=0;
long a[4][1];
double t=0;
int c[5];
int i,j,f,k;
for(i=0;i<4;i++)
{
scanf("%ld",&a[i][0]);
}
for(i=0;i<4 && a[i][0]!=0;i++)
{
b=0;
for(k=0;k<5 && a[i][0]!=0;k++)
{
c[k]=(a[i][0]%10);
a[i][0]=a[i][0]/10;
}
for(j=0;j<k;j++)
{
t=pow(10,(k-1-j));
f=(long)t;
b=b+f*c[j];
}
printf("%ld\n",b);
}
return 0;
}
| 56 |
27,573 | int main()
{
int num,n[6],sum;
scanf("%d",&num);
n[5]=num/10000;
n[4]=num/1000-10*n[5];
n[3]=num/100-100*n[5]-10*n[4];
n[2]=num/10-1000*n[5]-100*n[4]-10*n[3];
n[1]=num%10;
sum=10000*n[1]+1000*n[2]+100*n[3]+10*n[4]+n[5];
while(sum%10==0)
{
sum=sum/10;
}
printf("%d",sum);
}
| 56 |
27,574 | int main()
{
int a,b,c,d,e,f,g,h,i,j,k,l,m,o,p,n;
scanf("%d",&n);
if(n>=10000)
{
a=n/10000;
b=(n-a*10000)/1000;
c=(n-a*10000-b*1000)/100;
d=(n-a*10000-b*1000-c*100)/10;
e=n-a*10000-b*1000-c*100-d*10;
printf("%d%d%d%d%d",e,d,c,b,a);
}
else if(n>=1000&&n<=10000)
{
f=n/1000;
g=(n-f*1000)/100;
h=(n-f*1000-g*100)/10;
i=n-f*1000-g*100-h*10;
printf("%d%d%d%d",i,h,g,f);
}
else if(n>=100&&n<=1000)
{
j=n/100;
k=(n-j*100)/10;
l=n-j*100-k*10;
printf("%d%d%d",l,k,j);
}
else if(n>=10&&n<=100)
{
m=n/10;
o=n-m*10;
printf("%d%d",o,m);
}
else if(n>=0&&n<=10)
{
p=n;
printf("%d",n);
}
} | 56 |
27,575 | main()
{
int i,chang;
char a[5]={'\0'},b[5]={'\0'};
scanf("%s",a);
chang=strlen(a);
for(i=0;i<chang;i++)
{
b[i]=a[chang-i-1];
}
for(i=0;i<chang;i++)
printf("%c",b[i]);
} | 56 |
27,576 | int main()
{
int a,b,g,s,h,q,w;
scanf("%d",&a);
if(a<10)
{
printf("%d",a);
}
if(a<=10&&a<100)
{
g=a/10;
s=a%10;
b=10*s+g;
printf("%d",b);
}
if(a>=100&&a<1000)
{
g=a/100;
a=a-100*g;
s=a/10;
h=a%10;
b=100*h+10*s+g;
printf("%d",b);
}
if(a>=1000&&a<10000)
{
g=a/1000;
a=a-1000*g;
s=a/100;
a=a-100*s;
h=a/10;
q=a%10;
b=1000*q+100*h+10*s+g;
printf("%d",b);
}
if(a>=10000&&a<100000)
{
g=a/10000;
a=a-10000*g;
s=a/1000;
a=a-1000*s;
h=a/100;
a=a-100*h;
q=a/10;
w=a%10;
b=10000*w+1000*q+100*h+10*s+g;
printf("%d",b);
}
return 0;
}
| 56 |
27,577 | int main()
{
long a;
scanf("%d",&a);
int b,c,d,e,f;
b=a/10000;
c=(a-b*10000)/1000;
d=(a-b*10000-c*1000)/100;
e=(a-b*10000-c*1000-d*100)/10;
f=a-b*10000-c*1000-d*100-e*10;
if (!(b==0))
printf("%d%d%d%d%d",f,e,d,c,b);
else
if(!(c==0))
printf("%d%d%d%d",f,e,d,c);
else
if(!(d==0))
printf("%d%d%d",f,e,d);
else
if(!(e==0))
printf("%d%d",f,e);
else
printf("%d",f);
return 0;
}
| 56 |
27,578 |
int main()
{
int num;
int i,n[5];
scanf("%d",&num);
if (num>0 && num<10)
{
for (i=0;i<1;i++)
{
n[i]=num%10;
num=num/10;
if (num<1)
break;
}
printf("%d\n",n[0]);
return 0;
}
if (num>9 && num<100)
{
for (i=0;i<2;i++)
{
n[i]=num%10;
num=num/10;
if (num<1)
break;
}
printf("%d%d\n",n[0],n[1]);
return 0;
}
if (num>99 && num<1000)
{
for (i=0;i<3;i++)
{
n[i]=num%10;
num=num/10;
if (num<1)
break;
}
printf("%d%d%d\n",n[0],n[1],n[2]);
return 0;
}
if (num>999 && num<10000)
{
for (i=0;i<4;i++)
{
n[i]=num%10;
num=num/10;
if (num<1)
break;
}
printf("%d%d%d%d\n",n[0],n[1],n[2],n[3]);
return 0;
}
if (num>9999 && num<100000)
{
for (i=0;i<5;i++)
{
n[i]=num%10;
num=num/10;
}
printf("%d%d%d%d%d\n",n[0],n[1],n[2],n[3],n[4]);
return 0;
}
return 0;
} | 56 |
27,579 | int main()
{
int n,i,j;
char c[5];
scanf("%s",&c);
n=strlen(c);
for(i=0;i<n;i++)
{
j=n-i-1;
printf("%c",c[j]);
}
return 0;
}
| 56 |
27,580 |
int main()
{
int sum=0,n,x[5],i,j=0;
scanf("%d",&n);
for (i=0;i<=4;i++)
{
if (n>=pow(10,4-i)){
x[i]=n/pow(10,4-i);
n= n - x[i]*(pow(10,4-i));
}
else x[i]=0;
}
for (i=0;i<=4;i++){
if (x[i]==0) j++;
}
for (i=j;i<=4;i++){
sum = x[i]*(pow(10,i-j))+sum;
}
printf("%d",sum);
return 0;
} | 56 |
27,581 | int num,i,c;
int a[5];
void main()
{
void move(int j,int k);
scanf("%d",&num);
if(num>=10000) {c=4;move(num,c);}
else if(num>=1000&&num<10000) {c=3;move(num,c);}
else if(num>=100&&num<1000) {c=2;move(num,c);}
else if(num>=10&&num<100) {c=1;move(num,c);}
else {c=0;move(num,c);}
for(i=0;i<=c;i++)
printf("%d",a[i]);
}
void move(int j,int k)
{
if(k>0)
{
a[k]=(int)(j/(int)pow(10,k));
int o=(int)(j%(int)pow(10,k));
move(o,k-1);
}
else if(k==0)
{a[k]=j;
}
} | 56 |
27,582 | int l;
int main()
{
char a[5];
int n;
void pailie(int n,char ar[]);
gets(a);
l=strlen(a);
n=l;
pailie(n,a);
return 0;
}
void pailie(int n,char ar[])
{
if(n==1)printf("%c",ar[l-n]);
else
{
pailie(n-1,ar);
printf("%c",ar[l-n]);
}
}
| 56 |
27,583 | int main(){
char ch[6];
char c;
int j,k,n=0;
do
{
n++;
ch[n-1]=getchar();
}while(ch[n-1]!='\n');
n--;
for(j=0;j<n/2;j++)
{
c=ch[j];
ch[j]=ch[n-1-j];
ch[n-1-j]=c;
}
for(k=0;k<n;k++)
putchar(ch[k]);
return 0;
} | 56 |
27,584 | void main()
{
int m[5],n,i;
scanf("%d",&n);
for(i=0;i<5;i++)
{
m[0]=n/10000;
m[1]=n/1000-10*m[0];
m[2]=n/100-100*m[0]-10*m[1];
m[3]=n/10-1000*m[0]-100*m[1]-10*m[2];
m[4]=n-10000*m[0]-1000*m[1]-100*m[2]-10*m[3];
}
for(i=4;i>=0;i--)
{
if(m[i]!=0)
printf("%d",m[i]);
}
} | 56 |
27,585 |
void print(int n)
{
int p=n;int i;
if(p/10!=0)
{
for(i=0;p/10!=0;i++)
{
int temp=p/10;
p=p-10*temp;
}
printf("%d",p);
n=n/10;
print(n);
}
else
printf("%d",n);
}
main()
{
int number,i;
scanf("%d",&number);
print(number);
}
| 56 |
27,586 |
int main()
{
int n,m,a,b,c,d,e;
scanf("%d",&n);
if(n>1000){
a=n%10;
b=(n%100-a)/10;
c=(n%1000-a-10*b)/100;
d=(n%10000-a-10*b-100*c)/1000;
e=(n%100000-a-10*b-100*c-1000*d)/10000;
m=a*10000+b*1000+c*100+d*10+e;
printf("%d",m);}
else if(n<1000){
a=n%10;
b=(n%100-a)/10;
c=(n%1000-a-10*b)/100;
m=a*100+b*10+c;
printf("%d",m);}
return 0;
}
| 56 |
27,587 | void main()
{
int a[5],m,i,k=0;
scanf("%d",&m);
for(i=0;i<5;i++)
{
a[i]=m%10;
m=m/10;
}
for(i=0;i<5;i++)
{
if(a[i]!=0)
k++;
}
a[i]=a[k-1-i];
i=0;
do
{
if(a[i]!=0)
printf("%d",a[i]);
i++;
}
while(i<5);
}
| 56 |
27,588 | void main()
{
int n,a,b,c,d,e,f;
scanf("%d",&n);
a=n/10000;
b=n/1000-a*10;
c=n/100-a*100-b*10;
d=n/10-a*1000-b*100-c*10;
e=n-a*10000-b*1000-c*100-d*10;
if(a!=0)
f=e*10000+d*1000+c*100+b*10+a;
else
if(b!=0)
f=e*1000+d*100+c*10+b;
else
if(c!=0)
f=e*100+d*10+c;
else
if(d!=0)
f=e*10+d;
else
f=e;
printf("%d",f);
}
| 56 |
27,589 | int main()
{
long int n;
int x1,x2,x3,x4,x5;
scanf("%ld",&n);
x1=n/10000;
x2=(int)(n-x1*10000)/1000;
x3=(int)(n-x1*10000-x2*1000)/100;
x4=(int)(n-x1*10000-x2*1000-x3*100)/10;
x5=(int)(n-x1*10000-x2*1000-x3*100-x4*10);
if(n>9999)
printf("%d%d%d%d%d",x5,x4,x3,x2,x1);
else if(n>999)
printf("%d%d%d%d",x5,x4,x3,x2);
else if(n>99)
printf("%d%d%d",x5,x4,x3);
else if(n>9)
printf("%d%d",x5,x4);
else printf("%d",x5);
return 0;
} | 56 |
27,590 | void main()
{
int m=0,n,a[6]={0},i;
scanf("%d",&n);
for(i=0;i<=5;i++)
{
a[i]=n%10;
n=n/10;
m=m*10+a[i];
if(n==0)
break;
}
printf("\n%d",m);
} | 56 |
27,591 |
int main(int argc, char* argv[])
{
char a[6],b[6];
int i,j;
scanf("%s",a);
for(i=0;*(a+i)!='\0';i++){
*(b+i)=*(a+i);
}
for(j=i-1;j>=0;j--){
printf("%c",b[j]);
}
return 0;
} | 56 |
27,592 | int main()
{
int i,n=0;
char d[5],c[5];
for(i=0;i<5;i++)
{
scanf("%c",&d[i]);
if(d[i]>=48&&d[i]<=57) {c[i]=d[i];n++;}
else break;
}
for(i=n-1;i>=0;i--)
printf("%c",c[i]);
return 0;
} | 56 |
27,593 | int main()
{
int x;
int a;
int b;
int c;
int d;
int e;
scanf("%d",&x);
a=x/10000;
b=(x-10000*a)/1000;
c=(x-10000*a-1000*b)/100;
d=(x-10000*a-1000*b-100*c)/10;
e=x%10;
{
if(a==0&&b!=0&&c!=0&&d!=0&&e!=0)
printf("%d%d%d%d",e,d,c,b);
else
if(a==0&&b==0&&c!=0&&d!=0&&e!=0)
printf("%d%d%d",e,d,c);
else
if(a==0&&b==0&&c==0&&d!=0&&e!=0)
printf("%d%d",e,d);
else
if(a==0&&b==0&&c==0&&d==0&&e!=0)
printf("%d",e);
else
if(a!=0&&b!=0&&c!=0&&d!=0&&e!=0)
printf("%d%d%d%d%d",e,d,c,b,a);
else
printf("I don't know!");
}
return 0;
} | 56 |
27,594 | int main()
{
int a,b,c,d,e,n;
scanf("%d",&n);
if(n>10000&&n<1000000){
a=n%10;
b=(n/10)%10;
c=(n/100)%10;
d=(n/1000)%10;
e=(n/10000)%10;
n=a*10000+b*1000+c*100+d*10+e;
}else{
if(n>1000&&n<10000){
a=n%10;
b=(n/10)%10;
c=(n/100)%10;
d=(n/1000)%10;
n=a*1000+b*100+c*10+d;
}else{
if(n>100&&n<1000){
a=n%10;
b=(n/10)%10;
c=(n/100)%10;
n=a*100+b*10+c;
}else{
if(n>10&&n<100){
a=n%10;
b=n/100;
n=a*10+b;
}
}
}
}
printf("%d",n);
return 0;
} | 56 |
27,595 | void main()
{
int num,i,num2=0,b;
scanf("%d",&num);
for(i=1;i<=6;i++)
{
b=num%10;
num=num/10;
if(b!=0) num2=num2*10+b;
}
printf("%d",num2);
}
| 56 |
27,596 | int main()
{
int a[4],i;
int b[4]={0};
for(i=0;i<=3;i++)
scanf("%d",&a[i]);
for(i=0;i<=3;i++)
{
while(a[i]>9)
{
b[i]=(b[i]+a[i]-a[i]/10*10)*10;
a[i]/=10;
}
b[i]+=a[i];
printf("%d\n",b[i]);
}
return 0;
}
| 56 |
27,597 | int main()
{
int i;
char a[]={'\0','\0','\0','\0','\0','\0'};
scanf("%s",a);
for(i=0;i<6;i++)
if(a[5-i])
printf("%c",a[5-i]);
return 0;
} | 56 |
27,598 |
void main()
{
int x,a,b,c,d,e;
scanf("%d",&x);
a=x/10000;
b=(x-a*10000)/1000;
c=(x-a*10000-b*1000)/100;
d=(x-a*10000-b*1000-c*100)/10;
e=x-a*10000-b*1000-c*100-d*10;
if(a==0)
if(b==0)
if(c==0)
printf("%d%d\n",e,d);
else
printf("%d%d%d\n",e,d,c);
else
printf("%d%d%d%d\n",e,d,c,b);
else
printf("%d%d%d%d%d\n",e,d,c,b,a);
} | 56 |
27,599 | int main()
{
void print(int n);
int n;
scanf("%d",&n);
print(n);
return 0;
}
void print(int n)
{
if(n<10)
printf("%d",n);
else
{
printf("%d",n%10);
print(n/10);
}
} | 56 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.