label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
44 | 21800 | int reverse(int num)
{
int d = 0,m;
if(num >= 0)
{
m = num;
while (m != 0)
{
d = d * 10 + m % 10;
m = m / 10;
}
return d;
}
else
{
m = 0 - num;
while (m != 0)
{
d = d * 10 + m % 10;
m = m / 10;
}
... |
44 | 21801 | int reverse(int num);
int main()
{
int i;
int a[10],b[10];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
b[i]=reverse(a[i]);
}
for(i=0;i<6;i++)
printf("%d\n",b[i]);
return 0;
}
int reverse(int num)
{
if(num==0)
return 0;
int c[100],d[100],e[100];
int i,j;
int a;
int k=1;
int result=0;
if(num<0)
a=0... |
44 | 21802 | int reverse(int num)//????????????????
{ int a[10],k=0,i,j,result=0;
while(num!=0)
{
a[k]=num%10;//????????
num=num/10;
k++;
}
for(i=0;i<k;i++)
for(j=1;j<=k-i-1;j++)
a[i]=10*a[i];//10??
for(i=0;i<k;i++)
result=result+a[i];//??10??????
return result;
}
int main()
{
int i,a[6];
for(i=0;i<6;i++)
... |
44 | 21803 | int reverse(int num)
{
int a,b=0,i;
if(num==0)
b=0;
for(i=0;num!=0;i++)
{
a=num%10;
num=num/10;
b=a+b*10;
}
return b;
}
main()
{
int n,i,j,k;
for(k=0;k<6;k++)
{
... |
44 | 21804 | void reverse(int num)
{
int a=0;
if(num==0)
cout<<0<<endl;
if(num<0)
{
int b=1,c=0,biaoji=0;
cout<<'-';
num=(-1)*num;
while(true)
{
a=(num/b)%10;
c=num/b;
if(a>0)
{
cout<<a;
biaoji=1;
b=b*10;
break;
}
else b=b*10;
}
while (biaoji)
{
a=(num/b)%10;
c=num/b;
... |
44 | 21805 | 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;... |
44 | 21806 | void reverse(int n)
{
int i,b=0;
if(n==0)
printf("%d\n",n);
else
{
if(n<0)
printf("-");
n=abs(n);
if(n%10==0)
{
while(n%10==0)
{
n=n/10;
}
}
for(i=1;n!=0;i++)
{
b=b*10+n%10;
n=n/10;
}
printf("%d\n",b);
}
}
int main()
{
void reverse(int num);
int n,j;
for(j=1;j<=6;j++)
{... |
44 | 21807 | 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);
pri... |
44 | 21808 |
int reverse(int x);
int main()
{
int p,num,k;
for(k=1;k<7;k++){
scanf("%d",&num);
p=reverse(num);
printf("%d\n",p);
}return 0;
}
int reverse(int x)
{
int i,s,cishu,sz[20],a;
cishu=0;
a=1;
if(x<0){
a=-1;
x=-x;
}
if(x==0){s=0;}
else{
for(i=1;;i++){
if(x%10==0){
x/... |
44 | 21809 | int main()
{
int reverse(int num);
int i[6],d;
for (d=0;d<6;d++)
{
scanf("%d",&i[d]);
}
for (d=0;d<6;d++)
{
printf("%d\n",reverse(i[d]));
}
}
int reverse(int num)
{
int a[5]={0},b=0,n;
if (num<0)
{
n=(0-num);
}
else
{
n=num;
}
a[0]=n/10000;
a[1]=(n%10000)/1000;
a[2]=(n%1000)/100;
a... |
44 | 21810 | void main()
{
int cal(int a);
int i,j;
int a[6];
for(i=1;i<=6;i++)
scanf("%d",&a[i]);
for(i=1;i<=6;i++)
printf("%d\n",cal(a[i]));
}
int cal(int a)
{
int s=0,p=0;
if(a<0)
{
a=-a;
p=1;
}
while(a)
{
s=s*10+a%10;
a=a/10;
}
if(p==1)
return(-s);
else
return(s);
}
|
44 | 21811 |
//******************
int n=0,num=0,i=0;
//******************
void upside(int x)
{
int a[5]={0},y=0,z=0,len=0,len0=0;
if(x>0)
{
for(i=0;i<5;i++)
{
a[i]=x%10;
x=x/10;
if(x==0)
{
len=i;
break;
}
}
for(i=0;a[i]==0;i++)
{
len0++;
}
for(i=len0;i<=le... |
44 | 21812 | int reverse(int t){
int flag=1;
if(t==0)return 0;
if(t<0){
flag=-1;
t=-t;
}
int ans=0;
while(t){
ans*=10;
ans+=t%10;
t/=10;
}
return ans*flag;
}
int main(){
for(int i=0;i<6;i++){
int t=0;
cin>>t;
cout<<reverse(t)<<endl;
}
return 0;
}
|
44 | 21813 | //?????
//??
//????????????????????????
//?????1576???????6751??????1230?
//???321??main????????????????
//????
//??6???
//????
//?????????6?
int flag = 0;
int function(int n);
int main()
{
int i=0;
for(i=0;i<6;i++)
{
int n=0;
cin>>n;
if (n<0)
{
cout<<"-";
... |
44 | 21814 | 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));}
... |
44 | 21815 | int f(int n){
int sz[15];
int i,k,m=0,t;
if(n<0){
t=-1;
}else if(n>0){
t=1;
}else{
t=0;
}
n=fabs(n);
for(i=1;;i++){
if(n<pow(10,i)){
break;
}
}
for(k=0;k<i;k++){
sz[k]=n/pow(10,i-k-1);
n-=sz[k]*pow(10,i-k-1);
}
for(k=0;k<i;k++){
m+=sz[k]*pow(10,k);
}
return m*t;
}
int main(){
int n,i;
... |
44 | 21816 | int f(int a)
{
int n[32],i,p=10,q,b=0;
for(i=0; ;i++)
{
n[i]=a%10;
a=a/p;
if(a==0)
break;
}
for(int j=i;j>=0;j--)
{
q=1;
for(int s=0;s<j;s++)
{
q=q*10;
... |
44 | 21817 |
int main(){
int reverse(int num);
int i,result,sz[6];
for(i=0;i<6;i++){
scanf("%d",&sz[i]);
}
for(i=0;i<6;i++){
result=reverse(sz[i]);
printf("%d\n",result);
}
return 0;
}
int reverse(int num){
int g=0,s=0,b=0,q=0,w=0;
int a,y,goal;
a=abs(num);
w=a/10000;
q=a/1000-w*10;
b=a/100-w*100-q*10;
s=a... |
44 | 21818 |
int reverse(int num) {
if(num == 0) return 0;
int a[70] = {0};
int count = 0;
if(num > 0) {
while(num > 0) {
a[count] = num % 10;
num /= 10;
count++;
}
for(int i = 0; i < count; i++) {
num *= 10;
num += a[i];
}
return num;
}
if(num < 0) {
num *= -1;
while(num > 0) {
a[count] = ... |
44 | 21819 | 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)
... |
44 | 21820 |
void main()
{
int i,j,len,k;
char str[6][7];
for(i=0;i<6;i++)
scanf("%s",str[i]);
for(i=0;i<6;i++)
{
if(atoi(str[i])>0)
{
len=strlen(str[i]);
for(j=len-1;j>=0;j--)
{
if(str[i][j]!='0')
break;
}
for(k=j;k>=0;k--)
printf("%c",str[i][k]);
printf("\n");
}
else if(atoi(str[i])<... |
44 | 21821 | 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;... |
44 | 21822 | 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*wa... |
44 | 21823 | int reverse(int n)
{
int back=0,flag=0;
if(n>=0&&n<=9)
back=n;
else
{
if(n<0)
{
flag=1;
n=-n;
}
while(n>=1)
{
back=back*10+n%10;
n=n/10;
}
}
if(flag==0)
return back;
else
return -back;
}
int main()
{
int i,a[6];
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
printf("%d\... |
44 | 21824 | 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... |
44 | 21825 | int reverse(int x)
{
int a[20];
int i,j,t,y,l=0;
for(i=0;i<20;i++) a[i]=0;
while (x!=0)
{
a[l]=x%10;
x/=10;
l+=1;
}
y=0;
t=1;
for (i=0;i<=l;i++)
{
for(j=l-1;j>i;j--)
{
t*=10;
}
y+=a[i]*t;
t=1;
}
r... |
44 | 21826 |
int reverse(int num)
{
int sgn,a[1000],i,j,t,k,x=0,u,real;
i=1;
real=abs(num);
if(num==0)
{
return 0;
}
else
{
if(num>0)
{
sgn=1;
}
if(num<0)
{
sgn=-1;
}
while(real!=0)//????i??
{
a[i-1]=real%10;
real/=10;
i++;
}
for(j=i;j>=1;j--)
{
u=1;
for(k=1;k<=i-j;k++)
{
... |
44 | 21827 | int reverse(int num)
{
int retval = 0;
while(num)
{
retval = retval*10 + num%10;
num=num/10;
}
return retval;
}
int main()
{
int i,a[6],b[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
b[i]=reverse(a[i]);
printf("%d\n",b[i]);
}
}
|
44 | 21828 | int reverse(int num)
{
int i=0;
for (;num!=0;)
{
i=i*10+num%10;
num=num/10;
}
return (i);
}
main ()
{
int x[6],p[6],i;
for (i=0;i<6;i++)
scanf ("%d",&x[i]);
for (i=0;i<6;i++)
{
if (x[i]>=0)
p[i]=reverse(x[i]);
else
p[i]=-reverse(-x[i]... |
44 | 21829 | int fan(int x)
{
int a=0,b,i;
int f[100];
if (x==0)
return (x);
else
{
for(i=0;i<100;i++)
{
f[i]=x%10;
x=x/10;
a++;
if (x==0)
break;
}
}
... |
44 | 21830 | int fan(int x)
{
int i,a[100],b[200],sign=0,c=0;
if(x>=0)
{ for(i=1;;i++)
{
b[i]=x%10;
x=(x-b[i])/10;
sign+=1;
if(x==0)
break;
}
for(i=sign;i>=1;i--)
c+=b[i]*pow(10,sign-i);
return c;
}
if(x<0)
{
x=-1*x;
for(i=1;;i++)
{
b[i]=x%10;
x=(x-b[i])/10;
sign+=1;
if(x==0)
... |
44 | 21831 | 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( ... |
44 | 21832 | void main()
{
int a[6],i,sum;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
int f(int x);
for(i=0;i<6;i++)
{
sum=f(a[i]);
printf("%d\n",sum);
}
}
int f(int x)
{
int sum,g(int y);
if(x>0)
sum=g(x);
if(x==0)
sum=0;
if(x<0)
sum=-g(-x);
return(sum);
}
int g(int y)
{
int a[5],sum=0,i,n;
for(i=0;i<... |
44 | 21833 | 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;
si... |
44 | 21834 | int main()
{
int reverse(int a);
int x,y,i;
for (i=0;i<6;i++){
scanf ("%d",&x);
if (x==0||x==-0){
printf("0\n");
}
else if (x<0){
x=-x;
y=-1*reverse(x);
printf("%d\n",y);
}
else if (x>0){
y=reverse(x);
printf("%d\n",y);
}
}
return 0;
}
int reverse(int a)
{
int i,j,n,m,sz[50],b,c,d;
for (n... |
44 | 21835 | int main()
{
void reverse(int num,int o1);
int number,k;
for(k=0;k<6;k++)
{
cin>>number;
if(number!=0) reverse(number,0);//?????0
else cout<<0;
cout<<endl;
}
return 0;
}
void reverse( int num ,int o1)//?????
{
int rev=0,fuhao=1,num1,dig,i, ot=o1;
num1=num;
if(num!=0)
{
if (num1<0)//???????
{
co... |
44 | 21836 |
int reverse(int num)
{
int a = 0, b;
while (num != 0)
{
b = num % 10;
a = a * 10 + b;
num = num / 10;
}
return a;
}
int main()
{
int num;
while (cin >> num)
{
cout << reverse(num) <<endl;
}
return 0;
} |
44 | 21837 |
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 ... |
44 | 21838 |
int reverse(int a)
{
int c=0;
while(a)
{
c=c*10+a%10;
a=a/10;
}
return c;
}
main()
{
int a,c,i,b[6];
for(i=0;i<6;i++)
{
scanf("%d",&a);
b[i]=reverse(a);
}
for(i=0;i<6;i++)
printf("%d\n",b[i]);
} |
44 | 21839 | int reverse(int num)
{
int y,n,i,temp;
int a[50];
if(num==0)y=0;
else
{
temp=num;
num=fabs(num);
n=(int)log10(num);
for(i=n;i>=0;i--)
{
a[i]=num/(int)pow(10,i);
num=num%(int)pow(10,i);
}
for(i=0,y=0;i<=n;i++)y=y+a[i]*(int)pow(10,n-i);
if(temp<0)y=(-1)*y;
}
return(y);
}
void main()
{
int n,i;
int a[6];
for(... |
44 | 21840 | int reverse(int n);
int main()
{
int i,answer,n;
for(i=0;i<6;i++)
{
scanf("%d",&n);
answer=reverse(n);
printf("%d\n",answer);
}
return 0;
}
int reverse(int n)
{
if(n==0)
return 0;
char a[35]={'\0'};
int i,p=1,l,j;
if(n<0)
{
p=-1;
n=n*p;
}
for(i=0;n>0;i++)
{
a[i]=n%10+'0';
n=n/10... |
44 | 21841 | int reverse(int n){
int i,num[1000],k=0,a=0,sign=0;
if(n<0){
n=n*(-1);
sign=1;
}
for(;n>0;){
num[k++]=n%10;
n=n/10;
}
//for(i=0;i<k;i++) printf("%d ",num[i]);
for(i=0;i<k;i++){
a+=num[i]*pow(10,k-i-1);
... |
44 | 21842 | /* 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++)
{... |
44 | 21843 | int reverse(int number)
{
int result = 0, left = number, posOrNot = 1;
if (number < 0)
{
posOrNot = 0;
left = abs(number);
}
while (left > 0)
{
result = result * 10 + left % 10;
left = left / 10;
}
if (posOrNot == 0)
{
result = -result;
}
return result;
}
int main()
{
int i = 0;
int number = ... |
44 | 21844 | int reverse(int num){
int a,b,c,d,e;
int z;
a=num/10000;
b=num%10000/1000;
c=num%1000/100;
d=num%100/10;
e=num%10;
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;
}
... |
44 | 21845 | int reverse(int n)
{
int sw[10],sz[10];
int i,wei=10,result=0;
if(n>0){
for(i=0;i<10;i++){
sw[i]=(int)(pow(10,i));
}
sz[9]=n/sw[9];
for(i=8;i>=0;i--){
sz[i]=n%sw[i+1]/sw[i];
}
for(i=9;i>=0;i--){
if(sz[i]==0){
wei--;
}else{
break;
}
}
for(i=0;i<wei;i++){
result+=sz[i]*sw[wei-... |
44 | 21846 | int f(signed n)
{
int c;
if(n==0||n==-0) c=0;
if((n>=1&&n<=9)||(n>=-9&&n<=-1)) c=abs(n);
if((n>=10&&n<=99)||(n>=-99&&n<=-10)) c=(abs(n)%10)*10+abs(n)/10;
if((n>=100&&n<=999)||(n>=-999&&n<=-100)) c=((abs(n)%100)%10)*100+((abs(n)%100)/10)*10+abs(n)/100;
if((n>=1000&&n<=9999)||(n>=-9999&&n<=-1000)) c=(((abs(... |
44 | 21847 |
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 | 21848 | 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++) ... |
44 | 21849 | int reverse(int num)
{
int x,answer=0;
if(num>0)
{
do
{
x=num%10;
answer=x+answer*10;
num=num/10;
}
while(num!=0);
return answer;
}
else if(num==0)
return 0;
e... |
44 | 21850 | int reverse(int num)
{
int c=0,a;
if(num>=0)
{
for(;num!=0;)
{
a=num%10;
c=c*10+a;
num=num/10;
}
return c;
}
else
{
num=0-num;
for(;num!=0;)
{
... |
44 | 21851 | int reverse(int a)
{
int i;
for(i=0;(int)pow(10,i)<=a;i++);
int word;
word=i;
int sum;
sum=0;
for(i=0;i<word;i++)
{
sum+=(a%10)*((int)pow(10,word-i-1));
a/=10;
}
return sum;
}
int main()
{
int num[6],a;
scanf("%d\n%d\n%d\n%d\n%d\n%d",&num[0],&num[1],&num[2],&num[3],&num[4],&num[5]);
int i;
for(i=0;i<6... |
44 | 21852 |
int reverse(int num)
{
int i,j,num1=0,k;
if(num>=0){
for(i=1;i<=num;i=i*10);
i=k=i/10;
for(j=1;j<=k;j=j*10)
{
num1=num1+num/i*j;
num=num-num/i*i;
i=i/10;
}}
else if(num<0)
{
for(i=1;i<=(-num);i=i*10);
i=k=i/10;
for(j=1;j<=k;j=j*10)
{
num1=num1+num/i*j;
num=num-num/i*i;
i=i/10... |
44 | 21853 | int reverse(int num)
{
int b=0;
int t=num;
if(num>0) num=num;
else if(num<0) num=-num;
for(int i=1;num!=0;i++)
{
int a=num%10;
num=(num-a)/10;
b=b*10+a;
}
if(t==0||t==-0) b=0;
else if(t>0) b=b;
else if(t<0) b=-b;
return b;
}
main()
{
int num[6];
for(int i=0;i<6;i... |
44 | 21854 | //***************************
//* ??: ????? *
//* ??: ??? *
//* ??: 2010-11-26 *
//***************************
int back(int);//???????0
int mult(int);//????10?n???
int main()
{
int i,n,result;
for(i=0;i<6;i++)
{
cin>>n;
result=back(n);
cout<<result<<endl;
}
return 0;
}
int back(int n... |
44 | 21855 | void main()
{
int reverse(int num);
int num,n,i,t;
for(i=0;i<=5;i++)
{
scanf("%d",&num);
if(num>0||num==0)
{
n=reverse(num);
printf("%d\n",n);
}
else if(num<0)
{
t=0-num;
n=reverse(t);
t=0-n;
printf("%d\n",t);
}
}
}
int reverse(int num)
{
int w;
w=num %... |
44 | 21856 | 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 ... |
44 | 21857 | int reverse(int num);
void swap(int* a,int* b);
int main()
{
int num,i;
for(i=0;i<6;i++)
{
scanf("%d",&num);
printf("%d\n",reverse(num));
}
return 0;
}
int reverse(int num)
{
int a[20],i,n,mark=0;
if(num>0)
mark=1;
for(i=0;;i++)
{
a[i]=num%10;
num=(num-a[i])/10;
if(num==0)
break;
}
n=i;
for(i=... |
44 | 21858 | int 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++)
{
while(a[i]%10==0)
{a[i]=a[i]/10;}
}
for(i=0;i<6;i++)
printf("%d\n",reverse(a[i]));
}
int reverse(int num)
{
int s=0,p;
for(;abs(num)>0;)
{p=num%10;
s=s*10+p;
num=num/10;}
return(s);}
|
44 | 21859 | int FAN(int num)
{
int a[100000],i,wei,b,c,f=0;
wei=log10(num)+1;
for(i=1;i<=wei-1;i++)
{
b=pow(10,i);
c=pow(10,i-1);
a[i]=(num-num/b*b)/c;
}
a[i]=num/b;
for(i=wei;i>=1;i--)
{
f=f+a[i]*(pow(10,wei-i));
}
return f;
}
int main()
{
int N,M,i;
for(i=1;i<=6;i++)
{
scanf("%d",&N);
if(N==0)
printf(... |
44 | 21860 | char num[15];
int reverse(char num[15])
{
int i;
int count=0;
if(num[0]=='-')
{
printf("%c",'-');
}
for(i=14;i>=0;i--)
{
if((num[i]>='0')&&(num[i]<='9'))
{
if(count>0)
{
printf("%c",num[i]);
}
else if(num... |
44 | 21861 | 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");
... |
44 | 21862 | int main()
{
int number=0,judge=0;//judge??????????0,number?????
int i;
void reverse(int num,int judge);//????
for(i=0;i<6;i++)
{
cin>>number;//????
if(number==0)//?????????0
cout<<'0';
else
{
if(number<0)
{
cout<<'-';
number=-number;
}
reverse(number,0);
}
cout<<endl;
}
return ... |
44 | 21863 | void main()
{
int reverse(int num);
int a[6][1];
int i;
for(i=0;i<6;i++)
scanf("%d",&a[i][0]);
for(i=0;i<6;i++)
printf("%d\n",reverse(a[i][0]));
}
int reverse(int num)
{
int i,wei;
int z=0,b[100];
if(num<0)
{
num=-num;
wei=log10(num)+1;
for(i=0;i<wei;i++)
{
b[i]=num/(pow... |
44 | 21864 |
int main(int argc, char* argv[])
{
int reverse(int num);
int i,num;
for(i=0;i<6;i++){
scanf("%d",&num);
printf("%d\n",reverse(num));
}
}
int reverse(int num)
{
int a,b,r,j;
if(num>=0){
b=num;
r=0;
for(j=0;j<32;j++){
a=b%10;
b=b/10;
r=r*10+a;
if(b==0)
break;
}
}
else{
b=-num;
r=0... |
44 | 21865 |
int reverse(int n){
int x,i,zz;
zz=n%10;
for(i=0;n/10!=0;i++){
n=n/10;
x=n%10;
zz=zz*10+x;}
return zz;
}
int main(){
int i,m;
for(i=0;i<6;i++){
scanf("%d",&m);
printf("%d\n",reverse(m));
}
return 0;
}
|
44 | 21866 |
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... |
44 | 21867 | void reverse(int n)
{
int a,b,i,j;
a=fabs(n);
b=log(a)/log(10);
if(n<0)printf("-");
if(a%(int)pow(10,b)==0)printf("%d",(int)(a/pow(10,b))/10);
else{
for(i=0;i<=b;i++)
{
if((int)(a/pow(10,i))%10!=0)
{
for(j=i;j<=b;j++)printf("%d",(int)(a/pow(10,j))%10);
break;}
}
}
printf("\n");
}
void main()
{
int a... |
44 | 21868 | int reverse(int num);
int main(){
int i;
for(i=0;i<6;i++){
int n,result;
scanf("%d",&n);
if(n<0){
printf("-");//?????????
n=-n;
}
reverse(n);
}
return 0;
}
int reverse(int num){
if(num==0){
printf("0");
}//??0???????????0
else{
int r... |
44 | 21869 | //?????????
//??????
int reverse(int num);
int main()
{
int a[6],i;
for(i=0;i<6;i++) cin>>a[i];
for(i=0;i<6;i++){
if(a[i]<0){ //???????????????
a[i]=0-a[i];
cout<<"-";}
reverse(a[i]);} //?????
return 0;
}
int reverse(int num)
{
int a;
if(num==0) cout... |
44 | 21870 | int main()
{
int reverse(int num);
int i,a;
for(i=0;i<6;i++)
{
scanf("%d",&a);
printf("%d\n",reverse(a));
}
return 0;
}
int reverse(int num)
{
int s=0;
if(num*num<100)
{
s=num;
}
else if(num*num<10000)
{
s=num%10;
s=s*10+(num/10)%10;
}
else if(num*num<1000000)
{
s=num%10;
s=s*10+(num/10)%10;
s=s*10+(num/100)%... |
44 | 21871 | void reverse(int x)
{
int i,b[100],p,r,y;
scanf("%d",&x);
i=0;
if(x==0||x==(-0))
printf("0");
if(x<0)
p=0;
else
p=1;
y=abs(x);
while(y%10==0)
{
y=y/10;
}
b[i]=y%10;
while(y/10!=0)
{
y=y/10;
b[i+1]=y%10;
i++;
}
if... |
44 | 21872 | main()
{
int fan(int x);
int a[6];
int b[6];
int i=0;
do
{
scanf("%d",&a[i]);
b[i]=fan(a[i]);
i=i+1;
}
while(i<6);
i=0;
do
{
printf("%d\n",b[i]);
i=i+1;
}
while(i<6);
}
int fan(int x)
{
int y;
y=0;
do
{
y... |
44 | 21873 | int g(int a)
{
int s=1;
for(int i=0;i<a;i++)
{
s=s*10;
}
return s;
}
int f(int a)
{
if(a<0)
{
a=-a;
int i,x=0;
for(i=0;i<=11;i++)
{
if(a>=g(i)&&a<g(i+1))
break;
}
... |
44 | 21874 | int reverse(int num);
int main()
{
int sz[6],rsz[6];
int i;
for(i=0;i<=5;i++){
scanf("%d",&(sz[i]));
}
for(i=0;i<=5;i++){
rsz[i]=reverse(sz[i]);
}
for(i=0;i<=5;i++){
printf("%d\n",rsz[i]);
}
return 0;
}
int reverse(int num)
{
int mw[8],z,k,i;
k=8;
z=0;
mw[7]=num/10000000;
mw[6]=(num/1000000)%10;
mw... |
44 | 21875 | 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 su... |
44 | 21876 | int f(int x){
int a,b,c,d,e,j;
a=x%10;
b=x/10000;
c=x/1000%10;
d=x/100%10;
e=x/10%10;
if(b!=0)j=a*10000+e*1000+d*100+c*10+b;
if(b==0&&c!=0)j=a*1000+e*100+d*10+c;
if(b==0&&c==0&&d!=0)j=a*100+e*10+d;
if(b==0&&c==0&&d==0&&e!=0)j=a*10+e;
if(b==0&&c==0&&d==0&&e==0&&a!=0)j=a;
if(x==0)j=0;
if(x==-0)j==-0;
return... |
44 | 21877 | 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;... |
44 | 21878 | main()
{
int a[6],l;
int reverse(int num);
for(l=0;l<6;l++)
{
scanf("%d",&a[l]);
printf("%d\n",reverse(a[l]));
}
}
int reverse(int num)
{
int i,b[5]={0},c=0,k;
for(i=0;num!=0;i++)
{
b[i]=num%10;
num=num/10;
}
i--;
for(k=0;k<=i;k++... |
44 | 21879 | int reverse(int b)
{
int a=0;
while (b>0)
{
a=a*10+b%10;
b=b/10;
}
return a;
}
int main()
{
int x,tag=1,i;
for (i=0;i<6;i++)
{
scanf("%d",&x);
if (x<0)
{
printf("%d\n",-reverse(-x));
}
else
{
printf("... |
44 | 21880 | int reverse(int num)
{
if(num==0)
return 0;
else if(num>0)
{
if(num<10)
return num;
else if(num<100)
{
int p1=num%10;
int p2=num/10;
return (10*p1+p2);
}
else if(num<1000)
{
int p3=num/100;
int p2=(num-p3*100)/10;
int p1=num%10;
return (100*p1+10*p2+p3);
}
else if(num<10000)... |
44 | 21881 | int 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]));
return 0;
}
int reverse(int num)
{
int i=0;
if(num==0)
i=0;
while(num!=0)
{
i=i*10+num%10;
num=num/10;
}
return i;
} |
44 | 21882 | int reverse(int num)
{
int a,b=0,i,j;
for(j=1;num!=0;j++)
{
a=num%10;
num=num/10;
b=b*10+a;
}
return(b);
}
main()
{
int num,i,c;
for(i=1;i<=6;i++)
{
scanf("%d",&num);
c=reverse(num);
... |
44 | 21883 | //***********************************************************************
//?????????????
//?????????????
//??????
//***********************************************************************
void out1(int n, char a[]);
void out2(int n, char a[]);
int main() //???
{
int n;
char ... |
44 | 21884 | int main()
{
int n,i,j,k,l;
char a[100][100],b[100][100];
for(i=0;i<6;i++)
{
scanf("%s",a[i]);
l=strlen(a[i]);
if(a[i][0]!='-')
{
for(j=0;j<l;j++)
{
b[i][l-1-j]=a[i][j];
}
for(j=0;j<l;j++)
{
if(b[i][j]!=48)
{k=j;
break;}
}
for(j=k;j<l;j++)
{
printf("%c... |
44 | 21885 | int f(int n)
{
if (n==0)
{
cout <<n<<endl;
return 0;
}
if (n<0)
{
cout <<'-';
return f(-n);
}
cout <<n%10;
if (n/10!=0)
return f(n/10);
else cout<<endl;
}
int main()
{
int n;
while(cin>>n)
{
while (n%10==0&&n!=0)
{
n/=10;
}
f(n);
}
return 0;
} |
44 | 21886 | void main()
{
int rev(int a);
int length(int a);
int i,a[6],c[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
c[i]=rev(a[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",c[i]);
}
}
int rev(int a)
{
int i,l,m,b[15],c=0;
l=length(a);
m=pow(10,l-1);
for(i=0;i<l;i++)
{
b[i]=a/m;
a=a%m;
m=m/10;
if(m==0)... |
44 | 21887 | 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-10... |
44 | 21888 |
int reverse(int a)
{
int c[6],b[6],d[6],i,x,y,z=0;
if(a>0)
{
x=log10(a)+1;
b[0]=a;
for(i=0;i<x;i++)
{
y=pow(10,x-i-1);
c[i]=b[i]/y;
b[i+1]=b[i]%y;
}
for(i=0;i<x;i++)
{
d[i]=c[i]*pow(10,i);
z=z+d[i];
}
return z;
}
if(a<0)
{
a=-a;
x=log10(a)+1;
b[0]=a;
for(i=0;i<x;i++... |
44 | 21889 | 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]));
... |
44 | 21890 | int reverse(int num)
{
int i=0,s=0,remain=0;
if(num==0)cout<<"0";
if(num<0)
{
num=-num;
cout<<"-";
do
{
remain=num%10;
if(remain!=0||s!=0)
{cout<<remain;s++;}
num=num/10;
}while(num!=0);
}
if(num>0)
{
do
{
remain=num%10;
if(remain!=0||s!=0)
{cout<<remain;s++;}
num=num/10... |
44 | 21891 | void main()
{
int r(int num);
int i,n;
for(i=0;i<6;i++)
{
scanf("%d",&n);
printf("%d\n",r(n));
}
}
int r(int n)
{
int k,i,m=0,w=1;
int digit[10];
if(n<0)
{
n=abs(n);
for(k=0;n!=0;k++)
{
digit[k]=n%10;
n/=10;
}
for(i=k-1;i>=0;i--)
{
m+=digit[i]*w;
w*=10;
}
m=-m;
return m;
}
... |
44 | 21892 |
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... |
44 | 21893 | int fanxu(int num)
{
int m,n,l,k,a,t;
if(fabs(num)>=10000)
{
m=num/10000;
n=num/1000-m*10;
l=num/100-m*100-n*10;
k=num/10-m*1000-n*100-l*10;
t=num%10;
a=t*10000+k*1000+l*100+n*10+m;
}
else if(fabs(num)>=1000)
{
m=num/1000;
n=num/100%10;
l=num/10%10;
k=num%10;
a=k*1000+l*100... |
44 | 21894 | 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... |
44 | 21895 | void main()
{
int a,b,c,d,e,f;
int reverse(int a);
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
scanf("%d",&d);
scanf("%d",&e);
scanf("%d",&f);
a=reverse(a);
b=reverse(b);
c=reverse(c);
d=reverse(d);
e=reverse(e);
f=reverse(f);
printf("%d\n",a);
printf(... |
44 | 21896 |
void fan(char a[]);
int b[6]={0};
int i,j=0;
void main()
{
char s[100];
while(j<6)
{
fan(s);
j++;
}
for(i=0;i<6;i++)
{
printf("%d",b[i]);
printf("\n");
}
}
void fan(char a[])
{
int n,i;
scanf("%s",a);
n=strlen(a);
for(i=0;i<n;i++)
if(a[0]!='-') for(i=0;i<n;i++) b[j]=b[j]*10+a[n... |
44 | 21897 | int reverse(int num)
{
int t=1,b=0,x=0;
int i,j;
int k[10],h[10];
// scanf("%d",&num);
for(i=0;num!=0;i++)
{
k[i]=num%10;
b=b+1;
num=(num-num%10)/10;
t=t*10;
}
t=t/10;
for(i=0;i<b;i++)
{ if(k[i]!=0)break;
else t=t/10;
}
for(j=0;j<b-i;j++)
h[j]=k[i+j];
for(j=0;j<b-i;j++)
{ x=x+h[j]*... |
44 | 21898 | int fxs(int a)
{
int b[257];
int k,j;
if(a<0)
{
a=-a;
for(k=0;a>0;k++)
{
b[k]=a%10;
a=a/10;
}
for(j=0;j<k;j++)
{
a=a+b[j]*pow(10,(k-1-j));
}
a=-a;
}
else
{
for(k=0;a>0;k++)
{
b[k]=a%10;
a=a/10;
}
for(j=0;j<k;j++)
{
a=a+b[j]*(pow(10,(k-1-j)));
}
}
return a;
}
int ma... |
44 | 21899 | void main()
{int reverse(int num);
int a[6];
int i,t;
for(i=0;i<=5;i++)
scanf("%d",&a[i]);
for(i=0;i<=5;i++)
{t=a[i];
a[i]=reverse(t);
printf("%d\n",a[i]);
}
}
int reverse(int num)
{int z,d,e,f,g,h,y;
int c=1;
if(num==0)
{z=0;
}
else
{if(num>0)
y=num;
if(num<0)
y=-1*num;
d=y%10;
e=y/10%10;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.