label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
44 | 21700 | int reverse(int num)
{ int a,b,c,d,e,f;
if(num==0){
printf("0");}
else if(num<0){
num=0-num;
printf("-");}
a=(int)(num/10000);
b=(int)((num%10000)/1000);
c=(int)((num%1000)/100);
d=(int)((num%100)/10);
e=(int)(num%10);
f=10000*e+1000*d+100*c+10*b+a;
while(f%10... |
44 | 21701 |
int reverse(int num);
int main()
{
int i;
int temp;
for (i=0; i<6; i++){
scanf("%d", &temp);
printf("%d\n", reverse(temp));
}
return 0;
}
int reverse(int num)
{
int len;
int sign;
int out = 0; // Modified Unsigned
int i;
if (num==0) return 0;
sign = num / abs(num);
num = abs(num);
len = (int)log10... |
44 | 21702 | void main()
{
int a[6];
int i;
int reverse(int num);
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
reverse(a[i]);
}
int reverse(int num)
{
int indiv,ten,hundred,thousand,ten_thousand;
int c;
if(num>0)
{
ten_thousand=num/10000;
thousand=(int)(num-ten_thousand*10000)/1000;
hundred=(int)... |
44 | 21703 | 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;
... |
44 | 21704 | void arc()
{
char str[10000];
char str2[10000];
int a,b=0,c;
gets(str);
a=strlen(str);
if(a==1) putchar(str[0]);
else
{
if(str[0]=='-')
{
putchar(str[0]);
}
for(c=a-1;;c--)
{
if(str[c]=='0') b++;
else
{
printf("%c",str[c]);
b++;
break;
}
}
for(;b<a;b++)
{
... |
44 | 21705 | 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(... |
44 | 21706 | int main()
{
void nixu(int num,int sign);
int i,num,sign=0;
for(i=0;i<6;i++)
{
cin>>num;
nixu (num,sign);
cout<<endl;
}
return 0;
}
void nixu(int num,int sign)
{
int sum[10000],i=0,temp,j;
if(num==0)
cout<<0;
else
{
if(num<0)
{
... |
44 | 21707 | void main()
{
int reverse(int num);
int a[6],b[6],i;
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 n;
int i,j,k,l,m;
if(fabs(num)>=10000){
i=num/10000;
j=(num-10000*i)/1000;
k=(num-10000*i-1000*j)/100;
l=(num-1000... |
44 | 21708 | int main()
{
void reverse(int num,int flag);
for(int i=0;i<6;i++)
{
int n;
cin>>n;
if(n==0){cout<<'0'<<endl;}
else
{
if(n<0){cout<<'-';n*=-1;}
reverse(n,0); //?????????
cout<<endl;
}
}
return 0;
}
void reverse(int n... |
44 | 21709 | 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++;
... |
44 | 21710 | int Reverse(int num) //??Reverse??
{
int n,temp[10];
int f=0,j=0,k;
double l=0;
n=abs(num); //????????num????
while(n!=0)
{
temp[j]=n%10;
n=n/10;
j++; ... |
44 | 21711 |
int main()
{
int f(int m);
int count(int m);
int m[6];
for(int i=0;i<=5;i++)
{
scanf("%d",&m[i]);
}
for(int j=0;j<=5;j++)
{
printf("%d\n",f(m[j]));
}
}
int count(int m)
{
int a=1;
int i;
for(i=0;i<=m-1;i++)
{
a=a*10;
}
return a;
}
int... |
44 | 21712 | int reverse(int num);
int res(int q,int w,int t);
int main(){
int n[7],n1[7],i;
char c;
for(i=1;i<=6;i++){
scanf("%d",&n[i]);
if(n[i]<0){
n1[i]=0-n[i];
c='-';
}
else{
n1[i]=n[i];
c='+';
}
if(c=='+') printf("%d\n",reverse(n1[i]));
if(c=='-') printf("-%d\n",reverse(n1[i]));
}
scanf("%d",&i... |
44 | 21713 | 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;... |
44 | 21714 | int reverse(int num)
{
int numnew;
if(num==0)
return 0;
else
{
if(num>0)
{
numnew=0;
while(num>0)
{
numnew=numnew*10+num%10;
num=num/10;
}
return numnew;
}
else if(num<0)
{
num=-num;
numnew=0;
while(num>0)
{
numnew=numnew*10+num%10;
num=num/10;
}
return ... |
44 | 21715 | 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... |
44 | 21716 | int rev(int m)
{
char s[1050];
int k=m;
int ans=0;
int i=0;
while (k>0)
{
s[i]=k%10;
k/=10;
i++;
}
i--;
int base=1;
while (s[i]==0) i--;
for (;i>=0;i--)
{
ans+=s[i]*base;
base*=10;
}
return ans;
}
main()
{
for (int kk=1;kk<=6;kk++)
{
int n,m;
scanf("%d",&n);
if (n<0) m=0-n; else m=n;
if (m==0) printf("0\n");
else
{
m=... |
44 | 21717 | int reverse(int n)
{
int i,j,d[201],timer=0,neo=0,e=1;
if(n<0)
n*=-1;
do
{
timer++;
d[timer]=n%10;
n/=10;
} while(n>0);
for(i=1;i<=timer;i++)
{
for(j=1;j<=timer-i;j++)
{
e*=10;
}
neo+=d[i]*e;
e=1;
}
return neo;
}
int main()
{
int n,i;
for(i=1;i<7;i++)
{
scanf("%d",&n);
if(n<0)
pr... |
44 | 21718 |
int main(){
int reverse(int num);
int i,num,a;
for(i=0;i<6;i++){
scanf("%d",&num);
a=reverse(num);
printf("%d\n",a);
}
return 0;
}
int reverse(int num){
int z=0,a,i,j;
if(num>=0){
for(i=0;i<10;i++){
a=num%10;
num=num/10;
z=z*10+a;
if(num==0){
break;
}
}
}
else{
num=-num;
for(j... |
44 | 21719 | int main()
{
void reverse(int num);
int num,i;
for(i=0;i<6;i++)
{
cin>>num;
reverse(num);
}
return 0;
}
void reverse(int num0)
{
int num1=0,n=1;
while(num0/n!=0)
{n=n*10;}
for(int i=10;i<=n;i=i*10)
{
num1=num1+(num0%i)/(i/10)*(n/i);
num0=num0-... |
44 | 21720 | 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;
... |
44 | 21721 | 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;... |
44 | 21722 | int reverse(int x);
int main(){
int i,m;
for(i=0;i<6;i++)
{
scanf("%d",&m);
m=reverse(m);
printf("%d\n",m);
}
return 0;
}
int reverse(int x){
int j,p;
p=x;
int q;
for(j=0;;j++)
{
p=p/10;
if(p==0)
{
q=j;
break;
}
}
p=0;
for(j=0;j<q+1;j++)
{
p+=(x%10)*pow(10,q-j);
x=x/10;
}
retu... |
44 | 21723 | int RevNum(int n)
{ int s=0;
if(n>=0)
{
while(n/10!=0)
{
s=n%10;
n=n/10;
printf("%d",s);
}
printf("%d\n",n);
}
else
{
n=abs(n);
printf("-");
while(n/10!=0)
{
s=n%10;
n=n/10;
printf("%d",s);
}
printf("%d\n"... |
44 | 21724 | void reserve(int a)//??????
{
int rest,yu;
yu=a%10;//?????????
a=a/10;
if (a>=1)
{
cout<<yu;
reserve(a);
}
else cout<<yu<<endl;
}
int main()
{
int input,i;//?????i????
for(i=0;i<6;i++)
{
cin>>input;
... |
44 | 21725 | int reverse(int num)
{
if(num>0)
{
int a[10],i,la,sum=0;
double temp;
for(i=0;i<=9;i++)
{
a[i]=-1;
}
for(i=0;i<=9;i++)
{
if(num>0)
{
a[i]=num%10;
num=(int)((num-a[i])/10);
}
}
for(i=0;i<=9;i++)
{
if(a[i]==-1)
{
la=i;
break;
}
}
for(i=0;i<=la;i++)
{
tem... |
44 | 21726 | void reverse(int num)//?????????
{
if(num==0)//?0????
cout<<num<<endl;
else if(num>0)
{
int i=0,n;
int a[20];
while(num!=0)//??0???????????
{
a[i]=num%10;
num=num/10;
i++;
}
n=i;//????
int count=0;
for(i=0;i<20;i++)//??????????0?????
{
if(a[i]==0)
count++;
else break;
}
for... |
44 | 21727 | int reverse(int num)
{
int ge=0,shi=0,bai=0,qian=0,wan=0,out;
int sign=1;
if(num<0) sign=-1;
if(num==0)
{
out=0;
goto end;
}
num=abs(num);
wan=(int)num/10000;
qian=(int)(num-10000*wan)/1000;
bai=(int)(num-1000*qian-10000*wan)/100;
shi=(int)(num-1000*qian-100*bai-10000*wan)/10;
ge=num-10000*wan-1000*qian... |
44 | 21728 | int reverse(int num);
int main()
{
int i,a;
for (i=1;i<=6;i++)
{
scanf("%d",&a);
printf("%d\n",reverse(a));
}
}
int reverse(int num)
{
int abs1,zhengfu=1,ge=0,shi=0,bai=0,qian=0,wang=0,fanxu;
if (abs(num)==0)
return 0;
else
if(num<0)
{
zhengfu=-1;
}
abs1=abs(num);
if ((10000<=abs1)&&(abs1<=32767... |
44 | 21729 | int reverse(int p)
{
int m=0,k;
k=abs(p);
if (p!=0)
{
while (k!=0)
{
m=m*10+k%10;
k=k/10;
}
m=m*(abs(p)/p);
}
else m=0;
return m;
}
int main()
{
int num,i;
for (i=0;i<6;i++)
{
cin >>num;
cout <<reverse(num)<<endl;
}
return 0;
} |
44 | 21730 | 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);
... |
44 | 21731 | int reverse(int num);
int main()
{
int a[6],i,z;
for(i=0;i<6;i++){
scanf("%d",&a[i]);
}
for(i=0;i<6;i++){
z=reverse(a[i]);
if(i==0){
printf("%d",z);
}else{
printf("\n%d",z);
}
}
return 0;
}
int reverse(int num){
int a=0,Num,n,m;
Num=num;
if(Num/10==0){
n=0;
}else{
n=0;
while(n>=0){
Num=Num/1... |
44 | 21732 | 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
{
... |
44 | 21733 | void main()
{
int i,a[6];
int reverse(int num);
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<6;i++)
{
printf("%d\n",reverse(a[i]));
}
}
int reverse(int num)
{
int i,x[5],y=0,a,j;
for(i=0;i<5;i++)
{
x[i]=num%10;
num=(num-x[i])/10;
}
for(i=4;i>=0;i--)
{
... |
44 | 21734 | 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... |
44 | 21735 | int reverse(int num)
{
int rvs=0,i,j,a[100],numz;
if(num==0)rvs=0;
else
{
if(num<0)numz=0-num;
else numz=num;
for(i=0;;i++)
{
a[i]=numz%10;
numz/=10;
if(numz<1)break;
}
for(j=0;j<i+1;j++)
{
rvs*=10;
rvs+=a[j];
}
if(num<0)rvs*=(-1);
}
return rvs;
}
int main()
{
int n,i;
fo... |
44 | 21736 | int reverse(int a);
int R(int a);
main()
{
int i,j,k;
for(i=1;i<=6;i++)
{
scanf("%d",&j);
k=reverse(j);
printf("%d\n",k);
}
}
int R(int a)
{
int i,b,c=0;
for(i=1;a>0;i++)
{
b=a%10;
c=c*10+b;
a=a/10;
}
return(c);
}
int revers... |
44 | 21737 | int reverse(int num)
{
int r=0, m, n=1, s=1, i=0, j=1;
int a, C=1;
if(num < 0)
{
num = -num;
C = 0;
}
while(s!=0)
{
j = j * 10;
s = num / j;
i++; //i?num???
}
for(m = i; m > 0; m--)
{
j = j/10;
r = r + (num/j) * n;
n = n * 10;
a = num/j;
num = num - a * j;
}
if(C == 0)
r = -... |
44 | 21738 | int reverse(int num)
{
int a,b,c,d,b1,b2,b3,b4,b5,t;
if(num==-32768) a=num;
t=abs(num);
if(t<10) a=num;
else if(t>=10&&t<=99)
{
b1=t%10;
b2=(t-b1)/10;
a=b1*10+b2;
}
else if(t>=100&&t<=999)
{
b1=t%10;
c=t%100;
b3=(t-c)/100;
b2=(t-100*b3-b1)/10;
a=b1*100+b2*10+b3;
}
else if(t>=1000&&t<=99... |
44 | 21739 | int main ()
{
for (int i=1;i<=6;i++)
{
char a[100]={0},l;
for (int i=1;i<=50;i++)
{
a[i]=getchar();
if (a[i]=='-')
{
a[0]='-';
i--;
}
if (a[i]=='\n')
{
l=i-1;
... |
44 | 21740 |
void reverse( int x )
{
int i , j ;
char s[10] ;
if ( x >= 0 )
{
sprintf(s , "%d" , x );
for ( i = sizeof(s)-1 ; i >= 0 ; i --)
{
if ( s[i] > '0' && s[i] <= '9')
{
for ( j = i ; j >= 0 ; j --)
printf("%c" , s[j]);
break ;
}
}
}
else
{
printf("-");
reverse(-x);
}
}
int main(... |
44 | 21741 | int reverse(int n)
{
int i,j,s,a[20],t=0;
if(n>=0)
s=n;
else
s=-n;
for(i=0;s!=0;i++)
{
a[i]=s%10;
s=(s-a[i])/10;
}
for(j=0;j<i;j++)
{
t=10*t+a[j];
}
if(n<0)
return -t;
else
return t;
}
main()
{
int i,c[6]... |
44 | 21742 | int reverse (int num)
{
int a[12];
int i,j,k,p;
if(num==0)
{
printf("0");
}
else
{
if(num>0)
{
a[0]=1;
}
if(num<0)
{
a[0]=0;
num=0-num;
}
if(a[0]==0)
{
printf("-");
}... |
44 | 21743 | int fanxu(int x); //????
int main()
{
int i,num[6];
for(i=0;i<6;i++)
{
cin>>num[i];
}
for(i=0;i<6;i++)
{
cout<<fanxu(num[i])<<endl; //??????
}
return 0;
}
int fanxu(int x)
{
int y=0,i=0,j,a[10],temp;
while(x!=0) //????????????
{
a[i]=x%10;
x=x/10;
i... |
44 | 21744 |
double i = 0;
int reverse (int n);
int main ()
{
int n;
while (cin >> n)
{
if (n == 0)
{
cout <<"0"<<endl;
continue;
}
if ( n < 0)
{
cout << "-";
n = -n;
}
i = 0;
cout << reverse (n) << endl;
}
return 0;
}
int reverse (int n)
{
if (n < 10)
return n;
int t;
t = reverse(n/10);
... |
44 | 21745 | int change(int x)
{
int t,i;
t=0;
i=0;
while(x!=0)
{
t=t*10+x%10;
x=x/10;
i++;
}
return(t);
}
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",change(a[i]));
}
|
44 | 21746 | int f(int a);
int main()
{
int x,j,c[6];
for(j=1;j<=6;j++)
{
cin>>x;
c[j]=f(x);
}
for(j=1;j<=6;j++)
{
cout<<c[j]<<endl;
}
return 0;
}
int f(int a)
{
int i,b=0,t;
for(i=1;a!=0;i++)
{
t=a%10;
b=b*... |
44 | 21747 |
int main()
{
int reverse (int n);
int s[6]={0},z[6]={0},i;
for (i=0;i<6;i++)
{
scanf("%d",&s[i]);
z[i]=reverse (s[i]);
printf("%d\n",z[i]);
}
return 0;
}
int reverse (int n)
{
int z,t=0;
if (n==0)
z=0;
while(n!=0)
{
t=t*10+n%10;
n=n/10;
}
if (n<0)
{
z=t*(-1);
}else{
z... |
44 | 21748 | int reverse(int num){
int i,b,k,a=1000,x=0;
for(i=10;a>0;i=10*i,x++){
a=num/i;
}
if(x==1){
k=num;
}
else{
k=(num%10);
for(b=1;b<x;b++){
k=k*10;
}
k+=reverse(num/10);
}
return k;
}
int main(){
int u[10],j;
for(j=0;j<6;j++){
scanf("%d",&u[j]);
}
for(j=0;j<6;j++){
if(u[j]==0) printf("%d\n",0... |
44 | 21749 | int p(int i)//???
{
int s=1;
for(int j=1;j<=i;j++)
{
s=s*10;
}
return s;
}
int size(int a)//????????
{
int b,S=1;
for(b=1;b<20;b++)
{
S=S*10;
if(S>a)
break;
}
return (b);
}
int reserve(int n)//?????
{
int g=0,k;
if(n==0)//???0??????0
{
g=0;
}
... |
44 | 21750 | void main()
{
int a[6],b[5],c[6],i;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
{
b[0]=a[i]/10000;
b[1]=a[i]/1000-10*b[0];
b[2]=a[i]/100-10*b[1]-100*b[0];
b[4]=a[i]%10;
b[3]=(a[i]%100-b[4])/10;
if(a[i]/10000!=0)
c[i]=b[0]+b[1]*10+b[2]*100+b[3]*1000+b[4]*10000;
else if(a[i]/1000!=0)
c[i]=b[1]+b[... |
44 | 21751 | int reverse(int num)/*?????????*/
{
int ws=0/*??*/,new_num=0,i,a=num;
int ten=1;
while (a>0)
{
ws++;
a=a/10;
}
for(i=0;i<ws;i++)
ten=ten*10;
i=1;
ten=ten/10;
while(ten>0)
{
new_num=num/ten*i+new_num;
num=num%ten;
i=i*10;
ten=ten/10;
}
return(new_num);
}
void main()
{
int a[6]={0},i,j;
f... |
44 | 21752 | 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;
}
r... |
44 | 21753 | void main()
{
int disorder(int n);
int a[6],i,b[6];
for(i=0;i<6;i++)
{scanf("%d",&a[i]);
b[i]=disorder(a[i]);}
for(i=0;i<6;i++)
{printf("%d\n",b[i]);}
}
int disorder(int n)
{
int a,c;
if(n>0)
{a=n;c=0;
while(a>0)
{
c=c*10+a%10;
a/=10;}
return c;}
if(n<0)
{a=-n;c=0;
while(a>0)
{
c=c*10+a%10;
... |
44 | 21754 | int main()
{
int reverse(int n);
int i,n,j=0;
int a[6];
for(i=0;i<6;i++){
scanf("%d",&a[i]);
}
for(i=0;i<6;i++){
if(a[i]<0){
a[i]=0-a[i];
j=reverse(a[i]);
... |
44 | 21755 | 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--)
{... |
44 | 21756 | void reverse(int a)
{
cout<<a%10;
if(a/10!=0)
reverse(a/10);
}
int main()
{
int a,i,j;
for(i=1;i<=6;i++)
{
cin>>a;
if(a>=0)
{
for(j=0;;j++)
{
if(a%10==0)
a=a/10;
else
break;
}
reverse(a);
cout<<endl;
}
else
{
a=-a;
for(j=0;;j++)
{
if(a%10==0)
a=a/10;
... |
44 | 21757 | void turn(char *a,int n)
{
char *p,*q;
int i,j,t,k;
k=n/2+n%2;
p=a,q=a+n-1;
for(i=0;i<=k-1;i++)
{
t=*(p+i);
*(p+i)=*(q-i);
*(q-i)=t;
}
}
main()
{
int ii;
for(ii=0;ii<=5;ii++)
{
char A[100];... |
44 | 21758 | int reverse(int num)
{
int res;
res=num;
int i,j;
int ct;
for(j=0;;j++)
{
if(res<pow(10.0,j+1)&&res>=pow(10.0,j))
{
ct=j+1;
break;
printf(",");
}
else
{}
}
int shuwei[100];
for(i=1;i<=ct;i++)
{
shuwei[i-1]=res%10;
res/=10;
}
int ans=0;
for(i=1;i<=ct;i++)
{
ans+=shuwei[i-1]*pow(10.... |
44 | 21759 | int reverse(int num)
{
int a=0,i,b=1,j=0;
int m[5]={0};
for(i=0;(i<=5)&&(num!=0);i++)
{
m[i]=num%10;
num=num/10;
j++;
}
for(i=j-1;i>=0;i--)
{
a=a+m[i]*b;
b=b*10;
}
return a;
}
main()
{
int i,n,c;
for(i=1;i<=6;i++)
{
scanf("%d",&n);
c=reverse(n)... |
44 | 21760 | int main()
{
void reserve(int num);
int x[6],i;
for(i=0;i<6;i++)
scanf("%d",&x[i]);
for(i=0;i<6;i++)
reserve(x[i]);
return 0;
}
void reserve(int a)
{
int j,p[1000],q,m;
if(a==0)
printf("0");
else
{if(a<0)
{
printf("-");
a=-a;
}
for(j=0;;j++)
{
p[j]=a%10;
a=a/10;
if(a==0)
break;
}
q... |
44 | 21761 | void main()
{
int reverse(int n);
int i;
int a[6],b[6];
for (i=0;i<=5;i++)
scanf("%d",&a[i]);
for (i=0;i<=5;i++)
b[i]=reverse(a[i]);
for (i=0;i<=5;i++)
printf("%d\n",b[i]);
}
int reverse(int n)
{
int f=0,i,j,m,p,q,c[10],d[10];
if (n>0)
{
p=log10(n);
for (i=0;i<=p;i++)
{
q=pow(10,(p-i));
c[i]... |
44 | 21762 | int reverse(int num);
void main()
{
int a[10],i;
int b[10];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);}
for(i=0;i<6;i++)
{
b[i]=reverse(a[i]);
printf("%d\n",b[i]);
}
}
int reverse(int num)
{int x,y,z;
if(num<0)
{
x=-num;
if(x>0&&x<10)
return(-x);
if(x>=10&&x<=99)
{z=(x-(x/10)*10)*10+x/10;
return(-z);... |
44 | 21763 |
void reverse(char a[])
{int i,p;
char t;
if(a[0]!='-')
{for(i=0;i<strlen(a)/2;i++)
t=a[i],a[i]=a[strlen(a)-i-1],a[strlen(a)-i-1]=t;
p=0;
while(a[p]=='0') p++;
for(i=p;i<strlen(a);i++)
printf("%c",a[i]);
printf("\n");}
else
if(a[1]=='0') printf("0\n");
else
{for(i=1;i<(strlen(a)/2+1);i++)
t=a[... |
44 | 21764 | int reverse(int);
int main()
{
int i,in[6];
for(i=0;i<6;i++){
scanf("%d",&in[i]);
if(i<5)
getchar();
in[i]=reverse(in[i]);
}
for(i=0;i<6;i++){
printf("%d",in[i]);
if(i<5)
printf("\n");
}
return 0;
}
int reverse(int n)
{
int dig,i,ans=0,del;
dig=(int)log10(abs(n));
for(i=0;i<=dig;i++){
del=... |
44 | 21765 | //-------------------
// ???
// 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 | 21766 | int reverse(int num)
{ int i=0,a[100],m=0,j,y=1;
if(num<0)
{ num=-num;
y=0;
}
while(1)
{ if(num<10)
break;
a[i]=num%10;
num=num/10;
i++;
}
for(j=0;j<i;j++)
{ m+=a[j]*(pow(10,(i-j)));
}
m+=num;
if(y==0)
return -m;
else
return m;
}
int main()
{int i=0,j,n;
while(i<6)
{ scanf("%d",&n);
j=r... |
44 | 21767 | int fanxu(int n)
{
int m,a[5];
a[4]=n/10000;a[3]=(n/1000)%10;a[2]=(n/100)%10;a[1]=(n/10)%10;a[0]=n%10;
if(a[4]!=0) m=10000*a[0]+1000*a[1]+100*a[2]+10*a[3]+a[4];
else if(a[4]==0&&a[3]!=0) m=1000*a[0]+100*a[1]+10*a[2]+a[3];
else if(a[4]==0&&a[3]==0&&a[2]!=0) m=100*a[0]+10*a[1]+a[2];
else if(a[4]==0&&a[3]==0&&... |
44 | 21768 | int reverse(int a);//??reverse??
int main()//?????
{
int n[6],num[6],i;
for(i=0;i<6;i++)cin>>n[i];//??????6???
for(i=0;i<6;i++)num[i]=reverse(n[i]);//????????num??
for(i=0;i<5;i++)cout<<num[i]<<endl;//??num????????????
cout<<num[5];//???????
return 0;
}//?????
int reverse(int a)//reverse??
{
int x[100],i=0,sum=0... |
44 | 21769 | void main()
{
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 numr,i,j,digit[10],flag=0;
if (num<0) {num=-num;flag=1;}
for(i=0;;i++)
{
digit[i]=num%10;
num=(num-digit[i])/10;
if(num==0) break;
}
numr=0;
for(j=0;j<=... |
44 | 21770 | 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 | 21771 | void main()
{
int h,i,j,k,l,m;
scanf("%d%d%d%d%d%d",&h,&i,&j,&k,&l,&m);
int reverse(int x);
h=reverse(h);
i=reverse(i);
j=reverse(j);
k=reverse(k);
l=reverse(l);
m=reverse(m);
printf("%d\n%d\n%d\n%d\n%d\n%d\n",h,i,j,k,l,m);
}
int reverse(int x)
{
int a,b,c,d,e,f,y;
if(x<0)
{
f=-1*x;
x=f;
a=x%10;
... |
44 | 21772 | int main()
{
int n,i;
void reverse(int num);
for(i=0;i<6;i++)
{
scanf("%d",&n);
reverse(n);
}
return 0;
}
void reverse(int num)
{
int i,result,k;
if(num<0)
{
printf("-");
num=num*-1;
k=0;
while(num/10!=0)
{
if(num%10!=0)
{
k=1;
}
if(k!=0)
{
printf("%d",num%10);
}... |
44 | 21773 | 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 | 21774 | //??? 1000010334
char n[10]; //cin.getline the z
void type0(); //0??-0???
void typefu(); //?????
void typezh(); //?????
int main()
{
int i=0,j=0; //circulate
for(i=0;i<6;i++) //6?
{
for(j=0;j<10;j++)
{
n[j]='\0';
}
cin.getline(n,10); //??
if(n[0]=='0'||(n[1]=='0'&&n[0]=='-'))
{
type0(... |
44 | 21775 | void main()
{
int reverse(int num);
int a[6];
int i,c;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(i=0;i<6;i++)
{
c=reverse(a[i]);
printf("%d",c);
if(i<5)
printf("\n");
}
}
int reverse(int num)
{
int num1,i,n,k,num2=0;
if(num<0)
num1=(-num);
else
num1=num;
n=log10(num1);
for(i=n+1;i>0;i--)
{
k... |
44 | 21776 | void reverse(char a[100])
{
int i,j,m,t,n;m=strlen(a);n=m/2;
if(a[0]==45)
{
for(i=1;i<n+1;i++)
{ t=a[i];a[i]=a[m-i];a[m-i]=t;
}printf("%c",a[0]);
for(i=1;i<m;i++)
{if(a[i]!='0')
{printf("%c",a[i]);break;}
else continue;
}
for(i=i+1;i<m;i++)
{
printf("%c",a[i]);
}
printf("\n");
}
... |
44 | 21777 | int dao(int x)
{
int s;
int i;
int r=1;
int a[100];
int y=0;
if(x<0){x=-x;}
int p=x;
for(i=0;;i++)
{
if(p/10>0)
{
a[i]=p%10;
p=p/10;
}
else{a[i]=p%10;i++; s=i;break;}
}
for(int j=0;j<=s-1;j++)
{
for(int k=0;k<=j-1;k++)
{r=r*... |
44 | 21778 | void main()
{
int r(int x);
int a [6],i,x,y;
for (i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<6;i++)
{
y=r(a[i]);
printf("%d",y);
if(i!=5)
printf("\n");
}
}
int r (int x)
{
int y,m,i,b[50];
if (x==0)y=0;
else if (x<0)
{
x=-x;
m=(int) log10(x);
for (i=m;i>=0;i--)
{
b[i]=(int)(x/pow(10... |
44 | 21779 | void main()
{
int copy(int m);
int a[6],b,i;
for(i=0;i<6;i++)
{ scanf("%d",&a[i]);
b=copy(a[i]);
printf("%d\n",b);
}
}
int copy(int m)
{
int a,b,c;
a=m;
b=a%10;
do
{
a=a/10;
c=a%10;
b=b*10+c;
}
while(a/10!=0);
return b;
}
|
44 | 21780 |
int reverse(int num)
{
int m;
int d=0;
m=num;
while(m!=0)
{
d=d*10+m%10;
m=m/10;
}
return d;
}
int main()
{
int i,j,a[1000],b[1000],c;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
... |
44 | 21781 | 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;
if (flag)
for (j=0;j<=i-1;j++)
re_n=re_n*10+num[j];
else re_n=n; //flag==0 means that n is 0-9... |
44 | 21782 | 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;
}
}
in... |
44 | 21783 | int reverse(int num)
{
int i=0,mun=0,a[10]={0},flag=0;
if(num<0)
{
flag=1;
num=-num;
}
while(num>0)
{
a[i]=num%10;
num=(num-a[i])/10;
mun=mun*10+a[i];
i++;
}
if(flag)return -mun;
else return mun;
}
int main()
{
int i,a[100]={0};
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
printf("%d\n",reverse(a[i... |
44 | 21784 | 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;
... |
44 | 21785 | int reverse(int num){
int nnum;
int abs;
if(num<0){
abs=-num;
}else{
abs=num;
}
int weishu[20],i=1;
while(abs!=0){
weishu[i]=abs%10;
abs=abs/10;
i++;
}
int nabs=0;
int j;
for(j=1;j<i;j++){
nabs=nabs*10+weishu[j];
}
if(num<0){
nnum=-nabs;
}else{
nnum=nabs;
}
return nnum;
}
int main()
{
i... |
44 | 21786 |
int reverse(int num)
{
int i,j,k,c,N,renum;
for(i=0;c!=0;i++)
c=num/pow(10,i);
int a[20];
a[0]=num/pow(10,i-1);
N=num;
for(j=1;j<i;j++){
a[j]=(N-a[j-1]*pow(10,i-j))/pow(10,i-j-1);
N-=a[j-1]*pow(10,i-j);
}
renum=0;
for(j=i-1,k=0;j>=0,k<i;j--,k++)
renum+=a[j]*pow(10,i-k-2);
return renum;
}
main()
{
i... |
44 | 21787 |
int main()
{
int a[N];
int i;
int reverse(int x);
for(i=0;i<N;i++)
scanf("%d",&a[i]);
for(i=0;i<N;i++)
printf("%d\n",reverse(a[i]));
return 0;
}
int reverse(int x)
{
int y,i,j,r;
int a[M];
for(r=0;x>=10||x<=-10;r++)
{
a[r]=x%10;
x=(x-x%10)/10... |
44 | 21788 | int reverse(int num)
{
int a=0,b=0,c=0;
if (num==0) {c=num;}
else if (num<0)
{
a=-num;
do
{b=a%10;
c=(c+b)*10;
a=a/10;}
while (a>9);
c=-c-a;
}
else
{
a=num;
do
{b=a%10;
c=(c+b)*10;
a=a... |
44 | 21789 | void main()
{
int reverse(int num);
int a[6],i,c[6];
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<6;i++)
{
c[i]=reverse(a[i]);
printf("%d\n",c[i]);
}
}
int reverse(int num)
{
int z,a,b,c,d,e;
if(num>=0)
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... |
44 | 21790 | int reverse(int num)
{
int i=1,sum=0,yushu[50],j,k,p=0;//yushu????
if (num<0)
{
num=-num;//????0??????
p=-1;//????
}
while(num>=1)
{
yushu[i]=num%10;//???????
i++;
num=num/10;
}
for(j=1;j<i;j++)
{
... |
44 | 21791 | int digit(int n)
{
int q=1,i;
for(i=0;q>0;i++)
{
q=n/10;
n=n/10;
}
return i;
}
int digz(int n)
{
int i,q=0,r=10;
for(i=0;q==0;i++)
{
q=n%10;
n=n/10;
}
return i-1;
}
int fx(int a)
{
int b=0,m,n=1... |
44 | 21792 |
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;... |
44 | 21793 | int reverse(int num);
int main()
{
int a[6],i,k;
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
k=reverse(a[i]);
printf("%d\n",k);
}
return 0;
}
int reverse(int num)
{
int b,c=0,i,j;
for(i=0;;i++)
{
b=num%10;
num=num/10;
c=10*c+b;
if(num==0)
break;
}
return c;
}
|
44 | 21794 | 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;
}
pri... |
44 | 21795 | int fx(int n)
{
int a[10],i,j,k;
i=0;
if(n==0)
{
printf("0");
}
while(n!=0)
{
a[i]=n%10;
n=(n-a[i])/10;
i++;
}
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(a[k]!=0)
{
break;
}
}
if(j>=k)
{
printf("%d",a[j]);
}
}
printf("\n");
return 0;
}
int main()
{
int i,b[6],n,k;
for(i=... |
44 | 21796 |
int reverse(int x);
int main()
{
int re_num,num,i;
for(i=0;i<6;i++){
scanf("%d",&num);
re_num=reverse(num);
printf("%d\n",re_num);
}
return 0;
}
int reverse(int x){
int a,b,c,d,e,y;
a=x/10000;
b=x/1000%10;
c=x/100%10;
d=x/10%10;
e=x%10;
if(a!=0){
y=e*10000+d*1000+c*100+b*10+a;
}
else if(b!=0){
... |
44 | 21797 | void main()
{
int i;int a[6];
int b;
int reverse(int x);
for(i=1;i<=6;i++)
{
scanf("%d",&a[i-1]);
}
for(i=0;i<=5;i++)
{
b=reverse(a[i]);
printf("%d\n",b);
}
}
int reverse(int x)
{
int y;
if(-9<=x&&x<=9)y=x;
else if(x>=10&&x<100)
y=x%10*10+(int)(x/10);
else if(x>=100&&x<1000)
y=x%10*100+x/... |
44 | 21798 | 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... |
44 | 21799 | 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;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.