id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
21,600 | 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 |
21,601 | //-------------------
// ???
// 2010/11/23
// ???
//-------------------
int Reverse(int x); //????
int main()
{
int n=6,i,X;
for(i=0;i<n;i++)
{
cin>>X;
cout<<Reverse(X)<<endl;
}
return 0;
}
int Reverse(int x)
{
int y=0;
if(x==0) return 0;
while(x!=0)
{
y=y*10+x%10;
x=x/10;
}
return y;
} | 44 |
21,602 | 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 |
21,603 | void main()
{
int num[6];
int i;
int fuck(int a,int n);
int reverse(int x);
for(i=0;i<6;i++)
{
scanf("%d",&num[i]);
}
for(i=0;i<6;i++)
{
num[i]=reverse(num[i]);
printf("%d\n",num[i]);
}
}
int reverse(int x)
{
int y=0,z;//z ti huan x
int j,k,m;
int w=0;//??
int b[20]={0};
if (x>0)
{
z=x;
for(j=0;j<=20;j++)//20?
{
z=z/10;
w++;
if (z==0)
{
break;
}
}
for(k=0;k<w;k++)
{
b[w-k-1]=x/(fuck(10,(w-k-1)));
x=x-b[w-k-1]*(fuck(10,(w-k-1)));//b0= ge wei;b1=10 wei
}
for(m=0;m<w;m++)
{
if(b[m]!=0)
{
y+=b[m]*(fuck(10,w-m-1));
}
}
}
if (x<0)
{
x=(0-x);
z=x;
z=x;
for(j=0;j<=20;j++)//20?
{
z=z/10;
w++;
if (z==0)
{
break;
}
}
for(k=0;k<w;k++)
{
b[w-k-1]=x/(fuck(10,(w-k-1)));
x=x-b[w-k-1]*(fuck(10,(w-k-1)));//b0= ge wei;b1=10 wei
}
for(m=0;m<w;m++)
{
if(b[m]!=0)
{
y+=b[m]*(fuck(10,w-m-1));
}
}
y=(0-y);
}
return(y);
}
int fuck(int a,int n)
{
int y;
int i;
y=1;
for (i=1;i<=n;i++)
{
y*=a;
}
return (y);
} | 44 |
21,604 | 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 |
21,605 | long long reverse(int n){
int flag=0;
if (n<0)
flag=1,n=-n;
int a=1,t=0,n1=0;
while (10*a<=n)
a*=10,t++;
for (int i=0;i<=t;i++)
n1+=n/a*(int)pow((double)10,i),n%=a,a/=10;
if (flag==1)
n1=-n1;
return n1;
}
int main(){
int n;
for (int i=1;i<=6;i++)
{
cin >> n;
cout << reverse(n) << endl;
}
return 0;
} | 44 |
21,606 | int reverse(int);
int main()
{
int i,x;
for(i=1;i<=6;i++) //???6???
{
cin>>x;
reverse(x);
cout<<endl;
}
return 0;
}
int reverse(int x) //??????
{
int i;
int y=0;
if(x==0)
{
cout<<x;
}
if(x>0)
{
for(i=0;x>0;i++) //??????????????0
{
if(x%10!=0||y!=0)
{
cout<<x%10;
y=1;
}
x=x/10;
}
}
if(x<0) //???????????????????????
{
cout<<"-";
for(i=0;-x>0;i++)
{
if(x%10!=0||y!=0)
{
cout<<(-x)%10;
y=1;
}
x=x/10;
}
}
return 0;
}
| 44 |
21,607 | int reverse(int a)
{
int x,i,p,t,j,n=0;
if(a==0)
return(0);
x=abs(a);
for(i=9,p=0,j=0;i>=0;i--)
{
t=x/((int)pow(10,i));
x-=t*(int)pow(10,i);
if((t!=0)||(p==1))
{
p=1;
n+=t*pow(10,j);
j++;
}
}
if(a<0)
n=-n;
return(n);
}
void main()
{
int a,i;
for(i=1;i<=6;i++)
{
scanf("%d",&a);
printf("%d\n",reverse(a));
}
} | 44 |
21,608 | //****************
//*1000010538 *
//*?? *
//****************
int reverse(int);
int main()
{
int i,a[6]; //????????????
for(i=0;i<6;i++)
{
cin>>a[i];
a[i]=reverse(a[i]);
cout<<a[i]<<endl;
}
return 0;
}
int reverse(int num)
{
char str[10]={0};
int len=0,i;
if(num!=0) //?????
{
for(i=0;num!=0;i++)
{
str[i]=num%10+'0'; //???????????????
num=num/10;
}
len=strlen(str);
for(i=0;i<len;i++)
num=num+(str[i]-'0')*pow(10.0,len-1-i); //????????????????
return(num);
}
if(num==0) //????0
return 0; //????0
}
| 44 |
21,609 | int reverse(int num)
{
if(num==0)
return 0;
else
{
if(num>0)
{
int b,x=1,y=0,i,j,k,n=0;
b=num;
for(i=1;;i++)
{
if(b%10==0)
y++;
else
break;
b=b/10;
}
b=num;
for(i=1;;i++)
{
if(b/10!=0)
x++;
else
break;
b=b/10;
}
b=num;
int a[x],c[x];
for(j=0;j<x;j++)
{
a[j]=b;
b=b/10;
}
int e;
for(k=y;k<x;k++)
{
c[k]=a[k]%10;
e=x-k-1;
n+=c[k]*pow(10,e);
}
return n;
}
else
{
int b,x=1,y=0,i,j,k,n=0;
b=-num;
for(i=1;;i++)
{
if(b%10==0)
y++;
else
break;
b=b/10;
}
b=-num;
for(i=1;;i++)
{
if(b/10!=0)
x++;
else
break;
b=b/10;
}
b=-num;
int a[x],c[x];
for(j=0;j<x;j++)
{
a[j]=b;
b=b/10;
}
int e;
for(k=y;k<x;k++)
{
c[k]=a[k]%10;
e=x-k-1;
n+=c[k]*pow(10,e);
}
return (-n);
}
}
}
main()
{
int n,a,b=1;
for(b=1;b<=6;b++)
{
scanf("%d",&n);
a=reverse(n);
printf("%d\n",a);
}
getchar();
getchar();
getchar();
getchar();
getchar();
}
| 44 |
21,610 | 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;
double 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(10,t-i);
num=num/10;
}
return sum;
}
| 44 |
21,611 | int reverse(int num)
{ int i,j,a[100],m=0,d;
d=1;
if(num<0)
{
num=-num;
d=0;
}
for(i=0;1;i++)
{
if(num<10)
break;
a[i]=num%10;
num=num/10;
}
for(j=0;j<i;j++)
{
m+=a[j]*(pow(10,(i-j)));
}
m+=num;
if(d==0)
return -m;
else
return m;
}
int main()
{
int i,n,result;
for(i=0;i<6;i++)
{
scanf("%d",&n);
result=reverse(n);
if(i<5)
printf("%d\n",result);
else
printf("%d",result);
}
return 0;
} | 44 |
21,612 | int clear(int num)
{
while(num%10==0) num=num/10;
return num;
}
int reverse(int num)
{
if(num!=0)
{
cout<<(num%10);
reverse(num/10);
}
return 0;
}
int main()
{
for(int i=0;i<6;i++)
{
int num;
cin>>num;
if(num<0)
{cout<<'-';num=abs(num);}
if(num==0) cout<<'0';
else
{
num=clear(num);
reverse(num);
}
if(i!=6) cout<<endl;
}
} | 44 |
21,613 | int reverse(int digit);
int main()
{
int i;
int s;
int t;
for(i=0;i<6;i++)
{
scanf("%d",&s);
t=reverse(s);
printf("%d\n",t);
}
return 0;
}
int reverse(int digit)
{
int result;
int n[MAX],i,count;
if(digit==0)
return result=0;
else if(digit==-0)
return result=0;
else if(digit>0)
{
i=count=0;
while(digit>=1)
{
n[i]=digit%10;
digit=digit/10;
i++;
count++;
}
result=0;
for(i=0;i<count;i++)
{
result+=n[i]*(int)pow((double)10,(count-i-1));
}
return result;
}
else
{
digit=abs(digit);
i=count=0;
while(digit>=1)
{
n[i]=digit%10;
digit=digit/10;
i++;
count++;
}
result=0;
for(i=0;i<count;i++)
{
result+=n[i]*(int)pow((double)10,(count-i-1));
}
result=-result;
return result;
}
}
| 44 |
21,614 | 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 |
21,615 | const int n=6;
long down(long x)
{
long k,m;
k=x;
m=0;
while(k>0)
{
m=m*10;
m=m+k%10;
k=k/10;
}
return m;
}
main()
{
long i,k,l;
for(i=1;i<=n;i++)
{
l=1;
scanf("%d",&k);
if(k<0)
{
l=-1;
k=-k;
}
k=down(k);
if(l==-1) k=-k;
printf("%d\n",k);
}
getchar();
getchar();
}
| 44 |
21,616 | void oppoorder(int x);
int main()
{
int i,j;
for(i=1;i<=6;i++)
{cin>>j;
if(j==0) cout<<'0'<<endl;
if(j>0) oppoorder(j);
if(j<0) {j=-j;
cout<<"-";
oppoorder(j);
}}//????????????
return 0;
}
void oppoorder(int x)
{
int a[32],i=0,k,flag=0;
while(x!=0)
{a[i]=x%10;
i++;
x=x/10;}
for(k=0;k<=i-1;k++)
{if((a[k]==0)&&(flag==0))
continue;//??????0????
if(a[k]!=0) flag=1;
cout<<a[k];//?????0?????
}
cout<<endl;
} | 44 |
21,617 | void main()
{
int f(int x);
int m[6],i,out;
for(i=0;i<6;i++)
{
scanf("%d\n",&m[i]);
out=f(m[i]);
printf("%d\n",out);
}
}
int f(int x)
{
int a,b,c,d,e,z;
a=x/10000;
b=(x-10000*a)/1000;
c=(x-10000*a-1000*b)/100;
d=(x-10000*a-1000*b-100*c)/10;
e=x-10000*a-1000*b-100*c-10*d;
if(a!=0)
z=e*10000+d*1000+c*100+b*10+a;
else if(a==0&&b!=0)
z=e*1000+d*100+c*10+b;
else if(a==0&&b==0&&c!=0)
z=e*100+d*10+c;
else if(a==0&&b==0&&c==0&&d!=0)
z=e*10+d;
else if(a==0&&b==0&&c==0&&d==0)
z=e;
return(z);
}
| 44 |
21,618 | void main()
{
int reverse(int num);
int a,b,i;
for(i=0;i<6;i++)
{
scanf("%d",&a);
b=reverse(a);
printf("%d\n",b);
}
}
int reverse(int num)
{
int num1,n,c1,c2,c3,c4,c5;
if(num/10000) {c1=num/10000;c2=(num/1000)%10;c3=(num/100)%10;c4=(num/10)%10;c5=num%10; num1=c1+c2*10+c3*100+c4*1000+c5*10000;}
else if(num/1000) {c1=num/1000;c2=(num/100)%10;c3=(num/10)%10;c4=(num%10); num1=c1+c2*10+c3*100+c4*1000;}
else if(num/100) {c1=num/100;c2=(num/10)%10;c3=num%10; num1=c1+c2*10+c3*100;}
else if(num/10) {c1=num/10;c2=num%10; num1=c1+c2*10;}
else num1=num;
return(num1);
} | 44 |
21,619 | int reverse(int num){
int k,N[100],i,rev;
rev=0;
if(num<10)
return num;
if(num>=10){
k=0;
while(1){
if(num>0){
N[k]=num%10;
k++;
num/=10;
}else
break;
}
for(i=0;i<k;i++)
rev+=pow(10,i)*N[k-1-i];
return rev;
}
}
int main(){
int i,sz[6],rev[6];
for(i=0;i<6;i++)
scanf("%d",&sz[i]);
for(i=0;i<6;i++){
if(sz[i]<0){
sz[i]=-sz[i];
rev[i]=reverse(sz[i]);
printf("-%d\n",rev[i]);
}else{
rev[i]=reverse(sz[i]);
printf("%d\n",rev[i]);
}
}
return 0;
} | 44 |
21,620 | int reverse(int num);
int main()
{
for(int i=0;i<6;i++)
{
int a,r;
scanf("%d",&a);
r=reverse(a);
printf("%d\n",r);
}
int a;
scanf("%d",&a);
return 0;
}
int reverse(int num)
{
int a=num,s=0;
int SZ[100];
int n=1,i=0;
while((a/10)!=0)
{
SZ[i]=a%10;
a=a/10;
i++;
}
SZ[i]=a%10;
if(SZ[i]<0)
{
s=-SZ[0];
for(int k=1;k<=i;k++)
{
s=s*10-SZ[k];
}
s=-s;
}
if(SZ[i]>=0)
{
s=SZ[0];
for(int k=1;k<=i;k++)
{
s=s*10+SZ[k];
}
}
return s;
} | 44 |
21,621 | int reverse(int num)
{
int d=0,m=num;
if(m>0)
while(m!=0)
{
d=d*10+m%10;
m/=10;
}
else if(m<0)
{
m=m*(-1);
while(m!=0)
{
d=d*10+m%10;
m/=10;
}
d=d*(-1);
}
else;
return d;
}
int main()
{
int i,a;
for(i=1;i<=6;i++)
{
scanf("%d",&a);
printf("%d\n",reverse(a));
}
getchar();
getchar();
} | 44 |
21,622 | int f=0;
void reserve(int num)
{
num=abs(num);
if((num%10)!=0){
cout<<num%10;f = 1;
}
if(num%10==0&&f==1)
{
cout<<"0";
}
if(num/10 >0)
reserve(num/10);
}
int main()
{
int i,num;
for(i=0;i<6;i++)
{
f=0;
cin>>num;
if(num<0){
num=0-num;
cout<<"-";
}
reserve(num);
cout<<endl;
}
return 0;
}
| 44 |
21,623 | int main()
{
int n,i,j,r,p=0,y,r1,t=0;
char q[6][100];
char ch[100]={0},ch1[100]={0};
for(i=0;i<=5;i++)
{
gets(q[i]);
r=strlen(q[i]);
if(q[i][0]>=48&&q[i][0]<=57)
{
for(j=0;j<=r-1;j++)
{
ch[r-1-j]=q[i][j];
}
}
if(q[i][0]=='-'&&q[i][1]!='0')
{
for(j=1;j<=r-1;j++)
{
ch[r-j]=q[i][j];
}
ch[0]=q[i][0];
}
if(q[i][0]=='-'&&q[i][1]=='0')
{ch[0]=q[i][1];}
r1=strlen(ch);
if(ch[0]=='0'&&r1==1) {ch1[0]=ch[0];}
else
{
if(ch[0]=='-')
{
for(y=1;y<=r1-1;y++)
{
if(ch[1]!='0') {break;}
if(ch[y]=='0') {p++;}
if(ch[y+1]!='0') {break;}
}
for(int y1=p+1;y1<=r1-1;y1++)
{
ch1[0]=ch[0]; ch1[t+1]=ch[y1]; t++;
}
}
else
{
for(int x=0;x<=r1-1;x++)
{
if(ch[x]!='0') {break;}
if(ch[x]=='0') {p++;}
if(ch[x+1]!='0') {break;}
}
for(int x1=p;x1<=r1-1;x1++)
{
ch1[t]=ch[x1]; t++;
}
}
}
puts(ch1);
p=0;
t=0;
for(int x=0;x<=99;x++)
{
ch[x]='\0';
ch1[x]='\0';
}
}
return 0;
} | 44 |
21,624 | int reverse(int);
int main()
{
int num1,num2,num3,num4,num5,num6;
cin>>num1>>num2>>num3>>num4>>num5>>num6;
cout<<reverse(num1)<<endl;
cout<<reverse(num2)<<endl;
cout<<reverse(num3)<<endl;
cout<<reverse(num4)<<endl;
cout<<reverse(num5)<<endl;
cout<<reverse(num6)<<endl;
return 0;
}
int reverse(int num)
{
int sum=0;
while(num)
{
sum=sum*10+num%10;
num=num/10;
}
return sum;
}
| 44 |
21,625 | void main()
{
int reverse(int num);
int a[6],b[6];
int i;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
b[i]=reverse(a[i]);
for(i=0;i<6;i++)
printf("%d\n",b[i]);
}
reverse(int a)
{
int j,p,l=0,c=a,z=0;
if(a>=0)
{
for(;c>0;)
{
c=c/10;
l++;
}
for(j=l-1;j>=0;j--)
{
p=a/(int)pow(10,j);
z=z+p*(int)pow(10,l-j-1);
a=a-p*pow(10,j);
}
}
else
{
for(;c<0;)
{
c=c/10;
l++;
}
for(j=l-1;j>=0;j--)
{
p=a/(int)pow(10,j);
z=z+p*(int)pow(10,l-j-1);
a=a-p*pow(10,j);
}
}
return z;
} | 44 |
21,626 |
int reverse(int);
int main() {
int i,data[6];
for(i=0;i<6;i++) {
scanf("%d", &data[i]);
}
for(i=0;i<6;i++) {
data[i]=reverse(data[i]);
printf("%d\n", data[i]);
}
return 0;
}
int reverse(int data) {
int i, n, sign, num[7], result=0;
if(data<0) {
sign=-1;
data=-data;
} else if (data==0) {
return 0;
} else if (data==-0) {
return -0;
}else {
sign=1;
}
for(i=0;i<7;i++) {
num[i]=data/pow(10,i+1);
num[i]=data-num[i]*pow(10,i+1);
num[i]=num[i]/pow(10,i);
}
for(i=6;num[i]==0;i--);
n=i;
for(i=0;i<=n;i++) {
result+=num[n-i]*pow(10,i);
}
if(sign==-1) result=-result;
return result;
}
| 44 |
21,627 | 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 |
21,628 | 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 |
21,629 | int reverse(int n)
{
int j,temp,flag,i,re_n,num[11];
flag=0;
i=0;
while ((n>=10) || (n%10!=0))
{
temp=n%10;
n=n/10;
if ((flag==0) && (temp!=0) || (flag==1))
{
num[i++]=temp;
flag=1;
}
}
re_n=0;
for (j=0;j<=i-1;j++) re_n=re_n*10+num[j];
return(re_n);
}
void main()
{
int flag,n;
flag=0;
while (scanf("%d",&n)==1)
{
if (n<0)
{
n=n*(-1);
printf("-");
}
printf("%d\n",reverse(n));
}
}
| 44 |
21,630 |
int reverse(int x);
int main()
{
int i;
int sz[6];
for(i=0;i<6;i++){
scanf("%d",&sz[i]);
}
for(i=0;i<6;i++){
printf("%d\n",reverse(sz[i]));
}
return 0;
}
int reverse(int x){
int a,b,c,d,e,k;
k=abs(x);
e=k/10000;
d=(k-10000*e)/1000;
c=(k-10000*e-1000*d)/100;
b=(k-10000*e-1000*d-100*c)/10;
a=k-10000*e-1000*d-100*c-10*b;
if(x>=0){
if(e==0&&d!=0)return a*1000+b*100+c*10+d*1;
if(e==0&&d==0&&c!=0)return a*100+b*10+c;
if(e==0&&d==0&&c==0&&b!=0)return a*10+b;
if(e!=0)return a*10000+b*1000+c*100+d*10+e;
else return e;
}
else{
if(e==0&&d!=0)return -(a*1000+b*100+c*10+d*1);
if(e==0&&d==0&&c!=0)return -(a*100+b*10+c);
if(e==0&&d==0&&c==0&&b!=0)return -(a*10+b);
if(e!=0)return -(a*10000+b*1000+c*100+d*10+e);
else return -e;
}
} | 44 |
21,631 | int f(int x)
{
int y,v,j;
v=0;
for(j=0;x!=0;j++)
{
v=v*10+x%10*10;
x=x/10;
}
y=v/10;
return(y);
}
int main()
{
int f(int x);
int i;
int a[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",f(a[i]));
}
return 0;
}
| 44 |
21,632 | 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 |
21,633 |
int re(int num){
int sz[30],i,value,x;
value=1;
i=0;
if(num<0) {num=-num;value=-1;}
for(int j=0;j<30;j++) sz[j]=0;
while(num>0) {
sz[i++]=num%10;
num=num/10;
}
for(i=29;i>=0;i--){
if(sz[i]!=0){
x=i;
break;
}
}
for(i=0,num=0;i<=x;i++) num=num*10+sz[i];
num=num*value;
}
int main(){
int num[6],i;
for(i=0;i<6;i++){
scanf("%d",&num[i]);
num[i]=re(num[i]);
}
for(i=0;i<6;i++){
if(i==5) printf("%d",num[i]);
else printf("%d\n",num[i]);
}
scanf("%d",&i);
return 0;
} | 44 |
21,634 | main()
{
int reverse(int n);
int X;
int R;
int i;
for(i=0;i<=5;i++)
{
scanf("%d",&X);
R=reverse(X);
printf("%d\n",R);
}
}
int reverse(int n)
{
int r=0,q,N;
if(n>0)
{
while(n>0)
{
q=n%10;
r=r*10+q;
n=n/10;
}
return(r);
}
if(n<0)
{
while(n<0)
{
N=0-n;
q=N%10;
r=r*10+q;
N=N/10;
n=0-N;
}
return(-r);
}
if(n==0)
return(n);
}
| 44 |
21,635 | int main ()
{
void reverse(int num);
int num,i;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
if(num>0)
reverse(num);
else if(num==0)
printf("0\n");
else
{
printf("-");
reverse(-num);
}
}
return 0;
}
void reverse(int num)
{
int a;
while(num>0)
{
if(num%10==0)
{
num/=10;
}
else
break;
}
while(num>0)
{
printf("%d",num%10);
num/=10;
}
printf("\n");
} | 44 |
21,636 |
int reverse(int num);
int branch(int e);
int main()
{
int A[6],i;
for (i=0;i<6;i++)
{
scanf("%d",&A[i]);
}
for (i=0;i<6;i++)
{
int v=reverse(A[i]);
printf("%d\n",v);
}
return 0;
}
int reverse(int num){
int c;
if (num == 0)
{
c=num;
}
if (num <0)
{
int d=abs(num);
c= -branch(d);
}
if (num >0)
{
c= branch(num);
}
return c;
}
int branch(int e){
int reversenum=0,standard=e;
for(;e>0;)
{
reversenum=10*reversenum+e%10;
e=e/10;
}
return reversenum;
}
| 44 |
21,637 | void main()
{
int reverse(int num);
int a[6];
int i;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
reverse(a[i]);
}
int reverse(int num)
{
int z,b,h,n,t,m,l;
b=abs(num);
if(b>=0&&b<10)
z=b;
else if(b>=10&&b<100)
{
l=b/10;
n=b-l*10;
z=n*10+l;
}
else if(b>=100&&b<1000)
{
h=b/100;
l=(b-h*100)/10;
n=b-h*100-l*10;
z=n*100+l*10+h;
}
else if(b>=1000&&b<10000)
{
t=b/1000;
h=(b-t*1000)/100;
l=(b-t*1000-h*100)/10;
n=b-t*1000-h*100-l*10;
z=n*1000+l*100+h*10+t;
}
else
{
m=b/10000;
t=(b-m*10000)/1000;
h=(b-m*10000-t*1000)/100;
l=(b-m*10000-t*1000-l*100)/10;
n=b-m*10000-t*1000-h*100-l*10;
z=n*10000+l*1000+h*100+t*10+m;
}
if(num>=0) z=z;
else z=-z;
printf("%d\n",z);
return(z);
}
| 44 |
21,638 | int reverse(int num);
int main()
{
int n;
while (cin >>n)
{
if (n<0) {cout <<"-";n=-n;}
while (n%10==0&&n!=0)
n=n/10;
reverse(n);
}
return 0;
}
int reverse(int num)
{
cout <<num%10;
if (num/10!=0)
reverse(num/10);
else cout <<endl;
return 0;
} | 44 |
21,639 | int main()
{
void reverse(int num);//????
int num;
for(int i=0;i<6;i++)//????
{
cin>>num;
reverse( num );//????
cout<<endl;
}
cin.get();cin.get();
return 0;
}
void reverse(int num)//??????????????int reverse(int num)?
{
void fan( int num );//????
double flag=1,weishu=0,reverse=0;
if( num < 0 )//???????
{
num=-num;
cout<<'-';
}
for(;;)//?????0
{
if(num%10 == 0)num/=10;
else break;
}
fan( num );//????????
}
void fan( int num )
{
cout<<num%10;
if( num / 10 != 0 )fan( num / 10 );//????
} | 44 |
21,640 | void main()
{
char a[6][50]={0},(*p)[50],*q;
int n,b[6]={0},*w;
for(p=a;p<a+6;p++)
{
gets(p);
}
for(p=a,w=b;p<a+6;p++,w++)
{
n=strlen(p);
if(**p=='-')
{
for(q=*p+n-1;q>*p;q--)
*w=(*w)*10+(*q-'0');
*w=-*w;
}
else
for(q=*p+n-1;q>=*p;q--)
*w=(*w)*10+(*q-'0');
}
for(w=b;w<b+6;w++)
printf("%d\n",*w);
} | 44 |
21,641 | int main()
{
int reverse(int num);
int i,in[6],out[6];
for(i=0;i<6;i++){
cin>>in[i];
out[i]=reverse(in[i]);
}
for(i=0;i<6;i++)
cout<<out[i]<<endl;
return 0;
}
int reverse(int num)
{
int input,output[100],result=0,i,n1,n2,p;
//if(num<0){
// input=-num;
// p=0;}
//else{
input=num;
// p=1;}
for(i=0;i<100;i++){
if(input!=0){
output[i]=input%10;
input=input/10;
}
else break;
}
n1=i;
for(i=0;i<n1;i++){
if(output[i]!=0)
break;}
n2=i;
for(i=n2;i<n1;i++)
result=result+output[i]*pow(10.0,n1-1-i);
//if(p=0)
// result=0-result;
//else
// result=result;
return result;
}
| 44 |
21,642 | int fxs(int x)
{
int i;
int y=0;
for(i=10;x!=0;)
{
y=y*10+x%i;
x=x/i;
}
return y;
}
main()
{
for(int i=1;i<=6;i++)
{
int a,b;
scanf("%d",&a);
b=fxs(a);
printf("%d\n",b);
}
}
| 44 |
21,643 | int main()
{
int bianxu(int x);
int x,t=6,i=0;
for(i;i<t;i++)
{
scanf("%d",&x);
if(x>0)
printf("%d\n",bianxu(x));
if(x<0)
printf("-%d\n",bianxu((-x)));
if(x==0)
printf("0\n");
}
}
int bianxu(int x)
{int i,r=0,m;
char a[100]={0};
for(i=0;x!=0;i++)
{
a[i]=x%10;
x=x/10;r++;
}
for(i=0;i<r/2;i++)
{m=a[i];
a[i]=a[r-1-i];
a[r-1-i]=m;
}m=0;
for(i=r-1;a[i]==0;i--)
{
m++;
}
for(i=r-m-1;i>=0;i--)
{
x*=10;
x+=a[i];
}
return x;
}
| 44 |
21,644 | 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 |
21,645 | int reverse(int num);
int i,a[6];
int main(){
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]);
}
return 0;
}
int reverse(int num){
int a=0,b=0,c=0,d=0,e=0,t;
t=num;
if(num<0)
num=-num;
a=num/10000;
b=num/1000-10*a;
c=num/100-100*a-10*b;
d=num/10-1000*a-100*b-10*c;
e=num-10000*a-1000*b-100*c-10*d;
if(a==0){
if(b!=0){
num=b+10*c+100*d+e*1000;
}
else{
if(c!=0)
num=c+10*d+100*e;
else{
if(d!=0)
num=10*e+d;
else
num=e;
}
}
}
else
num=100*c+10*b+a+10000*e+1000*d;
if(t>=0)
return(num);
if(t<0)
return(-num);
} | 44 |
21,646 | void fy(char c[])
{
long s=0,i=0,t=1;
if(c[0]=='-'&&c[1]!='0')
{printf("-");
i++;}
for(i=i;c[i]!='\0'; i++)
{
s=s+(c[i]-'0')*t;
t=t*10;
}
printf("%d\n",s);
}
int main()
{
int k;
char a[1000];
for(k=0;k<6;k++)
{
scanf("%s",a);
fy(a);
}
return 0;
}
| 44 |
21,647 | int reverse(int n);
void main()
{
int i,c[6],d[6],x;
for(i=0;i<6;i++)
scanf("%d",&c[i]);
for(i=0;i<6;i++)
{
x=c[i];
d[i]=reverse(x);
printf("%d\n",d[i]);
}
}
int reverse(int n)
{
int m,a[32],x,i,j,b;
if(n==0)
m=0;
else
{
i=0;
j=0;
while(n!=0)
{
b=n/10;
a[i]=n%10;
n=b;
i++;
j++;
}
x=0;
i=0;
while(j!=0)
{
x=x*10+a[i];
j--;
i++;
}
m=x;
}
return(m);
} | 44 |
21,648 | 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 |
21,649 | 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 |
21,650 | int reverse(int n)
{
int i,a=n,b,j,c=n%10;
for(i=0;;i++)
{
a=a/10;
if(a/10==0)
break;
}
for(j=0;j<=i;j++)
c=c*10;
if(n/10!=0)
b=reverse(n/10)+c;
else
b=n;
return b;
}
int main()
{
int n,b;
while(cin>>n)
{
b=reverse(n);
cout<<b<<endl;
}
return 0;
} | 44 |
21,651 | void fan(int a); //??????
int main()
{
int i,a;
for(i=1;i<=6;i++) //????
{cin>>a;if(a>=0)fan(a);
else a=-a,cout<<"-",fan(a);}//????
}
void fan(int a)
{int j=1;
if(a>0)
{ while(a!=0)
{ if(a%10||(a%10==0&&j!=1))
cout<<a%10,j++;
a=a/10;
if(a%10!=0)
j++;
}cout<<endl;}
if(a=0)
cout<<"0"<<endl;
} | 44 |
21,652 | 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 |
21,653 | main()
{
int i,l,b,j,k,x;
char c[6][1000],a[6][1000];
for(i=0;i<=5;i++)
scanf("%s",c[i]);
for(i=0;i<=5;i++)
{
l=strlen(c[i]);
if(l==1)
{
a[i][0]=c[i][0];
a[i][1]='\0';
}
else if(c[i][0]<'0'||c[i][0]>'9')
{
b=1;
if(l==2&&c[i][1]=='0')
{
a[i][0]='0';
a[i][1]='\0';
}
else
a[i][0]=c[i][0];
}
else
b=0;
for(j=l-1;j>=b;j--)
{
a[i][b]=c[i][j];
if(a[i][b]!='0')
break;
}
x=b+1;
for(k=j-1;k>=b;k--)
{
a[i][x]=c[i][k];
x++;
}
a[i][j+1]='\0';
if(i==0)
printf("%s",a[i]);
else
printf("\n%s",a[i]);
}
getchar();
getchar();
}
| 44 |
21,654 | int reverse(int num)
{
int a1=0,p=0,sign=0;
int i,j=1,k=1,temp;
if(num<0) //?????
{
sign=1;
num=-num;
}
for(i=0;i<20;i++) //????
{
if(num/j==0)break;
else
{
p++;
j=j*10;
}
}
j=1;
for(i=1;i<p;i++) //j?1?k?10?p????
k=k*10;
for(i=0;i<p;i++) //????????????
{
a1=a1+num/k*j;
temp=num/k;
num=num-temp*k;
j=j*10;
k=k/10;
}
if(sign==1) //?????
a1=-a1;
return a1;
}
int main()
{
int a[6];
int i;
for(i=0;i<6;i++)
cin>>a[i];
for(i=0;i<6;i++) //??????
cout<<reverse(a[i])<<endl;
return 0;
} | 44 |
21,655 | /* Note:Your choice is C IDE */
int reverse(int num)
{
int a[10],i,c=0,k=0,h=1;
if(num>0)
{
for(i=1;i<=9;i++)
{
k=k+1;
a[i]=num%10;
num=num/10;
if(num==0) break;
}
for(i=k;i>=1;i--)
{
c=c+a[i]*h;
h=h*10;
}
}
else { if(num==0) c=0;
else {
num=(-1)*num;
for(i=1;i<=9;i++)
{
k=k+1;
a[i]=num%10;
num=num/10;
if(num==0) break;
}
for(i=k;i>=1;i--)
{
c=c+a[i]*h;
h=h*10;
}
c=(-1)*c;
}
}
return c;
}
int main()
{
int reverse(int num);
int a[7],n,i;
for(i=1;i<=6;i++)
{
scanf("%d",&a[i]);
}
printf("%d",reverse(a[1]));
for(i=2;i<=6;i++)
{
printf("\n%d",reverse(a[i]));
}
return 0;
} | 44 |
21,656 |
int main()
{
int fan(int x);
int k,z,b;
for(k=1;k<7;k++){
scanf("%d",&z);
b=fan(z);
printf("%d\n",b);
}
return 0;
}
int fan(int x){
int y=0,ne=0,j;
int wei[1000];
double i;
if(x==0){
y=0;
}
else{
if(x<0){
ne=1;
x=0-x;
}
for(i=1;(x>=pow(10,i));i++){
}
for(j=0;j<i;j++){
wei[j]=x%10;
x=x/10;
}
for((i=i-1,j=0);i>=0;(i--,j++)){
y +=wei[j]*pow(10,i);
}
if(ne==1){
y=0-y;
}
}
return y;
} | 44 |
21,657 | int cifang(int n)
{
int i,t=1;
for(i=0;i<n;i++)
t=t*10;
return t;
}
int reverse(int num)
{
int i,j,k,count=0;
int a[100];
for(i=0;i<100;i++)
a[i]=0;
for(i=0;num!=0;i++)
{
a[i]=(num%cifang(i+1))/cifang(i);
num=num-a[i]*cifang(i);
count++;
}
int total=0;
for(i=0;i<count;i++)
{
total=total+a[i]*cifang(count-i-1);
}
return total;
}
main()
{
int k,i;
for(i=6;i>0;i--)
{
scanf("%d",&k);
printf("%d\n",reverse(k));
}
getchar();
getchar();
}
| 44 |
21,658 | int main()
{
int i,a[6],b[6];
int reverse(int n);
for(i=0;i<6;i++){
scanf("%d",&a[i]);
}
for(i=0;i<6;i++){
b[i]=reverse(a[i]);
}
for(i=0;i<6;i++){
printf("%d\n",b[i]);
}
scanf("%d",&i);
return 0;
}
int reverse(int n)
{
int d[50],j,k,m;
j=0;
if(n>0){
while(n>=10){
d[j]=n%10;
n=(n-d[j])/10;
j++;
}
d[j]=n;
m=0;
for(k=0;k<=j;k++){
m=m+d[k]*pow(10,j-k);
}
}
if(n==0){
m=0;
}
if(n<0){
j=0;
while(n<=-10){
d[j]=n%10;
n=(n-d[j])/10;
j++;
}
d[j]=n;
m=0;
for(k=0;k<=j;k++){
m=m+d[k]*pow(10,j-k);
}
}
return m;
} | 44 |
21,659 | 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 |
21,660 | int main()
{
int reserve(int num);
int num;
int b;
int a[6],i;
for(i=0;i<=5;i++)
{
scanf("%d",&a[i]);
num=a[i];
b=reserve(num);
printf("%d\n",b);
}
}
int reserve(int num)
{
int c,j,n=0,s=0;
c=num;
do
{
c=c/10;
n++;
}
while(c!=0);
for(j=1;j<=n;j++)
{
c=num;
c=c/(pow(10,(j-1)));
c=c%10;
s=s+c*pow(10,(n-j));
}
return(s);
}
| 44 |
21,661 | void echo(int n);
int main()
{
int i,a[10];
for(i=0;i<6;i++)
{
cin>>a[i];
while(a[i]%10==0)a[i]=a[i]/10;
if(a[i]>=0)
echo(a[i]);
if(a[i]<0)
{
cout<<"-";
echo(-a[i]);
}
cout<<endl;
}
return 0;
}
void echo(int n)
{
cout<<n%10;
n=n/10;
if(n>0)
echo(n);
} | 44 |
21,662 | 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 |
21,663 |
int r(int a, int b)
{
int i,j;
if(a<10)
{
return (b+a);
}
int sum=1;
for(i=1;;i++)
{
if(sum>a)
{
break;}
sum*=10;
}
b+=(a%10)*(sum/10);
return (r(a/10,b));
}
int main()
{
int a;
int i;
for(i=0;i<6;i++)
{
scanf("%d",&a);
if(a<0)
{
a=-a;
printf ("%d\n",-r(a,0));
}
else
{
printf ("%d\n",r(a,0));
}
}
return 0;
}
| 44 |
21,664 | 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[k]=c[k]*10;
}
for(k=1;k<=i;k++)
w=w+c[k];
return(w);
}
main()
{
int a[6],i,d;
for(i=0;i<=5;i++)
scanf("%d",&a[i]);
for(i=0;i<=5;i++)
{
if(a[i]>0)
{
d=reverse(a[i]);
printf("%d\n",d);
}
else if(a[i]==0)
printf("0\n");
else
{
d=-reverse(-a[i]);
printf("%d\n",d);
}
}
getchar();
getchar();
getchar();
getchar();
}
| 44 |
21,665 | 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 |
21,666 | 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 |
21,667 | int reverse(int num);
void main()
{
int num[5],i;
for (i=0;i<=5;i++)
scanf("%d",&num[i]);
for (i=0;i<=5;i++)
printf("%d\n",reverse(num[i]));
}
int reverse(int num)
{
int a=0,a1,a2,a3,a4,a5,a6;
a1=num/100000;
a2=(num-num/100000*100000)/10000;
a3=(num-num/10000*10000)/1000;
a4=(num-num/1000*1000)/100;
a5=(num-num/100*100)/10;
a6=num-num/10*10;
a=a1+a2*10+a3*100+a4*1000+a5*10000+a6*100000;
if(a%100000==0) a=a/100000;
else if(a%10000==0) a=a/10000;
else if(a%1000==0) a=a/1000;
else if(a%100==0) a=a/100;
else if(a%10==0) a=a/10;
return a;
}
| 44 |
21,668 | int fanxushu(int x)
{
long j,a,shuzu[10];
int k,l;
a=abs(x);
for(j=0;j<10;j++){
shuzu[j]=(a%(long)pow(10,j+1))/(long)pow(10,j);
}
for(j=0;j<10;j++){
if(shuzu[j]!=0){
k=j;
break;
}
}
for(j=9;j>=0;j--){
if(shuzu[j]!=0){
l=j;
break;
}
}
for(j=0;;j++){
printf("%d",shuzu[k+j]);
if(k+j==l){
break;
}
}
return 0;
}
int main()
{
int i,shuru;
for(i=0;i<6;i++){
scanf("%d",&shuru);
if(shuru==0){
printf("0\n");
}
if(shuru>0){
fanxushu(shuru);
printf("\n");
}
if(shuru<0){
printf("-");
fanxushu(shuru);
printf("\n");
}
}
return 0;
}
| 44 |
21,669 | int MI(int x)
{
int a,mul=1;
for(a=0;a<x;a++)
{
mul=mul*10;
}
return mul;
}
int reverse(int num)
{
int a=1,count,i,n,plus=0,c=2,remove;
for(count=0;a!=0;count++)
{
a=num/MI(count);
}
for(i=1;i<=count-1;i++)
{
a=num/MI(count-c);
plus=plus+a*MI(i-1);
num=num-a*MI(count-c);
c++;
}
return plus;
}
main()
{
int n[10001],answer[7],i;
for(i=1;i<=6;i++)
{
scanf("%ld",&n[i-1]);
answer[i-1]=reverse(n[i-1]);
}
for(i=1;i<=6;i++)
printf("%ld\n",answer[i-1]);
getchar();
getchar();
}
| 44 |
21,670 | void main ( )
{
void doc(char b[20]);
char a[6][20],c[20];
int i,j;
for(i=0;i<6;i++)
{
for(j=0;j<20;j++)
a[i][j]='0';
gets(a[i]);
}
for(i=0;i<6;i++)
{
if(a[i][0]=='0')
printf("0\n");
else
if(a[i][0]=='-' && a[i][1]=='0')
printf("-0\n");
else
if(a[i][0]=='-')
{
for(j=0;j<19;j++)
c[j]=a[i][j+1];
c[20]='0';
printf("-");
doc(c);
printf("\n");
}
else
{
for(j=0;j<20;j++)
c[j]=a[i][j];
doc(c);
printf("\n");
}
}
}
void doc(char b[20])
{
char *p;
p=b;
p=p+19;
while(*p=='\0' || *p=='0')
{
p=p-1;
if(*p!='0' && *p!='\0')
break;
}
for(p=p;p>=b;p--)
printf("%c",*p);
}
| 44 |
21,671 |
void main()
{
int reverse(int num);
int num=0;
scanf("%d",&num);
printf("%d\n", reverse(num));
scanf("%d",&num);
printf("%d\n", reverse(num));
scanf("%d",&num);
printf("%d\n", reverse(num));
scanf("%d",&num);
printf("%d\n", reverse(num));
scanf("%d",&num);
printf("%d\n", reverse(num));
scanf("%d",&num);
printf("%d\n", reverse(num));
}
int reverse (int num)
{
int r=0,flag=0;
if (num==0) r=0;
else
{
switch (num/abs(num))
{
case -1: num=num*(-1);flag=1;
case 1: while(num)
{
r=r*10+num%10;
num=num/10;
}
}
if (flag==1) r=r*(-1);
}
/*
?????num???????r=0?flag=0???switch???
[1](num=0) r=0,break??
[2](num<0) ?num?-1?flag=1????break????[3]????
[3](num>0)
?while???????????num??0?
r=r*10+num%10;
num=num/10;
??switch????flag???0??????r??-1?
*/
return(r);
} | 44 |
21,672 | void main()
{
int reverse(int x);
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 x)
{
int wang,qian,bai,shi,ge;
wang=x/10000;
qian=(x-10000*wang)/1000;
bai=(x-10000*wang-1000*qian)/100;
shi=(x-10000*wang-1000*qian-100*bai)/10;
ge=x-10000*wang-1000*qian-100*bai-10*shi;
if(wang!=0)
return(10000*ge+1000*shi+100*bai+10*qian+wang);
else if(qian!=0)
return(1000*ge+100*shi+10*bai+qian);
else if(bai!=0)
return(100*ge+10*shi+bai);
else if(shi!=0)
return(10*ge+shi);
else
return(ge);
}
| 44 |
21,673 | void make(int k,int x)
{
if (x==0) return;
int y;
y=x%10;
if (k==0)
{
if (y!=0)
{
printf("%d",y);
make(1,x/10);
}
else make(0,x/10);
}
else
{
printf("%d",y);
make(1,x/10);
}
}
int main()
{
int i,x,j,l,n,t,a[100],m;
for (i=1;i<=6;i++)
{
scanf("%d",&n);
if (n==0)
{
printf("0\n");
continue;
}
if (n<0) printf("-");
if (n<0) make(0,-n); else make(0,n);
printf("\n");
}
} | 44 |
21,674 | int reverse(int num); //?????
int main()
{
int a[7]; //????????
int i=0;
for(i=1;i<=6;i++)
{
cin>>a[i];
a[i]=reverse(a[i]); //????????
}
for(i=1;i<=6;i++)
{
cout<<a[i]<<endl; //?????
}
return 0;
}
int reverse(int num) //??????
{
int n=0,j=0,t;
int shuzi[100];
for(j=1;j<100;j++)
{
shuzi[j]=0;
}
if(num>0)
{
t=num;
while(num!=0) //?????
{
num=num/10;
n++;
}
num=t;
for(j=1;j<=n;j++) //?????
{
shuzi[j]=num%10;
num=num/10;
}
for(j=1;j<=n;j++) //?????
{
num=shuzi[j]+num*10;
}
}
if(num<0)
{
t=num;
while(num!=0)
{
num=num/10;
n++;
}
num=-t;
for(j=1;j<=n;j++)
{
shuzi[j]=num%10;
num=num/10;
}
for(j=1;j<=n;j++)
{
num=shuzi[j]+num*10;
}
num=(-1)*num;
}
return num;
} | 44 |
21,675 | main()
{
int reverse(int num);
int a[6],i;
for(i=0;i<=5;i++)
scanf("%d",&a[i]);
for(i=0;i<=5;i++)
{
if(i==0)
printf("%d",reverse(a[i]));
else
printf("\n%d",reverse(a[i]));
}
getchar();
getchar();
}
int reverse(int num)
{
int a=num,x,b=0;
for(;a!=0;)
{
x=a%10;
a=a/10;
b=x+b*10;
}
return(b);
}
| 44 |
21,676 | void main()
{
int reverse(int num);
int a1,a2,a3,a4,a5,a6;
scanf("%d%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5,&a6);
printf("%d\n%d\n%d\n%d\n%d\n%d\n",reverse(a1),reverse(a2),reverse(a3),reverse(a4),reverse(a5),reverse(a6));
}
int reverse(int num)
{
int mun,p1,p2,p3,p4,p5;
if(fabs(num)<10) mun=num;
else if(fabs(num)>=10&&fabs(num)<100) p1=num/10,p2=num-p1*10,mun=p2*10+p1;
else if(fabs(num)>=100&&fabs(num)<1000) p1=num/100,p2=(num-p1*100)/10,p3=num-p1*100-p2*10,mun=p3*100+p2*10+p1;
else if(fabs(num)>=1000&&fabs(num)<10000) p1=num/1000,p2=(num-p1*1000)/100,p3=(num-p1*1000-p2*100)/10,p4=num-p1*1000-p2*100-p3*10,mun=p4*1000+p3*100+p2*10+p1;
else if(fabs(num)>=10000) p1=num/10000,p2=(num-p1*10000)/1000,p3=(num-p1*10000-p2*1000)/100,p4=(num-p1*10000-p2*1000-p3*100)/10,p5=num-p1*10000-p2*1000-p3*100-p4*10,mun=p5*10000+p4*1000+p3*100+p2*10+p1;
return(mun);
} | 44 |
21,677 | int f(int x){
int a,c;
if(x<10)
return x;
c=10;
while(c<=x)
c=c*10;
c=c/10;
a=x%10;
a=f(x/10)+a*c;
return a;
}
int main(){
int n,i,sig,ans;
for(i=0;i<6;i++){
scanf("%d",&n);
if(n>=0)
sig=0;
else{
n=-n;
sig=1;
}
ans=f(n);
if(sig==1)
ans=-ans;
printf("%d\n",ans);
}
return 0;
}
| 44 |
21,678 | void main()
{
int a[6],i,ans=0;
char d='-';
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
{ ans=0;
if(a[i]==0) printf("%d\n",0);
if(a[i]<0)
{
a[i]=a[i]*(-1);
printf("%c",d);
while(a[i])
{
ans*=10;
ans=a[i]%10+ans;
a[i]/=10;
}
printf("%d\n",ans);
}
if(a[i]>0)
{
while(a[i])
{
ans*=10;
ans=a[i]%10+ans;
a[i]/=10;
}
printf("%d\n",ans);
}
}
} | 44 |
21,679 | int back(int a)
{
int b=abs(a),m=0,r=0;
int i=0;
if(a<0)
{
a=-a;
r=1;
}
while(b>0)
{
b/=10;
i++;
}
while(a>0)
{
i--;
m=a%10;
b+=m*pow((double)10,(double)i);
a/=10;
}
if(r==1)
b=-b;
return b;
}
int main()
{
int a;
for(int i=1;i<=6;i++)
{
cin>>a;
cout<<back(a)<<endl;
}
return 0;
} | 44 |
21,680 | int re(int *a)
{
int i,h,g,f=1,n=0;
if(*a<0){f=-1;*a*=-1;}else if(*a==0)return 0;
for(h=1;*a+0.1>pow(10,h);h++);
g=h;
for(i=0;i<h;i++)
{ if(g==1)n+=*a;
else n+=(*a%10)*pow(10,--g);
*a=(*a-*a%10)/10;
}
return (f*n);
}
void main()
{
int i,a[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
printf("%d\n",re(a+i));
}
}
| 44 |
21,681 | int reverse(int u){
int a[33]={0};
int j,k;
int x=0;
for(j=0;u>0;j++){
a[j]=u%10;
u=u/10;
}
for(k=0;k<j;k++){
x=x*10+a[k];
}
return x;
}
int main(){
int n,b;
int i;
for(i=0;i<6;i++){
scanf("%d",&n);
if(i!=0){
printf("\n");
}
if(n<0){
printf("-");
n=-n;
}
b=reverse(n);
printf("%d",b);
}
return 0;
}
| 44 |
21,682 | int main()
{
int reverse(int num);
int a[6],b[6],i;
for(i=0;i<6;i++)
{scanf("%d",&a[i]);
b[i] = reverse(a[i]);}
for(i=0;i<6;i++)
printf("%d\n",b[i]);
getchar();
getchar();
}
int reverse(int num)
{
int a[100],i,j,z=0,b=1;
for(i=0;;i++)
{a[i]=num%10;
num=num/10;
if(num==0)
break;}
for(j=i;j>=0;j--)
{z= z+a[j]*b ;
b=b*10;
}
return(z);
} | 44 |
21,683 | 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 |
21,684 |
int reverse(int a)
{
int c=0;
while(a)
{
c=c*10+a%10;
a=a/10;
}
return c;
}
main()
{
int a,i;
for(i=0;i<6;i++)
{
scanf("%d",&a);
printf("%d\n",reverse(a));
}
} | 44 |
21,685 | int reverse(int num){
int sz[100];
int i=0;
int num1;
num1=abs(num);
while(num1>=10){
sz[i]=num1%10;
num1=num1/10;
i++;
}
sz[i]=num1;
int n=i;
num1=0;
for(i=0;i<=n;i++){
num1=num1+sz[i]*pow(10,n-i);
}
if(num==0){
return 0;
}else if(num>0){
return num1;
}else if(num<0){
return 0-num1;
}
}
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 |
21,686 | 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 |
21,687 | int f=0;
void reserve(int num)
{
if((num%10)!=0){
cout<<num%10;f = 1;
}
if(num%10==0&&f==1)
{
cout<<"0";
}
if(num/10 >0)
reserve(num/10);
}
int main()
{
int i,num;
for(i=0;i<6;i++)
{
f=0;
cin>>num;
if(num<0){
num=0-num;
cout<<"-";
}
reserve(num);
cout<<endl;
}
return 0;
}
| 44 |
21,688 | 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 |
21,689 | int main()
{
int a;
int reverse(int num); //????
for(int i=0;i<6;i++)
{
cin>>a;
cout<<reverse(a)<<endl;
}
cin.get();
return 0;
}
int reverse(int num) //????????
{
int b=0;
if(num<0)
{
num*=-1; //????????
while(num>0) {b=10*b+num%10;num/=10;}
b*=-1;
}
else if(num>0)
{
while(num>0) {b=10*b+num%10;num/=10;}
}
return b;
}
| 44 |
21,690 | 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 x,m,i,s,t,yu,j;
if(num==0) return 0;
else{
if(num>0){
x=num;
s=2;
t=0;
while(1)
{
if(num%10==0) {num=num/10;t++;}
else
break;
}
while(1)
{
if(x/10>9) {s=s+1;x=x/10;}
else
{break;}
}
s=s-t;
if(s==1) return num;
else{
int result=0;
for(i=1;i<=s-1;i++)
{
yu=num%10;
num=num/10;
for(j=1;j<=s-i;j++)
yu=yu*10;
result=result+yu;
}
result=result+num;
return result;
}
}
if(num<0)
{
printf("-");
num=-num;
x=num;
s=2;
t=0;
while(1)
{
if(num%10==0) {num=num/10;t++;}
else
break;
}
while(1)
{
if(x/10>9) {s=s+1;x=x/10;}
else
{break;}
}
s=s-t;
if(s==1) return num;
else{
int result=0;
for(i=1;i<=s-1;i++)
{
yu=num%10;
num=num/10;
for(j=1;j<=s-i;j++)
yu=yu*10;
result=result+yu;
}
result=result+num;
return result;
}
}
}
} | 44 |
21,691 | //********************************
//* ????2.cpp *
//* ?? 1000012747 *
//* ???????? *
//********************************
int reverse(int x) //?????????????
{
int b[10],i,j,c=0; //????b?????????i,j??????c??????
for(i=0;i<10;i++)
{
b[i]=x%10;
x=x/10;
if (x<10)
{
b[i+1]=x;
break;
}
} //??????????
j=0;
while(b[j]==0)
j++; //??????0?????
for(;j<i+2;j++)
c=c+b[j]*(pow(10.0,i+1-j)); //??c??
return(c);
}
int main()
{
int a,n=6,c; //??????a?n=6????6???c??????
while (n>0)
{
cin>>a;
if(a==0)
cout<<0<<endl;
else if(a<0)
{
a=0-a; //a<0?????
c=reverse(a);
cout<<"-"<<c<<endl;
}
else
{
c=reverse(a);
cout<<c<<endl;
}
n--;
}
return 0;
} | 44 |
21,692 | int reverse(int num){
int fz,w,g,k,t,a;
fz=0;
w=0;
if(num<=0){
t=-1;
num=-num;}
else{t=1;}
a=num;
while(num/10>=1){
w=w+1;
num=num/10;
}
num=a;
for(k=0;k<=w;k++){
g=pow(10,w-k);
fz=fz+(num%10)*g;
num=num/10;
}
return t*fz;
}
int main(){
int m,i;
for(i=0;i<6;i++){
scanf("%d",&m);
printf("%d\n",reverse(m));
}
return 0;
} | 44 |
21,693 | void reverse(int a)
{
if(a==0)
printf("0\n");
else
{
if(a<0)
{
printf("-");
a=-a;
}
int i=10000000;
int j,x[100000];
int t=0;
int y=0;
for(j=0;i>=1;j++)
{
x[j]=a/i;
if(x[j]!=0&&y==0)
y=j;
a=a-x[j]*i;
i=i/10;
}
j=j-1;
for(t=j;;t--)
{
if(x[t]!=0)
break;
}
for(j=t;j>=y;j--)
{
printf("%d",x[j]);
}
printf("\n");
}
}
main()
{
int a[6],i;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
reverse(a[i]);
}
| 44 |
21,694 | int num,s;
int reverse(int num)
{
s=0;
while(num!=0)
{
s=s*10+num-((int)(num/10))*10;
num=num/10;
}
return s;
}
main()
{
int x;
for(int i=1;i<=6;i++)
{
scanf("%d",&x);
if(x>=0)
printf("%d\n",reverse(x));
if(x<0)
{x=(-1)*x;printf("%d\n",(-1)*reverse(x));}
}
getchar();getchar();getchar();getchar();getchar();getchar();
}
| 44 |
21,695 | int mi(int s)
{
int sum=1,i;
for(i=1;i<=s;i++)
sum=sum*10;
return sum;
}
int reserve(int n)
{
int a[100]={0},i,j;
for(i=0;;i++)
{
a[i]=n%10;
n=n/10;
if(n==0) break;
}
for(j=0;i>=0;i--)
{
n=n+a[i]*mi(j);
j++;
}
return n;
}
int main()
{
int i,num;
for(i=1;i<=6;i++)
{
cin>>num;
cout<<reserve(num)<<endl;
}
return 0;
}
| 44 |
21,696 | int main()
{
int reverse(int num);
int a[6][1];
int i,l=0;
for(i=0;i<6;i++)
{
scanf("%d",&a[i][0]);
l=reverse(a[i][0]);
printf("%d\n",l);
}
return 0;
}
int reverse(int num)
{ int a=0,b=0,c=0,p=0,q=0,d=0,e=0,k=0;
k=abs(num);
e=k/10000;
a=(k/1000)%10;
b=k%10;
c=(k/10)%10;
d=(k/100)%10;
if(e!=0)
p=b*10000+c*1000+d*100+a*10+e;
if(e==0&&a!=0)
p=b*1000+c*100+d*10+a;
if(e==0&&a==0&&d!=0)
p=b*100+c*10+d;
if(e==0&&a==0&&d==0&&c!=0)
p=b*10+c;
if(e==0&&a==0&&d==0&&c==0)
p=b;
if(num>0)
q=p;
if(num<0)
q=-p;
return q;
} | 44 |
21,697 | int main(int argc, char* argv[])
{
int i,n,a[6][2];
int reverse(int n);
for(i=0;i<6;i++){
scanf("%d",&n);
a[i][0]=n;
}
for(i=0;i<6;i++){
a[i][1]=reverse(a[i][0]);
}
for(i=0;i<6;i++){
printf("%d\n",a[i][1]);
}
return 0;
}
int reverse(int n)
{
int a,b,c,d,e;
if(n>=-9&&n<=9){
return (n);}
if(n>=10&&n<=99){
a=n/10;
b=n%10;
return(a+b*10);
}
if(n>=-99&&n<=-10){
a=(-n)/10;
b=(-n)%10;
return(-(a+b*10));
}
if(n>=100&&n<=999){
a=n/100;
b=(n-100*a)/10;
c=n%10;
return(c*100+b*10+a);
}
if(n>=-999&&n<=-100){
a=(-n)/100;
b=((-n)-100*a)/10;
c=(-n)%10;
return(-(c*100+b*10+a));
}
if(n>=1000&&n<=9999){
a=n/1000;
b=(n-1000*a)/100;
c=(n-1000*a-100*b)/10;
d=n%10;
return(d*1000+c*100+b*10+a);
}
if(n>=-9999&&n<=-1000){
n=abs(n);
a=n/1000;
b=(n-1000*a)/100;
c=(n-1000*a-100*b)/10;
d=n%10;
return(-(d*1000+c*100+b*10+a));
}
if(n>=10000&&n<=99999){
a=n/10000;
b=(n-10000*a)/1000;
c=(n-10000*a-1000*b)/100;
d=(n-10000*a-1000*b-100*c)/10;
e=n%10;
return(e*10000+d*1000+c*100+b*10+a);
}
if(n>=-99999&&n<=-10000){
a=(-n)/10000;
b=((-n)-10000*a)/1000;
c=((-n)-10000*a-1000*b)/100;
d=((-n)-10000*a-1000*b-100*c)/10;
e=(-n)%10;
return(-(10000*e+1000*d+100*c+10*b+a));
}
} | 44 |
21,698 | int reverse(int num);
void main()
{
int a[6],i,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]);
}
}
int reverse(int num)
{
int s=0,i,j,k=0,t;
if(num<0)
{
num=0-num;
k=1;
}
for(i=0;;i++)
{
t=pow(10,i);
if((num%t)==num)
break;
}
for(j=0;j<i;j++)
{
s+=(num%10)*pow(10,i-j-1);
num=(num-num%10)/10;
}
if(k)
return -s;
else
return s;
}
| 44 |
21,699 | int reverse(int num)
{
int result=0;
int number[100]={0};int k=0; int i=0,j=0;
if(num>=0)
{
for(i=0;num>=0;i++)
{
k=num/10;
number[i]=num-10*k;
num=k;
if(num==0) break;
}
for(j=0;j<=i;j++)
result=result+number[j]*pow(10.0,i-j);
}
else
{
num=-num;
for(i=0;num>=0;i++)
{
k=num/10;
number[i]=num-10*k;
num=k;
if(num==0) break;
}
for(j=0;j<=i;j++)
result=result+number[j]*pow(10.0,i-j);
result=-result;
}
return result;
}
int main()
{
int num=0;
while(cin>>num)
{
cout<<reverse(num)<<endl;
}
return 0;
}
| 44 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.