label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
44 | 21900 | 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 | 21901 | 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 | 21902 | int reverse(int num);
int m;
int main ()
{
int num;
int i=0;
while(cin>>num)
{
reverse(num);
cout<<m<<endl;
}
return 0;
}
int reverse(int num)
{
int n=0,i;
if(num==0||num==-0)
{
m=0;
return m;
}
else if(num<0)
{
i=abs(num);
while(i!=0)
{
n=n*10+i%10;
i=i/10;
}
m=-n;
return m;
}
else if(num>0)
{
i=num;
while(i!=0)
{
n=n*10+i%10;
i=i/10;
}
m=n;
return m;
}
}
|
44 | 21903 | int reverse (int num){
int result,a,b,c,d,e;
if(num==0){
result=0;
}
else if(num>9999){
a=num/10000;
b=(num-10000*a)/1000;
c=(num-10000*a-1000*b)/100;
d=(num-10000*a-1000*b-100*c)/10;
e=num-10000*a-1000*b-100*c-10*d;
result=10000*e+1000*d+100*c+10*b+a;
}
else if(num>999){
a=num/1000;
b=(num-1000*a)/100;
c=(num-1000*a-100*b)/10;
d=num-1000*a-100*b-10*c;
result=1000*d+100*c+10*b+a;
}
else if(num>99){
a=num/100;
b=(num-100*a)/10;
c=num-100*a-10*b;
result=100*c+10*b+a;
}
else if(num<=99&&num>9){
b=num/10;
c=num-10*b;
result=10*c+b;
}
else if(num<=9){
result=num;
}
if(num<0){
result=-reverse(-num);
}
return result;
}
int main(){
int n,i,r;
for(i=0;i<6;i++){
scanf("%d",&n);
r=reverse(n);
printf("%d\n",r);
}
return 0;
}
|
44 | 21904 | 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 | 21905 | 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 | 21906 | void fuction(int num)
{
cout<<num%10;
if((num/10)!=0)
fuction(num/10);
}
int main()
{
int a,i;
while(cin>>a)
{
for(i=i;;i++)
{
if(a%10==0)
a=a/10;
else
break;
}
if(a>0)
{fuction(a); cout<<endl;}
if(a==0)
{cout<<"0"<<endl;}
if(a<0)
{
a=-a;
cout<<"-";
fuction(a);
cout<<endl;
}}
return 0;
}
|
44 | 21907 | 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 | 21908 | int reverse(int num){
int num1;
int a;
num1=abs(num);
int num2=0;
while(num1>=10){
a=num1%10;
num1=num1/10;
num2=num2*10+a;
}
a=num1%10;
num2=num2*10+a;
if(num==0){
return 0;
}else if(num>0){
return num2;
}else if(num<0){
return 0-num2;
}
}
int main()
{
int a;
int k;
for(k=1;k<=6;k++){
scanf("%d",&a);
a=reverse(a);
printf("%d\n",a);
}
return 0;
} |
44 | 21909 | void f(char s[10])
{
int i,j,a;
a=strlen(s);
if(s[0]=='0'||(s[0]=='-'&&s[1]=='0')){printf("0\n");}
else if(s[0]=='-')
{
printf("-");
for(i=a-1;i>=1;i--)
{
if(s[i]!='0'){break;}
}
for(j=i;j>=1;j--)
{
printf("%c",s[j]);
}
printf("\n");
}
else
{
for(i=a-1;i>=0;i--)
{
if(s[i]!='0'){break;}
}
for(j=i;j>=0;j--)
{
printf("%c",s[j]);
}
printf("\n");
}
}
void f(char s[]);
int main()
{
int i;
char s[10];
for(i=1;i<=6;i++)
{
gets(s);
f(s);
}
return 0;
} |
44 | 21910 | int reverse(int num)
{
int a[100];
int i, count=0;
for(i=0; ;i++)
{
a[i]=num%10;
num=num/10;
count=count+1;
if(num==0) break;
}
int rev=0;
for(i=0; i<count; i++)
{
rev=rev*10+a[i];
}
return rev;
}
int main()
{
int num;
int rev;
int a[6];
int i;
for(i=0; i<6; i++)
{
scanf("%d", &a[i]);
}
for(i=0; i<6; i++)
{
if(a[i]<0)
{
a[i]=-a[i];
rev=reverse(a[i]);
printf("%d\n", -rev);
}
else
{
rev=reverse(a[i]);
printf("%d\n", rev);
}
}
return 0;
} |
44 | 21911 | int main()
{
void f(int x);
int n,i;
for(i=0;i<6;i++)
{
cin>>n;
if(n>0)//?n?????
{
while(n%10==0)
n=n/10;
f(n);
cout<<endl;
}
if(n<0)
{
n=-n;
while(n%10==0)
n=n/10;
cout<<'-';
f(n);
cout<<endl;
}
if(n==0)
cout<<'0'<<endl;
}
return 0;
}
void f(int x)//??????
{
cout<<x%10;
if((x/10)>0)
{
x=x/10;
f(x);
}
} |
44 | 21912 | int shorten(int a)
{
while(a%10==0)
a/=10;
return a;
}
void reverse(int a)
{
cout<<a%10;
a/=10;
if(a!=0)
reverse(a);
}
int main()
{
int a;
for(int i=1;i<=6;i++)
{
int b=0;
cin>>a;
if(a<0)
cout<<"-";
a=abs(a);
if(a>0)
a=shorten(a);
reverse(a);
cout<<endl;
}
return 0;
} |
44 | 21913 | 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 | 21914 | int reverse(int num){
int i,j,k,sum=0,s,p;
int u[100];
if(num>=0){
p=num;
for(i=0;p>0;i++){
u[i]=p%10;
p=p/10;
}
s=i;
for(i=s-1;i>=0;i--){
sum=sum*10+u[s-1-i];
}
return sum;}
if(num<0){
p=-num;
for(i=0;p>0;i++){
u[i]=p%10;
p=p/10;
}
s=i;
for(i=s-1;i>=0;i--){
sum=sum*10+u[s-1-i];
}
return -sum;}
}
int main(){
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",reverse(a),reverse(b),reverse(c),reverse(d),reverse(e),reverse(f));
return 0;
} |
44 | 21915 | int reverse(int num){
int k=0;
if(num>=0){
while(num>0){
k=k*10+num%10;
num=num/10;
}
k=k+num;
}
else
{
num=0-num;
while(num>0){
k=k*10+num%10;
num=num/10;
}
k=0-k+num;
}
return k;
}
main(){
int i,n;
i=0;
for(i=0;i<6;i++){
scanf("%d",&n);
printf("%d\n",reverse(n));
}
}
|
44 | 21916 |
int reverse(int num);
void main()
{
int a[6];
int i;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++){
a[i]=reverse(a[i]);
printf("%d\n",a[i]);
}
}
int reverse(int num)
{
int n,i,m=0;
if(num<0) return -1*reverse(-num);
n=log10(num);
for(i=0;i<n+1;i++)
{
int j,temp=1;
int tempt=1;
for(j=0;j<i;j++)temp*=10;
for(j=0;j<n-i;j++)tempt*=10;
m+=((num%(temp*10))/temp)*tempt;
}
return m;
}
|
44 | 21917 | 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 | 21918 | 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 | 21919 | int main ()
{
int a[6],i,b[6];
int reverse(int num);
for (i=0;i<6;i++)
{
scanf("%d",&a[i]);
b[i]=reverse(a[i]); //????a[i],???????b[i]//
}
for(i=0;i<6;i++)
printf("%d\n",b[i]);
return 0;
}
reverse(int num)
{
int x=0,i,weishu;
int a[15]={0};
if(num>=0) //?????//
{
for (i=0;;i++)
{
if((num/(pow(10,x)))<1) //????????????//
{
weishu=i-1;
break;
}
a[i]=((int)(num/(pow(10,x))))%10; //????????//
x=x+1;
}
x=0;
num=0;
for(i=weishu;i>=0;i--) //??//
{
num=num+a[i]*(pow(10,x)); //?????//
x=x+1;
}
}
if(num<0) //????//
{
num=-num; //????//
for (i=0;;i++)
{
if((num/(pow(10,x)))<1)
{
weishu=i-1;
break;
}
a[i]=((int)(num/(pow(10,x))))%10;
x=x+1;
}
x=0;
num=0;
for(i=weishu;i>=0;i--)
{
num=num+a[i]*(pow(10,x));
x=x+1;
}
num=-num; //??????????//
}
return (num);
}
|
44 | 21920 |
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 | 21921 | 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 | 21922 | int main()
{
int reverse(int num);
int i,n,p;
for (i=0;i<6;i++)
{
scanf("%d",&n);
p=reverse(n);
printf("%d\n",p);
}
getchar();
getchar();
}
int reverse(int num)
{
int d,r=0;//?????????
while (num!=0)
{
d=num%10;
r=r*10+d;
num=num/10;
}
return(r);//return?????????????????????
}
|
44 | 21923 | 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 | 21924 | 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 | 21925 | int reverse( num );
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]) );
}
int reverse( int num )
{
int i, a[6] , m , n , b[6] , c[6] , s=0 ;
if ( num > 0 )
{
n=log10(num)+1; /* ??????? */
a[1]=num;
for ( i=1 ; i<=n ; i++ )
{
m=pow(10,n-i);
b[i]=a[i]/m;
a[i+1]=a[i]%m; /* ?????? */
}
for ( i=1 ; i<=n ; i++ )
{ c[i]=b[i]*pow(10,i-1);
s += c[i] ; /* ?????? */
}
return s;
}
if ( num < 0 )
{
num = (-1)*num;
n=log10(num)+1; /* ??????? */
a[1]=num;
for ( i=1 ; i<=n ; i++ )
{
m=pow(10,n-i);
b[i]=a[i]/m;
a[i+1]=a[i]%m; /* ?????? */
}
for ( i=1 ; i<=n ; i++ )
{ c[i]=b[i]*pow(10,i-1);
s += c[i] ; /* ?????????? */
}
return -s;
}
if ( num == 0 || num== -0 )
return 0;
} |
44 | 21926 | void main()
{
int b[6],t[6],i;
int h(int a);
for(i=0;i<6;i++)
{
scanf("%d",&b[i]);
t[i]=h(b[i]);
}
for(i=0;i<6;i++)
printf("%d\n",t[i]);
}
int h(int a)
{
int c,x,y,z,i,j;
x=a/10000;
y=(a-x*10000)/1000;
z=(a-x*10000-y*1000)/100;
i=(a-x*10000-y*1000-z*100)/10;
j=a-x*10000-y*1000-z*100-i*10;
if(a>=10000||a<=-10000)
{
c=x+y*10+z*100+i*1000+j*10000;
}
if((a>=1000&&a<10000)||(a<=-1000&&a>-10000))
{
c=y+z*10+i*100+j*1000;
}
if((a>=100&&a<1000)||(a<=-100&&a>-1000))
{
c=z+i*10+j*100;
}
if((a>=10&&a<100)||(a<=-10&&a>-100))
{
c=i+j*10;
}
if(a<10&&a>-10)
{
c=a;
}
return(c);
}
|
44 | 21927 | 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 | 21928 | //?????????????????????
//20101126 liuyi
int main()
{
int reverse(int num); //?????????
int i,a[7];
for(i=1;i<7;i++)
cin>>a[i];
for(i=1;i<7;i++)
reverse(a[i]);
return 0;
}
int reverse(int num)
{
int b[20],j=0;
if(num==0)
cout<<0<<endl;
else if(num>0)
{
for(j=1;j<20;j++)
{
b[j]=num%10; //???????????????????
num=num/10;
if(num==0)
break;
}
int i=1;
while(b[i]==0)
i++; //???????0 ????
for(int k=i;k<=j;k++)
cout<<b[k];
cout<<endl;
}
else //?????
{
cout<<"-"; //?????
reverse(-num); //??????????????
}
return 0;
}
|
44 | 21929 | 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 | 21930 | int a=0;
int main()
{
for (int i=1;i<=6;i++)
{cin>>a;
if (a==0)cout<<0;
else
{
if (a<0){cout<<'-';a=-a;}
int k=0;
k=a%10;
while (k==0){a=a/10;k=a%10;}
while (a!=0){cout<<k;a=a/10;k=a%10;}
}
cout<<endl;
}
return 0;
}
|
44 | 21931 | int reverse(int num)
{
int j,m,s,r;
if(num>0)
s=num;
else
s=0-num;
r=0;
for(j=1;s>0;j++)
{
m=s%10;
r=r*10+m;
s=s/10;
}
if(num<0)
r=0-r;
return(r);
}
int main()
{
int i;
int a[7];
int c[7];
for(i=1;i<=6;i++)
scanf("%d",&a[i]);
for(i=1;i<=6;i++)
if(a[i]==0)
printf("0\n");
else
{
c[i]=reverse(a[i]);
printf("%d\n",c[i]);
}
} |
44 | 21932 | 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 | 21933 | int reverse(int num)
{
int k;
k=0;
while (num!=0)
{
k=k*10+num%10;
num=num/10;
}
return k;
}
int main()
{
int n,b,i;
for (i=1;i<=6;i++)
{
scanf("%d",&n);
if (n<0)
{
b=0-reverse(0-n);
printf("%d\n",b);
}
else if (n==0)
printf("0\n");
else printf("%d\n",reverse(n));
}
getchar();
getchar();
}
|
44 | 21934 | void revers(int x);
int main()
{
int a,i;
for(i=0;i<6;i++)
{
scanf("%d",&a);
if(a<0)
{a=-a;
printf("-");}
revers(a);
}
return 0;
}
void revers(int x)
{
int start(int p);
x=start(x);
while(x!=0)
{
printf("%d",x%10);
x=x/10;
}
printf("\n");
}
int start(int p)
{
while(p%10==0)
{
p=p/10;
}
return p;
}
|
44 | 21935 | // ??10.3.cpp : ??????????????
//
int reverse(int num)
{
int x=num/10,i=0,total=0;
while(x!=0)
{
i++;
x=x/10;
}
total=i;
for(i=total;i>=0;i--)
{
x=x+(num%10);
num=num/10;
if(num==0)
{
break;
}
x=x*10;
}
return x;
}
int main()
{
int j=0,a=0,z=0;
for(j=0;j<6;j++)
{
scanf("%d",&a);
z=reverse(a);
printf("%d\n",z);
}
return 0;
}
|
44 | 21936 | int reverse(int num);
int main( )
{
int num[6],i;
for(i=0;i<6;i++){
cin >>num[i];
}
for(i=0;i<6;i++){
if(num[i]>=0) cout <<reverse(num[i]) <<endl;
else cout <<-reverse(-num[i]) <<endl;
}
return 0;
}
int reverse(int num)
{
int i,n,a[20];
for(i=1;;i++){
if((num/(int)pow(10.0,i))==0){
n=i;
break;
}
}
for(i=1;i<=n;i++){
a[i]=num/(int)pow(10.0,n-i);
num=num-a[i]*(int)pow(10.0,n-i);
}
num=0;
for(i=1;i<=n;i++){
num=num+a[i]*(int)pow(10.0,i-1);
}
return num;
} |
44 | 21937 | int reverse(int x)
{
int a[100]={0};
int i=0;
int change=0;
int temp=0;
if (x==0) change=0;
if (x>0)
{
temp=x;
for (i=0;temp>0;i++)
{
a[i]=temp%10;
temp=temp/10;
}
int j=0;
for (j=0;;j++)
{
change=change+ a[j]*pow(10.0,i-1);
i=i-1;
if (i<0) break;
}
}
if (x<0)
{
temp=-x;
for (;temp>0;i++)
{
a[i]=temp%10;
temp=temp/10;
}
int j=0;
for (j=0;;j++)
{
change=change+ a[j]*pow(10.0,i-1);
i=i-1;
if (i<0) break;
}
change=-change;
}
return (change);
}
int main()
{
int b[6]={0};
int j=0;
for (j=0;j<6;j++)
{
cin >>b[j];
cout <<reverse(b[j])<<endl;
}
return 0;
}
|
44 | 21938 | void reverse(char n[])
{
int l,i,counter;
char b[100]={0};
l=strlen(n);
if((n[0]=='-')&&(n[1]!='0'))
{
for(i=0;i<l-1;i++)
b[i]=n[l-i-1];
printf("-");
for(i=0,counter=0;b[i]=='0';i++)
if(b[i]=='0')
counter++;
for(i=counter;i<l-1;i++)
printf("%c",b[i]);
printf("\n");
}
else if((n[0]=='-')&&(n[1]=='0'))
printf("0\n");
else
{
for(i=0;i<l;i++)
b[i]=n[l-i-1];
for(i=0,counter=0;b[i]=='0';i++)
if(b[i]=='0')
counter++;
for(i=counter;i<l;i++)
printf("%c",b[i]);
printf("\n");
}
getchar();
}
int main()
{
int i;
for(i=1;i<=6;i++)
{
char a[100]={0};
scanf("%s",a);
reverse(a);
}
}
|
44 | 21939 | int reverse(int num)
{
int t=0;
for(;num!=0;num=num/10)
t=t*10+num%10;
return(t);
}
void main()
{int i,a[6];
for(i=0;i<6;i++)
{scanf("%d\n",&a[i]);
printf("%d\n",reverse(a[i]));}
} |
44 | 21940 | int reverse(int num)
{
int n,i,b=0,a,c=0;
if(num==0) return 0;
else if(num<0)
{
for(i=1;num/i!=0;i=i*10)
{
a=num%(10*i)/i;
if (a==0&&c==0) continue;
b=b*10+a;
c++;
}
return b;
}
else
{
for(i=1;num/i!=0;i=i*10)
{
a=num%(10*i)/i;
if (a==0&&c==0) continue;
b=b*10+a;
c++;
}
return b;
}
}
int main()
{
int i,num,res;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
res=reverse(num);
printf("%d\n",res);
}
return 0;
}
|
44 | 21941 | int invert(int x)
{
int y=0;
for(x;x!=0;x/=10)
y=x%10+y*10;
return y;
}
main()
{
int i,a[6],b[6];
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
b[i]=invert(a[i]);
for(i=0;i<6;i++)
printf("%d\n",b[i]);
}
|
44 | 21942 |
int get(char c)
{
if (c>='A'&&c<='Z') return c-'A'+10;
else return c-'0';
}
void main()
{
char s1[1000],s[1000],c='0';
int i;
while (c!=EOF)
{
c=getchar();
if (c==EOF) return;
gets(s1);
for (i=0;i<strlen(s1);i++)
s[i]=s1[strlen(s1)-1-i];
int l=0,r=strlen(s1);
s[r]=c;
if (s[strlen(s1)]=='-')
{
r--;
printf("-");
}
while (s[l]=='0'&&r-l>0)
{
l++;
}
for (i=l;i<=r;i++)
printf("%c",s[i]);
printf("\n");
}
} |
44 | 21943 | int reverse(int n)
{
int c,a,b=0;
c=n;
if(n>=0)
{
while(c>0)
{
a=c%10;
c=c/10;
b=10*b+a;
}
}
if(n==0)
b=0;
if(n<0)
{
b=-reverse(-n);
}
return(b);
}
int main()
{
int i,c;
for(i=1;i<=6;i++)
{
scanf("%d",&c);
printf("%d\n",reverse(c));
}
return 0;
} |
44 | 21944 | 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 | 21945 | int fan(int a)
{int i,j;
int k;
int b=0;
int c[10];
if(a<0)
{k=1;
a=-a;}
else if(a==0)
{return 0;}
else
{k=0;}
for(i=0;i<10;i++)
c[i]='\0';
for(i=0;i<10;i++)
{c[i]=a%10;
a=a/10;
if(a==0)
break;
}
for(j=0;j<=i;j++)
{b=b*10;
b=b+c[j];
}
if(k==0)
return b;
else
return -b;
}
int main()
{int i,j;
int a,b;
for(i=0;i<6;i++)
{cin>>a;
b=fan(a);
cout<<b<<endl;}
return 0;
} |
44 | 21946 |
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 | 21947 | 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 | 21948 | 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 | 21949 | void haha(int x)
{
int a[100],n,i,c;
n=x;i=0;c=0;
if(x==0) printf("0\n");
else if(x>0&&n!=2900)
{while(n!=0)
{i=i+1;a[i]=n%10;n=n/10;if(a[i]==0&&c==0); else printf("%d",a[i]);if(n==0) printf("\n");c=c+1;}}
else if(n==2900) printf("92\n");
else if(x<0&&n!=-1000&&n!=-20100)
{printf("-");while(n!=0)
{i=i+1;a[i]=-n%10;n=n/10;if(a[i]==0&&c==0); else printf("%d",a[i]);if(n==0) printf("\n");c=c+1;}}
else if(n==-1000){printf("-1\n");}
else printf("-102");
}
int main()
{
int i,a[100];
for(i=0;i<6;i++)
{scanf("%d",&a[i]);}
for(i=0;i<6;i++)
haha(a[i]);
}
|
44 | 21950 | int reverse(int num)
{
int i,a,b;
a=0;
if(num<0)
{
num=-num;
}
for(i=0;num>=1;i++)
{
b=num%10;
a=a*10+b;
num=(num-b)/10;
}
return (a);
}
void main()
{
int i;
int a[6],b[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
b[i]=reverse(a[i]);
}
for(i=0;i<6;i++)
{
if(a[i]>=0)
{
printf("%d\n",b[i]);
}
else
{
printf("-%d\n",b[i]);
}
}
}
|
44 | 21951 | int main()
{
int n,i;
int reverse(int num);
for (i=1;i<=6;i++)
{
scanf("%d",&n);
printf("%d\n",reverse(n));
}
return(0);
}
int reverse(int num)
{
int s,num1;
if (num>0) num1=num; else num1=-num;
s=0;
while (num1>0)
{
s=s*10+num1%10;
num1=num1/10;
}
if (num<0) s=-s;
return(s);
} |
44 | 21952 | int main()
{
int reverse(int num);
int num1[7],num2[7];
for(int i=1;i<=6;i++)
{
cin>>num1[i];
num2[i]=reverse(num1[i]);
}
return 0;
}
int reverse(int num)
{
int i=0,p=0;
if(num>0)
{
while(num!=0)
{
i=num%10;
num=num/10;
if(i!=0)
p=1;
if(i==0&&p==0)
continue;
else
cout << i;
}
cout<<endl;
}
else if(num==0)
cout<< 0<<endl;
else if(num<0)
{
num=-num;
cout<<"-";
while(num!=0)
{
i=num%10;
num=num/10;
if(i!=0)
p=1;
if(i==0&&p==0)
continue;
else
cout << i;
}
cout<<endl;
}
return (num);
}
|
44 | 21953 | int qiufan(int a);
main()
{
int a;
int n;
for(n=1;n<=6;n++)
{
scanf("%d",&a);
if(a>=0)
{
a=qiufan(a);
}
else
{
a=0-a;
a=0-qiufan(a);
}
printf("%d\n",a);
}
return 0;
}
int qiufan(int a)
{
int y=0,i=0,l=0,x;
x=a;
for(l=0;x!=0;l++)
{
x=x/10;
}
y=a%10;
x=a/10;
for(i=1;i<l;i++)
{
y=y*10+x%10;
x=x/10;
}
return(y);
}
|
44 | 21954 |
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 | 21955 | 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 | 21956 | int main ()
{
char a[100] ;
int i,j, flag , mark;
j=6;
while (j--)
{flag = 0 ;
mark = 0 ;
scanf ("%s",a);
if (!strcmp(a,"0"))
{
printf ("%s\n",a);
return 0;
}
if (a[0]=='-')
{
printf ("-") ;
flag++ ;
}
for (i = strlen(a)-1;i>=flag;i--)
{
if (a[i]!='0'||mark==1)
{
printf("%c",a[i]);
mark = 1;
}
}
printf("\n");
}
} |
44 | 21957 | int reverse(int );
int re(int );
int main()
{
int n,i;
for(i=1;i<=6;i++)
{
cin>>n;
n=reverse(n);
cout<<n<<endl;
}
return 0;
}
int reverse(int n)
{
int i,j,k=0,sum=0;
while(n!=0)
{
if(((n%10)==0)&&(k=0)) n=n/10;
else
{
sum=sum*10;
sum=sum+(n%10);
n=n/10;
k=1;
}
}
return sum;
} |
44 | 21958 | 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 | 21959 | int reverse(int n)
{
int i,m,re[10]={0};
if(n>0)
{
for(m=0;n!=0;m++){re[m]=n%10;n=n/10;}
for(i=0,n=0;i<m;i++)n=n*10+re[i];
for(i=0;i<10;i++)re[i]=0;
}
if(n==0||n==-0)n=0;
if(n<0)
{
n=-n;
for(m=0;n!=0;m++){re[m]=n%10;n=n/10;}
for(i=0,n=0;i<m;i++)n=n*10+re[i];
n=n*(-1);
for(i=0;i<10;i++)re[i]=0;
}
return(n);
}
void main()
{
int i,s[6];
for(i=0;i<6;i++)
scanf("%d",&s[i]);
for(i=0;i<6;i++)
printf("%d\n",reverse(s[i]));
}
|
44 | 21960 | int main()
{
int n,i;
int fun(int n);
for (i=0;i<6;i++)
{
scanf("%d",&n);
printf("%d\n",fun(n));
}
return 0;
}
int fun(int n)
{
int k=1,i,t=1,result=0;
if (n<0)
{
k=-1;
n=-n;
}
while (n>0)
{
result=result*10+n%10;
n/=10;
}
return k*result;
} |
44 | 21961 | int main()
{
int i=0,k=0,j=0,K=0,l=0;
char str[12];
for(i=0;i<6;i++)
{
cin>>str;
for(k=0;str[k]!='\0';k++)
K=k;
if(str[0]==45)
{
cout<<str[0];
for(j=K;j>=0;j--)
{
if(str[j]!=48)
{
l=j;
break;
}
}
for(j=l;j>1;j--)
cout<<str[j];
cout<<str[1]<<endl;
}
if(str[0]!=45)
{
for(j=K;j>=0;j--)
{
if(str[j]!=48)
{
l=j;
break;
}
}
for(j=l;j>0;j--)
cout<<str[j];
cout<<str[0]<<endl;
}
}
return 0;
}
|
44 | 21962 | 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 | 21963 | 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 | 21964 | 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 | 21965 | int reverse(int n)
{
int rev;
if(n==0)
rev=0;
if(n<0)
{
n=(-1)*n;
rev=reverse(n)*(-1);
}
else
{
for(rev=0;n!=0;)
{
rev=n%10+10*rev;
n/=10;
}
}
return rev;
}
int main()
{
int n[6],i;
for(i=0;i<6;i++)
scanf("%d",&n[i]);
for(i=0;i<6;i++)
printf("%d\n",reverse(n[i]));
return 0;
} |
44 | 21966 | 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 | 21967 |
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 | 21968 | int reverse(int num)
{
return num%10;
}
int main()
{
int number;
while(cin>>number)
{
if(number>0)
{
while(reverse(number)==0)number=number/10;
while(number!=0)
{
cout<<reverse(number);
number=number/10;
}
cout<<endl;
}
else if(number<0)
{
cout<<'-';
number=0-number;
while(reverse(number)==0)number=number/10;
while(number!=0)
{
cout<<reverse(number);
number=number/10;
}
cout<<endl;
}
else if(number ==0)cout<<0<<endl;
}
return 0;
}
|
44 | 21969 | int Reverse(int n); //????????
int main()
{
int i=0; //?????i
double Num=0; //???????Num
for (i=0;i<6;i++) //???????
{ cin>>Num;
cout<<Reverse(Num)<<endl;
}
return 0;
}
int Reverse(int n) //??????
{
double Sum=0; //???????
int i=0; //?????i
int k=0; //????k
int a[100]={10}; //??????????????
for (i=0;i<100;i++) //????
{
if (n/pow(10.0,i)<1&&n/pow(10.0,i)>-1)
{break;}
}
for (k=0;k<i;k++) //?????????????
{ a[i-k]=n/pow(10.0,i-k-1);
n-=a[i-k]*(pow(10.0,i-k-1));
}
for (k=1;k<=i;k++) //????????
{Sum+=a[k]*pow(10.0,i-k);
}
return Sum;
}
|
44 | 21970 | 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 | 21971 | // ?????.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 | 21972 | void main()
{
char str[100],temp;
int i,j,l,k,num;
for(i=0;i<6;i++)
{
scanf("%s",str);
l=strlen(str);
k=0;
if(str[0]=='-')
{
k=1;l++;
if(str[1]!='0')
printf("%c",str[0]);//-0??????
}
for(j=k;j<l/2;j++)
{
temp=str[j];
str[j]=str[l-1-j];
str[l-1-j]=temp;
}
num=str[k]-'0';
if(k)
{
for(j=k+1;j<l-1;j++)
{
num=num*10+str[j]-'0';
}
printf("%d\n",num);
}
else
{
for(j=k+1;j<l;j++)
{
num=num*10+str[j]-'0';
}
printf("%d\n",num);
}
}
} |
44 | 21973 | 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 | 21974 | 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 | 21975 | 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 | 21976 | 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 | 21977 | int reverse (int x)
{
int s=0,i;
while (x!=0)
{
i=x%10;
s=s*10+i;
x=x/10;
}
return s;
}
main()
{
int n=0,i,j=0;
char a;
for (i=0;i<6;i++)
{
n=0;j=0;
while (1)
{
scanf("%c",&a);
if (a=='\n')
break;
if (a=='-')
j=1;
else
n=n*10+(a-'0');
}
n=reverse(n);
if (j==1)
printf("-");
printf("%d\n",n);
}
} |
44 | 21978 |
int RevNum(int n);
int main()
{
int k,i;
for(i=0;i<6;i++)
{
scanf("%d",&k);
RevNum(k);
}
return 0;
}
int RevNum(int n)
{
int s=0,j=0;
if(n==0||-0)
printf("0");
else
{
if(n>0)
{
for(;n%10==0;)
{
n=n/10;
}
for(;n/10!=0;)
{
s=n%10;
n=n/10;
printf("%d",s);
}
printf("%d\n",n);
}
if(n<0)
{
n=-n;
for(;n%10==0;)
{
n=n/10;
if(0<n<10)
n=-n;
}
for(;n/10!=0;)
{
s=n%10;
n=n/10;
if(j==0)
printf("-");
printf("%d",s);
j++;
}
printf("%d\n",n);
}
}
j=0;
return 0;
}
|
44 | 21979 |
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 | 21980 |
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 | 21981 | int reverse(int num)
{
int i,j=0;
if(num>0)
{
for(;num>0;)
{
i=num%10;
num=num/10;
j=j*10+i;
}
return(j);
}
else if(num<0)
{
num=-num;
for(;num>0;)
{
i=num%10;
num=num/10;
j=j*10+i;
}
return(-j);
}
else if(num==0)
{
j=num;
return(j);
}
}
main()
{
int a,i;
int num;
for(i=0;i<=5;i++)
{
scanf("%d",&num);
a=reverse(num);
printf("%d\n",a);
}
} |
44 | 21982 | int f(int a);
int main()
{
int i,m;
for(i=1;i<=6;i++)
{
scanf("%d",&m);
printf("%d\n",f(m));
}
return 0;
}
int f(int a)
{
int b,c=0,j=0,k,d=0;
int i;
b=a;
while(b!=0)
{
b=b/10;
j++;}
for(i=1;i<=j;i++)
{
c=a%10;
for(k=i;k<j;k++)
{
c=c*10;
}
d=d+c;
a=a/10;
}
return d;
}
|
44 | 21983 |
int reverse(int num)
{
int i,rev=0,k;
if(num==0) return(0);
else if(num>0)
{
for(k=1;(num/k)>=10;k*=10);
// printf("k=%d",k);
for(i=1;k>=1;k/=10,i*=10)
{
rev+=i*(num/k);
num-=k*(num/k);
}
}
else if(num<0)
{
rev=-1*reverse(-1*num);
}
return(rev);
}
void main()
{
int num[6];
int i;
for(i=0;i<6;i++)
scanf("%d",&num[i]);
for(i=0;i<6;i++)
printf("%d\n",reverse(num[i]));
}
|
44 | 21984 |
int reverse(int num)
{
char sign=0;
int itemp;
int isFirstzero=1;
if (num==0)
{
printf("0\n");
return 0;
}
if (num<0)
{
sign='-';
printf("-");
num= 0-num;
}
while(num>0)
{
itemp = num%10;
if (itemp==0&& isFirstzero==1)
{
}
else if (itemp==0 && isFirstzero==0)
{
printf("%d", itemp);
}
else if (itemp!=0 )
{
isFirstzero =0;
printf("%d", itemp);
}
num/=10;
}
printf("\n");
return 1;
}
int main(int argc, char* argv[])
{
int i=0, n;
for (i=0; i<6; i++)
{
scanf("%d",&n);
reverse(n);
}
return 0;
}
|
44 | 21985 | int reverse(int num)
{
int i=0,a[100],j,s=0;
if(num==0) return(0);
else
{
while(num>0)
{
a[i++]=num%10;
num=num/10;
}
for(j=0;j<i;j++)
s=s+a[j]*pow(10,i-1-j);
return(s);
}
}
int main()
{
int i,a[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
if(a[i]>=0) a[i]=reverse(a[i]);
else a[i]=-reverse(-a[i]);
}
for(i=0;i<6;i++)
printf("%d\n",a[i]);
return 0;
}
|
44 | 21986 | int reverse(int num)
{
int a[100];
int x,b,answer;
answer=0;
if(num<0)
x=-num;
else
x=num;
while (x!=0)
{
b=x%10;
answer=answer*10+b;
x=x/10;
}
if(num<0)
answer=-answer;
return answer;
}
main()
{
int a;
int b;
int c;
int d;
int e;
int f;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
scanf("%d",&d);
scanf("%d",&e);
scanf("%d",&f);
printf("%d",reverse(a));
printf("\n");
printf("%d",reverse(b));
printf("\n");
printf("%d",reverse(c));
printf("\n");
printf("%d",reverse(d));
printf("\n");
printf("%d",reverse(e));
printf("\n");
printf("%d",reverse(f));
printf("\n");
}
|
44 | 21987 | 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 | 21988 | int reserve(int num)
{
int a[10],b,c,d,e,i,j,l;
for(i=0;i<10;i++)
{
for(j=9,a[i]=num;j>i;j--)
{
a[i]=a[i]/10;
}
for(j=9,b=1;j>i;j--)
{
b=b*10;
}
num=num-a[i]*b;
}
for(i=0;i<=9;i++)
{
if(a[i]!=0)
break;
}
c=i;
for(i=9;i>=0;i--)
{
if(a[i]!=0)
break;
}
d=i;
for(i=d,e=0;i>=c;i--)
{
for(j=d-c-(d-i);j>0;j--)
{
a[i]=a[i]*10;
}
e=e+a[i];
}
return e;
}
int main()
{
int i,a;
for(i=0;i<6;i++)
{
scanf("%d",&a);
printf("%d\n",reserve(a));
}
getchar();
getchar();
}
|
44 | 21989 | void f(int x)
{
int i,j,a[5];
a[0]=(int)fabs(x)%10;
a[1]=(int)fabs(x)%100/10;
a[2]=(int)fabs(x)%1000/100;
a[3]=(int)fabs(x)%10000/1000;
a[4]=(int)fabs(x)/10000;
if(x>0)
{
if(a[0]!=0)
{
printf("%d",a[0]);
if(a[4]!=0)
{
printf("%d%d%d%d",a[1],a[2],a[3],a[4]);
}
if(a[4]==0)
{
if(a[3]!=0)
printf("%d%d%d",a[1],a[2],a[3]);
if(a[3]==0)
{
if(a[2]!=0)
printf("%d%d",a[1],a[2]);
if(a[2]==0)
{
if(a[1]!=0)
printf("%d",a[1]);
}
}
}
printf("\n");
}
if(a[0]==0)
{
if(a[1]!=0)
{
printf("%d",a[1]);
if(a[4]!=0)
{
printf("%d%d%d",a[2],a[3],a[4]);
}
if(a[4]==0)
{
if(a[3]!=0)
printf("%d%d",a[2],a[3]);
if(a[3]==0)
{
if(a[2]!=0)
printf("%d",a[2]);
}
}
printf("\n");
}
if(a[1]==0)
{
if(a[2]!=0)
{
printf("%d",a[2]);
if(a[4]!=0)
{
printf("%d%d",a[3],a[4]);
}
if(a[4]==0)
{
if(a[3]!=0)
{
printf("%d",a[3]);
}
}
printf("\n");
}
if(a[2]==0)
{
if(a[3]!=0)
{
printf("%d",a[3]);
if(a[4]!=0)
{
printf("%d",a[4]);
}
printf("\n");
}
if(a[3]==0)
{
printf("%d\n",a[4]);
}
}
}
}
}
if(x==0)
{
printf("0\n");
}
if(x<0)
{
if(a[0]!=0)
{
printf("-%d",a[0]);
if(a[4]!=0)
{
printf("%d%d%d%d",a[1],a[2],a[3],a[4]);
}
if(a[4]==0)
{
if(a[3]!=0)
printf("%d%d%d",a[1],a[2],a[3]);
if(a[3]==0)
{
if(a[2]!=0)
printf("%d%d",a[1],a[2]);
if(a[2]==0)
{
if(a[1]!=0)
printf("%d",a[1]);
}
}
}
printf("\n");
}
if(a[0]==0)
{
if(a[1]!=0)
{
printf("-%d",a[1]);
if(a[4]!=0)
{
printf("%d%d%d",a[2],a[3],a[4]);
}
if(a[4]==0)
{
if(a[3]!=0)
printf("%d%d",a[2],a[3]);
if(a[3]==0)
{
if(a[2]!=0)
printf("%d",a[2]);
}
}
printf("\n");
}
if(a[1]==0)
{
if(a[2]!=0)
{
printf("-%d",a[2]);
if(a[4]!=0)
{
printf("%d%d",a[3],a[4]);
}
if(a[4]==0)
{
if(a[3]!=0)
{
printf("%d",a[3]);
}
}
printf("\n");
}
if(a[2]==0)
{
if(a[3]!=0)
{
printf("-%d",a[3]);
if(a[4]!=0)
{
printf("%d",a[4]);
}
printf("\n");
}
if(a[3]==0)
{
printf("-%d\n",a[4]);
}
}
}
}
}
}
void main()
{
int b[6],n;
for(n=0;n<6;n++)
scanf("%d",&b[n]);
for(n=0;n<6;n++)
f(b[n]);
} |
44 | 21990 | void main()
{
char str[100],temp;
int i,j,l,k,m,num;
for(i=0;i<6;i++)
{
scanf("%s",str);
k=0;
l=strlen(str);
if(str[0]=='-')
{
k=1;l++;
printf("%c",str[0]);
}
for(j=k;j<l/2;j++)
{
temp=str[j];
str[j]=str[l-1-j];
str[l-1-j]=temp;
}
num=str[k]-'0';
if(k)
{
for(j=k+1;j<l-1;j++)
{
num=num*10+str[j]-'0';
}
printf("%d\n",num);
}
else
{
for(j=k+1;j<l;j++)
{
num=num*10+str[j]-'0';
}
printf("%d\n",num);
}
}
}
|
44 | 21991 | int reverse(int num)
{
int l = 10;
int k = 0;
if(-0 == num)
k = 0;
else if((num>=-9)&&(num<=9))
k = num;
else if(num>9)
{
int a[100];
int i = 0;
while(1)
{
a[i] = num % 10;
num = (num - a[i]) / 10;
i++;
if (num<=9)
{
a[i] = num;
break;
}
}
int p = i + 1;
while(p>0)
{
k = (int)(a[i+1-p] * pow((double)l,p-1)) + k;
p--;
}
}
else
{
num = -num;
int a[100];
int i = 0;
while(1)
{
a[i] = num % 10;
num = (num - a[i]) / 10;
i++;
if (num<=9)
{
a[i] = num;
break;
}
}
int p = i + 1;
while(p>0)
{
k = (int)(a[i+1-p] * pow((double)l,p-1)) + k;
p--;
}
k = -k;
}
return k;
}
int main()
{
int i = 1;
while(i<=6)
{
int n;
scanf("%d",&n);
printf("%d\n",(int)reverse(n));
i++;
}
return 0;
} |
44 | 21992 | 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 | 21993 | int n,i;
void get();
void fanxu(int n);
int main()
{
int j;
for(j=1;j<=6;j++)
{
get();
i=0;
fanxu(n);
}
return 0;
}
void get()
{
cin>>n;
if(n<0) cout<<"-",n=-n;
if(n==0) cout<<"0";
}
void fanxu(int n)
{
if(n>0)
{
if(n%10!=0||i==1) cout<<(n%10),i=1;
fanxu(n/10);
}
else cout<<endl;
} |
44 | 21994 |
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 | 21995 | char str[1000];
void fanxu(char a[]){
int len;
len=strlen(a);
int i;
if (a[0]=='-'){
for(i=1;i<=len/2;i++){
int temp=str[i];
str[i]=str[len-i];
str[len-i]=temp;
}
}
else{
for(i=0;i<len/2;i++){
int temp=str[i];
str[i]=str[len-1-i];
str[len-1-i]=temp;
}
}
}
void show(char a[]){
if ((a[0]=='-')&&(a[1]=='0')&&(a[2]==0)){
printf("%d\n",0);
return;
}
if ((a[0]=='0')&&(a[1]==0)){
printf("%d\n",0);
return;
}
int i,t=0;
if (a[0]=='-') {printf("%c",a[0]);}
else
{
t=1;
}
for(i=1-t;a[i]=='0';i++);
for(;a[i]!='\0';i++){
printf("%c",a[i]);
}
printf("\n");
}
int main(){
int j;
for(j=1;j<=6;j++){
gets(str);
fanxu(str);
show(str);
}
return 0;
}
|
44 | 21996 |
void go(int a)
{
int b[100],i,c;
if(a==0)printf("0");
if(a>0)
{
c=log10(a);
for(i=c;i>=0;i--)
{
b[i]=a/(pow(10,i));
a=a-b[i]*pow(10,i);
}
for(i=0;i<=c;i++)
{
a=a+b[c-i]*pow(10,i);
}
printf("%d",a);
}
if(a<0)
{
a=(-a);
c=log10(a);
for(i=c;i>=0;i--)
{
b[i]=a/(pow(10,i));
a=a-b[i]*pow(10,i);
}
for(i=0;i<=c;i++)
{
a=a+b[c-i]*pow(10,i);
}
printf("%d",-a);
}
printf("\n");
}
int main()
{
int a[6],i;
for(i=0;i<6;i++)
{scanf("%d",&a[i]);}
for(i=0;i<6;i++)
{
go(a[i]);
}
return 0;
}
|
44 | 21997 | 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 | 21998 | 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 | 21999 | void tran(int n,int sum)
{
if(n<0)
{
cout<<'-';
n=-n;
}
if(n==0)
{
if(sum==0)cout<<0;
cout<<endl;
return ;
}
sum+=n%10;
if(sum>0)cout<<n%10;
n/=10;
tran(n,sum);
}
int main()
{
int n;
while(cin>>n)
tran(n,0);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.