id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
21,900 | int f(int n) //??????????
{
int i=1,a[100],k=0,m=0,p;
p=abs(n); //????????
do
{
a[i]=p%10;
p=p/10;
i++;
k=k+1;
}
while(p!=0); //????????????
for(i=1;i<=k;i++)
{
m=m+a[i]*pow(10.00,(double)(k-i));
}
if(n>=0)
{return(m);}
else
{return(-m);} //??????????
}
int main()
{
int a[7],i;
for(i=1;i<=6;i++)
{
cin>>a[i];
a[i]=f(a[i]); //?????????
}
for(i=1;i<=6;i++)
{
cout<<a[i]<<endl;
}
return 0;
}
| 44 |
21,901 |
int reverse(int a)
{
int c=0;
while(a)
{
c=c*10+a%10;
a=a/10;
}
return c;
}
main()
{
int a,c,i,b[6];
for(i=0;i<6;i++)
{
scanf("%d",&a);
b[i]=reverse(a);
}
for(i=0;i<6;i++)
printf("%d\n",b[i]);
} | 44 |
21,902 | int reverse(int num);
int main()
{
int i,a;
for (i=1;i<=6;i++)
{
scanf("%d",&a);
printf("%d\n",reverse(a));
}
}
int reverse(int num)
{
int abs1,zhengfu=1,ge=0,shi=0,bai=0,qian=0,wang=0,fanxu;
if (abs(num)==0)
return 0;
else
if(num<0)
{
zhengfu=-1;
}
abs1=abs(num);
if ((10000<=abs1)&&(abs1<=32767))
{
ge=abs1%10;
shi=(abs1/10)%10;
bai=(abs1/100)%10;
qian=(abs1/1000)%10;
wang=(abs1/10000)%10;
fanxu=ge*10000+shi*1000+bai*100+qian*10+wang;
}
if((1000<=abs1)&&(abs1<10000))
{
ge=abs1%10;
shi=(abs1/10)%10;
bai=(abs1/100)%10;
qian=(abs1/1000)%10;
fanxu=ge*1000+shi*100+bai*10+qian;
}
if((100<=abs1)&&(abs1<1000))
{
ge=abs1%10;
shi=(abs1/10)%10;
bai=(abs1/100)%10;
fanxu=ge*100+shi*10+bai;
}
if((10<=abs1)&&(abs1<100))
{
ge=abs1%10;
shi=(abs1/10)%10;
fanxu=ge*10+shi;
}
if((1<=abs1)&&(abs1<10))
{
ge=abs1%10;
fanxu=ge;
}
if (zhengfu==1)
return (fanxu);
else if (zhengfu==-1)
return ((-1)*fanxu);
}
| 44 |
21,903 | int reverse(int num)
{ int i=0,a[100],m=0,j,y=1;
if(num<0)
{ num=-num;
y=0;
}
while(1)
{ if(num<10)
break;
a[i]=num%10;
num=num/10;
i++;
}
for(j=0;j<i;j++)
{ m+=a[j]*(pow(10,(i-j)));
}
m+=num;
if(y==0)
return -m;
else
return m;
}
int main()
{int i=0,j,n;
while(i<6)
{ scanf("%d",&n);
j=reverse(n);
if(i<5)
printf("%d\n",j);
else
printf("%d",j);
i++;
}
return 0;
} | 44 |
21,904 | int reverse(int num)
{
int a,b=0,i;
if(num==0)
b=0;
for(i=0;num!=0;i++)
{
a=num%10;
num=num/10;
b=a+b*10;
}
return b;
}
main()
{
int n,i,j,k;
for(k=0;k<6;k++)
{
scanf("%d",&n);
printf("%d\n",reverse(n));
}
getchar();
getchar();
getchar();
}
| 44 |
21,905 | // ?????.cpp : Defines the entry point for the console application.
// ??????????????????????????????main???????????????
int reverse(int num) //????reverse?????????????????????
{
int a[20];
int i=0,j=0; //????
if(num>0) //??????????????
{
while(num>0)
{
a[i]=num%10;
num=num/10;
i++;
}
for(j=0;j<i;j++)
{
num=num*10+a[j];
}
}
else //???????????????
{
num=num*(-1);
while(num>0)
{
a[i]=num%10;
num=num/10;
i++;
}
for(j=0;j<i;j++)
{
num=num*10+a[j];
}
num=num*(-1);
}
return num;
}
int main() //?????
{
int num[6],fan[6];
int i=0;
for(i=0;i<6;i++) //??6??
{
cin>>num[i];
}
for(i=0;i<6;i++) //?fan[i]???num[i]????
{
fan[i]=reverse(num[i]);
}
for(i=0;i<5;i++) //??
{
cout<<fan[i]<<endl;
}
cout<<fan[5];
return 0;
} | 44 |
21,906 | int reverse(int num)
{
int b=0;
int t=num;
if(num>0) num=num;
else if(num<0) num=-num;
for(int i=1;num!=0;i++)
{
int a=num%10;
num=(num-a)/10;
b=b*10+a;
}
if(t==0||t==-0) b=0;
else if(t>0) b=b;
else if(t<0) b=-b;
return b;
}
main()
{
int num[6];
for(int i=0;i<6;i++)
{
scanf("%d",&num[i]);
}
for(int i=0;i<6;i++)
{
printf("%d\n",reverse(num[i]));
}
getchar();
getchar();
getchar();
}
| 44 |
21,907 | int reverse(int num)
{
int r=0, m, n=1, s=1, i=0, j=1;
int a, C=1;
if(num < 0)
{
num = -num;
C = 0;
}
while(s!=0)
{
j = j * 10;
s = num / j;
i++; //i?num???
}
for(m = i; m > 0; m--)
{
j = j/10;
r = r + (num/j) * n;
n = n * 10;
a = num/j;
num = num - a * j;
}
if(C == 0)
r = -r;
return r;
}
int main()
{
int i=0;
int a[6];
for(i = 0; i < 6; i++)
{
scanf("%d", &a[i]);
}
for(i = 0; i < 6; i++)
{
printf("%d\n", reverse(a[i]));
}
return 0;
} | 44 |
21,908 | void main()
{
int reverse(int num);
int i;
int a[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",reverse(a[i]));
}
}
int reverse(int num)
{
int x[5];
int rev;
if(num==0){rev=0;}
if(num>0)
{
if(num>9999)
{
x[4]=((int)(num%10));
x[3]=(((int)(num-x[4])%100))/10;
x[2]=(((int)(num-x[4]-x[3]*10)%1000))/100;
x[1]=(((int)(num-x[4]-x[3]*10-x[2]*100)%10000))/1000;
x[0]=(((int)(num-x[4]-x[3]*10-x[2]*100-x[1]*1000)%100000))/10000;
rev=x[4]*10000+x[3]*1000+x[2]*100+x[1]*10+x[0];
}
if(num>999&&num<10000)
{
x[4]=((int)(num%10));
x[3]=(((int)(num-x[4])%100))/10;
x[2]=(((int)(num-x[4]-x[3]*10)%1000))/100;
x[1]=(((int)(num-x[4]-x[3]*10-x[2]*100)%10000))/1000;
rev=x[4]*1000+x[3]*100+x[2]*10+x[1];
}
if(num>99&&num<1000)
{
x[4]=((int)(num%10));
x[3]=(((int)(num-x[4])%100))/10;
x[2]=(((int)(num-x[4]-x[3]*10)%1000))/100;
rev=x[4]*100+x[3]*10+x[2];
}
if(num>9&&num<100)
{
x[4]=((int)(num%10));
x[3]=(((int)(num-x[4])%100))/10;
rev=x[4]*10+x[3];
}
if(num>0&&num<10)
{
rev=num;
}
}
if(num<0)
{
num=((-1)*num);
if(num>9999)
{
x[4]=((int)(num%10));
x[3]=(((int)(num-x[4])%100))/10;
x[2]=(((int)(num-x[4]-x[3]*10)%1000))/100;
x[1]=(((int)(num-x[4]-x[3]*10-x[2]*100)%10000))/1000;
x[0]=(((int)(num-x[4]-x[3]*10-x[2]*100-x[1]*1000)%100000))/10000;
rev=(x[4]*10000+x[3]*1000+x[2]*100+x[1]*10+x[0])*(-1);
}
if(num>999&&num<10000)
{
x[4]=((int)(num%10));
x[3]=(((int)(num-x[4])%100))/10;
x[2]=(((int)(num-x[4]-x[3]*10)%1000))/100;
x[1]=(((int)(num-x[4]-x[3]*10-x[2]*100)%10000))/1000;
rev=(x[4]*1000+x[3]*100+x[2]*10+x[1])*(-1);
}
if(num>99&&num<1000)
{
x[4]=((int)(num%10));
x[3]=(((int)(num-x[4])%100))/10;
x[2]=(((int)(num-x[4]-x[3]*10)%1000))/100;
rev=(x[4]*100+x[3]*10+x[2])*(-1);
}
if(num>9&&num<100)
{
x[4]=((int)(num%10));
x[3]=(((int)(num-x[4])%100))/10;
rev=(x[4]*10+x[3])*(-1);
}
if(num>0&&num<10)
{
rev=(-1)*num;
}
}
return(rev);
}
| 44 |
21,909 | int Reverse(int num);
int main()
{
int i,num;
for (i=1;i<=6;i++)
{
cin>>num; //??
cout<<Reverse(num)<<endl; //????
}
return 0;
}
int Reverse(int num)
{
int width,i,RevNum;
width=log10((double)(abs(num)))+1; //????
i=0;RevNum=0;
if (num>0)
{
while(num>0) //??n????????
{i++;
RevNum=RevNum+(num % 10)*(int)(pow(10.0,width-i));
num=num/10;
}
return(RevNum);
}
else if (num<0)
{
num=-num; //??????????????
while(num>0) //??n????????
{i++;
RevNum=RevNum+(num % 10)*(int)(pow(10.0,width-i));
num=num/10;
}
return(-RevNum);
}
else if (num==0) return 0;
}
| 44 |
21,910 | int reverse(char*);
int main(int argc, char* argv[])
{
int i;
char a[6][10];
for(i=0;i<6;i++)
{
scanf("%s",a[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",reverse(a[i]));
}
return 0;
}
int reverse(char* n)
{
char a[10],b[10],c[10];
int m,i;
strcpy(a,n);
m=strlen(a);
for(i=0;i<m;i++)
{
b[i]=a[m-i-1];
}
b[m]='\0';
if(b[m-1]=='-')
{
c[0]='-';
for(i=1;i<m;i++)
{
c[i]=b[i-1];
}
c[m]='\0';
}
else
strcpy(c,b);
return atoi(c);
} | 44 |
21,911 | int reserve(int num)
{
int x,y;
y=0;
if(num==0) return 0;
while(num!=0)
{
x=num%10;
y=y*10+x;
num=(num-x)/10;
}
return y;
}
main()
{
int z,i;
for(i=1;i<=6;i++)
{
scanf("%d",&z);
printf("%d\n",reserve(z));
}
}
| 44 |
21,912 | main()
{
int reverse(int num);
int n,i;
for(i=0;i<6;i++)
{
scanf("%d",&n);
printf("%d\n",reverse(n));
}
}
int reverse(int num)
{
int rev=0;
if(num>=0)
{
while(num)
{
rev=rev*10+num%10;
num=num/10;
}
}
else
{
int fan=-num;
while(fan)
{
rev=rev*10+fan%10;
fan=fan/10;
}
rev=-rev;
}
return rev;
}
| 44 |
21,913 | int reverse(int num)
{
int i=0;
for (;num!=0;)
{
i=i*10+num%10;
num=num/10;
}
return (i);
}
main ()
{
int x[6],p[6],i;
for (i=0;i<6;i++)
scanf ("%d",&x[i]);
for (i=0;i<6;i++)
{
if (x[i]>=0)
p[i]=reverse(x[i]);
else
p[i]=-reverse(-x[i]);
}
for (i=0;i<6;i++)
printf ("%d\n",p[i]);
getchar ();
getchar ();
}
| 44 |
21,914 | int reverse(int a);//??reverse??
int main()//?????
{
int n[6],num[6],i;
for(i=0;i<6;i++)cin>>n[i];//??????6???
for(i=0;i<6;i++)num[i]=reverse(n[i]);//????????num??
for(i=0;i<5;i++)cout<<num[i]<<endl;//??num????????????
cout<<num[5];//???????
return 0;
}//?????
int reverse(int a)//reverse??
{
int x[100],i=0,sum=0,num=0;
if(a>0)//?a??????
{do//?a???????
{
x[i]=a%10;
a=a/10;
i++;num++;
}while(a>0);
for(i=0;i<num;i++)sum=sum*10+x[i];//???????
}
else if(a<0)//?a??????
{
a=a*(-1);//?a????????
do//????????????
{
x[i]=a%10;
a=a/10;
i++;num++;
}while(a>0);
for(i=0;i<num;i++)sum=sum*10+x[i];//???????
sum=sum*(-1);//???????????
}
else if(a==0&&a==-0)sum=0;//?a?0?-0????0
return sum;//????sum
}//reverse???? | 44 |
21,915 | int reverse(int a)
{
int c;
int d=0;
int i;
if(a<0)
{
a=-a;
for(i=0;a!=0;i++)
{
c=a%10;
a=a/10;
d=c+d*10;
}
return -d;
}
else
{
for(i=0;a!=0;i++)
{
c=a%10;
a=a/10;
d=c+d*10;
}
return d;
}
}
int main()
{
int i;
int a[6];
int b[6];
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
{
b[i]=reverse(a[i]) ;
printf("%d\n",b[i]);
}
} | 44 |
21,916 | int dao(int x)
{
int s;
int i;
int r=1;
int a[100];
int y=0;
if(x<0){x=-x;}
int p=x;
for(i=0;;i++)
{
if(p/10>0)
{
a[i]=p%10;
p=p/10;
}
else{a[i]=p%10;i++; s=i;break;}
}
for(int j=0;j<=s-1;j++)
{
for(int k=0;k<=j-1;k++)
{r=r*10;}
y=y+a[s-j-1]*r;
r=1;
}
if(x>0)
return y;
else{return -y;}
}
int main()
{
int a[100];
for(int i=0;i<=5;i++)
{
scanf("%d",&a[i]);
if(a[i]>0)
{printf("%d\n",dao(a[i]));}
else{printf("%d\n",-dao(a[i]));}
}
int y;scanf("%d",&y);
return 0;
}
| 44 |
21,917 | int fanxu(int x);
int main(int argc, char* argv[])
{
int n=0,t=0;
while(1)
{
scanf("%d",&n);
if(n>=0)
{
n=fanxu(n);
}
else
{
n=-1*n;
n=fanxu(n);
n=-1*n;
}
printf("%d\n",n);
t++;
if(t==6) break;
}
return 0;
}
int fanxu(int x)
{
int sz[5],y=0,i=0;
sz[0]=x%10;
sz[1]=(x%100)/10;
sz[2]=(x%1000)/100;
sz[3]=(x%10000)/1000;
sz[4]=x/10000;
y=sz[0]*10000+sz[1]*1000+sz[2]*100+sz[3]*10+sz[4];
for(i=1;i<=5;i++)
{
if(y%10==0)
{
y=y/10;
}
}
return y;
}
| 44 |
21,918 | int rev(int m)
{
char s[1050];
int k=m;
int ans=0;
int i=0;
while (k>0)
{
s[i]=k%10;
k/=10;
i++;
}
i--;
int base=1;
while (s[i]==0) i--;
for (;i>=0;i--)
{
ans+=s[i]*base;
base*=10;
}
return ans;
}
main()
{
for (int kk=1;kk<=6;kk++)
{
int n,m;
scanf("%d",&n);
if (n<0) m=0-n; else m=n;
if (m==0) printf("0\n");
else
{
m=rev(m);
if (n<0)
printf("-");
printf("%d\n",m);
}
}
}
| 44 |
21,919 | int fanxu(int x); //????
int main()
{
int i,num[6];
for(i=0;i<6;i++)
{
cin>>num[i];
}
for(i=0;i<6;i++)
{
cout<<fanxu(num[i])<<endl; //??????
}
return 0;
}
int fanxu(int x)
{
int y=0,i=0,j,a[10],temp;
while(x!=0) //????????????
{
a[i]=x%10;
x=x/10;
i++;
}
for(j=0;j<i;j++) //??????????
{
y=10*y+a[j];
}
return y;
}
| 44 |
21,920 | main()
{
for(int j=0;j<6;j++)
{
char a[10];
scanf("%s",a);
if(a[0]=='-')
{
int k=strlen(a),p=0;
printf("-");
for (int i=k-1;i>=1;i--)
{
if (a[i]!='0')
{
p++;
}
if(p!=0) printf("%c",a[i]);
}
}
else
{
int k=strlen(a),p=0;
for (int i=k-1;i>=0;i--)
{
if (a[i]!='0')
{
p++;
}
if(p!=0) printf("%c",a[i]);
}
}
printf("\n");
}
}
| 44 |
21,921 | void main()
{
int reverse(int num);
int a,b,c,d,e,f;
scanf("%d %d %d %d %d %d",&a,&b,&c,&d,&e,&f);
printf("%d\n%d\n%d\n%d\n%d\n%d\n",reverse(a),reverse(b),reverse(c),reverse(d),reverse(e),reverse(f));
}
int reverse(int num)
{
int a[5],b[5];
int i,j,t,NUM,flag,top,butt;
if(num<0)
{num=-num;
flag=1;}
else flag=0;
a[0]=num/10000;
a[1]=(num-10000*a[0])/1000;
a[2]=(num-10000*a[0]-1000*a[1])/100;
a[3]=(num-10000*a[0]-1000*a[1]-100*a[2])/10;
a[4]=num-10000*a[0]-1000*a[1]-100*a[2]-10*a[3];
b[0]=1000;
for(i=0;i<4;i++)
b[i+1]=b[i]/10;
for(i=0;i<5;i++)
if(a[i]!=0)
break;
top=i-1;
butt=4;
while(top<=butt)
{
t=a[top];
a[top]=a[butt];
a[butt]=t;
top=top+1;
butt=butt-1;}
NUM=0;
for(j=i-1;j<5;j++)
NUM=a[j]*b[j]+NUM;
if(flag==1)
NUM=-NUM;
return(NUM);}
| 44 |
21,922 | int fan(int x)
{
int a=0,b,i;
int f[100];
if (x==0)
return (x);
else
{
for(i=0;i<100;i++)
{
f[i]=x%10;
x=x/10;
a++;
if (x==0)
break;
}
}
for(i=0;i<a;i++)
{
x=x*10+f[i];
}
return (x);
}
main ()
{
int c,d,j;
int g[6];
for (j=0;j<6;j++)
{
scanf("%d",&g[j]);
}
for (j=0;j<6;j++)
{
c=g[j];
if (c<0)
{
c=c*(-1);
d=fan (c);
printf("-%d\n",d);
}
else
{
d=fan(c);
printf("%d\n",d);
}
}
getchar ();
getchar ();
}
| 44 |
21,923 | int reverse(int n)
{
int temp=0,i=0,j;
int a[100];
while(n!=0)
{
a[i]=n%10;
i++;
n/=10;
}
j=i;
for(i=0;i<j;i++)
{
temp=temp*10+a[i];
}
return temp;
}
main()
{
int g,n;
for(g=0;g<6;g++)
{
scanf("%d",&n);
printf("%d\n",reverse(n));
}
}
| 44 |
21,924 | void main()
{
int h,i,j,k,l,m;
scanf("%d%d%d%d%d%d",&h,&i,&j,&k,&l,&m);
int reverse(int x);
h=reverse(h);
i=reverse(i);
j=reverse(j);
k=reverse(k);
l=reverse(l);
m=reverse(m);
printf("%d\n%d\n%d\n%d\n%d\n%d\n",h,i,j,k,l,m);
}
int reverse(int x)
{
int a,b,c,d,e,f,y;
if(x<0)
{
f=-1*x;
x=f;
a=x%10;
b=(int)(x/10)%10;
c=(int)(x/100)%10;
d=(int)(x/1000)%10;
e=(int)(x/10000);
if(a!=0&&b==0&&c==0&&d==0&&e==0)
y=-1*a;
if(a==0&&b!=0&&c==0&&d==0&&e==0)
y=-1*b;
if(a!=0&&b!=0&&c==0&&d==0&&e==0)
y=-1*(10*a+b);
if(a==0&&b==0&&c!=0&&d==0&&e==0)
y=-1*c;
if(a==0&&b!=0&&c!=0&&d==0&&e==0)
y=-1*(10*b+c);
if(a!=0&&c!=0&&d==0&&e==0)
y=-1*(100*a+10*b+c);
if(a==0&&b==0&&c==0&&d!=0&&e==0)
y=-1*d;
if(a==0&&b==0&&c!=0&&d!=0&&e==0)
y=-1*(10*c+d);
if(a==0&&b!=0&&d!=0&&e==0)
y=-1*(100*b+10*c+d);
if(a!=0&&d!=0&&e==0)
y=-1*(1000*a+100*b+10*c+d);
if(a==0&&b==0&&c==0&&d==0&&e!=0)
y=-1*e;
if(a==0&&b==0&&c==0&&d!=0&&e!=0)
y=-1*(10*d+e);
if(a==0&&b==0&&c!=0&&e!=0)
y=-1*(100*c+10*d+e);
if(a==0&&b!=0&&e!=0)
y=-1*(1000*b+100*c+10*d+e);
if(a!=0&&e!=0)
y=-1*(10000*a+1000*b+100*c+10*d+e);
}
else if(x==0)
y=0;
else
{
a=x%10;
b=(int)(x/10)%10;
c=(int)(x/100)%10;
d=(int)(x/1000)%10;
e=(int)(x/10000);
if(a!=0&&b==0&&c==0&&d==0&&e==0)
y=a;
if(a==0&&b!=0&&c==0&&d==0&&e==0)
y=b;
if(a!=0&&b!=0&&c==0&&d==0&&e==0)
y=10*a+b;
if(a==0&&b==0&&c!=0&&d==0&&e==0)
y=c;
if(a==0&&b!=0&&c!=0&&d==0&&e==0)
y=10*b+c;
if(a!=0&&c!=0&&d==0&&e==0)
y=100*a+10*b+c;
if(a==0&&b==0&&c==0&&d!=0&&e==0)
y=d;
if(a==0&&b==0&&c!=0&&d!=0&&e==0)
y=10*c+d;
if(a==0&&b!=0&&d!=0&&e==0)
y=100*b+10*c+d;
if(a!=0&&d!=0&&e==0)
y=1000*a+100*b+10*c+d;
if(a==0&&b==0&&c==0&&d==0&&e!=0)
y=e;
if(a==0&&b==0&&c==0&&d!=0&&e!=0)
y=10*d+e;
if(a==0&&b==0&&c!=0&&e!=0)
y=100*c+10*d+e;
if(a==0&&b!=0&&e!=0)
y=1000*b+100*c+10*d+e;
if(a!=0&&e!=0)
y=10000*a+1000*b+100*c+10*d+e;
}
return(y);
} | 44 |
21,925 | int main()
{
int i,a,b;
int reverse(int);
for(i=0;i<6;i++){
scanf("%d", &a);
if(a>=0){
b=reverse(a);
}
if(a<0){
a=-a;
b=-reverse(a);
}
printf("%d", b);
if(i<5) printf("\n");
}
return 0;
}
int reverse(int a)
{
int j,b=0,k, c[10]={0};
for(j=9;j>=0;j--){
c[j]=a%10;
a=a/10;
if(a==0) break;
}
for(k=9;k>=j;k--){
b=b*10+c[k];
}
return b;
}
| 44 |
21,926 | void main()
{
int i,b[6];
int reverse(int num);
for(i=0;i<6;i++)
scanf("%d",&b[i]);
for(i=0;i<6;i++)
printf("%d\n",reverse(b[i]));
}
int reverse(int num)
{
int k,i,j,wei=1,flag=0,a[8]={0};
if(num<0) {flag=1;num=-num;}
k=num;a[0]=num;
for(i=0;;i++)
{
k=k/10;a[i+1]=k;
if(k==0) break;
}
for(j=0;j<=i;j++)
a[j]=a[j]%10;
k=0;
for(j=i;j>=0;j--)
if (a[j]!=0) break;
k=a[j];
for(i=1;i<=j;i++)
{
wei=wei*10;
k=k+a[j-i]*wei;
}
if (flag==1) k=-k;
return(k);
}
| 44 |
21,927 | int re(int n){
int result=0;
if(n>0){
while(n>0){
result=result*10+n%10;
n/=10;
}
}else if(n<0){
n=0-n;
while(n>0){
result=result*10+n%10;
n/=10;
}
result=0-result;
}
return result;
}
int main(){
int i,z,f;
for(i=0;i<6;i++){
scanf("%d",&z);
f=re(z);
printf("%d\n",f);
}
return 0;
} | 44 |
21,928 | int fanxu(int num)
{
int m,n,l,k,a,t;
if(fabs(num)>=10000)
{
m=num/10000;
n=num/1000-m*10;
l=num/100-m*100-n*10;
k=num/10-m*1000-n*100-l*10;
t=num%10;
a=t*10000+k*1000+l*100+n*10+m;
}
else if(fabs(num)>=1000)
{
m=num/1000;
n=num/100%10;
l=num/10%10;
k=num%10;
a=k*1000+l*100+n*10+m;
}
else if(fabs(num)>=100)
{
m=num/100;
n=num/10-m*10;
l=num%10;
a=l*100+n*10+m;
}
else if(fabs(num)>=10)
{
m=num/10;
n=num%10;
a=n*10+m;
}
else
a=num;
return(a);
}
void main()
{
int b[6],i,p;
for(i=0;i<6;i++)
{
scanf("%ld",&b[i]);
p=fanxu(b[i]);
printf("%d\n",p);
}
} | 44 |
21,929 | int reverse(int a);
int R(int a);
main()
{
int i,j,k;
for(i=1;i<=6;i++)
{
scanf("%d",&j);
k=reverse(j);
printf("%d\n",k);
}
}
int R(int a)
{
int i,b,c=0;
for(i=1;a>0;i++)
{
b=a%10;
c=c*10+b;
a=a/10;
}
return(c);
}
int reverse(int a)
{
int c;
if (a>0)
c=R(a);
else if (a<0)
c=-R(-a);
else
c=0;
return(c);
}
| 44 |
21,930 | int reverse(int n)
{
int back=0,flag=0;
if(n>=0&&n<=9)
back=n;
else
{
if(n<0)
{
flag=1;
n=-n;
}
while(n>=1)
{
back=back*10+n%10;
n=n/10;
}
}
if(flag==0)
return back;
else
return -back;
}
int main()
{
int i,a[6];
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
printf("%d\n",reverse(a[i]));
return 0;
} | 44 |
21,931 |
int f(int n)
{
int m=0;
while(n!=0){
m=m*10+n%10;
n=n/10;
}
return m;
}
int main()
{
int a;
for(int i=0;i<6;i++){
scanf("%d",&a);
printf("%d\n",f(a));
}
return 0;
}
| 44 |
21,932 | int main()
{
int a[6],i,j,b[6],m,n;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
int reverse(int num);
for(j=0;j<6;j++)
{
b[j]=reverse(a[j]);
printf("%d\n",b[j]);
}
return 0;
}
int reverse(int num)
{
int m,n=0;
m=num;
while(num!=0)
{
n=n*10+num%10;
num/=10;
}
num=n;
return(num);
} | 44 |
21,933 | int f(int m)
{
int d=0;
while(m!=0)
{
d=d*10+m%10;
m=m/10;
}
return d;
}
main()
{
int a[7],b[7],c[7],i=1,m;
for (;i<=6;i++)
{
scanf("%d",&a[i]);
if (a[i]>=0)
{
m=a[i];
c[i]=f(m);
}
else
{
m=-a[i];
b[i]=f(m);
c[i]=-b[i];
}
}
for(i=1;i<=6;i++)
printf("%d\n",c[i]);
return 0;
}
| 44 |
21,934 | int reverse(int num) //?????
{
int a[10],i,j,m,count=0;
int newnum=0;
if(num>=0){ //????????0?
for(i=0; ;i++){
m=pow(10.0,i);
a[i]=num/m%10;
if(m>num) {count=i; break;} //???????
}
for(j=0;a[j]!=0;j++){
m=pow(10.0,count-j-1);
newnum=a[j]*m;
break;
}
for(i=j+1;i<count;i++) {
m=pow(10.0,count-1-i);
newnum=newnum+a[i]*m;
}
return (newnum); //???????
}
if(num<0){ //?????????????????????
num=-num;
for(i=0; ;i++){
m=pow(10.0,i);
a[i]=num/m%10;
if(m>num) {count=i; break;}
}
for(j=0;a[j]!=0;j++){
m=pow(10.0,count-j-1);
newnum=a[j]*m;
break;
}
for(i=j+1;i<count;i++) {
m=pow(10.0,count-1-i);
newnum=newnum+a[i]*m;
}
return (-newnum);
}
}
int main() //?????
{
int num,i;
for(i=0;i<6;i++)
{
cin>>num;
cout<<reverse(num)<<endl; //??reverse??
}
return 0;
}
| 44 |
21,935 | int reverse(int num)
{
int h,i;
char no[5];
if(num<=0)
{num=-num;h=-1;}
for(i=4;i>=0;i--)
{
no[i]=num/((int) pow(10, i));//???????(parameter)????????????!!;(int)pow(10,i)????????.
num=num-(no[i]*((int) pow (10,i)));}
if(no[4]!=0)
num=no[0]*10000+no[1]*1000+no[2]*100+no[3]*10+no[4];
else if(no[3]!=0)
num=no[0]*1000+no[1]*100+no[2]*10+no[3];
else if(no[2]!=0)
num=no[0]*100+no[1]*10+no[2];
else if(no[1]!=0)
num=no[0]*10+no[1];
else num=no[0];
if(h==-1) num=-num;//=?==!!!!!!!!!
return(num);
}
void main()
{
int num,ci;
for(ci=1;ci<=6;ci++)
{scanf("%d",&num);
num=reverse(num);
printf("%d\n",num);}
}
| 44 |
21,936 |
int in[6];
int main(int argc, char* argv[])
{
int i;
int reverse(int x);
for(i=0;i<6;i++){
scanf("%d",&in[i]);}
for(i=0;i<6;i++){
printf("%d\n",reverse(i));}
return 0;
}
int reverse(int x){
int a,b,c,d,e;
a=in[x]/10000;
e=in[x]%10;
d=(in[x]%100-in[x]%10)/10;
b=(in[x]-10000*a)/1000;
c=(in[x]-10000*a-1000*b)/100;
if(a!=0){
return 10000*e+1000*d+100*c+10*b+a;}
else if(b!=0){
return 1000*e+100*d+10*c+b;}
else if(c!=0){
return 100*e+10*d+c;}
else if(d!=0){
return 10*e+d;}
else if(e!=0){
return e;}
else return 0;} | 44 |
21,937 | void main()
{
void p(int m);
int i,a[100]={0};
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
printf("0\n");
else if(a[i]>0)
p(a[i]);
else
{
printf("-");
a[i]=(-a[i]);
p(a[i]);
}
}
}
void p(int m)
{
int i,j,k;
char a[100]={""};
for(i=0,k=m,j=1;;i++,j++)
{
if(k<10)
{
a[i]=k;
break;
}
else
{
a[i]=k-k/10*10;
k=k/10;
}
}
for(i=0,k=0;;i++)
{
if(a[i]==0)
{
k++;
continue;
}
else
break;
}
for(i=k;i<j;i++)
printf("%d",a[i]);
printf("\n");
}
| 44 |
21,938 |
int reverse(int num)
{
int i,j,k,c,N,renum;
for(i=0;c!=0;i++)
c=num/pow(10,i);
int a[20];
a[0]=num/pow(10,i-1);
N=num;
for(j=1;j<i;j++){
a[j]=(N-a[j-1]*pow(10,i-j))/pow(10,i-j-1);
N-=a[j-1]*pow(10,i-j);
}
renum=0;
for(j=i-1,k=0;j>=0,k<i;j--,k++)
renum+=a[j]*pow(10,i-k-2);
return renum;
}
main()
{
int i;
int a[6];
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
printf("%d\n",reverse(a[i]));
} | 44 |
21,939 | int reverse(int num);
int main()
{
int i;
int a[10],b[10];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
b[i]=reverse(a[i]);
}
for(i=0;i<6;i++)
printf("%d\n",b[i]);
return 0;
}
int reverse(int num)
{
if(num==0)
return 0;
int c[100],d[100],e[100];
int i,j;
int a;
int k=1;
int result=0;
if(num<0)
a=0-num;
if(num>0)
a=num;
for(i=1;1;i=i+1)
{
k=k*10;
if((a-k)<0)
{
break;
}
}
for(j=i-1;j>=0;j--)
{
if(j==i-1)
d[j]=1;
else d[j]=d[j+1]*10;
}
for(j=0;j<i;j++)
{
if(j==0)
{
c[j]=a/d[j];
e[j]=a;
}
else
{
c[j]=(e[j-1]-d[j-1]*c[j-1])/d[j];
e[j]=e[j-1]-d[j-1]*c[j-1];
}
}
for(j=0;j<i;j++)
result=result+c[j]*d[i-j-1];
if(num>0)
return result;
if(num<0)
return (0-result);
} | 44 |
21,940 |
int main()
{
int reverse(int sum);
int sum,i;
for(i=0;i<6;i++)
{
scanf("%d",&sum);
reverse(sum);
}
return 0;
}
int reverse(int sum)
{
int yushu;
if(sum<0)
{
printf("-");
sum=-sum;
}
if(sum==0) printf("%d",sum);
yushu=sum%10;
while((yushu==0)&&(sum!=0))
{
sum=sum/10;
yushu=sum%10;
}
while(sum!=0)
{
printf("%d",yushu);
sum=(sum-yushu)/10;
yushu=sum%10;
}
printf("\n");
return 0;
} | 44 |
21,941 | void reverse(int n)
{
int i,b=0;
if(n==0)
printf("%d\n",n);
else
{
if(n<0)
printf("-");
n=abs(n);
if(n%10==0)
{
while(n%10==0)
{
n=n/10;
}
}
for(i=1;n!=0;i++)
{
b=b*10+n%10;
n=n/10;
}
printf("%d\n",b);
}
}
int main()
{
void reverse(int num);
int n,j;
for(j=1;j<=6;j++)
{
scanf("%d",&n);
reverse(n);
}
return 0;
} | 44 |
21,942 | void min(char a[1000])
{
char b[1000]={'\0'},c[1000]={'\0'};
int i=0,j;
if(a[0]!='-')
{
j=0;
for(i=0;i<strlen(a);i++)
b[strlen(a)-1-i]=a[i];
for(i=0;i<strlen(b);i++)
if(b[i]!='0')
{j=i;break;}
if(j==strlen(b))
c[0]='0';
else
{
for(i=j;i<strlen(b);i++)
c[i-j]=b[i];
}
printf("%s\n",c);
}
else
{
j=1;
c[0]='-';
b[0]='0';
for(i=1;i<strlen(a);i++)
b[i]=a[strlen(a)-i];
for(i=1;i<strlen(b);i++)
if(b[i]!='0')
{j=i;break;}
for(i=j;i<strlen(b);i++)
c[i-j]=b[i];
printf("-");
printf("%s\n",c);
}
scanf("\n");
}
void main()
{
int n;
for(n=1;n<=6;n++)
{
char a[1000]={'\0'};
gets(a);
min(a);
}
} | 44 |
21,943 | int Reverse(int num) //??Reverse??
{
int n,temp[10];
int f=0,j=0,k;
double l=0;
n=abs(num); //????????num????
while(n!=0)
{
temp[j]=n%10;
n=n/10;
j++; //?n????????????temp??????
}
for(k=j-1;k>=0;k--)
{
f+=temp[k]*pow(10.0,l);
l+=1; //?temp????????????,????10?????,??f??????n???
}
if(num>=0)return f; //??num??????,?????f
else
return -f; //??num????,????-f
}
int main()
{
int n[6],i,j; //??6???????????
for(i=0;i<=5;i++)
cin>>n[i]; //?????????
for(j=0;j<=5;j++)
cout<<Reverse(n[j])<<endl; //???????
return 0;
} | 44 |
21,944 | int reverse(int n);
int main()
{
int n,k,j;
for(j=0;j<6;j++)
{
scanf("%d",&n);
if(n<0)
{
n=-n;
k=reverse(n);
printf("-%d\n",k);
}
else
{
k=reverse(n);
printf("%d\n",k);
}
}
return 0;
}
int reverse(int num)
{
int x,i,k,a=num;
// x=int(log10(1.0*num))+1;
for(x=1;a>=10;x++)
{
a=a/10;
}
for(i=0,k=0;i<x;i++)
{
k=num%10+k*10;
num=(num-(num%10))/10;
}
return k;
} | 44 |
21,945 | char reverse(char a[],int n)
{
int i,j;
if(n==1&&a[0]=='0')
{
printf("0");
}
if(a[0]=='-')
{
printf("-");
for(i=n-1;i>0;i--)
{
if(a[i]=='0')
continue;
else
{
j=i;
break;
}
}
for(i=j;i>0;i--)
{
printf("%c",a[i]);
}
}
if(a[0]!='-')
{
for(i=n-1;i>=0;i--)
{
if(a[i]=='0')
continue;
else
{
j=i;
break;
}
}
for(i=j;i>=0;i--)
{
printf("%c",a[i]);
}
}
}
main()
{
char a[100],i;
int n;
for(i=0;i<6;i++)
{
gets(a);
n=strlen(a);
reverse(a,n);
printf("\n");
}
getchar(); getchar(); getchar();
}
| 44 |
21,946 | int reverse(int num)
{
int a[10],i,j;
if(num==0)
return(0);
else
{
int c=0,sum=0;
for(i=0;num!=0;i++)
{
c++;
a[i]=num%10;
num=num/10;
}
for(i=0;i<c;i++)
for(j=1;j<c-i;j++)
a[i]=a[i]*10;
for(i=0;i<c;i++)
sum=sum+a[i];
return(sum);
}
}
main()
{
int i;
for(i=1;i<=6;i++)
{
int a;
scanf("%d",&a);
printf("%d\n",reverse(a));
}
getchar();getchar();
} | 44 |
21,947 | int reverse(int t){
int flag=1;
if(t==0)return 0;
if(t<0){
flag=-1;
t=-t;
}
int ans=0;
while(t){
ans*=10;
ans+=t%10;
t/=10;
}
return ans*flag;
}
int main(){
for(int i=0;i<6;i++){
int t=0;
cin>>t;
cout<<reverse(t)<<endl;
}
return 0;
}
| 44 |
21,948 |
main()
{
int n,s,c,k,i,y,t,l;
int reverse(int num);
int a[8];
for(i=0;i<6;i++)
{
scanf("%d",&n);
//if(n==0) {printf("0");}
l=reverse(n);
printf("%d\n",l);
}
getchar();
getchar();
getchar();
getchar();
}
int reverse(int num)
{
int n,s,c,k,i,y,t,l;
int a[8];
s=num;
c=1;k=1;t=0;y=0;
for(int i=0;s!=0;i++)
{
s=s/10;
c=c*10;
a[i]=(num-s*c)/k;
k=k*10;
//printf("%d %d\n",a[i],i);
t=10*y;
y=t+a[i];
//printf("%d\n",y);
}
//printf("%d\n",y);
num=y;
return(num);
}
| 44 |
21,949 | int fx(int n)
{
int a[10],i,j,k;
i=0;
if(n==0)
{
printf("0");
}
while(n!=0)
{
a[i]=n%10;
n=(n-a[i])/10;
i++;
}
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(a[k]!=0)
{
break;
}
}
if(j>=k)
{
printf("%d",a[j]);
}
}
printf("\n");
return 0;
}
int main()
{
int i,b[6],n,k;
for(i=0;i<6;i++)
{
scanf("%d",&n);
b[i]=n;
}
for(i=0;i<6;i++)
{
if(b[i]<0)
{
k=abs(b[i]);
printf("-");
fx(k);
}
else
{
fx(b[i]);
}
}
return 0;
}
| 44 |
21,950 | int reverse(int num)
{
int a,b=0,i,j;
for(j=1;num!=0;j++)
{
a=num%10;
num=num/10;
b=b*10+a;
}
return(b);
}
main()
{
int num,i,c;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
c=reverse(num);
printf("%d\n",c);
}
} | 44 |
21,951 | void turn(char *a,int n)
{
char *p,*q;
int i,j,t,k;
k=n/2+n%2;
p=a,q=a+n-1;
for(i=0;i<=k-1;i++)
{
t=*(p+i);
*(p+i)=*(q-i);
*(q-i)=t;
}
}
main()
{
int ii;
for(ii=0;ii<=5;ii++)
{
char A[100];
int i,j,count=0;
memset(A,'\0',100);
scanf("%s",A);
if(A[0]=='-')
{for(j=0;A[j]!='\0';j++)
{A[j]=A[j+1];}
printf("-");
}
{
for(i=0;A[i]!='\0';i++)
{count++;}
turn(A,count);
if(A[0]=='0'&&A[1]=='\0'){printf("0");}
else{
for(i=0;A[0]=='0';i++)
{
for(j=0;A[j]!='\0';j++)
{
A[j]=A[j+1];
}
}
for(i=0;A[i]!='\0';i++)
{
printf("%c",A[i]);
}
}
}
printf("\n");
}
}
| 44 |
21,952 | main()
{
int i,j[6],k[6];
int reverse(int n);
for(i=0;i<6;i++)
{ scanf("%d",&j[i]);
k[i]=reverse(j[i]);
}
for(i=0;i<6;i++)
printf("%d\n",k[i]);
}
int reverse(int n)
{ int N,i,j=0,revn=0;
N=n;
if(n<0)
n=-n;
for(;n!=0;)
{ j=n%10;
revn=revn*10+j;
n=n/10;
}
if(N<0)
revn=-revn;
return(revn);
}
| 44 |
21,953 | //????????
//1000012915???
int reverse(int num);
int main()
{
int Number,i,NUM[7];
for(i=0;i<6;i++)
{
cin>>Number;
NUM[i]=reverse(Number);
}
for(i=0;i<6;i++)cout<<NUM[i]<<endl;
return 0;
}
int reverse(int num)
{
int i=0;
while(num!=0)
{
i=i*10+num%10;
num=num/10;
};
return i;
} | 44 |
21,954 | int reverse(int num)
{
int a,h,i,j,k,o=0,s=1,t=10,NUM=0,n[N];
if(num<0)
{
num=0-num;
o=1;
}
for(h=2;h<=N+2;h++)
{
s=s*10;
if(num/s==0)
break;
}
for(i=0;i<N;i++)
{
a=num%t;
num=num/t;
n[i]=a;
}
t=1;
for(j=2;j<h;j++)
{
t=t*10;
}
for(k=0;k<N;k++)
{
NUM=NUM+t*n[k];
t=t/10;
}
if(o==1)
NUM=0-NUM;
return NUM;
}
main()
{
int num,i;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
printf("%d\n",reverse(num));
}
} | 44 |
21,955 |
int main(int argc, char* argv[])
{
int reverse(int num);
int i,num;
for(i=0;i<6;i++){
scanf("%d",&num);
printf("%d\n",reverse(num));
}
}
int reverse(int num)
{
int a,b,r,j;
if(num>=0){
b=num;
r=0;
for(j=0;j<32;j++){
a=b%10;
b=b/10;
r=r*10+a;
if(b==0)
break;
}
}
else{
b=-num;
r=0;
for(j=0;j<32;j++){
a=b%10;
b=b/10;
r=r*10+a;
if(b==0)
break;
}
r=-r;
}
return r;
} | 44 |
21,956 | void inv(char str[])
{
int l,m,i;
char c;
l=strlen(str);
for(i=0;i<l/2;i++)
{
if(str[i]=='-') {l++;continue;}
c=*(str+i);
*(str+i)=*(str+l-1-i);
*(str+l-1-i)=c;
}
m=atoi(str);
printf("%d\n",m);
}
void main()
{
int i;
char a[6][9];
for(i=0;i<6;i++)
scanf("%s",a+i);
for(i=0;i<6;i++)
inv(*(a+i));
} | 44 |
21,957 | int reverse(int num);
int main()
{
int a[6],i,z;
for(i=0;i<6;i++){
scanf("%d",&a[i]);
}
for(i=0;i<6;i++){
z=reverse(a[i]);
if(i==0){
printf("%d",z);
}else{
printf("\n%d",z);
}
}
return 0;
}
int reverse(int num){
int a=0,Num,n,m;
Num=num;
if(Num/10==0){
n=0;
}else{
n=0;
while(n>=0){
Num=Num/10;
if(Num==0){
break;
}
n++;
}
m=n;
while(m>=0){
a+=num%10*pow(10,m);
num=num/10;
m--;
}
}
return a;
} | 44 |
21,958 | void main()
{
int reverse(int num);
int a,b,c,d,e,f;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
scanf("%d",&d);
scanf("%d",&e);
scanf("%d",&f);
a=reverse(a);
b=reverse(b);
c=reverse(c);
d=reverse(d);
e=reverse(e);
f=reverse(f);
printf("%d\n%d\n%d\n%d\n%d\n%d",a,b,c,d,e,f);
}
int reverse(int num)
{
int w=0,leap=0;
if(num<0)
{
num=0-num;
leap=1;
}
while(num>0)
{
w=num%10+10*w;
num/=10;
}
if(leap==1)
{
w=0-w;
}
return(w);
} | 44 |
21,959 | int reverse(int n)
{
int j,temp,flag,i,re_n,num[11];
flag=0;
i=0;
while ((n>=10) || (n%10!=0))
{
temp=n%10;
n=n/10;
if ((flag==0) && (temp!=0) || (flag==1))
{
num[i++]=temp;
flag=1;
}
}
re_n=0;
if (flag)
for (j=0;j<=i-1;j++)
re_n=re_n*10+num[j];
else re_n=n; //flag==0 means that n is 0-9
return(re_n);
}
void main()
{
int flag,n;
flag=0;
while (scanf("%d",&n)==1)
{
if (n<0)
{
n=n*(-1);
printf("-");
}
printf("%d\n",reverse(n));
}
} | 44 |
21,960 |
int reverse(int num,int a)
{
a=10*a+num%10;
if(num>9||num<-9) return (reverse(num/10,a));
return a;
}
int main()
{
int num,i;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
printf("%d\n",reverse(num,0));
}
return 0;
}
| 44 |
21,961 | void main()
{
int a[6],i;
int rvs(int x);
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<6;i++)
{
a[i]=rvs(a[i]);
printf("%d\n",a[i]);
}
}
int rvs(int x)
{
int z[5],sign,j,y;
if(x<0)sign=-1;
else if(x==0)sign=0;
else sign=1;
x*=sign;//??x???
for(j=4;j>=0;j--)
{
z[j]=x-x/10*10;//????
x/=10;
}
y=sign*(10000*z[4]+1000*z[3]+100*z[2]+10*z[1]+z[0]);
for(j=0;j<5;j++)
{
if(z[j]==0)y/=10;//?????0
if(z[j]!=0)break;//??01230????2?10???????
}
return(y);
}
| 44 |
21,962 | int main()
{
int i;
int a[10];
int reverse(int b);
for(i=1; i<=6; i++)
scanf("%d", &a[i]);
for(i=1; i<=6; i++)
{
a[i]=reverse(a[i]);
printf("%d\n", a[i]);
}
return 0;
}
int reverse(int b)
{
int q, w, e, r, t, y, u, i, o, p, rev;
if(b/1000000000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*1000000000+o*100000000+i*10000000+u*1000000+y*100000+t*10000+r*1000+e*100+w*10+q;
return(rev);
}
if(b/1000000000==0 && b/100000000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*100000000+o*10000000+i*1000000+u*100000+y*10000+t*1000+r*100+e*10+w;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*10000000+o*1000000+i*100000+u*10000+y*1000+t*100+r*10+e;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*1000000+o*100000+i*10000+u*1000+y*100+t*10+r;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*100000+o*10000+i*1000+u*100+y*10+t;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*10000+o*1000+i*100+u*10+y;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000==0 && b/1000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*1000+o*100+i*10+u;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000==0 && b/1000==0 && b/100!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*100+o*10+i;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000==0 && b/1000==0 && b/100==0 && b/10!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*10+o;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000==0 && b/1000==0 && b/100==0 && b/10==0)
{
rev=b;
return(rev);
}
}
| 44 |
21,963 | int reverse(int a)
{
int i,j=0,b[20],c=0,t=0;
if(a>0);
else
{a=-a;t=1;}
for(i=0;a>0;i++)
{
b[i]=a%10;
a=a/10;
}
for(j=0;j<i;j++)
c=10*c+b[j];
if(t==1)
c=-c;
return c;
}
int main()
{
int i=0,a=0;
for(i=0;i<6;i++)
{
while(cin>>a)
cout<<reverse(a)<<endl;
}
return 0;
} | 44 |
21,964 | int reverse(int num)
{
int n=0,m=0,i,s,l=1,x=1;
s=num;
do
{
s=s/10;
n=n+1;
l=10*l;
}while(s>0);
for(i=1;i<=n;i++)
{
m=num/(l/10)*x+m;
num=num-num/(l/10)*(l/10);
x=x*10;
l=l/10;
}
return(m);
}
void main()
{
int a[6],j;
for(j=0;j<6;j++)
scanf("%d",&a[j]);
for(j=0;j<6;j++)
{
if(a[j]!=0)
{
while(a[j]%10==0) a[j]=a[j]/10;
if(a[j]>0) printf("%d\n",reverse(a[j]));
else printf("%d\n",-reverse(-a[j]));
}
if(a[j]==0) printf("0\n");
}
} | 44 |
21,965 | int reverse(char n[8]);
int main(){
int j,z,i,c,k;
char jieguo[6][8];
char su[8];
for(j=0;j<6;j++){
scanf("%s",su);
c=strlen(su);
z=reverse(su);
switch(z){
case 1: {jieguo[j][0]=su[0];
jieguo[j][1]='\0';
break;}
case 2: {jieguo[j][0]=su[0];
for(i=1;i<c;i++){
jieguo[j][i]=su[c-i];
}
jieguo[j][c]='\0';
break;}
case 3:{for(i=0;i<c;i++){
jieguo[j][i]=su[c-1-i];
}
jieguo[j][c]='\0';
break;
}
case 4:{jieguo[j][0]=su[0];
for(i=1;i<c;i++){
if(su[c-i]!='0')
break;
}
for(k=1;k<=c-i;k++){
jieguo[j][k]=su[c-i-k+1];
}
jieguo[j][k]='\0';
}
break;
case 5:{for(i=0;i<c;i++){
if(su[c-i-1]!='0')
break;
}
for(k=0;k<c-i;k++){
jieguo[j][k]=su[c-i-k-1];
}
jieguo[j][k]='\0';
}break;
}
}
for(j=0;j<6;j++){
printf("%s\n",jieguo[j]);
}
return 0;
}
int reverse(char n[8]){
int b,i,jieguo;
b=strlen(n);
if(b==1){
jieguo=1;
}else{
if(n[0]=='-'){
jieguo=2;
if(n[b-1]=='0'){
jieguo=4;
}
}else{
jieguo=3;
if(n[b-1]=='0'){
jieguo=5;
}
}
}
return(jieguo);
}
| 44 |
21,966 | int main()
{
int a[6],b[6],m;
int reserve(int num);
for(m=0;m<6;m++)
{
scanf("%d",&a[m]);
b[m]=reserve(a[m]);
printf("%d\n",b[m]);
}
getchar();
getchar();
}
int reserve(int num)
{
if(num==0)
return(0);
else
{
int c[200];
int i,j,k,s;
for(i=0;num!=0;i++)
{
c[i]=num%10;
num=num/10;
}
s=0;
for(j=0;j<i;j++)
{
for(k=1;k<i-j;k++)
{
c[j]=c[j]*10;
}
s=s+c[j];
}
return(s);
}
} | 44 |
21,967 | void nixu(char s[])
{int j,k,h,len=strlen(s);
if(s[0]=='-')
{if(s[1]=='0') printf("0\n");
else {printf("-");
for(k=0;k<len;k++)
{
s[k]=s[k+1];
}
nixu(s);}
}
else if(s[0]=='0') printf("0\n");
else if(s[0]>=49&&s[0]<=57)
{
for(h=len-1;h>=0;h--)
{if(h==len-1&&s[h]!='0')printf("%c",s[h]);
else if(h!=len-1&& (s[h+1]!='0')|| (s[h]!='0') )printf("%c",s[h]);
}
printf("\n");}
}
int main()
{
int i;
char a[10];
for(i=0;i<6;i++)
{
scanf("%s",a);
nixu(a);
}
return 0;
} | 44 |
21,968 |
void diverse(int a)
{
int i,j,d,num=0;
if(a>=0)
{
for(i=0;pow(10,i+1)<=a;i++){}
for(j=i;j>=0;j--)
{
d=floor(a/(pow(10,j)));
num=pow(10,i-j)*d+num;
a=a-pow(10,j)*d;
}
printf("%d\n",num);
}
else
{
if(a<0)
{
a=-a;
for(i=0;pow(10,i+1)<=a;i++){}
for(j=i;j>=0;j--)
{
d=floor(a/(pow(10,j)));
num=pow(10,i-j)*d+num;
a=a-pow(10,j)*d;
}
printf("-%d\n",num);
}
}
}
int main()
{
int i,a[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<6;i++)
{
diverse(a[i]);
}
return 0;
}
| 44 |
21,969 | int reverse(int num)
{
int fnum=0,k=0;
if(num<0)
{
num=-num;
k=1;
}
for(;num!=0;)
{
fnum=fnum*10+num%10;
num=num/10;
}
if(k==0)
return fnum;
else
return -fnum;
}
int main()
{
int num[6];
for(int i=0;i<6;i++)
scanf("%d",&num[i]);
for(int i=0;i<6;i++)
printf("%d\n",reverse(num[i]));
} | 44 |
21,970 | char num[15];
int reverse(char num[15])
{
int i;
int count=0;
if(num[0]=='-')
{
printf("%c",'-');
}
for(i=14;i>=0;i--)
{
if((num[i]>='0')&&(num[i]<='9'))
{
if(count>0)
{
printf("%c",num[i]);
}
else if(num[i]!='0')
{
count++;
printf("%c",num[i]);
}
}
}
printf("\n");
}
main()
{
int j,k;
for(k=1;k<7;k++)
{
for(j=0;j<=14;j++)
{num[j]='\0';}
gets(num);
reverse(num);
}
getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();
}
| 44 |
21,971 | int dis(int x)
{
int y,t=0;
if(x>=0)
t=1;
else
x=(-1)*x;
if(0<=x&&x<10)
y=x;
if(9<x&&x<100)
y=(x%10*10+x/10);
if(99<x&&x<1000)
y=(x/100+(x-x/100*100)/10*10+x%10*100);
if(999<x&&x<10000)
y=x/1000+x%1000/100*10+x%100/10*100+x%10*1000;
if(9999<x&&x<32768)
y=x/10000+x%10000/1000*10+x%1000/100*100+x%100/10*1000+x%10*10000;
if(t==0)
return(-y);
else
return(y);
}
main()
{
int dis(int x),s,k;
for(k=0;k<6;k++)
{
scanf("%d",&s);
printf("%d\n",dis(s));
}
getchar();
}
| 44 |
21,972 | int reverse(int num)
{int x=0,y=1,i=0,j=0;int fuhao=1;int a[12];
//cin>>num;
if(num<0)fuhao=-1;
num=abs(num);
while(i<12){
if(num<pow(10,(double)i))break;
y=10*y;
i++;}
//cout<<i;
for(j=1;j<=i;j++){a[j]=num/(int)pow(10,(double)(i-j));num=num-a[j]*(int)pow(10,(double)(i-j));}
for(j=0;j<i;j++)//cout<<a[j]<<endl;
x=x+a[i-j]*pow(10,(double)(i-j-1));
//cout<<x<<endl;
x=fuhao*x;
return (x);
}
int main()
{int i=0;int num;
for(i=1;i<=6;i++)
{cin>>num;cout<<reverse(num)<<endl;}
return 0;
} | 44 |
21,973 | int main(){
int n[6],f(int x),i,j,nf[6];
for(i=0;i<6;i++){
scanf("%d",&n[i]);
}
for(i=0;i<6;i++){
if(n[i]==0){
nf[i]=0;
}
else if(n[i]<0){
nf[i]=-1*f(abs(n[i]));
}
else{
nf[i]=f(n[i]);
}
}
for(i=0;i<6;i++){
printf("%d\n",nf[i]);
}
return 0;
}
int f(int x){
int i,a[20],b,y,j;
b=10;
for(i=0;i<20;i++){
a[i]=(x%b)/(b/10);
x=x-(b/10)*a[i];
if(x==0){
break;
}
b=b*10;
}
y=0;
b=1;
for(j=0;j<=i;j++){
y=y+a[i-j]*b;
b=b*10;
}
return(y);
}
| 44 |
21,974 | int fanxu(int x)
{
int sum=0,i,f[10],a=10,p,q;
for(i=0;i<10;i++)
{
f[i]=(x%a)/(a/10);
x=x-(a/10)*f[i];
if(x==0)
{
break;
}
a*=10;
}
q=1;
for(p=0;p<=i;p++)
{
sum+=f[i-p]*q;
q*=10;
}
return sum;
}
int main()
{
int i,k[6],shu;
for(i=0;i<6;i++)
{
scanf("%d",&shu);
if(shu==0)
{
k[i]=0;
}
if(shu<0)
{
k[i]=-1*fanxu(abs(shu));
}
else
{
k[i]=fanxu(shu);
}
}
for(i=0;i<6;i++)
{
printf("%d\n",k[i]);
}
return 0;
}
| 44 |
21,975 | int fan2(int a1)
{
int b1;
int c1,c2;
c2=a1%10;
c1=a1/10;
b1=10*c2+c1;
return(b1);
}
int fan3(int a2)
{
int b2;
int c1,c2,c3;
c1=a2%10;
c2=((a2-c1)%100)/10;
c3=a2/100;
b2=100*c1+10*c2+c3;
return(b2);
}
int fan4(int a3)
{
int b3;
int c1,c2,c3,c4;
c1=a3%10;
c2=((a3-c1)%100)/10;
c3=((a3-c1-10*c2)%1000)/100;
c4=a3/1000;
b3=1000*c1+100*c2+10*c3+c4;
return(b3);
}
int fan5(int a4)
{
int b4;
int c1,c2,c3,c4,c5;
c1=a4%10;
c2=((a4-c1)%100)/10;
c3=((a4-c1-10*c2)%1000)/100;
c4=((a4-c1-10*c2-100*c3)%10000)/1000;
c5=a4/10000;
b4=10000*c1+1000*c2+100*c3+10*c4+c5;
return(b4);
}
void main()
{
int a[6];
int b[6];
int i;
for (i=0;i<=5;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<=5;i++)
{
if (a[i]<10&&a[i]>-10)
{
b[i]=a[i];
}
else if (a[i]<100&&a[i]>-100)
{
b[i]=fan2(a[i]);
}
else if (a[i]<1000&&a[i]>-1000)
{
b[i]=fan3(a[i]);
}
else if (a[i]<10000&&a[i]>-10000)
{
b[i]=fan4(a[i]);
}
else
{
b[i]=fan5(a[i]);
}
printf("%d\n",b[i]);
}
} | 44 |
21,976 | int main(void)
{
int i,n,flag,n1;
int f(int n);
for(i=1;i<=6;i++){
scanf("%d",&n);
if (n>0) flag=1;
else {flag=-1;n=-n;}
n1=f(n);
printf("%d\n",flag*n1);
}
}
int f(int n)
{
int s,nn;
s=n;nn=0;
while(s>0){
nn=nn*10+s%10;
s=s/10;
}
return nn;
}
| 44 |
21,977 | int f(int x){
int k,r=0;
for(k=10;;k=k*10){
if(x/k==0)
break;
}
for(int j=k/10;j>0;j=j/10){
r+=x/j*(k/j/10);
x=x%j;
}
return r;
}
int main(){
int a[6];
for(int i=0;i<6;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<6;i++){
printf("%d\n",f(a[i]));
}
return 0;
} | 44 |
21,978 | main()
{
int f(int n);
int a,b;
for(int i=1;i<=6;i++)
{
scanf("%d",&b);
a=f(b);
printf("%d\n",a);
}
}
int f(int n)
{
int i=0,m,b;
double a=0;
m=fabs(n);
if(m==0)
{
return(0);
}
else
{
while(pow(10,i)<=m)
{
i++;
}
int k=0;
while(k<i)
{
b=m/pow(10,i-k-1);
a=a+b*pow(10,k);
m=m-b*pow(10,i-k-1);
k++;
}
if(n<0)
return(-a);
else
return(a);
}
}
| 44 |
21,979 | void main()
{
int fan(int x);
int i,a;
for(i=1;i<=6;i++)
{
scanf("%d",&a);
printf("%d\n",fan(a));
}
}
int fan(int x)
{
int i=0,s=100000,n[5],f=0,m=0,k;
if(x>0)
{
for(i=0;i<5;i++)
{
s=s/10;
if((x/s)!=0)
{
k=i;
break;
}
else continue;
}
for(i=k;i<5;i++)
{
n[i-k]=x/s;
if((x/s)!=0) x=x%s;
s=s/10;
}
s=1;
for(i=0;i<5-k;i++)
{
f=f+n[i]*s;
s=s*10;
}
return(f);
}
else if(x<0)
{
x=-x;
for(i=0;i<5;i++)
{
s=s/10;
if((x/s)!=0)
{
k=i;
break;
}
else continue;
}
for(i=k;i<5;i++)
{
n[i-k]=x/s;
if((x/s)!=0) x=x%s;
s=s/10;
}
s=1;
for(i=0;i<5-k;i++)
{
f=f+n[i]*s;
s=s*10;
}
return(-f);
}
else return(0);
} | 44 |
21,980 | int reverse(int a)
{
int s[100];
int i=10,j,b=0;
if (a<0)
{
a=a*(-1);
for (j=1; ;j++)
{
s[j]=a%i;
b=s[j]+b*10;
a=a/i;
if (a==0)
break;
}
return -b;
}
else
{
for (j=1; ;j++)
{
s[j]=a%i;
b=s[j]+b*10;
a=a/i;
if (a==0)
break;
}
}
return b;
}
int main ()
{
int a[6],i;
for (i=0;i<=5;i++)
scanf ("%d",&a[i]);
for (i=0;i<=5;i++)
{
printf ("%d\n",reverse(a[i]));
}
getchar();
getchar();
getchar();
}
| 44 |
21,981 | int main()
{
void reverse(int num);
int num,i;
for(i=0;i<6;i++)
{
cin>>num;
reverse(num);
}
return 0;
}
void reverse(int num0)
{
int num1=0,n=1;
while(num0/n!=0)
{n=n*10;}
for(int i=10;i<=n;i=i*10)
{
num1=num1+(num0%i)/(i/10)*(n/i);
num0=num0-num0%i;
}
cout<<num1<<endl;
}
| 44 |
21,982 | int main()
{
int n,s,i;
for(i=0;i<6;i++)
{
scanf("%d",&n);
if(n>0)
s=f(n,0);
else
{ n=-n;
s=-f(n,0);}
printf("%d\n",s);
}
return 0;
}
int f(int x,int y)
{
y=y*10+x%10;
if(x<10)
return y;
else
f(x/10,y);
}
| 44 |
21,983 | int f(int n);
int main()
{
int i,m;
for(i=0;i<6;i++)
{
scanf("%d",&m);
printf("%d\n",f(m));
}
return 0;
}
int f(int n)
{
int a[10000],b[10000];
int g,i,j;
b[0]=abs(n);
if(b[0]!=0)
{
for(i=0;;i++)
{
a[i]=b[i]%10;
b[i+1]=b[i]/10;
if(a[i]==0&&b[i+1]==0)
{break;}
}
g=0;
for(j=i;j>=0;j--)
{
g=g+a[j]*pow(10,i-j-1);
}
}
if(n>0)
{
return(g);
}
if(n<0)
{
return((-g));
}
if(n=0)
{
return(0);
}
}
| 44 |
21,984 | int reverse(int num)
{
int i,j,y=0;
for(i=100000000;i>=1;i=i/10)
{
if(num/i!=0)
{
for(j=1;j<=i;j=j*10)
{
y=10*y+num%10;
num=num/10;
}
return y;
}
}
return 0;
}
int main()
{
int num,i;
for(i=0;i<6;i++)
{
scanf("%d",&num);
printf("%d\n",reverse(num));
}
return 0;
} | 44 |
21,985 | int reverse(int num)
{ int a[11],i,j,flag,n;
if (num==0) return 0;
else if (num<0) flag=-1;
else flag=1;
num=abs(num);
for (i=0;i<=10;i++) a[i]=0;
i=0;
while (num>0)
{
a[i]=num%10;
num=num/10;
i++;}
i--;
n=0;
for (j=0;j<=i;j++)
n=n*10+a[j];
if (flag<0) return(-n);
else return(n);
}
main()
{
int i,num;
for (i=0;i<6;i++)
{ scanf("%d",&num);
num=reverse(num);
printf("%d\n",num);
}
} | 44 |
21,986 | int number(int n)
{
int a,number=0;
if(n>=0)
{
while(n!=0)
{
a=n%10;
number=number*10+a;
n=n/10;
}
return number;
}
if(n<0)
{
n=-n;
while(n!=0)
{
a=n%10;
number=number*10+a;
n=n/10;
}
return -number;
}
}
void main()
{
int A[6],i;
for(i=0;i<6;i++)
{
scanf("%d",&A[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",number(A[i]));
}
} | 44 |
21,987 |
void reverse( int a)
{
int i,l,b;
i=0;
if (a==0) printf("0");
while ((a%10)==0)
{a=a/10;}
while (a!=0)
{
if (a>0)
{
b=a%10;
printf("%d",b);
a=a/10;
}
else if (a<0)
{
b=a%10;
if (i==0)
printf("%d",b);
else
{
b=-b;
printf("%d",b);
}
a=a/10;
i++;
}
}
}
int main()
{
int m,a;
int i=1;
while (i<=6)
{scanf("%d",&a);
reverse( a);
printf("\n");
i++;}
getchar(); getchar(); getchar(); getchar(); getchar(); getchar(); getchar(); getchar();
}
| 44 |
21,988 | int reverse(int num)
{
int t=1,b=0,x=0;
int i,j;
int k[10],h[10];
// scanf("%d",&num);
for(i=0;num!=0;i++)
{
k[i]=num%10;
b=b+1;
num=(num-num%10)/10;
t=t*10;
}
t=t/10;
for(i=0;i<b;i++)
{ if(k[i]!=0)break;
else t=t/10;
}
for(j=0;j<b-i;j++)
h[j]=k[i+j];
for(j=0;j<b-i;j++)
{ x=x+h[j]*t;
t=t/10;
}
return(x);
}
void main()
{
int a[6],i;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
printf("%d\n",reverse(a[i]));
} | 44 |
21,989 | int reverse(int);
int main()
{
int i,a[6];
for(i=0;i<=5;i++)
{
cin>>a[i];
}
for(i=0;i<=5;i++)
{
a[i]=reverse(a[i]);
cout<<a[i]<<endl;
}
return 0;
}
int reverse(int num)
{
int sum=0,i;
int t;
for(t=1;1;t++)
{
if(abs(num/pow((double)10,(int)t))>=1)
continue;
else
break;
}
for(i=1;i<=t;i++)
{
sum=sum+(num%10)*pow((double)10,(int)t-i);
num=num/10;
}
return sum;
}
| 44 |
21,990 | int reverse(int num)
{
int a=0,b=0,c=0;
if (num==0) {c=num;}
else if (num<0)
{
a=-num;
do
{b=a%10;
c=(c+b)*10;
a=a/10;}
while (a>9);
c=-c-a;
}
else
{
a=num;
do
{b=a%10;
c=(c+b)*10;
a=a/10;}
while (a>9);
c=c+a;
}
return c;
}
int main()
{
int m,i;
for (i=1;i<=6;i++)
{scanf ("%d",&m);
printf ("%d\n",reverse(m));}
return 0;
} | 44 |
21,991 |
int pow(int n)//??10?n???
{
int a=1,i=0;
for(i=0;i<n;i++)
a=a*10;
return a;
}
int reverse(int n)//??????
{
int b=0,k=0,i,j,a[10];
if(n<0)
{
n=-n;
k=1;
}
for(i=0;i<10;i++)
{
a[i]=n/pow(9-i);
n=n%pow(9-i);
}
for(j=0;a[j]==0;j++);
for(i=9;i>=j;i--)
b=b*10+a[i];
if(k==1) return -b;
else return b;
}
int main()
{
int i,n,b;
for(i=0;i<6;i++)//?????????????????????
{
cin>>n;
b=reverse(n);
cout<<b<<endl;
}
return 0;
}
| 44 |
21,992 | int reverse(int n);
int main(int argc, char* argv[])
{
int a[6],b[6];
int i;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
if(a[i]>=0)
{
b[i]=reverse(a[i]);
printf("%d\n",b[i]);
}
else
{
b[i]=reverse(-a[i]);
printf("%d\n",-b[i]);
}
}
return 0;
}
int reverse(int n)
{
int lenth=0,a,num=0;
int i;
int b,c,k;
double d;
a=n;
while(a>=1)
{
a=a/10;
lenth++;
}
k=0;
for(i=lenth;i>0;i--)
{
b=n%(int)pow(10,i);
c=n%(int)pow(10,(i-1));
d=pow(10,(1-lenth+2*k));
k++;
num+=(b-c)*d;
}
return num;
} | 44 |
21,993 | void main()
{
int i;int a[6];
int b;
int reverse(int x);
for(i=1;i<=6;i++)
{
scanf("%d",&a[i-1]);
}
for(i=0;i<=5;i++)
{
b=reverse(a[i]);
printf("%d\n",b);
}
}
int reverse(int x)
{
int y;
if(-9<=x&&x<=9)y=x;
else if(x>=10&&x<100)
y=x%10*10+(int)(x/10);
else if(x>=100&&x<1000)
y=x%10*100+x/100+(x%100/10)*10;
else if(x>=1000&&x<10000)
y=x%10*1000+x/1000+(x%100/10)*100+(x%1000/100)*10;
else if(x>=10000)
y=x%10*10000+x/10000+(x%100/10)*1000+(x%1000/100)*100+(x%10000/1000)*10;
else if(x<=-10&&x>-100)
y=-((-x)%10*10+(int)((-x)/10));
else if(x<=-100&&x>-1000)
y=-((-x)%10*100+(-x)/100+((-x)%100/10)*10);
else if(x<=-1000&&x>-10000)
y=-((-x)%10*1000+(-x)/1000+((-x)%100/10)*100+((-x)%1000/100)*10);
else if(x<=-10000)
y=-((-x)%10*10000+(-x)/10000+((-x)%100/10)*1000+((-x)%1000/100)*100+((-x)%10000/1000)*10);
return(y);
}
| 44 |
21,994 | int reverse(int a);
int main()
{
int a,i;
for(i=0;i<6;i++)
{
scanf("%d",&a);
reverse(a);
if(a==0)
printf("0");
printf("\n");
}
scanf("%d",1);
return 0;
}
int reverse(int a)
{
int d=0;
if(a<0)
{
printf("-");
a=-a;
}
while(1)
{
if(d==1)
printf("%d",a%10);
if(a%10!=0&&d==0)
{
printf("%d",a%10);
d=1;
}
a=a/10;
if(a==0)
break;
}
return 0;
} | 44 |
21,995 | int reverse(int num)
{
int i=0,s=0,remain=0;
if(num==0)cout<<"0";
if(num<0)
{
num=-num;
cout<<"-";
do
{
remain=num%10;
if(remain!=0||s!=0)
{cout<<remain;s++;}
num=num/10;
}while(num!=0);
}
if(num>0)
{
do
{
remain=num%10;
if(remain!=0||s!=0)
{cout<<remain;s++;}
num=num/10;
}while(num!=0);
}
cout<<endl;
return 0;
}
int main()
{
int i=0,num=0;
for(i=0;i<6;i++)
{
cin>>num;
reverse(num);
}
return 0;
} | 44 |
21,996 | void main()
{
int reverse(int num);
int num,i;
for(i=0;i<6;i=i+1)
{
scanf("%d",&num);
num=reverse(num);
printf("%d\n",num);
}
}
int reverse(int num)
{
int a[5];
int n,i,t,sign=1;
if(num==0)
return(num);
else
{
if(num<0)
sign=-1;
num=num*sign;
n=log10(num);
for(i=0;i<=n;i=i+1)
{
a[i]=num/pow(10,n-i);
num=num-a[i]*pow(10,n-i);
}
for(i=0;i<n/2+1;i=i+1)
{
t=a[i];
a[i]=a[n-i];
a[n-i]=t;
}
for(i=0;i<=
n;i=i+1)
{
num=num+a[i]*pow(10,n-i);
}
num=num*sign;
return num;
}
} | 44 |
21,997 | void reverse ( int number ) //????????
{
int result=0;
if (number>0 && number<10) //????number??????????????
cout<<number;
else if (number>=10) //????number?????????????
{
cout<<( number%10 );
number=number/10;
reverse ( number );
}
}
int main()
{
int number=0,i=0;
for (i=0;i<6;i++)
{
cin>>number;
if (number==0) //?????????????
cout<<number<<endl;
else if (number>0)
{
while (number%10==0) //??number?????0
number=number/10;
reverse (number);
cout<<endl;
}
else if (number<0)
{
number=number*(-1);
cout<<"-";
while (number%10==0) //??number?????0
number=number/10;
reverse (number);
cout<<endl;
}
}
return 0;
}
| 44 |
21,998 |
int main(){
int reverse(int num);
int i,result,sz[6];
for(i=0;i<6;i++){
scanf("%d",&sz[i]);
}
for(i=0;i<6;i++){
result=reverse(sz[i]);
printf("%d\n",result);
}
return 0;
}
int reverse(int num){
int g=0,s=0,b=0,q=0,w=0;
int a,y,goal;
a=abs(num);
w=a/10000;
q=a/1000-w*10;
b=a/100-w*100-q*10;
s=a/10-w*1000-q*100-b*10;
g=a%10;
if(w!=0){
y=g*10000+s*1000+b*100+q*10+w;
}
if(w==0&&q!=0){
y=g*1000+s*100+b*10+q;
}
if(w==0&&q==0&&b!=0){
y=g*100+s*10+b;
}
if(w==0&&q==0&&b==0&&s!=0){
y=g*10+s;
}
if(w==0&&q==0&&b==0&&s==0){
y=g;
}
if(num<0)
goal=y*(-1);
else
goal=y;
return(goal);
} | 44 |
21,999 | int FAN(int num)
{
int a[100000],i,wei,b,c,f=0;
wei=log10(num)+1;
for(i=1;i<=wei-1;i++)
{
b=pow(10,i);
c=pow(10,i-1);
a[i]=(num-num/b*b)/c;
}
a[i]=num/b;
for(i=wei;i>=1;i--)
{
f=f+a[i]*(pow(10,wei-i));
}
return f;
}
int main()
{
int N,M,i;
for(i=1;i<=6;i++)
{
scanf("%d",&N);
if(N==0)
printf("0\n");
else
{
if(N>0)
printf("%d\n",FAN(N));
else
{
M=-N;
printf("-%d\n",FAN(M));
}
}
}
return 0;
}
| 44 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.