id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,400 | int main()
{
int i,j,n,a[100],b[100];
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
b[n-i+1]=a[i];
}
for(j=1;j<n;j++)
{
cout<<b[j]<<" ";
}
cout<<b[j]<<endl;
return 0;
} | 47 |
23,401 | int main()
{
int n,m,i,t,a[100],b[100];
cin>>n;
cin.get();
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n/2;i++)
{ t=a[i];
a[i]=a[n-i-1];
a[n-i-1]=t;}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1];
return 0;
}
| 47 |
23,402 | int main(){
int i,n,s[100];
scanf("%d/n",&n);
for(i=0;i<n;i++){scanf("%d",&s[i]);};
for(i=n-1;i>=0;i--)
{
if(i!=0){
printf("%d ",s[i]);}
else{printf("%d",s[i]);};
}
return 0;
}
| 47 |
23,403 | int main(){
int n,a[100];
cin>>n;
int i;
for(i=0;i<n;i++)
{
cin>>a[i];
}
int j;
for(j=n-1;j>=0;j--){
cout<<a[j];
if(j!=0)
cout<<" ";
}
return 0;
}
| 47 |
23,404 | int main (){
int i,n[100],k;
scanf("%d",&k);
for(i=0;i<=k-1;i++)
scanf("%d",&n[i]);
for(i=0;i<=(k-1)/2;i++){
int e;
e=n[k-i-1];
n[k-i-1]=n[i];
n[i]=e;
}
for(int i=0;i<=k-2;i++){
printf("%d ",n[i]);
}
printf("%d",n[k-1]);
return 0;
}
| 47 |
23,405 |
int main()
{
int n,i,j,temp;
cin>>n;
int a[101];
for (i = 0;i < n;i++)
cin>>a[i];
int *p = a;
for (i = 0,j = n-1;i < j;i++,j-- )
{
temp = *( p + i );
*( p + i ) = *( p + j );
*( p + j ) = temp;
}
for (i = 0;i < n;i++)
{
if (i == n-1)
cout<<p[i];
else
cout<<p[i]<<' ';
}
} | 47 |
23,406 | void main()
{
int i,n;
scanf("%d",&n);
int a[100];
int *p=a;
int *e=p+(n-1);
for(i=0;i<n;i++,p++)
scanf("%d",p);
for(i=0;i<n-1;i++,e=e-1)
printf("%d ",*e);
printf("%d",*e);
} | 47 |
23,407 | void main()
{
int n,a[128],*p;
scanf("%d",&n);
for(p=a+n;p>=a+1;p--)
scanf("%d",p);
for(p=a+1;p<=a+n-1;p++)
printf("%d ",*p);
printf("%d",*p);
} | 47 |
23,408 | int main(){
int x[100],y[100];
int i,n,j;
scanf("%d",&n);
for(i=0,j=n-1;i<n;i++,j--)
{scanf("%d",&x[i]);
y[j]=x[i];}
for(j=0;j<n-1;j++)
{printf("%d ",y[j]);}
printf("%d",y[n-1]);
return 0;
}
| 47 |
23,409 | //**************************************************
//*??????????.cpp *
//*?????? *
//*?????2011.10.26 *
//*??????????? *
//**************************************************
int main()
{
int n=0,i=0,j=0; int num[100]; //??????n???????????????0???????i,j??????0???????num,????????
cin>>n;
for(i=0;i<n;i++) //????????
{
cin>>num[i];
}
j=n-1; //?????
do
{ cout<<num[j];
if(j>0)
{
cout<<" ";
}
j--;
}while(j>=0);
return 0;
} | 47 |
23,410 | int main()
{
int n,i,a[100],b[100];
cin>>n;
for(i=0;i<=n-1;i++)
cin>>a[i];
for(i=0;i<=n-1;i++)
b[i]=a[n-1-i];
for(i=0;i<=n-2;i++)
{cout<<b[i]<<" ";}
cout<<b[n-1];
return 0;
} | 47 |
23,411 |
int main()
{
int n,a[101]={0},b[101]={0},i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
b[i]=a[n-i-1];
}
for(i=0;i<(n-1);i++)
printf("%d ",b[i]);
printf("%d",b[n-1]);
return 0;
}
| 47 |
23,412 | int main()
{
int n;
int a[100],b[100];
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
b[n-i-1]=a[i];
}
for(int j=0;j<n-1;j++)
cout<<b[j]<<" ";
cout<<b[n-1]<<endl;
return 0;
} | 47 |
23,413 | /*
* ????????.cpp
* ?????
* ????: 2012-12-9
* ?????????
*/
int main(){ //?????
int a[110]={0};
int *p=NULL;
int n=0,i=0;; //??????????
cin>>n; //??n
for(i=0;i<n;i++){
cin>>a[i];
} //????
p=&a[n-1]; //???p????a???????
for(i=n-1;i>=1;i--){
cout<<*p<<" ";
p--;
} //?????n-1?
cout<<*p<<endl; //??????1???
return 0;
} //????? | 47 |
23,414 | void reverse(int n)
{
if(n>0)
{
int c;
char d;
cin>>c;
d=getchar();
reverse(n-1);
cout<<d<<c;}
}
int main()
{
int n;
cin>>n;
reverse(n);
return 0;
}
| 47 |
23,415 | int main()
{
int n;
scanf("%d",&n);
int sz[n];
for(int i=0;i<n;i++)
{
scanf("%d",&(sz[i]));
}
for(int j=n-1;j>=0;j--)
{
if(j==0)
{
printf("%d",sz[j]);
}
else
{
printf("%d ",sz[j]);
}
}
return 0;
}
| 47 |
23,416 | int main ()
{
int i,n;
scanf("%d",&n);
int q[100];
for(i=0;i<n;i=i+1){
scanf("%d",&(q[i]));
}
for(i=n-1;i>=1;i=i-1){
printf("%d ",q[i]);
}
printf("%d",q[0]);
return 0;
}
| 47 |
23,417 | /*??????*/
int main()
{
int n;
int num[100];
cin>>n;//?????????n
int i,j;
int t;
for(i=0;i<n;i++)//????num
{
cin>>num[i];
}
for(i=0,j=n-1;i<=(n-1)/2;i++,j--)//??????
{
t=num[i];
num[i]=num[j];
num[j]=t;
}
for(i=0;i<n-1;i++)
{
cout<<num[i]<<" ";//??????
}
cout<<num[n-1]<<endl;
return 0;
} | 47 |
23,418 | int main()
{
int sz[100],dx[100];
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
j=n-1-i;
dx[j]=sz[i];
}
for(j=0;j<n-1;j++)
{
printf("%d ",dx[j]);
}
if(j==n-1)
printf("%d",dx[j]);
return 0;
}
| 47 |
23,419 | int main()
{
int n=0,i=0,a[100];
cin >>n;
for(i=0;i<n;i++)
cin >>a[i];
for(i=0;i<n;i++)
{
if(i==0)
cout <<a[n-1-i];
else
cout <<" " <<a[n-1-i];
}
cout <<endl;
return 0;
}
| 47 |
23,420 | void main()
{int *i,*j,n,x[100],y[100];
scanf("%d",&n);
for (i=x;i<x+n;i++)
scanf("%d",i);
for (j=y,i=i-1;i>=x;i--,j++)
*j=*i;
for (i=x,j=y;i<x+n;i++,j++)
*i=*j;
for (i=x;i<x+n-1;i++)
printf("%d ",*i);
printf("%d",*i);
} | 47 |
23,421 | void main()
{
int n,i,j,a[100];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(j=n-1;j>=1;j=j-1)
{
printf("%d ",a[j]);
}
printf("%d",a[0]);
} | 47 |
23,422 |
int main(void)
{
int arr[100], n;
int i;
scanf("%d",&n);
for(i=0;i<n;++i)
scanf("%d",&arr[i]);
for(i=0;i<n/2;++i)
{
arr[i]^=arr[n-i-1];
arr[n-i-1]^=arr[i];
arr[i]^=arr[n-i-1];
}
for(i=0;i<n;++i)
{
printf("%d",arr[i]);
if(i!=n-1)
printf(" ");
}
return 0;
}
| 47 |
23,423 | /*
* 20121113-8.cpp
*
* Created on: 2012-11-20
* Author: ???
*/
int main(){
int n,i,j,k;
cin>>n;
int a[n],b[n];
for(i=1;i<=n;i++)
{
cin>>a[i];//??
}
for(j=1;j<=n;j++)
{
b[j]=a[n+1-j];//??
}
cout<<b[1];
for(k=2;k<=n;k++)
{
cout<<" "<<b[k];
}
return 0;
}
| 47 |
23,424 |
int main()
{
int a,b[100],i;
scanf("%d",&a);
for(i=a;i>0;i--)
{
scanf("%d",&(b[i-1]));
}
for(i=0;i<a;i++)
{
switch(a-1-i)
{
case 0:
printf("%d",b[i]);
break;
default:
printf("%d ",b[i]);
break;
}
}
return 0;
} | 47 |
23,425 | int main()
{
int a[100],b[100];
int i,j,m;
cin>>j;
for(i=1;i<=j;i++){
cin>>a[i];
}
for(i=1;i<=j;i++){
m=j+1-i;
b[m]=a[i];
}
for(m=1;m<=j-1;m++){
cout<<b[m]<<" ";
}
cout<<b[j];
return 0;
}
| 47 |
23,426 | void main()
{
int n,zj,m;
int *p,*q;
int a[101];
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
m=(n-1)/2;
for(p=a,q=a+n-1;p<a+m+1;p++,q--)
{
zj=*p;*p=*q;*q=zj;
}
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d",*(a+n-1));
} | 47 |
23,427 | int main(){
int n;
int number[NUMBER];
scanf("%d", &n);
int i=0;
int a;
while(i<n){
scanf("%d", &a);
number[i]=a;
i++;
}
while((n-1)>=0){
if((n-1)>0){
printf("%d ", number[n-1]);
n--;
}
else{
printf("%d", number[0]);
n--;
}
}
return 0;
scanf("%d",1);
} | 47 |
23,428 | int main() //?????
{
int n; //????n
cin>>n; //????n
int a[100]; //????a
for(int i = 0 ; i < n ; i++) //????a
{
cin>>a[i];
}
for(int j = n-1 ; j >= 0 ; j--) //??????a
{
if(j!=0)
cout<<a[j]<<" ";
if(j==0)
cout<<a[j]<<endl;
}
return 0; //???????????????????
}
| 47 |
23,429 |
int main()
{
int n;
scanf("%d",&n);
int sz[99],zs[99];
for(int i=0;i<n;i++)
{
scanf("%d",&(sz[i]));
zs[n-i-1]=sz[i];
}
for(int j=0;j<(n-1);j++)
{
printf("%d ",(zs[j]));
}
printf("%d",(zs[n-1]));
return 0;
}
| 47 |
23,430 | void daoxu(int n);
int main()
{
int n;
cin>>n;
int b;
cin>>b;
daoxu(n-1);
cout<<b; //???????
return 0;
}
void daoxu(int n) //??
{
int a;
cin>>a;
if(n==1)cout<<a<<' ';
else {daoxu(n-1);
cout<<a<<' ';}
}
| 47 |
23,431 | void main()
{
int i,n,*a,*b;
scanf("%d",&n);
a=(int*)malloc(sizeof(int)*n);
b=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
b[i]=a[n-i-1];
for(i=0;i<n-1;i++)
printf("%d ",b[i]);
printf("%d\n",b[n-1]);
return;
}
| 47 |
23,432 | void Exchange(int A[],int n);
int main(){
int n;
scanf("%d",&n);
int A[n];
Exchange(A,n);
return 0;
}
void Exchange(int A[],int n){
for(int i=0;i<n;i++){
scanf("%d",&A[i]);
}
printf("%d",A[n-1]);
for(int j=n-2;j>=0;j--){
printf(" %d",A[j]);
}
}
| 47 |
23,433 | int main()
{
int n;
cin>>n;
int i,a[100]={0};
for(i=1;i<=n;i++)
cin>>a[i];
int j=0,b=n/2,t;
for(j=0;j<=b;j++)
{
t=a[j];
a[j]=a[n-j];
a[n-j]=t;
}
int x=1;
for(i=0;i<n;i++)
{
if(x==1)
{
cout<<a[0];
x=0;
}
else
cout<<" "<<a[i];
}
return 0;
}
| 47 |
23,434 |
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
if(n==1) cout<<a[0]<<endl;//???????
else
{
cout<<a[n-1];//???????
for(int i=n-2;i>=0;i--)
{
cout<<" "<<a[i];//???????????????
}
}
return 0;
}
| 47 |
23,435 | void main()
{
int a[100];
int n,i=0;
scanf("%d",&n);
while(i<n)
{
scanf("%d",&a[i]);
i=i+1;
}
i=n-1;
while(i>0)
{
printf("%d ",a[i]);
i=i-1;
}
printf("%d",a[0]);
}
| 47 |
23,436 | int main()
{
int a[100],i,n,j,e,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(j=0;j<(n/2);j++)
{
e=a[j];
a[j]=a[n-1-j];
a[n-1-j]=e;
printf("%d ",a[j]);
}
for(m=n/2;m<n-1;m++)
{
printf("%d ",a[m]);
}
printf("%d",a[n-1]);
return 0;
}
| 47 |
23,437 | void main()
{
int n,i,a[128],*p,*q,t;
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p++);
p=a;
q=a+n-1;
for(i=0;i<=n/2-1;i++)
{
t=*(p+i);
*(p+i)=*(q-i);
*(q-i)=t;
}
p=a;
printf("%d",*p);
p=a+1;
for(i=1;i<n;i++)
printf(" %d",*(p++));
} | 47 |
23,438 | int i=0;//???????????????
int num=1;
void nixu(int n)
{
int a;
cin>>a;
i++;
if(i!=n)
{
nixu(n);
}
if(num!=n)
{
cout<<a<<' ';
num++;
}
else
{
cout<<a;
}
}
int main()
{
int n;
cin>>n;
getchar();
nixu(n);
return 0;
}
| 47 |
23,439 | int main(){
int a[10000],n,b,i;
i=1;
scanf("%d",&n);
while(i<n){
scanf("%d ",&a[i]);
i++;
}
scanf("%d",&a[n]);
i=1;
while(i<=n/2){
b=a[n-i+1];
a[n-i+1]=a[i];
a[i]=b;
i++;
}
i=1;
while(i<n){
printf("%d ",a[i]);
i++;
}
printf("%d",a[n]);
return 0;
} | 47 |
23,440 | int main(){
int shur[100],shu[100];
int n,i;
scanf("%d",&n);
for(i=0;i<=n;i++){
scanf("%d",&shur[i]);
shu[n-i]=shur[i];
}
for(i=1;i<=n;i++){
if(i==n){printf("%d",shu[i]);break;}
printf("%d ",shu[i]);
}
return 0;
}
| 47 |
23,441 | int main()
{
int n,a[101];
int *p;
scanf("%d",&n);
for(p=a;p<=a+n-1;p++)
{
scanf("%d",p);
}
p=a+n-1;
printf("%d",*p);
for(p=a+n-2;p>=a;p--)
{
printf(" %d",*p);
}
return 0;
} | 47 |
23,442 | void main()
{
int i,n,*p;
scanf("%d",&n);
p=(int *)(malloc(n*sizeof(int)));
for(i=0;i<n;i++)
{
scanf("%d",p+i);
}
for(i=n-1;i>0;i--)
{
printf("%d ",*(p+i));
}
printf("%d",*(p+i));
} | 47 |
23,443 | int main( )
{
int s[100]={0};
int n,i,a;
cin>>n; //??n
for(i=0;i<n;i++)//????
{
cin>>a;
s[i]=a;
}
i=n-1;
a=0;
while (i>=0)//????
{
if(a==0)
{
cout<<s[i];
a=1;
}
else cout<<" "<<s[i];//?????????
i=i-1;
}
return 0;
} | 47 |
23,444 | /*
* 5.8ReversedOrder.cpp
*
* Created on: 2012-11-11
* Author: ???
* ???????????????????
*/
int main(){
int n,i,j,temp,a[200];
cin>>n;
for(i=0;i<n;i++)
cin>>a[i]; //????
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++) //??????????????????
{
temp=a[j]; //??????
a[j]=a[j+1];
a[j+1]=temp;
}
for(i=0;i<n;i++)
cout<<a[i]<<(i<(n-1)?" ":"\n");//???????????
return 0;
}
| 47 |
23,445 | int main(){
int b[100],a[100],i=0,n,j=0;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n-1;i++){
b[i]=a[n-i-1];
printf("%d ",b[i]);
}
if(i=n-1){
b[i]=a[0];
printf("%d",b[i]);
}
return 0;
}
| 47 |
23,446 |
int main(int argc, char* argv[])
{
int n,i;
scanf("%d",&n);
int sz[100];
for(i=1;i<=n;i++){
if(i<n){
scanf("%d ",&sz[i]);
}else{
scanf("%d",&sz[i]);
}
}
for(i=n;i>=1;i--){
if(i>1){
printf("%d ",sz[i]);
}else{
printf("%d",sz[i]);
}
}
return 0;
}
| 47 |
23,447 | int main()
{
int n,zheng[100];
int i;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&zheng[n-i-1]);
}
for(i=0;i<n;i++){
if(i<n-1){
printf("%d ",zheng[i]);
}else if(i==n-1){
printf("%d",zheng[i]);
}
}
return 0;
} | 47 |
23,448 | void main()
{
int n,i=0,a[10000];
scanf("%d",&n);
while(i<n)
{
scanf("%d",&a[i]);
i++;
}
while(i>1)
{
i--;
printf("%d ",a[i]);
}
printf("%d",a[0]);
} | 47 |
23,449 | int main()
{
int n=0;
cin>>n;
int i=0;
int j=0;
int in[100]={0};
int out[100]={0};
for(i=0;i<n;i++)
{
cin>>in[i];
}
for(i=0,j=n-1;i<n,j>=0;i++,j--)
{
out[j]=in[i];
}
for(i=0;i<n-1;i++)
{
cout<<out[i]<<" ";
}
cout<<out[n-1]<<endl;
return 0;
} | 47 |
23,450 | void main()
{
int n,a[100],i,*p,tem;
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p+i);
for(i=0;i<n/2;i++)
{
tem=*(p+i);
*(p+i)=*(p+n-1-i);
*(p+n-1-i)=tem;
}
for(p=a;p<a+n;p++)
printf("%d%s",*p,p==a+n-1?"":" ");
}
| 47 |
23,451 | int print();
int main()
{
int m;
char c;
cin>>m;
c=cin.get();
print();
return 0;
}
int print()
{
int a;
char c='\0';
cin>>a;
c=cin.get();
if(c!='\n')
print();
if(c!='\n')
cout<<c;
cout<<a;
return 0;
}
| 47 |
23,452 |
void main()
{
int i,n;
int a[100];
scanf("%d",&n);
int* p=a;
for(i=0;i<n;i++)
scanf("%d",p++);
int* q=a;
p--;
int *end=p;
while(q<=p)
{
int temp=*p;
*p=*q;
*q=temp;
q++;
p--;
}
p=a;
printf("%d",*(p++));
for(;p<=end;p++)
printf(" %d",*p);
} | 47 |
23,453 | int main()
{
int a[100],n,i,b;
int * p;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
p=&a[n-1];
for(i=0;i<n-1;i++)
{
b= * p;
printf("%d ",b);
p=p-1;
}
b= * p;
printf("%d",b);
return 0;
} | 47 |
23,454 |
void main()
{
int *a;
int n;
scanf("%d",&n);
a=(int *)malloc(n*4);
int i;
for(i=0;i<n;i++)
scanf("%d",a+i);
int temp;
for(i=0;i<n/2;i++)
{
temp=*(a+i);
*(a+i)=*(a+n-1-i);
*(a+n-1-i)=temp;
}
for(i=0;i<n;i++)
{
printf("%d",*(a+i));
if(i!=n-1)
printf(" ");
}
} | 47 |
23,455 | int main(){
int n;
scanf("%d",&n);
int N[100],i,e;
for (i = 0;i < n;scanf("%d",&N[i++]));
for (i=0; i<n/2; e = N[i], N[i]=N[n-i-1], N[n-i-1]=e, i++);
for (i = 0;i < n-1;printf("%d ",N[i++]));
printf("%d",N[n-1]);
return 0;
} | 47 |
23,456 |
int main(){
int sz[100];
int i,n;
int e;
scanf("%d",&n);
scanf("%d",&sz[0]);
for(i=1;i<n;i++){
scanf(" %d",&sz[i]);
}
if(n%2==0){
for(i=0;i<n/2;i++){
e=sz[i];
sz[i]=sz[n-i-1];
sz[n-1-i]=e;
}
}else{
for(i=0;i<(n-1)/2;i++){
e=sz[i];
sz[i]=sz[n-i-1];
sz[n-1-i]=e;
}
}
printf("%d",sz[0]);
for(i=1;i<n;i++){
printf(" %d",sz[i]);
}
return 0;
}
| 47 |
23,457 |
int main()
{
int n,m=0,i=0;
int a[100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("%d",a[n-1]);
for(m=n-2;m>=0;m--)
{
printf(" %d",a[m]);
}
return 0;
} | 47 |
23,458 | /*
* ????????.cpp
* ??????
* ?????2012.11.9
* ??????????????????
*/
int main() {
int n, i, j, temp;//????
cin >> n;//?????????
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];//?????
}
for (i = 0, j = n - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;//???????
}
for (i = 0; i < n - 1; i++) {
cout << a[i] << " ";
}//??????
cout << a[n - 1] << endl;
}
| 47 |
23,459 | //????
int main()
{
int n=0,i=0,num[100],temp=0;
cin>>n;
for(i=0;i<n;i++)//????
cin>>num[i];
for(i=0;i<(n/2);i++)
{
temp=num[i];
num[i]=num[n-1-i];
num[n-1-i]=temp;
}
for(i=0;i<n;i++)
{
if(i!=n-1)
cout<<num[i]<<" ";
else
cout<<num[i];
}
return 0;
} | 47 |
23,460 | int main()
{int i=0,n=0;int a[100]={0};int b[100]={0};
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
b[i]=a[n-i-1];
for(i=0;i<n;i++)
if(i<n-1)cout<<b[i]<<" ";
else cout<<b[i]<<endl;
cin.get();cin.get();
return 0;
}
| 47 |
23,461 | /*
* shuzunixu.cpp
*????
* Created on: 2012-12-11
* Author: ???
*/
int main(){
int n,i,a[100];//?????????
cin >> n;
for(i=0;i<n;i++){//??
cin >> a[i];
}
int *p=&a[n-1];//??????????????
do
{
cout<< *p <<" ";
p--;
}while(p>a);
cout << *a;//????
return 0;
} | 47 |
23,462 | void shuchu(){
int a;
char b;
cin>>a;
cin.get(b);
if(b!='\n'){
shuchu();
cout<<b<<a;//??????
}
if(b=='\n')cout<<a;
}
int main(){
int m;
cin>>m;
shuchu();
return 0;
} | 47 |
23,463 | int main()
{
int i,a[100];
int n;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d ",&a[i]);
}
for(i=n-1;i>=1;i--){
printf("%d ",a[i]);
}
for(i=0;i>=0;i--){
printf("%d",a[i]);
}
return 0;
}
| 47 |
23,464 | int main()
{
int n=0;
int i;
cin >> n;//?? n
int a[100]={0};
for (i=1;i<=n;i+=1) cin>>a[i];
for (i=n;i>=2;i-=1) cout<<a[i]<<" ";
cout<<a[1];//??
return 0;
}
| 47 |
23,465 | /*
* ????nixu.cpp
* ??????
* ?????2012 12 22
* ?????????
*/
int main(){
int i,n,*p;
cin >>n;
int a[n];
p=a; //??????????????
for (i=0;i<n;i++)
cin >>*(p+n-1-i); //?????????
for (i=0;i<n;i++){
if (i!=n-1)
cout <<*(p+i)<<' ';
else cout <<*(p+i)<<endl;//????????
}
}
| 47 |
23,466 | int main(){
int N,i,e;
int sz[100];
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%d",&(sz[i]));
}
if(N%2==0){
for(i=0;i<N/2;i++){
e=sz[N-1-i];
sz[N-1-i]=sz[i];
sz[i]=e;
}
}else{
for(i=0;i<(N-1)/2;i++){
e=sz[N-1-i];
sz[N-1-i]=sz[i];
sz[i]=e;
}
}
for(i=0;i<N-1;i++){
printf("%d ",sz[i]);
}
printf("%d",sz[N-1]);
return 0;
}
| 47 |
23,467 | struct N{
int a;
struct N* next;
};
int main(){
int *p,*q,n,a[100],x;
scanf("%d",&n);
for(p=a;p<a+n;p++){
scanf("%d",p);}
for(p=a,q=a+n-1;p<a+n/2;p++,q--){
x=*p;
*p=*q;
*q=x;
}
for(p=a;p<a+n;p++){
if(p==a){printf("%d",*p);}
else{printf(" %d",*p);}
}
scanf("%d",&n);
return 0;
}
| 47 |
23,468 | int main()
{
int a[50],n,i,j,med;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(j=0;j<n/2;j++)
{
med=a[j];
a[j]=a[n-j-1];
a[n-j-1]=med;
}
for(i=0;i<n-1;i++)
cout<<a[i]<<' ';
cout<<a[n-1];
cout<<endl;
return 0;
}
| 47 |
23,469 |
int main(int argc, char* argv[])
{
int n,j,i,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(j=n-1;j>=1;j--)
{
printf("%d ",a[j]);
}
printf("%d\n",a[0]);
return 0;
}
| 47 |
23,470 |
int main(){
int a[99],n=0,i=0,j=0,e=0;
cin>>n;
for(i=0;i<=n-1;i++)
{
cin>>a[i];
}
for(j=n-1;j>0;j--)
cout<<a[j]<<" ";
cout<<a[0];
return 0;
}
| 47 |
23,471 | int main(int argc, char* argv[])
{
int i,n,t;
int *p;
p=(int *)malloc(sizeof(int)*100);
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&t);
*(p+i)=t;
}
printf ("%d",*(p+n-1));
for (i=n-2;i>=0;i--)
{
printf(" %d",*(p+i));
}
free(p);
return 0;
} | 47 |
23,472 |
int main(int argc, char *argv[])
{
int n,i;
scanf("%d",&n);
int a[n];
for(i=1;i<=n;i++)
scanf("%d",&a[i-1]);
for(i=n-1;i>=1;i--)
printf("%d ",a[i]);
printf("%d",a[0]);
return 0;
}
| 47 |
23,473 | /*
* reverse.cpp
*
* Created on: 2012-10-26
* Author: 12001
*/
int main()
{
int n;
int a[100];
cin >> n;
for (int i=0;i<n;i++){
cin >> a[i];
}
for (int i=0;i<n/2;i++){
int tmp=a[i];
a[i]=a[n-1-i];
a[n-1-i]=tmp;
}
for (int i=0;i<n;i++){
cout << a[i];
if (i==n-1)
cout << endl;
else
cout << ' ';
}
return 0;
}
| 47 |
23,474 | int n, a[100];
void io(int num) {
cin >> a[num];
if (num == 0) {
io(1);
cout << a[0];
} else if (num == n - 1)
cout << a[n - 1] << ' ';
else {
io(num + 1);
cout << a[num] << ' ';
}
}
int main() {
cin >> n;
io(0);
return 0;
}
| 47 |
23,475 | int main()
{
int n,e,sz[100];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(int k=1;k<=n;k++){
for(int i=0;i<n-k;i++){
e=sz[i];
sz[i]=sz[i+1];
sz[i+1]=e;
}
}
for(int j=0;j<n;j++){
if(j<n-1)
printf("%d ",sz[j]);
else
printf("%d",sz[j]);
}
return 0;
}
| 47 |
23,476 | int main()
{
int a[100],N=0,i=0;
int *p=&a[0];
cin>>N;
for(i=0;i<N;i++)
cin>>*p++;
cout<<*--p;
for(i=N-2;i>=0;i--)
cout<<" "<<*--p;
return 0;
} | 47 |
23,477 | int main()
{
int n,a[100],*p,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
p=a;
for(i=n-1;i>=0;i--)
{
if(i==n-1)
printf("%d",*(p+i));
else
printf(" %d",*(p+i));
}
return 0;
} | 47 |
23,478 | void main ()
{ void sort(int *p,int m);
int i,n;
int a[101],*p;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=&a[0];
sort(p,n);
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
}
void sort(int *p,int m)
{
int i;
int t,*p1,*p2;
for(i=0;i<m/2;i++)
{
p1=p+i;
p2=p+(m-1-i);
t=*p1;
*p1=*p2;
*p2=t;
}
}
| 47 |
23,479 | int main(){
int a[100];
int b[100];
int n,i,j;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
j=n-1;
if(n<=1||n>=100){
return 0;
}
else{
for(i=0;i<n;i++){
b[j]=a[i];
j=j-1;
}
for(j=0;j<n-1;j++){
printf("%d ",b[j]);
}
printf("%d",b[n-1]);
}
return 0;
}
| 47 |
23,480 | int main()
{
int a[100];
int n,i,j,k,s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(j=0;j<n-1;j++)
{
for(i=0;i<n-1-j;i++)
{
k=a[i];
a[i]=a[i+1];
a[i+1]=k;
}
}
for(i=0;i<n;i++)
{
if(s==0)
{
printf("%d",a[i]);
s=1;
}
else
printf(" %d",a[i]);
}
return 0;
}
| 47 |
23,481 | int main()
{
int n;
scanf("%d",&n);
int *num;
num=(int*)malloc(n);
int j,a;
for(j=1;j<=n;j++)
{
scanf("%d",&a);
*(num+j)=a;
}
for(j=n;j>1;j--)
{
printf("%d ",*(num+j));
}
printf("%d\n",*(num+1));
return 0;
} | 47 |
23,482 | int main()
{
int a[100],n,i,j,k,t;//??a???????n??????
cin>>n;//??n
for (i=0;i<n;i++)
{
cin>>a[i];//?????
}
for (j=n-1;j>=0;j--)
{
for(k=0;k<j;k++)
{
{t=a[n-k-1];a[n-k-1]=a[n-k-2];a[n-k-2]=t;}//?????????????
}
}
for (i=0;i<n;i++)
{
cout<<a[i];
if(i!=n-1)cout<<" ";//?????????????
}
return 0;
} | 47 |
23,483 | int main(){
int sz[100];
int i,b,n;
i=0;
scanf("%d",&n);
b=n-1;
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(b=n-1;b>0;b--){
printf("%d ",sz[b]);
}
b=0;
printf("%d",sz[b]);
return 0;
}
| 47 |
23,484 | /*
* 12.24.2.cpp
*
* Created on: 2012-12-11
* Author: slkingxr
*/
int main()
{
int a[101],i;
int n,*p=NULL,*q=NULL,t;
cin>>n;
for(i=0;i<n;i++)
cin >>a[i];
for(p=a,q=a+n-1;p<q;p++,q--)
{
t=*p;
*p=*q;
*q=t;
}
for(p=a;p<a+n-1;p++)
cout <<*p<<" ";
cout <<*p;
return 0;
}
| 47 |
23,485 | int main()
{
int n,i=1,s[100],j;
scanf("%d",&n);
while(i<=n){
scanf("%d",&s[i]);
i++;
}
j=n;
while(j>1){
printf("%d ",s[j]);
j--;
}
printf("%d",s[1]);
return 0;
}
| 47 |
23,486 | /*
* daoxu.cpp
*
* Created on: 2012-10-30
* Author: Administrator
*/
int main() {
int n, i, a[150], b[150];//??,i?????,a[]?????,b[]?????
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];//??????a[]?
for (i = 0; i < n; i++)
b[i] = a[n - 1 - i];//??????????
for (i = 0; i < n; i++)
a[i] = b[i];//????????
cout << a[0];
for (i = 1; i < n; i++)
cout << " " << a[i];//????
return 0;//????
} | 47 |
23,487 | int main()
{
int n,i;
scanf("%d",&n);
int *sz=(int*)malloc(sizeof(int)*n);
int *sf=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
sf[n-1-i]=sz[i];
}
for(i=0;i<n;i++)
{
if(i<n-1)
{
printf("%d ",sf[i]);
}
if(i==n-1)
{
printf("%d",sf[i]);
}
}
return 0;
} | 47 |
23,488 | int main()
{
int n,i,a[100];
int *p;
p=a;
cin>>n;
for(i=0;i<n;i++)
cin>>*p++;
for(p--;p>a;)
cout<<*p--<<' ';
cout<<*p;
return 0;
}
| 47 |
23,489 | int main(int argc, char* argv[])
{
int a[100],b[100],i,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
b[i]=a[i];
}
for(i=0;i<n;i++){
a[i]=b[n-i-1];
}
printf("%d",a[0]);
for(i=1;i<n;i++){
printf(" %d",a[i]);
}
return 0;
}
| 47 |
23,490 | /*
Name:???
ID:1200012842
Email:[email protected]
*/
void swap(int *data,int a,int b)
{
int t=data[a];
data[a]=data[b];
data[b]=t;
}
int main()
{
int n;
cin>>n;
int data[101];
for (int i=0;i<n;i++)
cin>>data[i];
for (int i=0;i<n/2;i++)
swap(data,i,n-1-i);
cout<<data[0];
for (int i=1;i<n;i++)
cout<<' '<<data[i];
return 0;
} | 47 |
23,491 | int n,inp[MAX],oup[MAX],i;
int main(){
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d",&inp[i]);
}
for(i=0;i<=n-1;i++){
oup[i]=inp[n-1-i];
}
for(i=0;i<n-1;i++){
printf("%d ",oup[i]);
}
printf("%d",oup[n-1]);
return 0;
}
| 47 |
23,492 | int main()
{
int n;
int a[102];
cin>>n;
for(int i = 0;i<n;i++)
{
cin>>a[i];
}
int c = 0;
for(int k = n - 1;k>=0;k--)
{
cout<<a[k];
c++;
if(c != n)
cout<<" ";
}
} | 47 |
23,493 | void main()
{
int n;
int a[100],b[100];
int*p,*q;
scanf("%d",&n);
q=b+n-1;
for(p=a;p<a+n;p++)
{
scanf("%d",p);
*q=*p;
q--;
}
q=b;
printf("%d",*q);
for(q=b+1;q<b+n;q++)
{
printf(" %d",*q);
}
}
| 47 |
23,494 | void main()
{
int i,n;scanf("%d",&n);
int *p=(int *)calloc(1,100*sizeof(int));
for(i=0;i<n;i++)
scanf("%d",p+i);
for(i--;i>=0;i--)
{
if(i==0) printf("%d",*(p+i));
else printf("%d ",*(p+i));
}
} | 47 |
23,495 | //============================================================================
// Name : shuzunixu.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
int main() {
int n,middle=0;
int a[101];
int *p=NULL,*q=NULL;
cin>>n;
for(p=a;p<a+n;p++)
cin>>*p;
for(p=a,q=a+n-1;p<q;p++,q--)
{ middle=*p;
*p=*q;
*q=middle;
}
for(p=a;p<a+n;p++)
{if(p<a+n-1)cout<<*p<<' ';
else cout<<*p;
}
return 0;
}
| 47 |
23,496 | int main(void)
{
int i,n;
scanf("%d\n",&n);
int num[n];
for(i=0;i<n;i++)
scanf("%d",&num[i]);
for(i=1;i<n;i++)
printf("%d ",num[n-i]);
printf("%d",num[0]);
return 0;
}
| 47 |
23,497 | int i;
void f(int n)
{
int a;
cin>>a;
if(n==1)
cout<<a<<" ";
else
{
f(n-1);
cout<<a;
if(n!=i)
cout<<" ";
}
}
int main()
{
int n;
cin>>n;
i=n;
f(n);
return 0;
} | 47 |
23,498 | int main()
{
int n;
cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++)
{cin>>a[i];}
for(int j=0;j<n;j++)
{
b[j]=a[n-j-1];
}
cout<<b[0];
for(int k=1;k<n;k++)
{cout<<" "<<b[k];}
return 0;
} | 47 |
23,499 |
int main() {
int n,temp,i;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
int *p=NULL;
p=a;
for(i=0;i<n/2;i++)
{
temp=*(p+i);
*(p+i)=*(p+n-1-i);
*(p+n-1-i)=temp;
}
for(i=0;i<n-1;i++)
cout<<*(p+i)<<" ";
cout<<*(p+n-1);
return 0;
}
| 47 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.