id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
21,500 | void main()
{
int a[6],i,sum;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
int f(int x);
for(i=0;i<6;i++)
{
sum=f(a[i]);
printf("%d\n",sum);
}
}
int f(int x)
{
int sum,g(int y);
if(x>0)
sum=g(x);
if(x==0)
sum=0;
if(x<0)
sum=-g(-x);
return(sum);
}
int g(int y)
{
int a[5],sum=0,i,n;
for(i=0;i<5;i++)
{
a[i]=y%10;
y=y/10;
}
for(i=4;i>=0;i--)
{
if(a[i]==0)continue;
else
{
n=i;
break;
}
}
for(i=0;i<=n;i++)
sum=sum*10+a[i];
return(sum);
} | 44 |
21,501 | int reverse(int num)
{
int rvs=0,i,j,a[100],numz;
if(num==0)rvs=0;
else
{
if(num<0)numz=0-num;
else numz=num;
for(i=0;;i++)
{
a[i]=numz%10;
numz/=10;
if(numz<1)break;
}
for(j=0;j<i+1;j++)
{
rvs*=10;
rvs+=a[j];
}
if(num<0)rvs*=(-1);
}
return rvs;
}
int main()
{
int n,i;
for(i=0;i<6;i++)
{
scanf("%d",&n);
printf("%d\n",reverse(n));
}
return 0;
} | 44 |
21,502 | int f(int a);
int main()
{
int x,j,c[6];
for(j=1;j<=6;j++)
{
cin>>x;
c[j]=f(x);
}
for(j=1;j<=6;j++)
{
cout<<c[j]<<endl;
}
return 0;
}
int f(int a)
{
int i,b=0,t;
for(i=1;a!=0;i++)
{
t=a%10;
b=b*10+t;
a=a/10;
}
return b;
} | 44 |
21,503 | int reverse(int num)
{
int i=1,sum=0,yushu[50],j,k,p=0;//yushu????
if (num<0)
{
num=-num;//????0??????
p=-1;//????
}
while(num>=1)
{
yushu[i]=num%10;//???????
i++;
num=num/10;
}
for(j=1;j<i;j++)
{
for(k=0;k<i-1-j;k++) yushu[j]=yushu[j]*10;//?????
sum=sum+yushu[j];
}
if (p==-1) sum=-sum;//??????????
return sum;
}
int main()
{
int input,output;//?????????
int i;//???
for(i=0;i<6;i++)
{
cin>>input;
output=reverse(input);
cout<<output<<endl;
}
cin.get();cin.get();cin.get();cin.get();cin.get();
return 0;
}
| 44 |
21,504 | int main()
{
int x,a,b,c,d,e,i;
for(i=1;i<7;i++)
{
scanf("%d",&x);
if(x==0||x==-0)
{
c=0;
printf("%d\n",c);
}
else if(x>0)
{
if(x/10000>0)
{
a=x/10000;
b=(x%10000)/1000;
c=(x%1000)/100;
d=(x%100)/10;
e=x%10;
printf("%d\n",e*10000+d*1000+c*100+b*10+a);
}
else if(x/1000>0)
{
a=x/1000;
b=(x%1000)/100;
c=(x%100)/10;
d=x%10;
printf("%d\n",d*1000+c*100+b*10+a);
}
else if(x/100>0)
{
a=x/100;
b=(x%100)/10;
c=(x%100)%10;
printf("%d\n",c*100+b*10+a);
}
else if((x/10)>0)
{
a=x/10;
b=x%10;
printf("%d\n",(b*10+a));
}
else if(x/10==0)
printf("%d\n",x);
}
else if(x<0)
{
x=-x;
if(x/10000>0)
{
a=x/10000;
b=(x%10000)/1000;
c=(x%1000)/100;
d=(x%100)/10;
e=x%10;
printf("%d\n",-(e*10000+d*1000+c*100+b*10+a));
}
else if(x/1000>0)
{
a=x/1000;
b=(x%1000)/100;
c=(x%100)/10;
d=x%10;
printf("%d\n",-(d*1000+c*100+b*10+a));
}
else if(x/100>0)
{
a=x/100;
b=(x%100)/10;
c=(x%100)%10;
printf("%d\n",-(c*100+b*10+a));
}
else if((x/10)>0)
{
a=x/10;
b=x%10;
printf("%d\n",-(b*10+a));
}
else if(x/10==0)
printf("%d\n",-x);
}
}
return 0;
} | 44 |
21,505 |
int reverse(int x);
int main()
{
int p,num,k;
for(k=1;k<7;k++){
scanf("%d",&num);
p=reverse(num);
printf("%d\n",p);
}return 0;
}
int reverse(int x)
{
int i,s,cishu,sz[20],a;
cishu=0;
a=1;
if(x<0){
a=-1;
x=-x;
}
if(x==0){s=0;}
else{
for(i=1;;i++){
if(x%10==0){
x/=10;
}else{break;}
}for(i=0;;i++){
sz[i]=x%10;
x=x/10;
cishu+=1;
if(x==0){break;}
}
s=sz[0];
for(i=1;i<cishu;i++){
s=10*s;
s=s+sz[i];
}s=a*s;
}return s;
} | 44 |
21,506 | int reverse(int);
int main()
{
int num;
while (cin >>num)
cout <<reverse(num) <<endl;
return 0;
}
int reverse(int num)
{
int judge=0;
if (num<0) { num=-num;judge=1;}
int n[10]={0},count=0,reverses=0,i,j=1;
do
{
n[count]=num%10;
num=(num-n[count])/10;
count++;
}
while (num!=0);
for (i=count-1;i>=0;i--)
{
reverses+=n[i]*j;
j*=10;
}
if (judge==1) reverses=-reverses;
return(reverses);
} | 44 |
21,507 |
int reverse(int num)
{
int sgn,a[1000],i,j,t,k,x=0,u,real;
i=1;
real=abs(num);
if(num==0)
{
return 0;
}
else
{
if(num>0)
{
sgn=1;
}
if(num<0)
{
sgn=-1;
}
while(real!=0)//????i??
{
a[i-1]=real%10;
real/=10;
i++;
}
for(j=i;j>=1;j--)
{
u=1;
for(k=1;k<=i-j;k++)
{
u*=10;
}
x+=u*a[j-1];
}
return sgn*x/10;
}
}
void main()
{
int i,num;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
printf("%d\n",reverse(num));
}
scanf("%d",&i);
}
| 44 |
21,508 |
int reverse(int x);
int main()
{
int re_num,num,i;
for(i=0;i<6;i++){
scanf("%d",&num);
re_num=reverse(num);
printf("%d\n",re_num);
}
return 0;
}
int reverse(int x){
int a,b,c,d,e,y;
a=x/10000;
b=x/1000%10;
c=x/100%10;
d=x/10%10;
e=x%10;
if(a!=0){
y=e*10000+d*1000+c*100+b*10+a;
}
else if(b!=0){
y=e*1000+d*100+c*10+b;
}
else if(c!=0){
y=e*100+d*10+c;
}
else if(d!=0){
y=e*10+d;
}
else{
y=e;
}
return y;
} | 44 |
21,509 | void main()
{
int a[6],b[5],c[6],i;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
{
b[0]=a[i]/10000;
b[1]=a[i]/1000-10*b[0];
b[2]=a[i]/100-10*b[1]-100*b[0];
b[4]=a[i]%10;
b[3]=(a[i]%100-b[4])/10;
if(a[i]/10000!=0)
c[i]=b[0]+b[1]*10+b[2]*100+b[3]*1000+b[4]*10000;
else if(a[i]/1000!=0)
c[i]=b[1]+b[2]*10+b[3]*100+b[4]*1000;
else if(a[i]/100!=0)
c[i]=b[2]+b[3]*10+b[4]*100;
else if(a[i]/10!=0)
c[i]=b[3]+b[4]*10;
else c[i]=b[4];
}
for(i=0;i<6;i++)
printf("%d\n",c[i]);
}
| 44 |
21,510 |
int reverse(int num)
{
char str[100], revstr[100];
int i, len;
sprintf(str, "%d", num);
len = strlen(str);
if(str[0] == '-')
{
for(i = 1; i < len; i++)
{
revstr[i] = str[len - i];
}
revstr[0] = '-';
revstr[len] = '\0';
}
else
{
for(i = 0; i < len; i++)
{
revstr[i] = str[len - i - 1];
}
revstr[len] = '\0';
}
return(atoi(revstr));
}
void main()
{
int i, num;
for(i = 0; i < 6; i++)
{
scanf("%d", &num);
printf("%d\n", reverse(num));
}
}
| 44 |
21,511 |
void reverse( int x )
{
int i , j ;
char s[10] ;
if ( x >= 0 )
{
sprintf(s , "%d" , x );
for ( i = sizeof(s)-1 ; i >= 0 ; i --)
{
if ( s[i] > '0' && s[i] <= '9')
{
for ( j = i ; j >= 0 ; j --)
printf("%c" , s[j]);
break ;
}
}
}
else
{
printf("-");
reverse(-x);
}
}
int main(int argc, char* argv[])
{
int i , num ;
for ( i = 0 ; i < 6 ; i ++)
{
scanf("%d", &num);
reverse(num);
printf("\n");
}
return 0;
}
| 44 |
21,512 |
int reverse(int num) {
if(num == 0) return 0;
int a[70] = {0};
int count = 0;
if(num > 0) {
while(num > 0) {
a[count] = num % 10;
num /= 10;
count++;
}
for(int i = 0; i < count; i++) {
num *= 10;
num += a[i];
}
return num;
}
if(num < 0) {
num *= -1;
while(num > 0) {
a[count] = num % 10;
num /= 10;
count++;
}
for(int i = 0; i < count; i++) {
num *= 10;
num += a[i];
}
num *= -1;
return num;
}
}
int main() {
const int line = 6;
int num = 0;
for(int i = 0; i < line; i++) {
cin >> num;
num = reverse(num);
cout << num << endl;
}
return 0;
} | 44 |
21,513 | int reverse(int num)
{
int x,answer=0;
if(num>0)
{
do
{
x=num%10;
answer=x+answer*10;
num=num/10;
}
while(num!=0);
return answer;
}
else if(num==0)
return 0;
else
{
num=-num;
do
{
x=num%10;
answer=x+answer*10;
num=num/10;
}
while(num!=0);
answer=-answer;
return answer;
}
}
int main()
{
int j,y;
for(j=0;j<6;j++)
{
scanf("%d",&y);
int result=reverse(y);
printf("%d\n",result);
}
}
| 44 |
21,514 | void main()
{
int reverse(int num);
int num[6],i;
for(i=0;i<6;i++)
scanf("%d",&num[i]);
for(i=0;i<6;i++)
num[i]=reverse(num[i]);
for(i=0;i<6;i++)
printf("%d\n",num[i]);
}
int reverse(int num)
{
int i=0,n=0,flag;
int a[100];
if(num==0)
num=0;
else
{
if(num>0)
flag=1;
else
flag=-1;
num=abs(num);
{
while(num>0)
{
a[i]=num%10;
i++;
num=(num-num%10)/10;
n++;
}
for(i=0;i<n;i++)
num=num+a[i]*pow(10,n-i-1);
}
num=num*flag;
}
return(num);
}
| 44 |
21,515 | int main()
{
int n,i,j,k,l;
char a[100][100],b[100][100];
for(i=0;i<6;i++)
{
scanf("%s",a[i]);
l=strlen(a[i]);
if(a[i][0]!='-')
{
for(j=0;j<l;j++)
{
b[i][l-1-j]=a[i][j];
}
for(j=0;j<l;j++)
{
if(b[i][j]!=48)
{k=j;
break;}
}
for(j=k;j<l;j++)
{
printf("%c",b[i][j]);
}
}
if((a[i][0]=='-'&&a[i][1]==48)||a[i][0]==48)
{
printf("0");
}
if(a[i][0]=='-')
{
for(j=1;j<l;j++)
{
b[i][l-j]=a[i][j];
}
for(j=1;j<l;j++)
{
if(b[i][j]!=48)
{
k=j;
break;
}
}
printf("-");
for(j=k;j<l;j++)
{
printf("%c",b[i][j]);
}
}
printf("\n");
}
return 0;
} | 44 |
21,516 | int reverse(int num)
{
int numnew;
if(num==0)
return 0;
else
{
if(num>0)
{
numnew=0;
while(num>0)
{
numnew=numnew*10+num%10;
num=num/10;
}
return numnew;
}
else if(num<0)
{
num=-num;
numnew=0;
while(num>0)
{
numnew=numnew*10+num%10;
num=num/10;
}
return -numnew;
}
}
}
int main()
{
int i,a[6],answer[6];
for(i=0;i<6;i++)
{
cin >>a[i];
answer[i]=reverse(a[i]);
cout <<answer[i]<<endl;
}
return 0;
}
| 44 |
21,517 |
int main()
{
int reverse(int num);
int a[6],b,i;
for(i=0;i<=5;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=5;i++)
{
b=reverse(a[i]);
printf("%d\n",b);
}
return 0;
}
int reverse(int num)
{
int c,d,e,f,g,j,k,l,m,n,o,p,q,x;
if(num==0)
{
x=num;
}
else
{
if(num>0)
{
c=num%10000;
d=num-c;
e=d/10000;
f=c%1000;
g=c-f;
j=g/1000;
k=f%100;
l=f-k;
m=l/100;
n=k%10;
o=k-n;
p=o/10;
q=10000*n+1000*p+100*m+10*j+e;
if(e!=0)
{
x=q;
}
if(e==0&&j!=0)
{
x=q/10;
}
if(e==0&&j==0&&m!=0)
{
x=q/100;
}
if(e==0&&j==0&&m==0&&p!=0)
{
x=q/1000;
}
if(e==0&&j==0&&m==0&&p==0&&n!=0)
{
x=q/10000;
}
}
else
{
if(num<0)
{
num=0-num;
c=num%10000;
d=num-c;
e=d/10000;
f=c%1000;
g=c-f;
j=g/1000;
k=f%100;
l=f-k;
m=l/100;
n=k%10;
o=k-n;
p=o/10;
q=10000*n+1000*p+100*m+10*j+e;
if(e!=0)
{
x=q;
}
if(e==0&&j!=0)
{
x=q/10;
}
if(e==0&&j==0&&m!=0)
{
x=q/100;
}
if(e==0&&j==0&&m==0&&p!=0)
{
x=q/1000;
}
if(e==0&&j==0&&m==0&&p==0&&n!=0)
{
x=q/10000;
}
x=0-x;
}
}
}
return(x);
} | 44 |
21,518 |
int reverse(int num){
int sz[20];
int i,fanxu=0,weishu=0;
for(i=0;;i++){
sz[i]=num%(int)pow(10,i+1);
if(num%(int)pow(10,i+1)==0&&num/(int)pow(10,i+1)==0){
weishu=i;
break;
}
num=num-sz[i];
}
for(i;i>=0;i--){
fanxu=fanxu+sz[i]*(int)pow(10,weishu-i-1)/(int)pow(10,i);
}
return fanxu;
}
int main(int argc, char* argv[])
{
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));
return 0;
} | 44 |
21,519 | int fan(int x)
{
int i,a[100],b[200],sign=0,c=0;
if(x>=0)
{ for(i=1;;i++)
{
b[i]=x%10;
x=(x-b[i])/10;
sign+=1;
if(x==0)
break;
}
for(i=sign;i>=1;i--)
c+=b[i]*pow(10,sign-i);
return c;
}
if(x<0)
{
x=-1*x;
for(i=1;;i++)
{
b[i]=x%10;
x=(x-b[i])/10;
sign+=1;
if(x==0)
break;
}
for(i=sign;i>=1;i--)
c+=b[i]*pow(10,sign-i);
return -1*c;
}
}
int main()
{
int a[6],i;
for(i=0;i<=5;i++)
{
scanf("%d",&a[i]);
a[i]=fan(a[i]);
}
for(i=0;i<=5;i++) printf("%d\n",a[i]);
return 0;
}
| 44 |
21,520 | int reverse(int num)
{
int zheng=abs(num);
int sz[10],i,wei=0;
for(i=0;i<10;i++){
sz[i]=zheng%10;
zheng=zheng/10;
wei++;
if(zheng==0)
break;
}
int Reverse=0;
for(i=0;i<wei;i++){
Reverse=Reverse*10+sz[i];
}
return Reverse;
}
int main()
{
int n,i;
for(i=0;i<6;i++){
scanf("%d",&n);
if(n>0){
printf("%d\n",reverse(n));
}else{
printf("%d\n",-reverse(n));
}
}
return 0;
}
| 44 |
21,521 | int transfer(int i)
{
int b=0,t,r;
b+=i%10;
for(r=0;r<5;r++)
{
i/=10;
if(i!=0)
b=(b*10)+i%10;
else break;
}
return b;
}
int main()
{
int i,j,n=6;
while(n>0)
{
scanf("%d",&i);
printf("%d\n",transfer(i));
n--;
}
return 0;
} | 44 |
21,522 | int turn(int a);
int main()
{
int n;
for(int i=0;i<6;i++)
{
scanf("%d",&n);
if (n<0)
printf("-%d\n",turn(-n));
else
printf("%d\n",turn(n));
}
}
int turn(int a)
{
int i,k,m=0;
char x[1000];
for (i = 0;a!=0;i++)
{
x[i] = a%10;
a=a/10;
}
for (k = 0;k<i;k++)
m=x[k]+10*m;
return (m);
} | 44 |
21,523 | int main()
{
int reverse(int num);
int i,p,q;
for(i=1;i<=6;i++){
scanf("%d",&p);
q=reverse(p);
printf("%d\n",q);
}
return 0;
}
int reverse(int num)
{
int t,sign,b=0;
t=abs(num);
while(t>0){
b=b*10+t%10;
t/=10;
}
sign=(num>=0)?1:-1;
b=sign*b;
return b;
} | 44 |
21,524 | void main()
{
int reverse(int num);
int a[6];
int i,c;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
{
c=reverse(a[i]);
printf("%d",c);
if(i<5)
printf("\n");
}
}
int reverse(int num)
{
int num1,i,n,k,num2=0;
if(num<0)
num1=(-num);
else
num1=num;
n=log10(num1);
for(i=n+1;i>0;i--)
{
k=num1/pow(10,i-1);
num2=k*pow(10,n-i+1)+num2;
num1=num1-k*pow(10,i-1);
}
if(num<0)
return(-num2);
else
return(num2);
} | 44 |
21,525 | int pow(int x,int y)
{
int i,sum=1;
for(i=0;i<y;i++)
{
sum*=x;
}
return (sum);
}
int rev(int x)
{
int i,k,j,m,ans=0;
if(x==0)
ans=0;
else
{
while(x%10==0)
{x=x/10;}
for(j=0;x!=0;j++)
{
ans=ans*10+x%10;
x=x/10;
}
}
return(ans);
}
int main()
{
int a,i;
for(i=0;i<6;i++)
{
scanf("%d",&a);
printf("%d\n",rev(a));
}
return (0);
} | 44 |
21,526 | int po(int x,int y)
{
int i,z=1;
for(i=1;i<=y;i++)
{
z*=x;
}
return z;
}
int r(int n)
{
int i,j,m[20],p=0,k,l;
if(n>=0){for(i=1;n>0;i++)
{
m[i]=n%10;
n/=10;
}
for(j=1;j<=i-1;j++)
{
p+=m[j]*po(10,i-j-1);
}
}
if(n<0)
{
n=-n;
for(i=1;n>0;i++)
{
m[i]=n%10;
n/=10;
}
for(j=1;j<=i-1;j++)
{
p+=m[j]*po(10,i-j-1);
}
p=-p;
}
return p;
}
int main()
{
int r(int n);
int a,b,c,d,e,f;
cin>>a>>b>>c>>d>>e>>f;
cout<<r(a)<<endl;
cout<<r(b)<<endl;
cout<<r(c)<<endl;
cout<<r(d)<<endl;
cout<<r(e)<<endl;
cout<<r(f)<<endl;
return 0;
}
| 44 |
21,527 | int reverse(int num);
void swap(int* a,int* b);
int main()
{
int num,i;
for(i=0;i<6;i++)
{
scanf("%d",&num);
printf("%d\n",reverse(num));
}
return 0;
}
int reverse(int num)
{
int a[20],i,n,mark=0;
if(num>0)
mark=1;
for(i=0;;i++)
{
a[i]=num%10;
num=(num-a[i])/10;
if(num==0)
break;
}
n=i;
for(i=0;i<=(n/2);i++)
{
swap(&a[i],&a[n-i]);
}
for(i=n;i>=0;i--)
{
num=(num+a[i])*10;
}
num=num/10;
return num;
}
void swap(int*a,int*b)
{
int e;
e=*a;
*a=*b;
*b=e;
}
| 44 |
21,528 | void main()
{
int copy(int x);
int a[6],b[6],i;
for(i=1;i<=6;i++)
scanf("%d",&a[i]);
for(i=1;i<=6;i++)
b[i]=copy(a[i]);
for(i=1;i<=6;i++)
printf("%d\n",b[i]);
}
int copy(int x)
{
int o,p,q,r,s,y;
if (x<=0)
{
x=-x;
if (x<1000)
{
o=x%10;
p=((x-o)%100)/10;
q=(x-o-10*p)/100;
y=-(100*o+10*p+q);
}
else if (x>=1000&&x<10000)
{
o=x%10;
p=((x-o)%100)/10;
q=((x-o-10*p)%1000)/100;
r=(x-o-10*p-100*q)/1000;
y=-(1000*o+100*p+10*q+r);
}
else
{
o=x%10;
p=((x-o)%100)/10;
q=((x-o-10*p)%1000)/100;
r=((x-o-10*p-100*q)%10000)/1000;
s=(x-o-10*p-100*q-1000*r)/10000;
y=-(10000*o+1000*p+100*q+10*r+s);
}
}
else
{
if (x<1000)
{
o=x%10;
p=((x-o)%100)/10;
q=(x-o-10*p)/100;
y=100*o+10*p+q;
}
else if (x>=1000&&x<10000)
{
o=x%10;
p=((x-o)%100)/10;
q=((x-o-10*p)%1000)/100;
r=(x-o-10*p-100*q)/1000;
y=1000*o+100*p+10*q+r;
}
else
{
o=x%10;
p=((x-o)%100)/10;
q=((x-o-10*p)%1000)/100;
r=((x-o-10*p-100*q)%10000)/1000;
s=(x-o-10*p-100*q-1000*r)/10000;
y=10000*o+1000*p+100*q+10*r+s;
}
}
return(y);
} | 44 |
21,529 | void main()
{
int reverse(int num);
int i,n,c[6];
for(i=0;i<6;i++)
{
scanf("%d",&n);
c[i]=reverse(n);
}
for(i=0;i<6;i++)
printf("%d\n",c[i]);
}
int reverse(int num)
{
int t=0,d;
if(num==0)
return 0;
else if(num>0)
{
d=num;
while(d!=0)
{
t=t*10+d%10;
d=d/10;
}
return t;
}
else
{
d=num*(-1);
while(d!=0)
{
t=t*10+d%10;
d=d/10;
}
return -t;
}
} | 44 |
21,530 | int main()
{
void reverse(int num,int flag);
for(int i=0;i<6;i++)
{
int n;
cin>>n;
if(n==0){cout<<'0'<<endl;}
else
{
if(n<0){cout<<'-';n*=-1;}
reverse(n,0); //?????????
cout<<endl;
}
}
return 0;
}
void reverse(int num,int flag) //????,flag????????
{ //flag=0????????????
int c;
c=num%10;
if(c!=0){cout<<c;flag=1;}
else if(c==0&&flag==1){cout<<c;}
if((num/10)!=0)
reverse(num/10,flag);
}
| 44 |
21,531 | main()
{
int fan(int x);
int a[6];
int b[6];
int i=0;
do
{
scanf("%d",&a[i]);
b[i]=fan(a[i]);
i=i+1;
}
while(i<6);
i=0;
do
{
printf("%d\n",b[i]);
i=i+1;
}
while(i<6);
}
int fan(int x)
{
int y;
y=0;
do
{
y=x%10+10*y;
x=x/10;
}
while(x!=0);
return(y);
}
| 44 |
21,532 | int num(int n)
{int c,x,y,i,j,a[100],k,nu;j=0;nu=0;
if(n>0)nu=1;if(n<0){nu=-1;n=n*nu;}
y=log10(n);
for(i=y;i>=0;i--){x=n/(pow(10,i));a[j]=x;j++;n=n-x*pow(10,i);}
k=0;j=0;x=0;
for(i=0;i<=y;i++){k=k+a[i]*pow(10,x);x++;}
return (k*nu);
}
int main()
{int l,m;
for(l=0;scanf("%d",&m)==1;l++)
{
printf("%d\n",num(m));}
return 0;} | 44 |
21,533 | int reverse(int num);
void main()
{
int a[10],i;
int b[10];
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]);
}
}
int reverse(int num)
{int x,y,z;
if(num<0)
{
x=-num;
if(x>0&&x<10)
return(-x);
if(x>=10&&x<=99)
{z=(x-(x/10)*10)*10+x/10;
return(-z);}
if(x>=100&&x<999)
{z=(x-(x/10)*10)*100+(x/10-(x/100)*10)*10+x/100;
return(-z);
}
if(x>=1000&&x<9999)
{z=(x-(x/10)*10)*1000+(x/10-(x/100)*10)*100+(x/100-(x/1000)*10)*10+x/1000;
return(-z);
}
if(x>=10000&&x<99999)
{z=(x-(x/10)*10)*10000+(x/10-(x/100)*10)*1000+(x/100-(x/1000)*10)*100+(x/1000-(x/10000)*10)*10+x/10000;
return(-z);
}
}
if(num==-0||num==0)
return(0);
if(num>0&&num<10)
return(num);
if(num>=10&&num<=99)
{ y=num;
z=(y-(y/10)*10)*10+y/10;
return(z);}
if(num>=100&&num<999)
{ y=num;
z=(y-(y/10)*10)*100+(y/10-(y/100)*10)*10+y/100;
return(z);
}
if(num>=1000&&num<9999)
{ y=num;
z=(y-(y/10)*10)*1000+(y/10-(y/100)*10)*100+(y/100-(y/1000)*10)*10+y/1000;
return(z);
}
if(num>=10000&&num<99999)
{ y=num;
z=(y-(y/10)*10)*10000+(y/10-(y/100)*10)*1000+(y/100-(y/1000)*10)*100+(y/1000-(y/10000)*10)*10+y/10000;
return(z);
}
}
| 44 |
21,534 |
int rev(int n)
{
int digit[6],i,out=0,a;
for(i=0;;i++)
{
digit[i]=n%10;
n/=10;
if(n==0) break;
}
a=i+1;
for(i=0;i<a;i++)
{
out+=(digit[i]*pow(10,a-1-i));
}
return out;
}
int main( )
{
int n,i;
for(i=0;i<6;i++)
{
scanf("%d",&n);
if(i!=0) printf("\n");
printf("%d",rev(n));
}
return 0;
} | 44 |
21,535 | int reverse(int num)
{
int s,j,k;
k=num;
int newnum=0;
int a[100];
for(s=1;s<100;s++)
{
a[s]=k-k/10*10;
k=k/10;
if(k==0)
break;
}
for(j=0;j<s;j++)
{
newnum=newnum*10;
newnum=newnum+a[j+1];
}
return newnum;
}
int main()
{
int n[6],newn[6];
for(int i=0;i<6;i++)
scanf("%d",&n[i]);
for(int i=0;i<6;i++)
{
newn[i]=reverse(n[i]);
printf("%d\n",newn[i]);
}
return 0;
}
| 44 |
21,536 | int main()
{
int n,m,k=0;
for(k=1;k<7;k++)
{
scanf("%d\n",&n);
m=reverse(n);
printf("%d\n",m);
}
return 0;
}
int reverse(int num)
{
int t,num1,a,b,c,d,e,f,g,h,i,j;
if(num<0) num1=-num;
else num1=num;
if(10000000000>num1&&num1>999999999)
{
a=num1/1000000000;
b=(num1-1000000000*a)/100000000;
c=(num1-1000000000*a-100000000*b)/10000000;
d=(num1-1000000000*a-100000000*b-10000000*c)/1000000;
e=(num1-1000000000*a-100000000*b-10000000*c-1000000*d)/100000;
f=(num1-1000000000*a-100000000*b-10000000*c-1000000*d-100000*e)/10000;
g=(num1-1000000000*a-100000000*b-10000000*c-1000000*d-100000*e-10000*f)/1000;
h=(num1-1000000000*a-100000000*b-10000000*c-1000000*d-100000*e-10000*f-1000*g)/100;
i=(num1-1000000000*a-100000000*b-10000000*c-1000000*d-100000*e-10000*f-1000*g-100*h)/10;
j= num1-1000000000*a-100000000*b-10000000*c-1000000*d-100000*e-10000*f-1000*g-100*h-10*i;
t=1000000000*j+100000000*i+10000000*h+1000000*g+100000*f+10000*e+1000*d+100*c+10*b+a;
}
if(1000000000>num1&&num1>99999999)
{
a=num1/100000000;
b=(num1-100000000*a)/10000000;
c=(num1-100000000*a-10000000*b)/1000000;
d=(num1-100000000*a-10000000*b-1000000*c)/100000;
e=(num1-100000000*a-10000000*b-1000000*c-100000*d)/10000;
f=(num1-100000000*a-10000000*b-1000000*c-100000*d-10000*e)/1000;
g=(num1-100000000*a-10000000*b-1000000*c-100000*d-10000*e-1000*f)/100;
h=(num1-100000000*a-10000000*b-1000000*c-100000*d-10000*e-1000*f-100*g)/10;
i= num1-100000000*a-10000000*b-1000000*c-100000*d-10000*e-1000*f-100*g-10*h;
t=100000000*i+10000000*h+1000000*g+100000*f+10000*e+1000*d+100*c+10*b+a;
}
if(100000000>num1&&num1>9999999)
{
a=num1/10000000;
b=(num1-10000000*a)/1000000;
c=(num1-10000000*a-1000000*b)/100000;
d=(num1-10000000*a-1000000*b-100000*c)/10000;
e=(num1-10000000*a-1000000*b-100000*c-10000*d)/1000;
f=(num1-10000000*a-1000000*b-100000*c-10000*d-1000*e)/100;
g=(num1-10000000*a-1000000*b-100000*c-10000*d-1000*e-100*f)/10;
h= num1-10000000*a-1000000*b-100000*c-10000*d-1000*e-100*f-10*g;
t=10000000*h+1000000*g+100000*f+10000*e+1000*d+100*c+10*b+a;
}
if(10000000>num1&&num1>999999)
{
a=num1/1000000;
b=(num1-1000000*a)/100000;
c=(num1-1000000*a-100000*b)/10000;
d=(num1-1000000*a-100000*b-10000*c)/1000;
e=(num1-1000000*a-100000*b-10000*c-1000*d)/100;
f=(num1-1000000*a-100000*b-10000*c-1000*d-100*e)/10;
g= num1-1000000*a-100000*b-10000*c-1000*d-100*e-10*f;
t=1000000*g+100000*f+10000*e+1000*d+100*c+10*b+a;
}
if(1000000>num1&&num1>99999)
{
a=num1/100000;
b=(num1-100000*a)/10000;
c=(num1-100000*a-10000*b)/1000;
d=(num1-100000*a-10000*b-1000*c)/100;
e=(num1-100000*a-10000*b-1000*c-100*d)/10;
f=(num1-100000*a-10000*b-1000*c-100*d-10*e)/10;
t=100000*f+10000*e+1000*d+100*c+10*b+a;
}
if(100000>num1&&num1>9999)
{
a=num1/10000;
b=(num1-10000*a)/1000;
c=(num1-10000*a-1000*b)/100;
d=(num1-10000*a-1000*b-100*c)/10;
e=num1-10000*a-1000*b-100*c-10*d;
t=10000*e+1000*d+100*c+10*b+a;
}
if(10000>num1&&num1>999)
{
a=num1/1000;
b=(num1-1000*a)/100;
c=(num1-1000*a-100*b)/10;
d=num1-1000*a-100*b-10*c;
t=1000*d+100*c+10*b+a;
}
if(1000>num1&&num1>99)
{
a=num1/100;
b=(num1-100*a)/10;
c=num1-100*a-10*b;
t=100*c+10*b+a;
}
if(100>num1&&num1>9)
{
a=num1/10;
b=num1-10*a;
t=10*b+a;
}
if(10>num1&&num1>=0)
t=num1;
if(num<0) t=-t;
else t=t;
return t;
} | 44 |
21,537 | int reverse(int a)
{
int k,p=0,m=0;
if(a<0)
{
m=-a;
while(m>0)
{
k=m%10;
p=p*10+k;
m=m/10;
}
p=-p;
}
else if(a>0)
{
m=a;
while(m>0)
{
k=m%10;
p=p*10+k;
m=m/10;
}
}
else if(a==0)
p=0;
return p;
}
int main()
{
int reverse(int a);
int i,b[6];
for(i=0;i<6;i++)
{
scanf("%d",&b[i]);
b[i]=reverse(b[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",b[i]);
}
return 0;
}
| 44 |
21,538 | int reverse(int num)
{
int res;
res=num;
int i,j;
int ct;
for(j=0;;j++)
{
if(res<pow(10.0,j+1)&&res>=pow(10.0,j))
{
ct=j+1;
break;
printf(",");
}
else
{}
}
int shuwei[100];
for(i=1;i<=ct;i++)
{
shuwei[i-1]=res%10;
res/=10;
}
int ans=0;
for(i=1;i<=ct;i++)
{
ans+=shuwei[i-1]*pow(10.0,ct-i);
}
return ans;
}
int main()
{
int i;
int x,ans;
for(i=1;i<=6;i++)
{
scanf("%d",&x);
if(x!=0)
{
if(x>0)
{
ans=reverse(x);
printf("%d\n",ans);
}
else
{
ans=-reverse(-x);
printf("%d\n",ans);
}
}
else
{
printf("0\n");
}
}
return 0;
} | 44 |
21,539 |
int main()
{
int a[N];
int i;
int reverse(int x);
for(i=0;i<N;i++)
scanf("%d",&a[i]);
for(i=0;i<N;i++)
printf("%d\n",reverse(a[i]));
return 0;
}
int reverse(int x)
{
int y,i,j,r;
int a[M];
for(r=0;x>=10||x<=-10;r++)
{
a[r]=x%10;
x=(x-x%10)/10;
}
a[r]=x;
for(i=0,y=0;i<=r;i++)
{
for(j=1;j<=r-i;j++)
{
a[i]=a[i]*10;
}
y=y+a[i];
}
return y;
} | 44 |
21,540 | int reverse(int num)
{
int a[20],j,p,x;
if(num<0)
{cout<< "-";
num=-num;}
else if(num==0)
{cout<<0;}
for(j=0;num>0;j++)
{a[j]=num%10;
num=num/10;
//cout<<a[j]<<' '<<j<<endl;
}
p=j;
for(j=0;j<=p;j++)
{ //cout<<a[j];
if(a[j]!=0)
{x=j;break;}
}
for(j=x;j<p;j++)
cout<<a[j];
}
int reverse(int);
int main()
{
int i,n;
for(i=0;i<6;i++)
{
cin>>n;
reverse(n);
cout<<endl;
}cin.get();return 0;
}
| 44 |
21,541 |
int reverse(int num)
{
if(num==0||num==-0)
return 0;
int x=abs(num);
if(num<0)
printf("-");
while(x%10==0)
{
x/=10;
}
while(x!=0)
{
printf("%d", x%10);
x/=10;
}
printf("\n");
return 1;
}
int main()
{
int num, i;
for(i=0;i<6;i++)
{
scanf("%d", &num);
if(reverse(num)==0)
printf("0\n");
}
return 0;
} | 44 |
21,542 | int reverse(int num){
int i,b,k,a=1000,x=0;
for(i=10;a>0;i=10*i,x++){
a=num/i;
}
if(x==1){
k=num;
}
else{
k=(num%10);
for(b=1;b<x;b++){
k=k*10;
}
k+=reverse(num/10);
}
return k;
}
int main(){
int u[10],j;
for(j=0;j<6;j++){
scanf("%d",&u[j]);
}
for(j=0;j<6;j++){
if(u[j]==0) printf("%d\n",0);
if(u[j]>0){
printf("%d\n",reverse(u[j]));
}
if(u[j]<0){
printf("%d\n",-reverse(-u[j]));
}
}
return 0;
}
| 44 |
21,543 | void reverse(int num)
{
int a,b,c,d,e,f;
f=abs(num);
if(num<0)
printf("-");
{ if(f/10000==0)
{
if(f/10==0)
printf("%d\n",f);
else if(f/100==0)
{
a=f/10;
b=f-a*10;
printf("%d\n",b*10+a);
}
else if(f/1000==0)
{
a=f/100;
b=(f-a*100)/10;
c=(f-a*100-b*10);
printf("%d\n",c*100+b*10+a);
}
else
{
a=f/1000;
b=(f-a*1000)/100;
c=(f-a*1000-b*100)/10;
d=(f-a*1000-b*100-c*10);
printf("%d\n",d*1000+c*100+b*10+a);
}
}
if(f/10000!=0)
{
a=f/10000;
b=(f-a*10000)/1000;
c=(f-a*10000-b*1000)/100;
d=(f-a*10000-b*1000-c*100)/10;
e=(f-a*10000-b*1000-c*100-d*10);
printf("%d\n",e*10000+d*1000+c*100+b*10+a);
}}
}
int main()
{
int i,num;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
reverse(num);
}
}
| 44 |
21,544 | void main()
{
int a[6], i;
int reverse(int num);
for (i=0; i<6; i++)
{
scanf("%d", &a[i]);
}
for (i=0; i<6; i++)
{
if (a[i]<0)
{
a[i]=reverse(a[i]);
printf("%d\n", -a[i]);
}
else
{
a[i]=reverse(a[i]);
printf("%d\n", a[i]);
}
}
}
int reverse(int a)
{
int n, b[5], i, j[5], c, t;
if (a<0)
a=-a;
if (a>=10000)
n=4;
if (a<10000 && a>=1000)
n=3;
if (a<1000 && a>=100)
n=2;
if (a<100 && a>=10)
n=1;
if (a<10 && a>=0)
n=0;
j[0]=1;
for (i=1; i<=n; i++)
{
j[i]=j[i-1]*10;
}
b[n]=a/j[n];
for (i=n-1; i>=0; i--)
{
c=a;
for (t=i+1; t<=n; t++)
{
c=c-b[t]*j[t];
}
b[i]=c/j[i];
}
t=0;
for (i=0; i<=n; i++)
{
t=t+b[i]*j[n-i];
}
return (t);
}
| 44 |
21,545 | int main()
{
int n,i;
void reverse(int num);
for(i=0;i<6;i++)
{
scanf("%d",&n);
reverse(n);
}
return 0;
}
void reverse(int num)
{
int i,result,k;
if(num<0)
{
printf("-");
num=num*-1;
k=0;
while(num/10!=0)
{
if(num%10!=0)
{
k=1;
}
if(k!=0)
{
printf("%d",num%10);
} num=num/10;
}
if(num<10&&num>0)
{printf("%d\n",num);}
}else if(num>0)
{
k=0;
while(num/10!=0)
{
if(num%10!=0)
{
k=1;
}
if(k!=0)
{
printf("%d",num%10);
}num=num/10;
}
if(num<10&&num>0)
{printf("%d\n",num);}
}else if(num==0)
{
printf("0");
}
}
| 44 |
21,546 | int f(int a)
{
int n[32],i,p=10,q,b=0;
for(i=0; ;i++)
{
n[i]=a%10;
a=a/p;
if(a==0)
break;
}
for(int j=i;j>=0;j--)
{
q=1;
for(int s=0;s<j;s++)
{
q=q*10;
}
a=a+n[b]*q;
b++;
}
printf("%d\n",a);
}
main()
{
int a;
int f(int );
for(int c=0;c<6;c++)
{
scanf("%d",&a);
f(a);
}
getchar();
getchar();
getchar();
getchar();
}
| 44 |
21,547 |
int main()
{
int reverse (int n);
int s[6]={0},z[6]={0},i;
for (i=0;i<6;i++)
{
scanf("%d",&s[i]);
z[i]=reverse (s[i]);
printf("%d\n",z[i]);
}
return 0;
}
int reverse (int n)
{
int z,t=0;
if (n==0)
z=0;
while(n!=0)
{
t=t*10+n%10;
n=n/10;
}
if (n<0)
{
z=t*(-1);
}else{
z=t;
}
return z;
}
| 44 |
21,548 | int f(int num)
{
int result=0,a[1000],i,j,u;
if(num<0)
num=num*-1;
j=0;
for(i=0;num>0;i++)
{
a[i]=num%10;
num=num/10;
j++;
}
u=1;
for(i=j-1;i>=0;i--)
{
result=result+a[i]*u;
u=u*10;
}
return result;
}
int main ()
{
int k,d,b[6],r;
for(k=0;k<6;k++)
{
scanf("%d",&b[k]);
}
for(k=0;k<6;k++)
{
r=f(b[k]);
if(b[k]>=0)
{
printf("%d\n",r);
}
else
{
printf("-%d\n",r);
}
}
scanf("%d",&d);
return 0;
}
| 44 |
21,549 | int reverse (int num)
{
int a[12];
int i,j,k,p;
if(num==0)
{
printf("0");
}
else
{
if(num>0)
{
a[0]=1;
}
if(num<0)
{
a[0]=0;
num=0-num;
}
if(a[0]==0)
{
printf("-");
}
for(i=1;num!=0;i++)
{
a[i]=num%10;
num=(num-a[i])/10;
}
a[i]=10;
for(j=1;a[j]==0;j++)
{
p=1;
}
for(k=j;a[k]!=10;k++)
{
printf("%d",a[k]);
}
printf("\n");
}
return 0;
}
main()
{
int a,i;
for(i=1;i<=6;i++)
{
scanf("%d",&a);
reverse(a);
}
} | 44 |
21,550 | int reverse(int num)
{
int d = 0,m;
if(num >= 0)
{
m = num;
while (m != 0)
{
d = d * 10 + m % 10;
m = m / 10;
}
return d;
}
else
{
m = 0 - num;
while (m != 0)
{
d = d * 10 + m % 10;
m = m / 10;
}
return -d;
}
}
int main()
{
int i,a[10],b[10];
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]);
}
getchar();
getchar();
getchar();
}
| 44 |
21,551 | void fanxu(char *p,int n);
void fanxu(char *p,int n)
{
int i,j;
char temp;
if((*p=='-'&&*(p+1)=='0')||*p=='0') {*p='0';*(p+1)='\0';return;}
else if(*p=='-'&&*(p+1)!='0')
{ for(i=n-1;i>=0;i--)
if(*(p+i)!='0') {*(p+i+1)='\0';break;}
j=i;
for(i=1;i<=j/2;i++)
{temp=*(p+i); *(p+i)=*(p+j+1-i);*(p+j+1-i)=temp;}
}
else { for(i=n-1;i>=0;i--)
if(*(p+i)!='0') {*(p+i+1)='\0';break;}
j=i;
for(i=0;i<=j/2;i++)
{temp=*(p+i); *(p+i)=*(p+j-i);*(p+j-i)=temp;}
}
}
int main()
{
int i,len;
char str[300];
for(i=0;i<6;i++)
{gets(str);len=strlen(str);
fanxu(str,len);
printf("%s\n",str);
}
return 0;
} | 44 |
21,552 |
int main()
{
int num;
int i;
int reverse(int num,int s);
for(i=0;i<6;i++)
{
scanf("%d",&num);
if(num<0)
{
num=-num;
printf("-%d\n",reverse(num,0));
}
else
printf("%d\n",reverse(num,0));
}
return 0;
}
int reverse(int num,int s)
{
s=s*10+num%10;
if(num>=10)
return reverse(num/10,s);
else
return s;
} | 44 |
21,553 | void reserve(int a)//??????
{
int rest,yu;
yu=a%10;//?????????
a=a/10;
if (a>=1)
{
cout<<yu;
reserve(a);
}
else cout<<yu<<endl;
}
int main()
{
int input,i;//?????i????
for(i=0;i<6;i++)
{
cin>>input;
if (input<0)
{
cout<<"-";
input=-input;
}
for(;;)//??????0
{
if (input%10==0) input=input/10;
else break;
}
reserve(input);
}
cin.get();cin.get();cin.get();cin.get();cin.get();cin.get();cin.get();
return 0;
}
| 44 |
21,554 | int main()
{
int number=0,judge=0;//judge??????????0,number?????
int i;
void reverse(int num,int judge);//????
for(i=0;i<6;i++)
{
cin>>number;//????
if(number==0)//?????????0
cout<<'0';
else
{
if(number<0)
{
cout<<'-';
number=-number;
}
reverse(number,0);
}
cout<<endl;
}
return 0;
}
void reverse(int num,int judge)
{
if(num%10!=0||judge)
{
cout<<num%10;
judge=1;
}
if(num/10!=0)
reverse(num/10,judge);
} | 44 |
21,555 | int reverse(int num);
int main()
{
int num; //????
int i;
for(i=0;i<6;i++)//????
{
cin>>num;
cout<<reverse(num)<<endl;
}
return 0;
}
int reverse(int num)
{
int change=0; //change???????
while(num!=0)
{
change=change*10+num%10;
num/=10;
}
return change;
} | 44 |
21,556 | int reverse(int num);
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]));
}
int reverse(int num)
{
int x=0,flag=0;
if(num<0)
{
flag=1;
num=0-num;
}
while(num!=0)
{
x=num%10+x*10;
num=num/10;
}
if(flag==1)x=0-x;
return(x);
} | 44 |
21,557 | void main()
{
int i,A[6];
int FanXu (int x);
for (i=0;i<6;i++)
scanf("%d",&A[i]);
for (i=0;i<6;i++)
A[i]=FanXu(A[i]);
for (i=0;i<6;i++)
printf("%d\n",A[i]);
}
int FanXu (int x)
{
int a,b,c,d,e,fanxu;
if (x>=0)
{
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)
fanxu=e*10000+d*1000+c*100+b*10+a;
else if (b!=0)
fanxu=e*1000+d*100+c*10+b;
else if (c!=0)
fanxu=e*100+d*10+c;
else if (d!=0)
fanxu=e*10+d;
else if (e!=0)
fanxu=e;
else
fanxu=0;
return(fanxu);
}
else
{
x=-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)
fanxu=e*10000+d*1000+c*100+b*10+a;
else if (b!=0)
fanxu=e*1000+d*100+c*10+b;
else if (c!=0)
fanxu=e*100+d*10+c;
else if (d!=0)
fanxu=e*10+d;
else if (e!=0)
fanxu=e;
else
fanxu=0;
return(-fanxu);
}
}
| 44 |
21,558 | int main ()
{
int reverse(int a);
int a;
int i;
for(i=1;i<=6;i++)
{
scanf("%d",&a);
if(a==0)
printf("0\n");
if(a>0)
printf("%d\n",reverse(a));
if(a<0)
printf("-%d\n",reverse(-a));
}
return 0;
}
int reverse(int a)
{
int i;
int j,k;
int m=0;
int c[100];
c[0]=a;
int b[100];
for(i=0;;i++)
{
c[i+1]=c[i]/10;
b[i]=c[i]-10*c[i+1];
if(c[i+1]==0)
break;
}
for(k=0;k<=i;k++)
for(j=0;j<i-k;j++)
{
b[k]=b[k]*10;
}
for(j=0;j<=i;j++)
{
m=m+b[j];
}
return m;
} | 44 |
21,559 |
int kobe(int n)
{
int i=0,bj=1;
for (i=0;i<n;i++)
bj*=10;
return bj;
}
int reverse(int num)
{
int i=0,j=0,x=0,rev=0,a[100];
if (num==0)
return 0;
while (num !=0)
{
a[i] = num%10;
num /=10;
j++;
i++;
x++;
}
j-=1;
for (i=0; i<x; i++)
{
rev += a[i]* kobe (j);
j--;
}
return rev;
}
int main()
{
int n;
while (cin >> n)
cout << reverse(n) <<endl;
return 0;
}
| 44 |
21,560 | int reverse(int num)
{
int c[6];
int i,j,k;
int w=0;
for(i=1;i<=6;i++)
{
c[i]=0;
c[i]=num%10;
num=num-c[i];
if(num==0)
break;
num=num/10;
}
for(j=1;j<=i;j++)
{
for(k=1;k<=(i-j);k++)
c[j]=c[j]*10;
}
for(k=1;k<=i;k++)
w=w+c[k];
return(w);
}
int main()
{
int n,m,j;
for(j=1;j<=6;j++)
{
scanf("%d",&n);
m = reverse(n);
printf("%d\n",m);
}
getchar();
getchar();
return 0;
} | 44 |
21,561 | void main()
{
int rev(int a);
int length(int a);
int i,a[6],c[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
c[i]=rev(a[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",c[i]);
}
}
int rev(int a)
{
int i,l,m,b[15],c=0;
l=length(a);
m=pow(10,l-1);
for(i=0;i<l;i++)
{
b[i]=a/m;
a=a%m;
m=m/10;
if(m==0)
break;
}
for(i=0;i<l;i++)
{
c=c+b[i]*pow(10,i);
}
return(c/10);
}
int length(int a)
{
int i,b=1,c;
c=-1;
for(i=0;c!=0;i++)
{
c=a/b;
b=b*10;
}
return(i);
} | 44 |
21,562 | int f(signed n)
{
int c;
if(n==0||n==-0) c=0;
if((n>=1&&n<=9)||(n>=-9&&n<=-1)) c=abs(n);
if((n>=10&&n<=99)||(n>=-99&&n<=-10)) c=(abs(n)%10)*10+abs(n)/10;
if((n>=100&&n<=999)||(n>=-999&&n<=-100)) c=((abs(n)%100)%10)*100+((abs(n)%100)/10)*10+abs(n)/100;
if((n>=1000&&n<=9999)||(n>=-9999&&n<=-1000)) c=(((abs(n)%1000)%100)%10)*1000+(((abs(n)%1000)%100)/10)*100+((abs(n)%1000)/100)*10+abs(n)/1000;
if((n>=10000&&n<=99999)||(n>=-99999&&n<=-10000)) c=((((abs(n)%10000)%1000)%100)%10)*10000+((((abs(n)%10000)%1000)%100)/10)*1000+(((abs(n)%10000)%1000)/100)*100+((abs(n)%10000)/1000)*10+abs(n)/10000;
if(n<0) c=-c;
return(c);
}
void main()
{
signed int n;
int i;
for(i=0;i<6;i++)
{
scanf("%d",&n);
printf("%d\n",f(n));
}
} | 44 |
21,563 | int main()
{
int i,n;
int reverse(int num);
for (i=0;i<6;i++)
{
scanf("%d",&n);
printf("%d\n",reverse(n));
}
return 0;
}
int reverse(int num)
{
int ans=0;
do
{
ans = ans*10+num%10;
num = num / 10;
}
while (num!=0);
return ans;
}
| 44 |
21,564 | int reverse(int n)
{
int sw[10],sz[10];
int i,wei=10,result=0;
if(n>0){
for(i=0;i<10;i++){
sw[i]=(int)(pow(10,i));
}
sz[9]=n/sw[9];
for(i=8;i>=0;i--){
sz[i]=n%sw[i+1]/sw[i];
}
for(i=9;i>=0;i--){
if(sz[i]==0){
wei--;
}else{
break;
}
}
for(i=0;i<wei;i++){
result+=sz[i]*sw[wei-i-1];
}
}
else if(n==0){
result=0;
}
else if(n<0){
n=-n;
for(i=0;i<10;i++){
sw[i]=(int)(pow(10,i));
}
sz[9]=n/sw[9];
for(i=8;i>=0;i--){
sz[i]=n%sw[i+1]/sw[i];
}
for(i=9;i>=0;i--){
if(sz[i]==0){
wei--;
}else{
break;
}
}
for(i=0;i<wei;i++){
result+=sz[i]*sw[wei-i-1];
}
result=-result;
}
return result;
}
int main()
{
int num,i;
int reverse(int n);
for(i=0;i<6;i++){
scanf("%d",&num);
printf("%d\n",reverse(num));
}
return 0;
} | 44 |
21,565 | void reverse(char a[100])
{
int i,j,m,t,n;m=strlen(a);n=m/2;
if(a[0]==45)
{
for(i=1;i<n+1;i++)
{ t=a[i];a[i]=a[m-i];a[m-i]=t;
}printf("%c",a[0]);
for(i=1;i<m;i++)
{if(a[i]!='0')
{printf("%c",a[i]);break;}
else continue;
}
for(i=i+1;i<m;i++)
{
printf("%c",a[i]);
}
printf("\n");
}
else
{
for(i=0;i<n;i++)
{
t=a[i];a[i]=a[m-i-1];a[m-i-1]=t;
}
for(i=0;i<m;i++)
{if(a[i]!='0')
{printf("%c",a[i]);break;}
else continue;
}
for(i=i+1;i<m;i++)
{
printf("%c",a[i]);
}
printf("\n");
}
}
void main()
{
char a[100];
int i,j,k,t,m;
for(k=0;k<6;k++)
{
scanf("%s\n",a);
reverse(a);
}
} | 44 |
21,566 | void reverse( int num);
int main()
{
int num;
for(int i=0;i<6;i++)
{
cin>>num;
if(num==0||num==-0)
cout<<"0";
else
{
reverse(num);
}
}
return 0;
}
void reverse(int num)
{
int x;
if (num<0)
{
num=0-num;
cout<<'-';
}
if(num!=0)
{
if(num%10==0)
{
for(;num%10==0;)
num/=10;
for(;num!=0;num/=10)
{
x=num%10;
cout<<x;
}
cout<<endl;
}
else
{
for(;num!=0;num/=10)
{
x=num%10;
cout<<x;
}
cout<<endl;
}
}
} | 44 |
21,567 | int reverse(int num)
{
if(num>0)
{
int a[10],i,la,sum=0;
double temp;
for(i=0;i<=9;i++)
{
a[i]=-1;
}
for(i=0;i<=9;i++)
{
if(num>0)
{
a[i]=num%10;
num=(int)((num-a[i])/10);
}
}
for(i=0;i<=9;i++)
{
if(a[i]==-1)
{
la=i;
break;
}
}
for(i=0;i<=la;i++)
{
temp=pow(10.00,la-i-1);
temp=(int)temp;
sum=(int)(sum+a[i]*temp);
}
return sum;
}
if(num==0)
{
return 0;
}
if(num<0)
{
num=-num;
return -reverse(num);
}
}
int main()
{
int i,num;
for(i=1;i<=6;i++)
{
cin >> num;
cout << reverse(num) << endl;
}
return 0;
} | 44 |
21,568 | long reverse(long number);
void main()
{ long num1,num2,num3,num4,num5,num6;
scanf("%ld\n%ld\n%ld\n%ld\n%ld\n%ld", &num1, &num2, &num3, &num4, &num5, &num6);
printf("%ld\n%ld\n%ld\n%ld\n%ld\n%ld\n", reverse(num1),reverse(num2),reverse(num3),reverse(num4),reverse(num5),reverse(num6));
}
long reverse(long number)
{
long res = 0;
while(number){
res = res * 10 + number % 10;
number /= 10;
}
return res;
} | 44 |
21,569 | int reverse(int n)
{
int i,j,d[201],timer=0,neo=0,e=1;
if(n<0)
n*=-1;
do
{
timer++;
d[timer]=n%10;
n/=10;
} while(n>0);
for(i=1;i<=timer;i++)
{
for(j=1;j<=timer-i;j++)
{
e*=10;
}
neo+=d[i]*e;
e=1;
}
return neo;
}
int main()
{
int n,i;
for(i=1;i<7;i++)
{
scanf("%d",&n);
if(n<0)
printf("-");
printf("%d\n",reverse(n));
}
return 0;
} | 44 |
21,570 |
main()
{
int a,c,i,b[6];
for(i=0;i<6;i++)
{
scanf("%d",&a);
c=0;
while(a)
{
c=c*10+a%10;
a=a/10;
}
b[i]=c;
}
for(i=0;i<6;i++)
printf("%d\n",b[i]);
} | 44 |
21,571 |
int f(int n)
{
int x,y=0;
if(n>=0)
{
while(n!=0)
{
x=n%10;//?????
y=y*10+x;//??
n=n/10;
}
return y;
}
else
{
n=-n;
while(n!=0)
{
x=n%10;//?????
y=y*10+x;//??
n=n/10;
}
return -y;
}
}
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]));
getchar();
getchar();
} | 44 |
21,572 | void main()
{
int reverse(int num);
int a[6][1];
int i;
for(i=0;i<6;i++)
scanf("%d",&a[i][0]);
for(i=0;i<6;i++)
printf("%d\n",reverse(a[i][0]));
}
int reverse(int num)
{
int i,wei;
int z=0,b[100];
if(num<0)
{
num=-num;
wei=log10(num)+1;
for(i=0;i<wei;i++)
{
b[i]=num/(pow(10,(wei-i-1)));
num=num-b[i]*pow(10,(wei-i-1));
}
for(i=0;i<wei;i++)
z+=b[i]*pow(10,i);
z=-z;
}
else if(num>0)
{
wei=log10(num)+1;
for(i=0;i<wei;i++)
{
b[i]=num/(pow(10,(wei-i-1)));
num=num-b[i]*pow(10,(wei-i-1));
}
for(i=0;i<wei;i++)
z+=b[i]*pow(10,i);
}
else z=0;
return(z);
}
| 44 |
21,573 |
int reverse(int num);
void main()
{
int n,t;
for(t=0;t<6;t++){
scanf("%d",&n);
printf("%d\n",reverse(n));
}
}
int reverse(int num)
{
int a[10],i,j,output=0;
for(i=0;i<10;i++){
a[i]=(int)(num/pow(10,i))%10;
}
for(i=9,j=0;i>=0;i--){
if(a[i]==0){
j++;
}
else break;
}
for(i=0;i<10;i++){
output+=a[i]*pow(10,(9-j-i));
}
return output;
}
| 44 |
21,574 | int reverse(int num);
int main()
{
int a[6],i,k;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
k=reverse(a[i]);
printf("%d\n",k);
}
return 0;
}
int reverse(int num)
{
int b,c=0,i,j;
for(i=0;;i++)
{
b=num%10;
num=num/10;
c=10*c+b;
if(num==0)
break;
}
return c;
}
| 44 |
21,575 |
int reverse(int num);
int main(int argc, char* argv[])
{
int i,num,result;
for(i=0;i<6;i++){
scanf("%d",&num);
result=reverse(num);
printf("%d\n",result);
}
return 0;
}
int reverse(int num){
int b=0,i;
if(num>=0){
for(i=0;;i++){
b=num%10+10*b;
num=num/10;
if(num==0){
break;
}
}
}else{
num=abs(num);
for(i=0;;i++){
b=num%10+10*b;
num=num/10;
if(num==0){
break;
}
}
b=-b;
}
return b;
}
| 44 |
21,576 | void main ()
{
int i;
double c[6];
void reverse (double c[]);
for (i=0;i<6;i++)
{
scanf ("%lf",&c[i]);
}
reverse (c);
}
void reverse (double c[])
{
int i,k,m,b[6],a[6];
for (i=0;i<6;i++)
{
m=(int)log10(fabs(c[i]))+1;
a[i]=(int)c[i];
b[i]=0;
for (k=0;k<m;k++)
{
b[i]=10*b[i]+(a[i]%10);
a[i]=a[i]/10;
}
printf("%d\n",b[i]);
}
} | 44 |
21,577 | void reverse(int x)
{
int i,b[100],p,r,y;
scanf("%d",&x);
i=0;
if(x==0||x==(-0))
printf("0");
if(x<0)
p=0;
else
p=1;
y=abs(x);
while(y%10==0)
{
y=y/10;
}
b[i]=y%10;
while(y/10!=0)
{
y=y/10;
b[i+1]=y%10;
i++;
}
if(p==0)
printf("-");
for(r=0;r<=i;r++)
{
printf("%d",b[r]);
}
printf("\n");
}
int main()
{
int a[6],i;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<6;i++)
{
reverse(a[i]);
}
getchar();
getchar();
}
| 44 |
21,578 | int main()
{
void nixu(int num,int sign);
int i,num,sign=0;
for(i=0;i<6;i++)
{
cin>>num;
nixu (num,sign);
cout<<endl;
}
return 0;
}
void nixu(int num,int sign)
{
int sum[10000],i=0,temp,j;
if(num==0)
cout<<0;
else
{
if(num<0)
{
num=0-num;
cout<<'-';
}
if(num%10!=0)
sign=1;
if(sign!=0)
cout<<num%10;
if(num/10!=0)
{
nixu (num/10,sign);
}
}
} | 44 |
21,579 | void main()
{
int i,a[6];
int reverse(int num);
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 i,x[5],y=0,a,j;
for(i=0;i<5;i++)
{
x[i]=num%10;
num=(num-x[i])/10;
}
for(i=4;i>=0;i--)
{
if(x[i]!=0)
{
a=i;
break;
}
}
for(i=a;i>=0;i--)
{
for(j=0;j<=i;j++)
{
x[a-i]=x[a-i]*10;
}
y=y+x[a-i];
}
y=y/10;
if(num<0) y=-y;
else y=y;
return(y);
}
| 44 |
21,580 | void main()
{
int c,k,d,i,sum,e,j;
int m;
m=6;
int b[10]={0};
for(j=0;j<=m-1;j++)
{
scanf("%d",&c);
if(c<0) printf("-");
d=fabs(c);
k=log10(d);
for(i=k;i>=0;i--)
{
b[i]=d/pow(10,i);
d=d-b[i]*pow(10,i);
}
for(i=0;i<=k;i++)
{
if(b[i]!=0)
{
e=i;
break;
}
}
sum=b[k];
for(i=k-1;i>=e;i--)
sum=sum+b[i]*pow(10,k-i);
printf("%d\n",sum);
}
}
| 44 |
21,581 | int reverse(int n)
{
int i,j,k=0;
int a[1000];
for(i=0;;i++)
{
a[i]=n%10;
n=n/10;
if(n==0) break;
}
j=i;
for(i=0;i<=j;i++)
{
k=k*10+a[i];
}
return k;
}
main()
{
int i,n,k;
for(i=0;i<6;i++)
{
scanf("%d",&n);
k=reverse(n);
printf("%d\n",k);
}
}
| 44 |
21,582 |
void fan(char a[]);
int b[6]={0};
int i,j=0;
void main()
{
char s[100];
while(j<6)
{
fan(s);
j++;
}
for(i=0;i<6;i++)
{
printf("%d",b[i]);
printf("\n");
}
}
void fan(char a[])
{
int n,i;
scanf("%s",a);
n=strlen(a);
for(i=0;i<n;i++)
if(a[0]!='-') for(i=0;i<n;i++) b[j]=b[j]*10+a[n-i-1]-48;
else for(i=1;i<n;i++) b[j]=b[j]*10-(a[n-i]-48);
} | 44 |
21,583 | // ?????.cpp : Defines the entry point for the console application.
//
void reverse(int x,int k);
int main(int argc, char* argv[])
{
int i,n;
for(i=0;i<6;i++){
scanf("%d",&n);
if(n<0)printf("-");
reverse(n,0);
}
return 0;
}
void reverse(int x,int k){
if(x<0)x=-x;
if(x%10!=0)k++;
if(x/10==0){
printf("%d\n",x);
}else{
if(k!=0)printf("%d",x%10);
reverse(x/10,k);
}
}
| 44 |
21,584 | int op(int x)
{
int y=0;
int a[10],i,j;
for(i=0;x!=0;i++)
{
a[i]=x%10;
x=x/10;
}
for(j=0;j<i;j++)
{
y=y+a[j];
if(j!=i-1)y=y*10;
}
return y;
}
main()
{
int k,n;
for(k=0;k<6;k++)
{
scanf("%d",&n);
if(n<0)
{
n=0-n;
printf("-%d",op(n));
}
else if(n==0)printf("0");
else printf("%d",op(n));
printf("\n");
}
}
| 44 |
21,585 | int reverse(int num){
int nnum;
int abs;
if(num<0){
abs=-num;
}else{
abs=num;
}
int weishu[20],i=1;
while(abs!=0){
weishu[i]=abs%10;
abs=abs/10;
i++;
}
int nabs=0;
int j;
for(j=1;j<i;j++){
nabs=nabs*10+weishu[j];
}
if(num<0){
nnum=-nabs;
}else{
nnum=nabs;
}
return nnum;
}
int main()
{
int sz[6],xsz[6];
int k;
for(k=0;k<6;k++){
scanf("%d",&sz[k]);
xsz[k]=reverse(sz[k]);
}
for(k=0;k<6;k++){
printf("%d\n",xsz[k]);
}
return 0;
}
| 44 |
21,586 | void main()
{
int reverse(int num);
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]));
}
int reverse(int num)
{
int n;
if(-10<num&&10>num)
n=num;
else if(-100<num&&100>num)
n=(num-(num/10)*10)*10+num/10;
else if(-1000<num&&1000>num)
n=(num-(num/10)*10)*100+(num/10-(num/100)*10)*10+num/100;
else if(-10000<num&&10000>num)
n=(num-(num/10)*10)*1000+(num/10-(num/100)*10)*100+(num/100-(num/1000)*10)*10+num/1000;
else if(-100000<num&&100000>num)
n=((long)num-((long)num/10)*10)*10000+(num/10-(num/100)*10)*1000+(num/100-(num/1000)*10)*100+(num/1000-(num/10000)*10)*10+num/10000;
return (n);
} | 44 |
21,587 |
void input();
void reverse();
void output();
int i,j,k, in[7] = {0}, out[7] = {0};
int main ()
{
input();
reverse();
output();
return 0;
}
void input()
{
for (i = 1; i <=6; i++)
cin >> in[i];
}
void reverse()
{
int negative = 0;
for (i = 1; i <=6; i++)
{
negative = 0;
if (in[i] == 0)
continue;
if (in[i] < 0 )
{
negative = 1;
in[i] = -in[i];
}
while (in[i] != 0)
{
out[i] = out[i]*10+in[i]%10;
in[i] /= 10;
}
if (negative == 1)
out[i] = -out[i];
}
}
void output()
{
for (i = 1; i <= 6; i++)
cout << out[i] << endl;
}
| 44 |
21,588 | void main()
{
int a,b,c,d,e,f;
int reverse(int a);
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",a);
printf("%d\n",b);
printf("%d\n",c);
printf("%d\n",d);
printf("%d\n",e);
printf("%d\n",f);
}
int reverse(int a)
{
int b[10];
int i=0,j;
if(a>0)
{
while(a>0)
{
b[i]=a%10;
a=(a-b[i])/10;
i=i+1;
}
for(j=0;j<i;j++)
{
a=a*10+b[j];
}
}
else if(a==0)a=0;
else if(a<0)
{
a=-a;
while(a>0)
{
b[i]=a%10;
a=(a-b[i])/10;
i=i+1;
}
for(j=0;j<i;j++)
{
a=a*10+b[j];
}
a=-a;
}
return (a);
} | 44 |
21,589 |
int reverse(int num);
int main()
{
int i;
int temp;
for (i=0; i<6; i++){
scanf("%d", &temp);
printf("%d\n", reverse(temp));
}
return 0;
}
int reverse(int num)
{
int len;
int sign;
int out = 0; // Modified Unsigned
int i;
if (num==0) return 0;
sign = num / abs(num);
num = abs(num);
len = (int)log10(num) + 1;
for (i=0; i<len; i++)
out += (num/(int)(pow(10, i))%10)*pow(10,len-i-1);
return sign*out;
} | 44 |
21,590 |
int reverse(int num)
{
if(num==0||num==-0)
return 0;
int x=abs(num);
int i=0, sum=0, sz[100];
for(;x!=0;x/=10)
{
sz[i++] = x%10;
}
x=i;
for(i=0;i<x;i++)
{
sum+=sz[i]*pow(10,(x-i-1));
}
if(num<0)
sum=-sum;
return sum;
}
int main()
{
int num, i;
for(i=0;i<6;i++)
{
scanf("%d", &num);
printf("%d\n", reverse(num));
}
return 0;
} | 44 |
21,591 | int reverse(int num)
{
int ge=0,shi=0,bai=0,qian=0,wan=0,out;
int sign=1;
if(num<0) sign=-1;
if(num==0)
{
out=0;
goto end;
}
num=abs(num);
wan=(int)num/10000;
qian=(int)(num-10000*wan)/1000;
bai=(int)(num-1000*qian-10000*wan)/100;
shi=(int)(num-1000*qian-100*bai-10000*wan)/10;
ge=num-10000*wan-1000*qian-100*bai-10*shi;
if(num<=9) out=num*sign;
if(num<=99&&num>=10) out=(10*ge+shi)*sign;
if(num>99&&num<=999) out=(100*ge+10*shi+bai)*sign;
if(num>999&&num<=9999) out=(1000*ge+100*shi+10*bai+qian)*sign;
if(num>9999) out=(ge*10000+shi*1000+bai*100+qian*10+wan)*sign;
end:return(out);
}
void main()
{
int i,a[6];
for(i=0;i<=5;i++)
scanf("%d",&a[i]);
for(i=0;i<=5;i++)
a[i]=reverse(a[i]);
for(i=0;i<=5;i++)
printf("%d\n",a[i]);
} | 44 |
21,592 | int reverse(int a)
{
int n,b[10],c[10],i,ra,sum=0;
if(a>0)
{
n=log10(a)+1;
for(i=0;i<n;i++)
{
b[i]=a/(int)pow(10,n-i-1);
c[i]=a%(int)pow(10,n-i-1);
a=c[i];
}
for(i=0;i<n;i++)
{
ra=b[i]*pow(10,i);
sum=sum+ra;
}
return(sum);
}
if(a<0)
{
a=-a;
n=log10(a)+1;
for(i=0;i<n;i++)
{
b[i]=a/(int)pow(10,n-i-1);
c[i]=a%(int)pow(10,n-i-1);
a=c[i];
}
for(i=0;i<n;i++)
{
ra=b[i]*pow(10,i);
sum=sum+ra;
}
return(-sum);
}
if(a==0)
{
return(0);
}
}
void 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]));
} | 44 |
21,593 | void main()
{
int copy(int m);
int a[6],b,i;
for(i=0;i<6;i++)
{ scanf("%d",&a[i]);
b=copy(a[i]);
printf("%d\n",b);
}
}
int copy(int m)
{
int a,b,c;
a=m;
b=a%10;
do
{
a=a/10;
c=a%10;
b=b*10+c;
}
while(a/10!=0);
return b;
}
| 44 |
21,594 | int reverse(int num)
{
if(num==0)
return 0;
else if(num>0)
{
if(num<10)
return num;
else if(num<100)
{
int p1=num%10;
int p2=num/10;
return (10*p1+p2);
}
else if(num<1000)
{
int p3=num/100;
int p2=(num-p3*100)/10;
int p1=num%10;
return (100*p1+10*p2+p3);
}
else if(num<10000)
{
int p4=num/1000;
int p3=(num-p4*1000)/100;
int p2=(num-p4*1000-p3*100)/10;
int p1=num%10;
return (1000*p1+100*p2+10*p3+p4);
}
else
{
int p5=num/10000;
int p4=(num-p5*10000)/1000;
int p3=(num-p5*10000-p4*1000)/100;
int p2=(num-p5*10000-p4*1000-p3*100)/10;
int p1=num%10;
return (10000*p1+1000*p2+100*p3+10*p4+p5);
}
}
else
{
return (0-reverse(0-num));
}
}
int main()
{
int n;
for(int i=0;i<6;i++)
{
cin>>n;
cout<<reverse(n)<<endl;
}
return 0;
} | 44 |
21,595 | int reverse(int num)
{
int m=0,i,j,k,n,p,x=0;
if (num<0) {num=-num;x=1;}
n=num;
for (j=0;n>=1;j++)
n=n/10;
for (i=0;i<j;i++)
{
n=1;
p=num%10;
num=(num-p)/10;
m=10*m+p;
}
return (x==1)?-m:m;
}
int main()
{
int i,n,j;
for (i=0;i<6;i++)
{
scanf("%d",&n);
printf("%d\n",reverse(n));
}
}
| 44 |
21,596 | int reverse(int n){
int i,num[1000],k=0,a=0,sign=0;
if(n<0){
n=n*(-1);
sign=1;
}
for(;n>0;){
num[k++]=n%10;
n=n/10;
}
//for(i=0;i<k;i++) printf("%d ",num[i]);
for(i=0;i<k;i++){
a+=num[i]*pow(10,k-i-1);
}
if(sign==1) a=a*(-1);
return a;
}
int main(){
int i,n,result;
for(i=0;i<6;i++){
scanf("%d",&n);
result=reverse(n);
printf("%d\n",result);
}
scanf("%d",&i);
return 0;
}
| 44 |
21,597 | int main()
{
char a[6][10]={0};
int i,j,k;
for(i=0;i<6;i++)
{
scanf("%s",a[i]);
}
for(j=0;j<6;j++)
{
if(strcmp(a[j],"0")==0||strcmp(a[j],"-0")==0)
{
printf("0\n");
}
else
{
if(a[j][0]=='-')
{
printf("-");
for(i=9;i>0;i--)
{
if(a[j][i]!='0'&&a[j][i]!='\0')
{
printf("%c",a[j][i]);
break;
}
}
for(k=i-1;k>0;k--)
{
printf("%c",a[j][k]);
}
printf("\n");
}
else
{
for(i=9;i>=0;i--)
{
if(a[j][i]!='0'&&a[j][i]!='\0')
{
printf("%c",a[j][i]);
break;
}
}
for(k=i-1;k>=0;k--)
{
printf("%c",a[j][k]);
}
printf("\n");
}
}
}
return 0;
} | 44 |
21,598 | int RevNum(int n)
{ int s=0;
if(n>=0)
{
while(n/10!=0)
{
s=n%10;
n=n/10;
printf("%d",s);
}
printf("%d\n",n);
}
else
{
n=abs(n);
printf("-");
while(n/10!=0)
{
s=n%10;
n=n/10;
printf("%d",s);
}
printf("%d\n",n);
}
}
main()
{ int i=0;
int k;
while(i<6)
{
scanf("%d",&k);
while(k%10==0)
{
k=k/10;
}
RevNum(k);
i++;
}
}
| 44 |
21,599 | void main()
{
void re(int n);
int n,i;
for( i=0;i<6;i++)
{
scanf("%d",&n);
re(n);
}
}
void re(int n)
{
int c[10]={0};
int h=1,sum=0,i,j;
if(n<0){printf("-");n=-n;}
for (i=0;n!=0;i++)
{
c[i]=n%10;
n/=10;
}
for(j=0;j<i;j++)
{
sum+=(c[i-j-1]*h);
h*=10;
}
printf("%d\n",sum);
}
| 44 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.