label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
44 | 21500 | 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 | 21501 | int inverse(int a)
{int i=0,b=0,c=0;
do
{
if(a<0){c=1;a=fabs(a);}
b=b*10+a%10;
a/=10;
i++;
}
while(a>0);
if(c==1)b=-b;
return b;
}
void main()
{
int i,num;
for(i=0;i<6;i++)
{
scanf("%d",&num);
printf("%d\n",inverse(num));
}
}
|
44 | 21502 | 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 | 21503 | int main()
{
int reverse(int num);
int i,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++)
{
printf("%d\n",b[i]);
}
return 0;
}
int reverse(int num)
{
int s=0,k;
do
{
k=num%10;
num=num/10;
s=(s+k)*10;
}
while(num!=0);
s=s/10;
return(s);
}
|
44 | 21504 | int main()
{
int a[6];
int i;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<6;i++)
fxs(a[i]);
return 0;
}
void fxs(int a)
{
int i,b=0;
int c[15]={0};
if(a<0)printf("-");
a=abs(a);
for(i=0;a>0;a=a/10,i++)
{
c[i]=a%10;
b++;
}
for(i=0;i<b;i++)
a=c[i]*pow(10,b-i-1)+a;
printf("%d\n",a);
} |
44 | 21505 | int reverse(int num)
{int x=0,y=1,i=0,j=0;int fuhao=1;int a[12];
//cin>>num;
if(num<0)fuhao=-1;
num=abs(num);
while(i<12){
if(num<pow(10,(double)i))break;
y=10*y;
i++;}
//cout<<i;
for(j=1;j<=i;j++){a[j]=num/(int)pow(10,(double)(i-j));num=num-a[j]*(int)pow(10,(double)(i-j));}
for(j=0;j<i;j++)//cout<<a[j]<<endl;
x=x+a[i-j]*pow(10,(double)(i-j-1));
//cout<<x<<endl;
x=fuhao*x;
return (x);
}
int main()
{int i=0;int num;
for(i=1;i<=6;i++)
{cin>>num;cout<<reverse(num)<<endl;}
return 0;
} |
44 | 21506 | 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 | 21507 | main()
{ int s,n,c,i;
for(i=1;i<=6;i++)
{ scanf("%d",&n);
if(n==0)
printf("0\n");
if(n>0)
{for(s=0;n!=0;)
{ c=n%10;
s=c*10+s*10;
n=n/10;
}
printf("%d\n",s/10);
}
if(n<0)
{
for(s=0,n=-n;n!=0;)
{c=n%10;
s=c*10+s*10;
n=n/10;
}
printf("-%d\n",s/10);
}
}
}
|
44 | 21508 | 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 | 21509 | 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 | 21510 | //?????
//??????
//?????
int QuLing(int num)
{
while(num%10==0)
num/=10;
return num;
}
void reverse(int num)
{
cout<<num%10;
if(num/10!=0) reverse(num/10);
else cout<<endl;
}
int main()
{
int a[6];
for(int i=0;i<6;i++)
cin>>a[i];
for(int i=0;i<6;i++)
if(a[i]>=0) reverse(QuLing(a[i]));
else
{
cout<<"-";
reverse(QuLing(-a[i]));
}
return 0;
} |
44 | 21511 | //#include<stdafx.h>
int reverse(int num)
{
int y,z=0;
if(num>0)
{
while(num>=1)
{
y=num%10;
z=10*z+y;
num=num/10;
}
}
else if(num==0) z=0;
else
{
num=-num;
while(num>=1)
{
y=num%10;
z=10*z+y;
num=num/10;
}
z=-z;
}
return z;
}
void main()
{
int a[6],i;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
printf("%d\n",reverse(a[i]));
}
} |
44 | 21512 | 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 | 21513 | int main()
{
void dx ( char str[]);
int j;
char str[100];
for(j=1;j<=6;j++)
{
cin.get(str,100,'\n');
dx (str);
getchar();
}
return 0;
}
void dx ( char str[])
{
int i=0;
if(str[0]=='-')
{
cout<<str[0];
for(i=strlen(str)-1;i>=1;i--)
if(str[i]==48) continue;
else break;
for(i;i>=1;i--)
cout<<str[i];
cout<<endl;
}
else
{
for(i=strlen(str)-1;i>=1;i--)
if(str[i]==48) continue;
else break;
for(i;i>=0;i--)
cout<<str[i];
cout<<endl;
}
}
|
44 | 21514 | 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 | 21515 | int f(int k)
{int p=1,y=0,j,i,q;
if(k<0)
p=-1;
k=fabs(k);
int a[5];
for(i=4;i>=0;i--)
{a[i]=k/pow(10,i);
k=k-a[i]*pow(10,i);
}
for(i=4;i>=0;i--)
if(a[i]!=0)
break;
for(j=0;j<5;j++)
if(a[j]!=0)
break;
for(q=j;q<=i;q++)
{y=a[q]*pow(10,i-q)+y;
}
y=y*p;
return(y);
}
void main()
{int i;
int a[6];
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
printf("%d\n",f(a[i]));
} |
44 | 21516 |
int main()
{
int reverse(int sum);
int sum,i;
for(i=0;i<6;i++)
{
scanf("%d",&sum);
reverse(sum);
}
return 0;
}
int reverse(int sum)
{
int yushu;
if(sum<0)
{
printf("-");
sum=-sum;
}
if(sum==0) printf("%d",sum);
yushu=sum%10;
while((yushu==0)&&(sum!=0))
{
sum=sum/10;
yushu=sum%10;
}
while(sum!=0)
{
printf("%d",yushu);
sum=(sum-yushu)/10;
yushu=sum%10;
}
printf("\n");
return 0;
} |
44 | 21517 | 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 | 21518 | 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 | 21519 | 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 | 21520 | void main()
{
int reverse(int num);
int num,i;
for(i=0;i<6;i=i+1)
{
scanf("%d",&num);
num=reverse(num);
printf("%d\n",num);
}
}
int reverse(int num)
{
int a[5];
int n,i,t,sign=1;
if(num==0)
return(num);
else
{
if(num<0)
sign=-1;
num=num*sign;
n=log10(num);
for(i=0;i<=n;i=i+1)
{
a[i]=num/pow(10,n-i);
num=num-a[i]*pow(10,n-i);
}
for(i=0;i<n/2+1;i=i+1)
{
t=a[i];
a[i]=a[n-i];
a[n-i]=t;
}
for(i=0;i<=
n;i=i+1)
{
num=num+a[i]*pow(10,n-i);
}
num=num*sign;
return num;
}
} |
44 | 21521 | 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 | 21522 | main()
{char a[6][99999];
int i,k,j,m,n,p,q;
void re(char x[99999]);
void xl(char x[99999]);
for(i=0;i<6;i++)
{scanf("%s",a[i]);re(a[i]);xl(a[i]);}
for(i=0;i<6;i++)
printf("%s\n",a[i]);
}
void re(char x[99999])
{int i,t;
int l=strlen(x);
if(strcmp(x,"-0")==0)
strcpy(x,"0");
else
{ if(x[0]=='-')
{ for(i=1;i<=(l/2);i++)
{t=x[i];x[i]=x[l-i];x[l-i]=t;}
}
else
{ for(i=0;i<(l/2);i++)
{t=x[i];x[i]=x[l-i-1];x[l-i-1]=t;}
}
}
}
void xl(char x[99999])
{int i,p;
if(strcmp(x,"0")!=0)
{if(x[0]=='-')
{for(i=1,p=0;x[i]=='0';i++)
{p++;}
for(i=p+1;x[i]!='\0';i++)
{x[i-p] = x[i];}
x[strlen(x)-p]='\0';
}
else
{for(i=0,p=0;x[i]=='0';i++)
{p++;}
for(i=p;x[i]!='\0';i++)
{x[i-p]=x[i];}
x[strlen(x)-p]='\0';
}
}
}
|
44 | 21523 | void main()
{
int p=0,s,i;
long int n,t;
for(i=0;i<6;i++)
{
scanf("%ld",&n);
if(n>0)
p=1;
else if(n<0)
{p=-1;
n=-n;}
s=0;
t=0;
do
{
s=n%10;
n=n/10;
t=t*10+s;
}
while(n!=0);
if(p>0)
printf("%ld\n",t);
else if(p<0)
printf("-%ld\n",t);
else
printf("0");
}
} |
44 | 21524 |
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 | 21525 | int fanxu(int num)
{
cout<<num%10;
if(num/10!=0) fanxu(num/10);
}//?????????
int main()
{
int shu[6],i;
for(i=0;i<6;i++) cin>>shu[i];
for(i=0;i<6;i++)
{
if(shu[i]!=0 && shu[i]%10==0)
{
do
{
shu[i]=shu[i]/10;
}while(shu[i]%10==0);
}//??10??????????10????
if(shu[i]>=0)
{
fanxu(shu[i]);
cout<<endl;
}//????????
else
{
cout<<"-";
shu[i]=-shu[i];
fanxu(shu[i]);
cout<<endl;
}//???????
}
cin.get();cin.get();cin.get();cin.get();cin.get();cin.get();
return 0;
}
|
44 | 21526 | 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 | 21527 | int reverse(int a)
{
int i,j=0,b[20],c=0,t=0;
if(a>0);
else
{a=-a;t=1;}
for(i=0;a>0;i++)
{
b[i]=a%10;
a=a/10;
}
for(j=0;j<i;j++)
c=10*c+b[j];
if(t==1)
c=-c;
return c;
}
int main()
{
int i=0,a=0;
for(i=0;i<6;i++)
{
while(cin>>a)
cout<<reverse(a)<<endl;
}
return 0;
} |
44 | 21528 |
void reverse(int n);
int main()
{
int n;
int i;
for (i=1;i<=6;i++)
{
scanf("%d",&n);
reverse(n);
}
return 0;
}
void reverse(int n)
{
int a[12];
int tmp;
int i,j;
int state=0;
tmp=(n>=0)? n:-n;
for (j=0;tmp>=1;j++)
{
a[j]=tmp%10;
tmp/=10;
}
if (n<0)
{
printf("-");
}
for (i=0;i<j;i++)
{
if (state)
{
printf("%d",a[i]);
}
else
{
if (a[i]!=0 &&state==0)
{
printf("%d",a[i]);
state=1;
}
}
}
if (!state)
{
printf("0");
}
printf("\n");
} |
44 | 21529 | int main()
{
int i,a,b;
int reverse(int);
for(i=0;i<6;i++){
scanf("%d", &a);
if(a>=0){
b=reverse(a);
}
if(a<0){
a=-a;
b=-reverse(a);
}
printf("%d", b);
if(i<5) printf("\n");
}
return 0;
}
int reverse(int a)
{
int j,b=0,k, c[10]={0};
for(j=9;j>=0;j--){
c[j]=a%10;
a=a/10;
if(a==0) break;
}
for(k=9;k>=j;k--){
b=b*10+c[k];
}
return b;
}
|
44 | 21530 |
int reverse(int n)
{
int m,i,b,j,h;
if(n>=0)
m=n;
else
m=-n;
int a=0;
b=0;
for(;m>0;)
{m/=10;
a++;}
if(n>=0)
m=n;
else
m=-n;
for(i=1;i<=a;i++)
{ h=1;
for(j=1;j<=(a-i);j++)
{h*=10;}
b+=(m-(m/10)*10)*h;
m/=10;
}
if(n>=0)
return b;
else
return -b;
}
main()
{ int i;
for (i=0;i<6;i++)
{
int n;
scanf("%d",&n);
printf("%d\n",reverse(n) );
}
getchar();
getchar();
} |
44 | 21531 | void main()
{
int f(char str[10]);
char string[6][10];
int i;
for(i=0;i<6;i++) gets(string[i]);
for(i=0;i<6;i++) printf("%d\n",f(string[i]));
}
int f(char str[10])
{
int j,m,e,k,b;
b=0; m=0;
for(j=0;str[j]!='\0';j++) b=j;
if(str[0]=='-')
{
for(j=b;j>0;j--)
{
e=1;
for(k=1;k<j;k++)
e=e*10;
m=m+(str[j]-48)*e;
}
if(m==0) return(0);
else return(-m);
}
else
{
for(j=b;j>=0;j--)
{
e=1;
for(k=0;k<j;k++)
e=e*10;
m=m+(str[j]-48)*e;
}
return(m);
}
}
|
44 | 21532 | void main()
{
int a[6][1],i,c[6];
int reverse(int x,int z);
for(i=0;i<=5;i++)
scanf("%d",&a[i][0]);
for(i=0;i<=5;i++)
c[i]=reverse(a[i][0],i);
for(i=0;i<=4;i++)
printf("%d\n",c[i]);
printf("%d",c[5]);
}
int reverse(int x,int z)
{
int b[6][100],m,j,f,c,d,e,y=0;
if(x==0)
y=0;
else if(x>0)
{
m=log10(x);
for(j=m;j>=0;j--)
{
f=pow(10,j+1);
c=pow(10,j);
d=x%f-x%c;
e=d/c;
b[z][j]=e;
}
for(j=0;j<=m;j++)
y=y+b[z][j]*pow(10,m-j);
}
else if(x<0)
{
x=(0-x);
m=log10(x);
for(j=m;j>=0;j--)
{
f=pow(10,j+1);
c=pow(10,j);
d=x%f-x%c;
e=d/c;
b[z][j]=e;
}
for(j=0;j<=m;j++)
y=y+b[z][j]*pow(10,m-j);
y=(0-y);
}
return(y);
}
|
44 | 21533 | 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 | 21534 | int f(int m)
{
int d=0;
while(m!=0)
{
d=d*10+m%10;
m=m/10;
}
return d;
}
main()
{
int a[7],b[7],c[7],i=1,m;
for (;i<=6;i++)
{
scanf("%d",&a[i]);
if (a[i]>=0)
{
m=a[i];
c[i]=f(m);
}
else
{
m=-a[i];
b[i]=f(m);
c[i]=-b[i];
}
}
for(i=1;i<=6;i++)
printf("%d\n",c[i]);
return 0;
}
|
44 | 21535 |
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 | 21536 | int re(int n){
int result=0;
if(n>0){
while(n>0){
result=result*10+n%10;
n/=10;
}
}else if(n<0){
n=0-n;
while(n>0){
result=result*10+n%10;
n/=10;
}
result=0-result;
}
return result;
}
int main(){
int i,z,f;
for(i=0;i<6;i++){
scanf("%d",&z);
f=re(z);
printf("%d\n",f);
}
return 0;
} |
44 | 21537 |
void main()
{
int a[6],i;
int reverse(int dividend);
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
printf("%d\n",reverse(a[i]));
}
}
int reverse(int devidend)
{
int result=0,remainder;
if(devidend<0)
{
devidend=fabs(devidend);
while(devidend>0)
{
remainder=devidend%10;result=result*10+remainder;
devidend=devidend/10;
}
result=-result;
}
else if(devidend>=0)
{
do
{
remainder=devidend%10;result=result*10+remainder;
devidend=devidend/10;
}
while(devidend>0);
}
return(result);
} |
44 | 21538 | int reverse(char n[8]);
int main(){
int j,z,i,c,k;
char jieguo[6][8];
char su[8];
for(j=0;j<6;j++){
scanf("%s",su);
c=strlen(su);
z=reverse(su);
switch(z){
case 1: {jieguo[j][0]=su[0];
jieguo[j][1]='\0';
break;}
case 2: {jieguo[j][0]=su[0];
for(i=1;i<c;i++){
jieguo[j][i]=su[c-i];
}
jieguo[j][c]='\0';
break;}
case 3:{for(i=0;i<c;i++){
jieguo[j][i]=su[c-1-i];
}
jieguo[j][c]='\0';
break;
}
case 4:{jieguo[j][0]=su[0];
for(i=1;i<c;i++){
if(su[c-i]!='0')
break;
}
for(k=1;k<=c-i;k++){
jieguo[j][k]=su[c-i-k+1];
}
jieguo[j][k]='\0';
}
break;
case 5:{for(i=0;i<c;i++){
if(su[c-i-1]!='0')
break;
}
for(k=0;k<c-i;k++){
jieguo[j][k]=su[c-i-k-1];
}
jieguo[j][k]='\0';
}break;
}
}
for(j=0;j<6;j++){
printf("%s\n",jieguo[j]);
}
return 0;
}
int reverse(char n[8]){
int b,i,jieguo;
b=strlen(n);
if(b==1){
jieguo=1;
}else{
if(n[0]=='-'){
jieguo=2;
if(n[b-1]=='0'){
jieguo=4;
}
}else{
jieguo=3;
if(n[b-1]=='0'){
jieguo=5;
}
}
}
return(jieguo);
}
|
44 | 21539 | int reverse(int num)
{
int f=1,s=0;
if (num<0)
{
f=0;
num=-num;
}
for (;num!=0;)
{
s=s*10+num%10;
num=num/10;
}
if (f==0)
s=-s;
return(s);
}
void main()
{
int i,n;
for (i=1;i<=6;i++)
{
scanf("%d",&n);
printf("%d\n",reverse(n));
}
} |
44 | 21540 | void main()
{
int reverse(int num);
int i,a[6],d[6];
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
{if (a[i]>0)
d[i]=reverse(a[i]);
else d[i]=(-1)*reverse(-a[i]);
printf("%d\n",d[i]);}
}
int reverse(int num)
{
int b[7],c[7],j,d,answer;
for(j=0;j<7;j++)
{
b[j]=floor(num/(pow(10,j)));}
for(j=0;j<6;j++)
{
c[6-j]=b[j]-10*b[j+1];}
c[0]=b[6];
d=0;
for(j=0;j<7;j++)
{
if(c[j]==0)
d=d+1;
else break;}
answer=0;
for(j=d-1;j<7;j++)
{
answer=answer+pow(10,j-d)*c[j];}
return answer;
}
|
44 | 21541 | int f(int x)
{
int a[5];
int b[5]={10000,1000,100,10,1};
int i,j;
int sum=0;
if(x==0)
return 0;
else if(x==-0)
return 0;
else if(x>0)
{
int m=x;
for(i=0;i<5;i++)
{a[i]=m/b[i];m=x%b[i];}
for(i=0;i<5;i++)
{if(a[i]!=0) break;}
for(j=i;j<5;j++)
{sum=sum+a[j]*b[4+i-j];}
return sum;
}
else
{
int y=-x;
for(i=0;i<5;i++)
{a[i]=y/b[i];y=y%b[i];}
for(i=0;i<5;i++)
{if(a[i]!=0) break;}
for(j=i;j<5;j++)
{sum=sum+a[j]*b[4+i-j];}
sum=-sum;
return sum;
}
}
main()
{
int a,b,c,d,e,g;
scanf("%d\n%d\n%d\n%d\n%d\n%d",&a,&b,&c,&d,&e,&g);
a=f(a);
b=f(b);
c=f(c);
d=f(d);
e=f(e);
g=f(g);
printf("%d\n%d\n%d\n%d\n%d\n%d",a,b,c,d,e,g);
getchar();
getchar();
}
|
44 | 21542 | int main(void)
{
int i,n,flag,n1;
int f(int n);
for(i=1;i<=6;i++){
scanf("%d",&n);
if (n>0) flag=1;
else {flag=-1;n=-n;}
n1=f(n);
printf("%d\n",flag*n1);
}
}
int f(int n)
{
int s,nn;
s=n;nn=0;
while(s>0){
nn=nn*10+s%10;
s=s/10;
}
return nn;
}
|
44 | 21543 | 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 | 21544 | 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 | 21545 | 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 | 21546 |
int main()
{
char a[10],b[10],c[10],d[10],e[10],f[10];
void reverse(char x[10]);
void putstr(char y[10]);
reverse(gets(a));
reverse(gets(b));
reverse(gets(c));
reverse(gets(d));
reverse(gets(e));
reverse(gets(f));
putstr(a);
putstr(b);
putstr(c);
putstr(d);
putstr(e);
putstr(f);
}
void reverse(char x[10])
{
int length,i,j,t;
char p[10]={0};
length=strlen(x);
if (x[0]==45)
{
if(x[1]==48)
{
x[0]=48;
x[1]='\0';
}
else {
for(i=length-1,j=1;i>=1;i--,j++)
p[j]=x[i];
for(i=1;i<j;i++)
if (p[i]!=48) break;
for (t=1;i<j;i++,t++)
x[t]=p[i];
x[t]='\0';
}
}
if (x[0]!=45)
{
if(x[0]==48)
{
x[0]=48;
x[1]='\0';
}
else{
for(i=length-1,j=0;i>=0;i--,j++)
p[j]=x[i];
for(i=0;i<j;i++)
if (p[i]!=48) break;
for (t=0;i<j;i++,t++)
x[t]=p[i];
x[t]='\0';
}
}
}
void putstr(char y[10])
{
puts(y);
}
|
44 | 21547 | 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 | 21548 | void main()
{
void p(int m);
int i,a[100]={0};
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
printf("0\n");
else if(a[i]>0)
p(a[i]);
else
{
printf("-");
a[i]=(-a[i]);
p(a[i]);
}
}
}
void p(int m)
{
int i,j,k;
char a[100]={""};
for(i=0,k=m,j=1;;i++,j++)
{
if(k<10)
{
a[i]=k;
break;
}
else
{
a[i]=k-k/10*10;
k=k/10;
}
}
for(i=0,k=0;;i++)
{
if(a[i]==0)
{
k++;
continue;
}
else
break;
}
for(i=k;i<j;i++)
printf("%d",a[i]);
printf("\n");
}
|
44 | 21549 | int main()
{
int reverse(int);
int i,n;
for(i=0;i<6;i++)
{scanf("%d",&n);
printf("%d\n",reverse(n));}
}
int reverse(int n)
{
int i,j,a[20]={0};
a[0]=n;
for(i=0;i<19;i++)
{a[i+1]=a[i]/10;
a[i]=a[i]-10*a[i+1];}
for(i=0;i<20;i++)
if(a[i]!=0)
j=i;
n=a[0];
for(i=0;i<j;i++)
n=n*10+a[i+1];
return n;
} |
44 | 21550 |
int reverse(int n)
{
int a[10]={0};
int sum;
int i,j;
i=0;sum=0;
while(n>0)
{
a[i]=n%10;
n=n/10;
i=i+1;
}
for(j=0;j<=i-1;j++)
{
sum=sum+a[j]*pow(10,i-1-j);
}
return sum;
}
int main()
{
int i;
int a;
for(i=1;i<=6;i++)
{
scanf("%d",&a);
if(a<0)
{
printf("-");
a=fabs(a);
printf("%d\n",reverse(a));
}
else
printf("%d\n",reverse(a));
}
return 0;
} |
44 | 21551 |
void main()
{
int i,ans,n=0;
//char c;
int reverse(int num);
for(i=0;i<6;i++)
{
scanf("%d",&n);
ans=reverse(n);
printf("%d\n",ans);
}
}
int reverse(int num)
{
int m=0,flag=1,w;
if(num<0) {flag=0;num=-num;}
w=(int)log10(num);
for(;w>=0;w--)
{
m=m*10+num%10;
num=num/10;
}
if(flag==0) m=-m;
return m;
} |
44 | 21552 |
void reverse ( )
{
int i,len,aaa,bbb;
char num[100],exnum[100];
char *p;
gets(num);
aaa=0;
if (num[0]=='-')
{
len= strlen (num)-1;
for(i=0;i<=len-1;i++)
{
exnum[len-1-i]=num[i+1];
}
aaa=1;
}
else
{
len=strlen(num);
for(i=0;i<=len-1;i++)
{
exnum[len-1-i]=num[i];
}
}
if (aaa==1)
{
printf("-");
}
bbb=0;
for (i=0;i<=len-1;i++)
{
if (exnum[i]=='0')
;
else
{
bbb=1;
break;
}
}
for (;i<=len-1;i++)
{
printf("%c",exnum[i]);
}
if (bbb==0)
{
printf("0");
}
printf("\n");
}
int main()
{
int i;
for (i=1;i<=6;i++)
{
reverse();
}
return(0);
}
|
44 | 21553 | long reverse(long n)
{
long g = n;
long a=0,b=0;
while(g!=0)
{
a = g % 10;
b = b*10+a;
g = g/10;
}
return b;
}
main()
{
long n,b,i;
for(i=0;i<=5;i++)
{
scanf("%d",&n);
b = reverse(n);
printf("%d\n",b);
}
}
|
44 | 21554 | int main()
{
int reverse(int num1);
int num1,num2=0;
while(cin>>num1)
{
num2=reverse(num1);
cout<<num2<<endl;
}
return 0;
}
int reverse(int num1)
{
int num[1000],i,j,num2=0;
for(i=0;;i++)
{
if(num1/10==0)
{
num[i]=num1;
break;
}
else
{
num[i]=num1%10;
num1=num1/10;
}
}
for(j=0;j<=i;j++)
{
num2=10*num2+num[j];
}
return(num2);
} |
44 | 21555 | int main()
{
int i;
int a[10];
int reverse(int b);
for(i=1; i<=6; i++)
scanf("%d", &a[i]);
for(i=1; i<=6; i++)
{
a[i]=reverse(a[i]);
printf("%d\n", a[i]);
}
return 0;
}
int reverse(int b)
{
int q, w, e, r, t, y, u, i, o, p, rev;
if(b/1000000000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*1000000000+o*100000000+i*10000000+u*1000000+y*100000+t*10000+r*1000+e*100+w*10+q;
return(rev);
}
if(b/1000000000==0 && b/100000000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*100000000+o*10000000+i*1000000+u*100000+y*10000+t*1000+r*100+e*10+w;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*10000000+o*1000000+i*100000+u*10000+y*1000+t*100+r*10+e;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*1000000+o*100000+i*10000+u*1000+y*100+t*10+r;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*100000+o*10000+i*1000+u*100+y*10+t;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*10000+o*1000+i*100+u*10+y;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000==0 && b/1000!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*1000+o*100+i*10+u;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000==0 && b/1000==0 && b/100!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*100+o*10+i;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000==0 && b/1000==0 && b/100==0 && b/10!=0)
{
q=b/1000000000;
w=(b-q*1000000000)/100000000;
e=(b-q*1000000000-w*100000000)/10000000;
r=(b-q*1000000000-w*100000000-e*10000000)/1000000;
t=(b-q*1000000000-w*100000000-e*10000000-r*1000000)/100000;
y=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000)/10000;
u=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000)/1000;
i=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000)/100;
o=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100)/10;
p=(b-q*1000000000-w*100000000-e*10000000-r*1000000-t*100000-y*10000-u*1000-i*100-o*10)/1;
rev=p*10+o;
return(rev);
}
if(b/1000000000==0 && b/100000000==0 && b/10000000==0 && b/1000000==0 && b/100000==0 && b/10000==0 && b/1000==0 && b/100==0 && b/10==0)
{
rev=b;
return(rev);
}
}
|
44 | 21556 |
int f(int n)
{
int m=0;
while(n!=0){
m=m*10+n%10;
n=n/10;
}
return m;
}
int main()
{
int a;
for(int i=0;i<6;i++){
scanf("%d",&a);
printf("%d\n",f(a));
}
return 0;
}
|
44 | 21557 | 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 | 21558 | 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 | 21559 | int reverse(int num){
int length,N=abs(num),i;
for(i=0;N>=pow(10,i);i++)
length=i+1;
int sum=0,l=length;
for(i=0;i<=length-1;i++,l--)
sum+=(int)(num%(int)pow(10,i+1)/pow(10,i))*pow(10,l-1);
return sum;
}
int main(){
int num,i;
for(i=0;i<6;i++){
scanf("%d",&num);
printf("%d\n",reverse(num));
}
return 0;
} |
44 | 21560 |
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 | 21561 | //********************************
//* ????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 | 21562 | int main()
{
int x,i,e,k,m;
for(k=1;k<7;k++){
scanf("%d",&x);
if(x==0){printf("0\n");}
if(x<0){
printf("-");
x=-x;
}if(x!=0){
for(i=1;;i++){
if(x%10==0){
x/=10;
}else{break;}
}for(i=1;;i++){
e=x%10;
printf("%d",e);
x=x/10;
if(x==0){break;}
}printf("\n");
}
}return 0;
} |
44 | 21563 | main()
{
int j;
int reverse(int num);
for(j=1;j<=6;j++)
{
char a[1000],b[1000];
gets(a);
int i,count=0,len=strlen(a);
if(a[0]=='-')
{
for(i=1;i<len;i++)
{
b[i]=a[len-i];
}
printf("-");
b[len]='\0';
for(i=1;b[i]!='\0';i++)
{
if((b[i]!='0')||(b[i]=='0'&&count!=0))
{
printf("%c",b[i]);
count++;
}
}
printf("\n");
}
else
{
for(i=0;i<len;i++)
{
b[i]=a[len-1-i];
}
b[len]='\0';
for(i=0;b[i]!='\0';i++)
{
if((b[i]!='0')||(b[i]=='0'&&count!=0))
{
printf("%c",b[i]);
count++;
}
}
printf("\n");
}
}
}
|
44 | 21564 | int fan( int k );//??????????
int pow1(int n);//????10?n?????
int main()
{
int a[6],i;
for(i=0;i<=5;i++)//??
cin>>a[i];
for(i=0;i<=5;i++)//??
cout<<fan(a[i])<<endl;
return 0;
}
int fan(int k)
{
int b[100],j=0,len,result=0;
if(k==0)
return 0;
else if(k>0)
{
while(k>0)
{
b[j]=k%10; //??????????
k=k/10;
j++;
}
len=j;
for(j=0;j<=len-1;j++)
{result=result+b[len-1-j]*pow1(j);}//?????10???????
return result;
}
else if(k<0)//k??????k=-k??
{
k=-k;
while(k>0)
{
b[j]=k%10;
k=k/10;
j++;
}
len=j;
for(j=0;j<=len-1;j++)
{result=result+b[len-1-j]*pow1(j);}
return (-result);
}
}
int pow1(int n)//??10?n??
{
int result=1,i;
for(i=1;i<=n;i++)
result=result*10;
return result;
} |
44 | 21565 | int rev(int a);
int main()
{
int a,b,i;
for(i=0;i<6;i++){
scanf("%d",&a);
b=rev(a);
printf("%d\n",b);
}
return 0;
}
int rev(int a){
int m,n=0,j;
for(j=0;j<10;j++){
m=a%10;
a=a/10;
n=n*10+m;
if(a==0)
break;
}
return n;
}
|
44 | 21566 | 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 | 21567 | int f(int n)
{
int z,a[5],i;
if (n>=0)
{
a[0]=(n-n%10000)/10000;
a[1]=(n%10000-n%1000)/1000;
a[2]=(n%1000-n%100)/100;
a[3]=(n%100-n%10)/10;
a[4]=n%10;
z=a[4]*10000+a[3]*1000+a[2]*100+a[1]*10+a[0];
for (i=4;i>=0;i--)
{
if (z%10==0)
z=z/10;
}
}
else
z=f(-n);
return z;
}
void main()
{
int i,b[6];
for (i=0;i<6;i++)
{
scanf ("%d",&b[i]);
}
for (i=0;i<6;i++)
{
if (b[i]<0)
printf ("-");
printf ("%d",f(b[i]));
printf ("\n");
}
}
|
44 | 21568 | void main()
{
int a[6],b[6]={0},i,t,c,s,x;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
{
if(a[i]<0)
{a[i]=-a[i];c=1;}
else c=0;
t=log(a[i]);s=t;
while(s>=0)
{
x=a[i]/pow(10,s);
b[i]+=x*pow(10,t-s);
a[i]-=x*pow(10,s);
s--;
}
if(c) b[i]=-b[i];
}
for(i=0;i<6;i++)
{while(b[i]%10==0)
b[i]=b[i]/10;
printf("%d\n",b[i]);}
} |
44 | 21569 |
int reverse(int num)
{
if(num==0||num==-0)
return 0;
int x=abs(num);
while(x%10==0)
{
x/=10;
}
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 | 21570 | int fanxu(int x)
{
int sum=0,i,f[10],a=10,p,q;
for(i=0;i<10;i++)
{
f[i]=(x%a)/(a/10);
x=x-(a/10)*f[i];
if(x==0)
{
break;
}
a*=10;
}
q=1;
for(p=0;p<=i;p++)
{
sum+=f[i-p]*q;
q*=10;
}
return sum;
}
int main()
{
int i,k[6],shu;
for(i=0;i<6;i++)
{
scanf("%d",&shu);
if(shu==0)
{
k[i]=0;
}
if(shu<0)
{
k[i]=-1*fanxu(abs(shu));
}
else
{
k[i]=fanxu(shu);
}
}
for(i=0;i<6;i++)
{
printf("%d\n",k[i]);
}
return 0;
}
|
44 | 21571 | int reverse(int n);
int main()
{
int a,n;
for(a=0;a<=5;a++)
{
scanf("%d",&n);
n=reverse(n);
//printf("%d",n);
}
return 0;
}
int reverse(int n)
{
int a,b=1,z[10],max;
if(n<0)
{
n=-n;
printf("-");
}
if(n==0)
{
printf("0\n");
return 0;
}
for(a=0;a<=9;a++)
{
z[a]=n/b;
b=b*10;
}
for(a=0;a<=9;a++)
{
b=z[a]/10;
z[a]=z[a]-b*10;
}
b=0;
for(a=9;a>=0;a--)
{
if((z[a-1]!=0)&&(b==0))
{
max=a-1;
b=1;
continue;
}
//if(b==1) printf("%d",z[a]);
}
b=0;
for(a=0;a<=max;a++)
{
if((z[a]!=0)&&(b==0))
{
b=1;
printf("%d",z[a]);
continue;
}
if(b==1) printf("%d",z[a]);
}
printf("\n");
return 0;
} |
44 | 21572 | void inv(char str[])
{
int l,m,i;
char c;
l=strlen(str);
for(i=0;i<l/2;i++)
{
if(str[i]=='-') {l++;continue;}
c=*(str+i);
*(str+i)=*(str+l-1-i);
*(str+l-1-i)=c;
}
m=atoi(str);
printf("%d\n",m);
}
void main()
{
int i;
char a[6][9];
for(i=0;i<6;i++)
scanf("%s",a+i);
for(i=0;i<6;i++)
inv(*(a+i));
} |
44 | 21573 |
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 | 21574 | main()
{
int i;
for(i=1;i<=6;i++)
{
int a,x,y;
scanf("%d",&a);
if(a<0)
{
a=-a;
for(y=0;a>0;a=a/10)
{
x=a%10;
y=10*y+x;
}
y=-y;
printf("%d\n",y);
}
else
{
for(y=0;a>0;a=a/10)
{
x=a%10;
y=10*y+x;
}
printf("%d\n",y);
}
}
}
|
44 | 21575 |
int main(int argc, char* argv[])
{int n,a(int num),s,i=0;
while(i<6)
{
scanf("%d",&n);
s=a(n);
printf("%d\n",s);
i++;
}
return 0;
}
int a(int num)
{
int x=0;
while(num!=0)
{
x=x*10+num%10;
num/=10;
}
return x;
} |
44 | 21576 | //????????
int reverse(int);//?????
int main()
{
int num=0;
while(cin>>num)
{
cout<<reverse(num)<<endl;
}
return 0;
}
int reverse(int num)
{
int i,sum=0,a[10]={0},count=0;
if(num==0)
return 0;
else if(num<0)//?????????
{
cout<<"-";
num=-num;
}
for(i=0;;i++)//??????
{
a[i]=num%10;
num=num/10;
count++;
if(num==0)
break;
}
for(i=0;i<10;i++)
{
sum=sum+a[i]*pow(10.0,count-i-1);//??????
}
return sum;
} |
44 | 21577 | 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 | 21578 | 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 | 21579 | int fanxushu(int a)//??????
{
int i=0,j=0;
int b[100]={0};
if(a==0)
return 0;//????????0????????0
else if(a>0)
{
for(i=0;a>0;i++)
{
b[i]=a%10;
a=a/10;
}
for(j=0;j<i;j++)
{
a=b[j]+a*10;
}
return a;
}//a???????????a????
else
{
a=-a;
for(i=0;a>0;i++)
{
b[i]=a%10;
a=a/10;
}
for(j=0;j<i;j++)
{
a=b[j]+a*10;
}
a=-a;
return a;
}//?a???????????????????
}
int main()//???
{//?????
int i=0,n=6;
int a=0;
for(i=0;i<n;i++)
{
cin>>a;
cout<<fanxushu(a)<<endl;
}//????6??????
return 0;
}//????? |
44 | 21580 | void main()
{
int reverse(int num);
int a[5],i;
for(i=0;i<=5;i++)
scanf("%d",&a[i]);
for(i=0;i<=5;i++)
printf("%d\n",reverse(a[i]));
}
int reverse(int num)
{
int z,a,b,c,d,e;
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;
if(a!=0)
z=10000*e+1000*d+100*c+10*b+a;
if(a==0&&b!=0)
z=1000*e+100*d+10*c+b;
if(a==0&&b==0&&c!=0)
z=100*e+10*d+c;
if(a==0&&b==0&&c==0&&d!=0)
z=10*e+d;
if(a==0&&b==0&&c==0&&d==0)
z=e;
return(z);
} |
44 | 21581 | 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 | 21582 |
void reverse( int a)
{
int i,l,b;
i=0;
if (a==0) printf("0");
while ((a%10)==0)
{a=a/10;}
while (a!=0)
{
if (a>0)
{
b=a%10;
printf("%d",b);
a=a/10;
}
else if (a<0)
{
b=a%10;
if (i==0)
printf("%d",b);
else
{
b=-b;
printf("%d",b);
}
a=a/10;
i++;
}
}
}
int main()
{
int m,a;
int i=1;
while (i<=6)
{scanf("%d",&a);
reverse( a);
printf("\n");
i++;}
getchar(); getchar(); getchar(); getchar(); getchar(); getchar(); getchar(); getchar();
}
|
44 | 21583 | //?????????????????
int reverse(int num) //??reverse????????
{
char Num[100];
int i=0,j,k;
if(num>0) //??????????????????????????????????????????????
{
while(num!=0)
{
Num[i]=num%10;
num=num/10;
i++;
}
num=0;
for(k=0;k<i;k++)
{
num=Num[k]+num*10;
}
return num;
}
else if(num==0) //???????0???0
return 0;
else //????????????????????????????????????????????????????????????
{
num=-1*num;
while(num!=0)
{
Num[i]=num%10;
num=num/10;
i++;
}
num=0;
for(k=0;k<i;k++)
{
num=Num[k]+num*10;
}
num=num*(-1);
return num;
}
}
int main() //?????
{
int num;
for(int k=0;k<6;k++)
{
cin>>num; //????
cout<<reverse(num)<<endl; //???????
}
return 0;
} |
44 | 21584 | int reverse(int num);
int main(){
int k,n;
for(k=0;k<6;k++){
scanf("%d",&n);
printf("%d\n",reverse(n));
}
return 0;
}
int reverse(int num){
int i,x,r,a=1;
r=0;
if(num<0){
num=-num;
a=-1;
}
for(i=1;i<12;i++){
if(num<pow(10,i)){
x=i;
break;
}
}
for(i=0;i<x;i++){
if(i==0){
r+=num%10*(int)(pow(10,x-1));
}
else{
r+=(num%(int)(pow(10,i+1))-num%(int)(pow(10,i)))/(int)(pow(10,i))*(int)(pow(10,x-i-1));
}
}
r=a*r;
return r;
} |
44 | 21585 | int reverse(int a);
int main()
{
int a,i;
for(i=0;i<6;i++)
{
scanf("%d",&a);
reverse(a);
if(a==0)
printf("0");
printf("\n");
}
scanf("%d",1);
return 0;
}
int reverse(int a)
{
int d=0;
if(a<0)
{
printf("-");
a=-a;
}
while(1)
{
if(d==1)
printf("%d",a%10);
if(a%10!=0&&d==0)
{
printf("%d",a%10);
d=1;
}
a=a/10;
if(a==0)
break;
}
return 0;
} |
44 | 21586 | 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 | 21587 | int reverse(char*);
int main(int argc, char* argv[])
{
int i;
char a[6][10];
for(i=0;i<6;i++)
{
scanf("%s",a[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",reverse(a[i]));
}
return 0;
}
int reverse(char* n)
{
char a[10],b[10],c[10];
int m,i;
strcpy(a,n);
m=strlen(a);
for(i=0;i<m;i++)
{
b[i]=a[m-i-1];
}
b[m]='\0';
if(b[m-1]=='-')
{
c[0]='-';
for(i=1;i<m;i++)
{
c[i]=b[i-1];
}
c[m]='\0';
}
else
strcpy(c,b);
return atoi(c);
} |
44 | 21588 | int num(int a)
{
int b;
b=abs(a);
while(b%10==0){
b=b/10;
}
if(a>0)return b;
else return -b;
}
int reverse(int b)//???a??keyi
{
int c=0,d;
d=abs(b);
while(d>0){
c=c*10+d%10;
d=d/10;
}
if(b>0)return c;
else return -c;
}
int main()
{
int i=0,x;
int out[6];
for(;i<6;i++){
scanf("%d",&x);
out[i]=reverse(num(x));
}
for(i=0;i<6;i++){
printf("%d\n",out[i]);
}
return 0;
}
|
44 | 21589 | 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 | 21590 | 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 | 21591 |
int main()
{
int j;
int reverse(int num);
int a[6]={0};
for(j=0;j<6;j++)
{
scanf("%d",&a[j]);
}
for(j=0;j<6;j++)
{
printf("%d\n",reverse(a[j])); /*??*/
}
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
}
int reverse(int num)
{
int i,k,b=0,m=1,jud=0,c=-1;
int s[100]={0};
if(num<0)
{
num=-num;
jud++; /*jud????*/
}
for(i=0;num>0;i++)
{
s[i]=num%10; /*????????????? s ?*/
num=num/10;
c++;
}
for(i=0;i<=c;i++)
{
for(k=0;k<c-i;k++)
{
m=m*10;
}
b=b+s[i]*m; /*???????*/
m=1;
}
for(i=0;i<100;i++)
s[i]=0;
if(jud)
{
b=0-b;
}
return(b);
}
|
44 | 21592 | int reverse(int num)
{
int i,k,l,m,ans;
if (num<0)
{
m=-1;
num=0-num;
}
else m=1;
k=0;
while (num!=0)
{
k=k*10+num%10;
num=(num-(num%10))/10;
}
ans=k*m;
return ans;
}
int main()
{
int r,t;
for (r=0;r<6;r++)
{
scanf("%d",&t);
printf("%d\n",reverse(t));
}
} |
44 | 21593 | int reverse(int num)
{ int a[11],i,j,flag,n;
if (num==0) return 0;
else if (num<0) flag=-1;
else flag=1;
num=abs(num);
for (i=0;i<=10;i++) a[i]=0;
i=0;
while (num>0)
{
a[i]=num%10;
num=num/10;
i++;}
i--;
n=0;
for (j=0;j<=i;j++)
n=n*10+a[j];
if (flag<0) return(-n);
else return(n);
}
main()
{
int i,num;
for (i=0;i<6;i++)
{ scanf("%d",&num);
num=reverse(num);
printf("%d\n",num);
}
} |
44 | 21594 | 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 | 21595 | int reverse(int num)
{
int a,h,i,j,k,o=0,s=1,t=10,NUM=0,n[N];
if(num<0)
{
num=0-num;
o=1;
}
for(h=2;h<=N+2;h++)
{
s=s*10;
if(num/s==0)
break;
}
for(i=0;i<N;i++)
{
a=num%t;
num=num/t;
n[i]=a;
}
t=1;
for(j=2;j<h;j++)
{
t=t*10;
}
for(k=0;k<N;k++)
{
NUM=NUM+t*n[k];
t=t/10;
}
if(o==1)
NUM=0-NUM;
return NUM;
}
main()
{
int num,i;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
printf("%d\n",reverse(num));
}
} |
44 | 21596 | void main()
{
int i,a[6];
int t(a);
for (i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<6;i++)
{
printf("%d\n",t(a[i]));
}
}
t(a)
{
int b[100],i,j,n,c=0;
int q(n);
for (i=0;a!=0;i++)
{
b[i]=a%10;
a=a/10;
}
for(j=0;j<i;j++)
{
c=c+b[j]*q(i-1-j);
}
return (c);
}
q(n)
{
int i,a=1;
for (i=0;i<n;i++)
{
a=a*10;
}
return (a);
}
|
44 | 21597 | int flag=0;
void reverse(int num)
{
if(flag==1||num%10!=0)//flag ??????????0??
{
if(num%10!=0) flag=1;
cout<<num%10;
}
if(num/10!=0)
reverse(num/10);//??
}
int main()
{
int i;
for(i=0;i<6;i++)
{
flag=0;
int n,u;
cin>>n;
if(n<0)
{
cout<<'-';
reverse(-n);
cout<<endl;
}
else if(n>0)
{
reverse(n);
cout<<endl;
}
else if(n==0)
{
cout<<'0'<<endl;
}
}
return 0;
}
|
44 | 21598 | int reverse(int num)
{
int a, rev=0;
int i, count=0;
for(i=0; ;i++)
{
a=num%10;
rev=rev*10+a;
num=num/10;
if(num==0) break;
}
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 | 21599 | int reverse(int num)
{
int x=0,y=0,k=0;
if(num==0)
return 0;
printf("\n");
while(num>0)
{
x=num%10;
y=y*10+x;
num=num/10;
if(num==0)
break;
}
return y;
}
main()
{
int n[6],i;
for(i=0;i<6;i++)
{
scanf("%d",&n[i]);
if(n[i]>=0)
{
reverse(n[i]);
printf("%d\n",reverse(n[i]));
}
else
{
reverse(-n[i]);
printf("-%d\n",reverse(-n[i]));
}
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.