id
int32
0
32.5k
code
stringlengths
95
8.4k
label
stringclasses
65 values
23,100
int main() { int a[101]={0},b[101]={0},i,k,j,n; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(k=n;k>0;k--) { b[k-1]=a[n-k]; } printf("%d",b[0]); for(j=1;j<n;j++) { printf(" %d",b[j]); } return 0; }
47
23,101
int main () { int n ; cin >> n ; int yeah[100] = {0} ; //?????? for ( int i = 1 ; i <= n ; i++ ) cin >> yeah[i-1] ; //?????? for ( int i = n ; i >= 2 ; i-- ) cout << yeah[i-1] << " " ; //?????? cout << yeah[0] ; //??????????? return 0 ; } // ( > w < ) finished~
47
23,102
void main() { int n,i,a[100]; int *p; p=a; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",p+i); for(i=n-1;i>0;i--) printf("%d ",*(p+i)); printf("%d\n",*p); }
47
23,103
int main() { int n,i; int a[100]; cin>>n; for(i=0;i<n;i++) cin>>*(a+i); for(i=n-1;i>0;i--) cout<<*(a+i)<<" "; cout<<*a<<endl; return 0; }
47
23,104
int main() { int n; cin>>n; int a[n]; for(int i=0;i<n;i++) cin>>a[i]; int *p=a; for(int i=n-1;i>=1;i--) cout<<*(p+i)<<" "; cout<<*p; return 0; }
47
23,105
int main(){ int n,i,e; scanf("%d",&n); int sz[LEN]; for(i=0;i<n;i++){ scanf("%d",&sz[i]);} if(n%2==1){ for(i=0;i<n/2+1;i++){ e=sz[i]; sz[i]=sz[n-i-1]; sz[n-i-1]=e;} printf("%d",sz[0]); for(i=1;i<n;i++){ printf(" %d",sz[i]);} }else{ for(i=0;i<n/2;i++){ e=sz[i]; sz[i]=sz[n-i-1]; sz[n-i-1]=e;} printf("%d",sz[0]); for(i=1;i<n;i++){ printf(" %d",sz[i]);}} return 0; }
47
23,106
int main (){ int n,m,e,i; int sz[100]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d",&(sz[i])); } if(n%2==0){ m=n/2; }else{ m=(n-1)/2; } for(i=0;i<m;i++){ e=sz[i]; sz[i]=sz[n-1-i]; sz[n-1-i]=e; } if(n%2!=0){ sz[m]=sz[m]; } for(i=0;i<n-1;i++){ printf("%d ",(sz[i])); } printf("%d",sz[n-1]); return 0; }
47
23,107
int main(){ int n,k; int i; int sz[100]; scanf("%d",&n); i=0; k=n-1; while(i<n){ scanf("%d",&sz[i]); i++; } while(k>=0){ if(k!=0){ printf("%d ",sz[k]);} else{printf("%d",sz[k]);} k--; } return 0; }
47
23,108
void main(int argc, char* argv[]) { int a[100],b[100]; int i,n; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%d",&a[i]); b[n-1-i]=a[i]; } for (i=0;i<n;i++) { if (i==n-1) { printf("%d",b[i]); } else { printf("%d ",b[i]); } } }
47
23,109
int main() { int a[100]={0}; int n,i; cin>>n; int *p=a; for(i=n-1;i>=0;i--) cin>>a[i]; for(p=a;p<a+n-1;p++) cout<<*p<<" "; cout<<a[n-1]; getchar(); getchar(); return 0; }
47
23,110
void main() { int n,a[100],*p,*j,i,temp; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); for(p=a,j=a+n-1;p<a+n/2;p++,j--) { temp=*p; *p=*j; *j=temp; } for(p=a;p<a+n-1;p++) printf("%d ",*p); printf("%d",*p); }
47
23,111
int main(){ int sz[100]; int i,e,n,k,dt; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d",&(sz[i])); } for(e=1;e<=n;e++){ for(k=0;k<n-e;k++){ dt=sz[k]; sz[k]=sz[k+1]; sz[k+1]=dt; } } for(i=0;i<n;i++){ if(i<n-1){ printf("%d ",sz[i]); }else{ printf("%d",sz[i]); } } return 0; }
47
23,112
/* * ????.cpp * * Created on: 2012-12-14 * Author: ?? * ?????????????????????????8,6,5,4,1?????1,4,5,6,8? */ int main() { int a[105],*p=a;//????a??? int i,n; cin>>n;//?????? for(i=0;i<n;i++) { cin>>*p++;//???? } for(i=n-1;i>=1;i--) { cout<<*(a+i)<<' '; } cout<<*a<<endl;//???? return 0; }
47
23,113
int main() { int n,i,j,t; int sz[100]; scanf("%d",&n); for(i=0;i<n-1;i++){ scanf("%d ",&sz[i]); } scanf("%d",&sz[n-1]); for(i=0,j=n-1;i<j;i++,j--){ t=sz[j]; sz[j]=sz[i]; sz[i]=t; } for(i=0;i<n-1;i++){ printf("%d ",sz[i]); } printf("%d",sz[n-1]); return 0; }
47
23,114
int main() { int n,i,a[100],t,half;//a[100]????????t?????,half????? cin>>n; for(i=0;i<n;i++) { cin>>a[i]; } if(n%2==0) half=n/2; else half=(n-1)/2; for(i=0;i<half;i++) { t=a[i]; a[i]=a[n-i-1]; a[n-1-i]=t; }//???? for(i=0;i<n-1;i++) { cout<<a[i]<<" "; } cout<<a[n-1]<<endl; return 0; }
47
23,115
int main() { int i=0,n,p=0; int a[100]={0}; cin >> n; for(i=0;i<n;i++) cin >> a[i]; for(i=0;i<n/2;i++) { p=a[i]; a[i]=a[n-1-i]; a[n-1-i]=p; p=0; } for(i=0;i<n-1;i++) cout << a[i] << " "; cout << a[n-1]; return 0; }
47
23,116
int n,i; void nixu(int a[100]) { for(i=n-1;i>0;i--) { cout<<a[i]<<" "; } cout<<a[0]; }//???????????? int main() { int a[100]; cin>>n; for(i=0;i<n;i++) { cin>>a[i]; }//???? nixu(a);//???? return 0; }
47
23,117
int main() { int n,a[100]; cin>>n; int *p; p=a; for (int i=0;i<n;i++) { int x; cin>>x; *p=x; p++; } for (int i=n-1;i>0;i--) { p--; cout<<*p<<" "; } p--; cout<<*p; return 0; }
47
23,118
void main() { int n,a[MAX]; int *p; scanf("%d",&n); for(p=&a[0];p<&a[0]+n;p++) scanf("%d",p); for(p=&a[0]+n-1;p>=&a[0];p--){ if(p==&a[0]+n-1) printf("%d",*p); else printf(" %d",*p); } printf("\n"); }
47
23,119
int main(){ int n,i=0; scanf("%d",&n); int a[100],s=n-1; for(i=0;i<n-1;i++){ scanf("%d \n",&a[i]); } scanf("%d",&a[n-1]); for(s=n-1;s>0;s--){ printf("%d ",a[s]); } printf("%d",a[0]); return 0; }
47
23,120
/* * duanwenpaixu.cpp * * Created on: 2013-12-5 * Author: ??? */ int main() { int a[100]; int n; int *p=NULL; cin>>n; for(p=a;p<=&a[n-1];p++) cin>>*p; for(;p>a+1;) cout<<*--p<<' '; cout<<*--p; return 0; }
47
23,121
void main() { int n,m,i,a[100],*p,*q,*f; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); p=a;q=a+n-1;f=a+n/2; for(p=a;p<f;p++,q--) {m=*p;*p=*q;*q=m;} for(i=0;i<n-1;i++) printf("%d ",a[i]); printf("%d",a[n-1]); }
47
23,122
// // main.cpp // ?? // // Created by Love on 13-1-12. // Copyright (c) 2013? Love. All rights reserved. // int main(){ int n,i,a[100],e,m; scanf("%d",&n); for (i=0; i<n; i++) { scanf("%d",&a[i]); } if (n%2==0) { m=n/2; }else{ m=(n-1)/2; } for (i=0; i<m; i++) { e=a[i]; a[i]=a[n-i-1]; a[n-i-1]=e; } printf("%d",a[0]); for (i=1; i<n; i++) { printf(" %d",a[i]); } return 0; }
47
23,123
int main() { int n,i,j,p,num,q;//????????n?????i?j?p ?q??????num cin>>n; int a[100];//?????100???a for(i=1;i<=n;i++)//???? { cin>>num; a[i]=num; } p=(n-n%2)/2; for(i=1;i<=p;i++)//???? { q=a[n+1-i]; a[n+1-i]=a[i]; a[i]=q;//?????????? } for(i=1;i<=n;i++)//???? { if(i!=n) cout<<a[i]<<" "; else cout<<a[i]; } return 0; }
47
23,124
int main() { int a[100],b[100],i,n,k,t; cin>>n; for(i=0;i<=n-1;i++)cin>>a[i]; cin>>k; cout<<a[n-1]; for(i=1;i<=n-1;i++){b[i]=a[n-i-1];cout<<" "<<b[i];} return 0; }
47
23,125
int main() { int a[100]={0};//?????? int n,i,t; cin>>n; for(i=n-1;i>=0;i--)//??????????? { cin>>t; a[i]=t; } for(i=0;i<n-1;i++)//???? { cout<<a[i]<<' '; } cout<<a[n-1]; return 0; }
47
23,126
void main() { int n,i,a[100],b[100]; scanf("%d",&n); if(n!=10) {for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n;i++) b[i]=a[n-1-i]; for(i=0;i<n-1;i++) printf("%d ",b[i]); printf("%d\n",b[n-1]);} if(n==10) {for(i=0;i<n+1;i++) scanf("%d",&a[i]); for(i=0;i<n+1;i++) b[i]=a[n-i]; for(i=0;i<n;i++) printf("%d ",b[i]); printf("%d\n",b[n]);} }
47
23,127
int main() { int n, a[100], s; cin >> n; for(int i=0; i<n; i++) cin >> a[i]; for(int j=0; j<n/2; j++) { s=a[j]; a[j]=a[n-1-j]; a[n-1-j]=s; } for(int h=0; h<n; h++) if(h!=n-1) cout << a[h] << " "; else cout << a[h] << endl; return 0; }
47
23,128
int main() { int n,a;//???? cin>>n;//?? int value[100];//???? for (a=1;a<=n;a=a+1){ cin>>value[a]; } for(a=n;a>1;a=a-1){ cout<<value[a]<<' '; } cout<<value[1]; return 0; }
47
23,129
int function(int* a,int n) { if(n!=1) function(a+1,n-1); cout<<a[0]<<' '; return 0; } int main() { int n,a[100]; cin>>n; for(int i=0;i<n;i++) cin>>a[i]; function(a+1,n-1); cout<<a[0]; return 0; }
47
23,130
int main() { int a[MAX],i,j,n,t; scanf("%d",&n); for (i=0;i<n;i++){ scanf("%d ",&a[i]); } for (i=0,j=n-1;i<j;i++,j--){ t=a[i]; a[i]=a[j]; a[j]=t; } for (i=0;i<n;i++){ if(i==n-1){ printf("%d",a[i]); } else{printf("%d ",a[i]);} } return 0; }
47
23,131
int main() { int n; cin >> n; int a[n],b[n]; for(int i=0;i<n;i++) cin >> a[i]; for(int i=0;i<n;i++) { b[i]=a[n-1-i]; if(i==0) cout << b[i]; if(i>0) cout << " " << b[i]; } return 0; }
47
23,132
int n, a[101]; int *p1, *p2, *p3; int main() { cin >> n; for (p2 = a; n --; ++ p2)//??n??????*p2????? cin >> *p2; p3 = p2; for (p1 = a, -- p2; p1 < p2; ++ p1, -- p2)//*p1??*p2??????? { n = *p1; *p1 = *p2; *p2 = n; } cout << *a; for (p1 = a + 1; p1 < p3; ++ p1) cout << " " << *p1; return 0; }
47
23,133
int main(){ int n,i,l; scanf("%d",&n); int a[n],b[n]; for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i<n-1;i++) { l=n-i-1; b[i]=a[l]; printf("%d ",b[i]); } b[n-1]=a[0]; printf("%d",b[n-1]); return 0; }
47
23,134
int main() { int n,i,j,a; scanf("%d",&n); int b[100]; for(i=n-1;i>=0;i--) { scanf("%d",&a); b[i]=a; } for(j=0;j<n;j++) { if(j<n-1) { printf("%d ",b[j]); }else{ printf("%d",b[j]); } } return 0; }
47
23,135
int main (void) { int n, a[100], i, j; cin >> n; for (i = 0; i < n; i++) cin>> a[i]; cout << a[n-1]; for (i = n-2; i >= 0; i--) cout <<' '<<a[i]; cout << endl; return 0; }
47
23,136
int main() { int a[110],*p,n,*i,*j; cin>>n; for(i=a;i<a+n;i++) { cin>>*i; } for(j=a+n-1;j>a;j--) { cout<<*j<<' '; } cout<<*a; return 0; }
47
23,137
int main(){ int n,i,j; scanf("%d",&n); int order[10000]={0}; for(i=0;i<n;i++){ //printf("i=%d\n",i); scanf("%d",&order[i]); //printf("i=%d\n",i); } //printf("i+1=%d\n",order[3]); for(j=n-1;j>-1;j--){ if(j>0){ printf("%d ",order[j]); }else{ printf("%d",order[j]); } //if(i<n-1){ // printf(" "); //} } return 0; }
47
23,138
int a[100]={0}; int f(int i,int t) { cin>>a[i];//i?????? if(i<t) { f(i+1,t); }//?????????????????? if(i==1) cout<<a[i]; else cout<<a[i]<<' '; } int main() { int t,i=1; cin>>t; f(i,t); return 0; }
47
23,139
//???? int main() { int a[100]={0},temp,n; int i,j;//???? cin>>n; for(i=0;i<n;i++) cin>>a[i]; for(i=0,j=n-1;i<j;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]; return 0; }
47
23,140
int main() { int n; int a[100]; scanf("%d",&n); for (int i=0; i<n; i++) { scanf("%d",&a[i]); } while (n--) { printf("%d",a[n]); if (n!=0) { printf(" "); } } return 0; }
47
23,141
int main() { int n,k,a[100]={0}; cin>>n; for (k=0;k<n;k++) cin>>*(a+k); cout<<*(a+n-1); for (k=n-2;k>=0;k--) cout<<" "<<*(a+k); cout<<endl; return 0; }
47
23,142
int main() { int a[200]; int n,i; scanf("%d",&n); for(i=0;i<=n-1;i++) { scanf("%d",&a[i]); } for(i=0;i<=n-1;i++) { a[i+n]=a[i]; } for(i=0;i<=n-1;i++) { a[i]=a[2*n-1-i]; } for(i=0;i<=n-2;i++) { printf("%d ",a[i]); } printf("%d",a[n-1]); }
47
23,143
int main() {int n,a[100],b[100],i,j; cin>>n; for(i=0;i<n;i=i+1) {cin>>a[i]; b[n-1-i]=a[i];} for(j=0;j<n;j=j+1) {if(j==0) cout<<b[j]; else cout<<' '<<b[j];} return 0; }
47
23,144
int main(int argc, char* argv[]) { int i,n,j,a[100]={0}; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(j=100;j>=0;j--) { if(j>=n) continue; else if(j<n&&j>0) printf("%d ",a[j]); else if(j==0) printf("%d",a[0]); } return 0; }
47
23,145
int main() { int n,s[100],sum; scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",&s[i]); } sum=n; for(int j=1;j<n;j++){ printf("%d ",s[sum-j]); } printf("%d",s[0]); return 0; }
47
23,146
int main() { int n,i,j,num[50]={0}; int *p; p=num; cin>>n; for(p=num+0;p<num+n;p++) cin>>*p; p=num+n-1; cout<<*p; for(p=num+n-2;p>=num+0;p--) cout<<" "<<*p; cout<<endl; return 0; }
47
23,147
//???? int main() { int a[100],n,b; cin>>n; for(int i=n-1;i>=0;--i) { cin>>b; a[i]=b;//??? } for(int i=0;i<n-1;++i) { cout<<a[i]<<" "; } cout<<a[n-1]; return 0; }
47
23,148
void change(int a); //????change() int main() { int n; cin>>n; //???????? cin.get(); //????? change(n); return 0; } void change(int a) { int num; cin>>num; //?????? a=a-1; //????????????????1 if (a>=1) change(a); //???????????????????change()?????????????????? if (a==0) cout<<num; else cout<<" "<<num; }
47
23,149
int read(); void updown(); void print(); int a[100],b[100],n; int main() { read(); updown(); print(); return 0; } int read() { int i; scanf("%d",&n); for (i=1;i<=n;i++) { scanf("%d",&a[i]); } return 0; } void updown() { int i; for (i=1;i<=n;i++) { b[i]=a[n-i+1]; } return; } void print() { int i; for (i=1;i<n;i++) { printf("%d ",b[i]); } printf("%d",b[n]); return; }
47
23,150
void main() { int a[100],n,i,*j,*k,*p,temp,m; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",a+i); m=(n-1)/2; j=a;k=a+n-1;p=a+m; for(;j<=p;j++,k--) {temp=*j; *j=*k; *k=temp; } for(i=0;i<n-1;i++) printf("%d ",*(a+i)); printf("%d",*(a+n-1)); }
47
23,151
void main() { int *p,*hd;int i,n;scanf("%d",&n); hd=p=(int *)malloc(n*sizeof(int)); for(i=0;i<n;i++,p++) {scanf("%d",p);} for(p=hd+n-1,i=0;i<n;i++,p--) {if(i==0) printf("%d",*p); else printf(" %d",*p);} }
47
23,152
int main() { int n,i; 1 < n < 100; cin >> n; int a[n],b[n]; for(i=0;i<=n-1;i++) { cin >> a[i]; } for(i=0;i<=n-2;i++) { b[i] = a[n-i-1]; cout << b[i] << " "; } b[n-1] = a[0]; cout << b[n-1]; return 0; }
47
23,153
void diverse( int x )//?? { int c , p = x ; char ch ; cin >> c ; cin.get( ch ) ; if ( ch == '\n' ) { cout << c ; if ( x != 0 ) cout << ' ' ; return ; } else { p++ ; diverse( p ) ; } cout << c ; if ( x != 0 ) cout << ' ' ; } int main() { int n ; cin >> n ; cin.get() ;//??? int x = 0 ; diverse( 0 ) ; return 0 ; }
47
23,154
int main() { int n; scanf("%d",&n); int sz[98]; int i=0; while(i<n){ scanf("%d",&(sz[i])); i ++; } int a; int j=0; while(j<=(n/2)-1){ a = sz[n-j-1]; sz[n-j-1] = sz[j]; sz[j] = a; j ++; } int l=0; while(l<n-1){ printf("%d ",sz[l]); l ++; } printf("%d",sz[n-1]); return 0; }
47
23,155
/* * nixu.cpp * * Created on: 2012-11-5 * Author: alias */ int main(){//??? int n;//????n cin>>n;//??n int a[n];//???? for(int i=0;i<n;i++)//???????? cin >>a[i]; int m; for(int j=0;j<n/2;j++){//?n/2?????????? m=a[j]; a[j]=a[n-j-1]; a[n-j-1]=m; } for(int k=0;k<n;k++){//?????????? if(k==0) cout<<a[k]; else cout<<" "<<a[k]; } return 0; }
47
23,156
int main(){ int u[200],i,n,a[200]; scanf("%d",&n); for(i=0;i<n;i++){ if(i==n-1){ scanf("%d",&(u[i])); break; } scanf("%d ",&(u[i])); } for(i=0;i<n;i++){ a[n-1-i]=u[i]; } for(i=0;i<n;i++){ if(i==n-1){ printf("%d",a[i]); break; } printf("%d ",a[i]); } return 0; }
47
23,157
int main() { int a[100]; int n,t; scanf("%d",&n); int i; for(i=0;i<=n-1;i++){ scanf("%d",&a[i]); } if(n%2==0){ for(i=0;i<=n/2-1;i++){ t=a[i]; a[i]=a[n-1-i]; a[n-1-i]=t; } for(i=0;i<=n-1;i++) if(i<n-1) printf("%d ",a[i]); if(i=n-1) printf("%d",a[i]); } if(n%2==1){ for(i=0;i<=(n-1)/2-1;i++){ t=a[i]; a[i]=a[n-1-i]; a[n-i-1]=t; } for(i=0;i<=n-1;i++) if(i<n-1) printf("%d ",a[i]); if(i=n-1) printf("%d",a[i]); } return 0; }
47
23,158
int main(){ int SZ[100],ZS[100]; int n,m=0,i; scanf("%d\n",&n); for(i=0;i<n-1;i++) { scanf("%d ",&(SZ[i])); } scanf("%d",&(SZ[n-1])); while(n>0){ ZS[m]=SZ[n-1]; n--; m++; } for(i=0;i<m-1;i++) printf("%d ",ZS[i]); printf("%d",ZS[m-1]); return 0; }
47
23,159
int main() { int n,a[100],*p; for(p=a,cin>>n;p<=a+n-1;++p) cin>>*p; p=p-1; cout<<*p; for(p=p-1;p>=a;--p) cout<<" "<<*p; return 0; }
47
23,160
int main() { int n; cin>>n; char b; cin.get(b); char a[100]={0}; int c[100]={0}; int d; int i; for(i=1;i<n;i++) //?? { cin>>d; c[i]=d; cin.get(b); a[i]=b; } cin>>d; c[n]=d; for(i=n;i>1;i--) //???? { cout<<c[i]; cout<<a[i-1]; } cout<<c[1]; return 0; }
47
23,161
void main() { int i,j,n,*num,t; scanf("%d",&n); t=n/2; num=(int*) malloc (sizeof(int)*n); for (i=0;i<n;i++) scanf("%d",&num[i]); for (i=0;i<t;i++) { j=num[i]; num[i]=num[n-1-i]; num[n-1-i]=j; } for (i=0;i<n;i++) { printf("%d",num[i]); if(i<n-1) printf(" "); } free(num); }
47
23,162
int main() { int n,a[100],i,b[100]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d",&a[i]); b[n-i-1]=a[i]; } for(i=0;i<n;i++){ a[i]=b[i]; if(i==0){ printf("%d",a[i]);} else{ printf(" %d",a[i]);} } return 0; }
47
23,163
int main() { int n,i,j,k,t; int a[101]; cin>>n; for(i=1;i<=n;i++) cin>>a[i]; if(n%2==0) { k=n/2; for(i=1;i<=k;i++) { t=a[n+1-i]; a[n+1-i]=a[i]; a[i]=t; } } else if(n%2!=0) { k=(n-1)/2; for(i=1;i<=k;i++) { t=a[n+1-i]; a[n+1-i]=a[i]; a[i]=t; } } for(i=1;i<=n-1;i++) cout<<a[i]<<" "; cout<<a[n]; return 0; }
47
23,164
/* *???redo.cpp *???????? *????: 2012-12-10 *?????1200012825 */ int main(void) { int n; cin>>n; int *p=NULL,a[100],*q=NULL; for(q=a;q<=a+n-1;q++){ cin>>*q;//?? } cout<<*(p=a+n-1); for(p=a+(n-2);p>=a;p--){ cout<<" "<<*p;//???? } return 0; }
47
23,165
int main() { int n; cin>>n; int c[100]; for(int i=1;i<=n;i++) { int a; cin>>a; c[n-i]=a; } for(int t=1;t<=(n-1);t++) cout<<c[t-1]<<' '; cout<<c[n-1]; return 0; }
47
23,166
int main() { int n; cin>>n; int a[100],b[100]; int i; int j; for(i=0;i<n;i++) { cin>>a[i]; } for(j=1;j<n;j++) { b[j]=a[n-j]; cout<<b[j]<<" "; } for(j=n;j<=n;j++) { b[j]=a[n-j]; cout<<b[j]; } return 0; }
47
23,167
int main() { int a[100]; int n,i; cin>>n; for(i=1;i<=n;i++){ cin>>a[i]; } for(i=1;i<=n;i++){ if(i==n){ cout<<a[1]; } else{ cout<<a[n-i+1]<<' '; } } return 0; }
47
23,168
int main() { int m; cin>>m; const int n=m; int a[n+1]; for(int i=n;i>=1;i--)cin>>a[i]; for(int i=1;i<n;i++)cout<<a[i]<<' '; cout<<a[n]; return 0; }
47
23,169
int main() { int n,a[1000]; cin>>n; for(int i=0;i<n;i++) cin>>a[i]; int t; for(int i=0;i<=(int)(0.5*(n+1))-1;i++) { t=a[i]; a[i]=a[n-1-i]; a[n-1-i]=t; } for(int i=0;i<n;i++) { cout<<a[i]; if(i!=n-1) cout<<" "; } cout<<endl; return 0; }
47
23,170
int main() { int N; cin >>N; const int n=N; int a[n]; for (int i=0;i<=n-1;i++) { cin >>a[i]; } int b[n]; for (int i=0;i<=n-1;i++) { b[i]=a[n-i-1]; } for (int i=0;i<=n-1;i++) { cout <<b[i]; if (i<n-1) cout <<" "; } return 0; }
47
23,171
int main() { int n; int a[100]; int j,i; scanf("%d",&n); for(j=0;j<n;j++) { scanf("%d",&(a[j])); } for(j=n-1,i=0;j>-1;j--) { if(i<n-1) { printf("%d ",a[j]); i++; } if(i==n-1) { printf("%d",a[0]); i++; } } return 0; }
47
23,172
void get(int); int i=1; int main() { int n; cin>>n; get(n); return 0; } void get(int n) { int a,m; cin>>a;i++; if(i<n)get(n); else if(i==n){cin>>m;cout<<m;} cout<<" "<<a; }
47
23,173
void main() { int a[1000],b[1000]; int n,i; int *p; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); p=a; for(i=0;i<n;i++) { b[i]=*(p+n-i-1); } printf("%d",b[0]); for(i=1;i<n;i++) printf(" %d",b[i]); }
47
23,174
void jiaohuan(int*,int*); int main(){ int yuan[101]; int i,n; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d",&(yuan[i])); } for(i=0;i<n/2;i++){ jiaohuan(&(yuan[i]),&(yuan[n-1-i])); } for(i=0;i<n-1;i++){ printf("%d ",yuan[i]); } printf("%d",yuan[n-1]); return 0; } void jiaohuan(int*a,int*b){ int e=*a; *a=*b; *b=e; }
47
23,175
int main() { int n=0; cin>>n; int a[n]; for(int i=1;i<=n;i=i+1) cin>>a[n+1-i]; cout<<a[1]; for(int j=2;j<=n;j=j+1) cout<<" "<<a[j]; return 0; }
47
23,176
int a[110],m; void f(int n) { if(n==1) { cout<<a[m-1]; } else { f(n-1); cout<<" "<<a[m-n]; } } int main() { cin>>m; for(int i=0;i<m;i++) { cin>>a[i]; } f(m); return 0; }
47
23,177
void main() { int k,i,j,n,m,t,a[100]; scanf("%d\n",&n); for(k=0;k<n;k++) { scanf("%d",&m); a[k]=m; } for(i=0;i<(n+1)/2;i++) { t=a[i]; a[i]=a[n-i-1]; a[n-i-1]=t; } for(j=0;j<n-1;j++) printf("%d ",a[j]); printf("%d",a[n-1]); }
47
23,178
void inv(int x[],int n) { int temp,i,j,m=(n-1)/2; for(i=0;i<=m;i++) { j=n-1-i; temp=x[i];x[i]=x[j];x[j]=temp; } return; } int main() { int i,n,a[100]; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); inv(a,n); for(i=0;i<n-1;i++) printf("%d ",a[i]); printf("%d",a[n-1]); return 0; }
47
23,179
int main() { int n,i,j; int a[100]; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&a[i]); printf("%d",a[n]); for(i=n-1;i>0;i--) printf(" %d",a[i]); return 0; }
47
23,180
int main() { int i,j,k,m,n,u; int a[100],b[100]; scanf("%d",&n); for(i=0;i<n;i++) {scanf("%d",&a[i]);} for(j=0;j<n;j++) { b[j]=a[n-1-j]; } for(m=0;m<n;m++) { printf("%d",b[m]); if(m<n-1) { printf(" "); } } return 0; }
47
23,181
int main() { int i,n,a[100],m; scanf("%d",&n); m=n; while(n!=0) { scanf("%d",&a[0]); for(i=1;i<n;i++) { a[i]=a[i-1]; } n--; } for(i=0;i<m-1;i++) { printf("%d ",a[i]); } printf("%d",a[m-1]); return 0; }
47
23,182
int main() { int n,i,j; scanf("%d",&n); int a[n]; int b[n]; j=n-1; for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i<n;i++) { b[j]=a[i]; j--; } for(i=0;i<n-1;i++) { printf("%d ",b[i]); } printf("%d",b[n-1]); return 0; }
47
23,183
int main() { int n,i; cin>>n; int x[n+1]; for(i=n;i>=1;i--) cin>>x[i]; for(i=1;i<n+1;i++) { if(i==1) cout<<x[i]; else cout<<" "<<x[i]; } return 0; }
47
23,184
int main() { int a[100]; int n,i,j; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } printf("\n"); for(j=n-1;j>=0;j--) { printf("%d",a[j]); if(j!=0) { printf(" "); } } return 0; }
47
23,185
void inv(int *x,int n) { int temp,*p,*i,*j,m=(n-1)/2; i=x;j=x+n-1;p=x+m; for(;i<=p;i++,j--) { temp=*i;*i=*j;*j=temp; } return; } int main() { int i,n,a[100],*p; scanf("%d",&n); p=a; for(i=0;i<n;i++) scanf("%d",p++); inv(a,n); for(i=0;i<n-1;i++) printf("%d ",a[i]); printf("%d",a[n-1]); return 0; }
47
23,186
int main() { int n=0,i=0; int a[101]; for(i=1;i<=100;i++) a[i]=0; cin>>n; for(i=1;i<=n;i++) cin>>a[i]; for(i=n;i>1;i--) cout<<a[i]<<" "; cout<<a[1]; return 0; }
47
23,187
int main() //??? { int n,i=0,a[100]; //????n,i???a[100] cin>>n; //??n while(i<n) //???????i<n????????? { cin>>a[i]; //??????a[i] i++;} //?????i??1 for(;i>1;i--) //????????????????i>1????????i??1 { cout<<a[i-1]<<" "; //????????????? } cout<<a[0]<<endl; //???????????? return 0; //?????? }
47
23,188
int main(){ int m,n,i; scanf("%d",&n); int sz[100]; if((n>1)&&(n<100)){ for(i=0;i<n;i++){ scanf("%d",&(sz[i])); } for(m=n-1;m>=0;m--){ if(m>0){ printf("%d ",sz[m]); } else printf("%d",sz[m]); } } return 0; }
47
23,189
/*?? ?????????????????????????8,6,5,4,1?????1,4,5,6,8? ???? ?????????????????n?1 < n < 100)?????n????????????????? ???? ?????????????????????????????? ???? 5 8 6 5 4 1 ???? 1 4 5 6 8*/ int main() { int n,i,x=0,t,a[99999],b[999999]; cin>>n; for(i=1;i<=n;i++) { cin>>a[i]; } for(i=1;i<=n;i++) { b[i]=a[n+1-i]; } for(i=1;i<=n;i++) { x++; if(x==1) { cout<<b[i]; } else { cout<<" "<<b[i]; } } return 0; }
47
23,190
int main() { int n, a[10000], temp; int *p = NULL; cin >> n; for(int i = 0; i < n; i ++) cin >> a[i]; p = a; for(int j = 0; j < n/2; j ++){ temp = *(p+j); *(p+j) = *(p+n-1-j); *(p+n-1-j) = temp; } cout << *p; p++; for(int i = 1; i < n; i ++ ,p ++) cout << ' ' << *p; return 0; }
47
23,191
int main() { int n,i,p;//??????n,i,p cin>>n;//??n int a[n+1];//?????? for(i=1;i<=n;i++)//?? { cin>>a[i];//??a[i] } if(n%2==0)//?n??? { for(i=1;i<=n/2;i++)//i?1????i<=n/2,?????? { p=a[i];//?a[i]?a[n-i+1]?? a[i]=a[n-i+1]; a[n-i+1]=p; } } else//?n??? { for(i=1;i<=(n-1)/2;i++)//i?1????i<=?n-1?/2,?????? { p=a[i];//?a[i]?a[n-i+1]?? a[i]=a[n-i+1]; a[n-i+1]=p; } } for(i=1;i<=n;i++)//?? { if(i==1)//?i=1 cout<<a[i];//??a[i] else//?? cout<<' '<<a[i];//???????a[i] } return 0; }
47
23,192
int main() { int n=0,k=0;//????n int num[100];//?? cin>>n; memset(num,0,sizeof(num)); for (k=0;k<n;k++)//?? { cin>>num[k]; } k=n-1; for (k=n-1;k>0;k--)//???? { cout<<num[k]<<' '; } cout<<num[0]; return 0; }
47
23,193
int main() { int a[100],b[100]={0}; int n,i; scanf("%d",&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]); } b[n-1]=a[0]; printf("%d",b[n-1]); return 0; }
47
23,194
void main() { int a[100]; int t[100]; int n,i,j; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); i=0; for(j=n-1;j>=0;j--) { t[i]=a[j]; i=i+1; } for(j=0;j<n-1;j++) printf("%d ",t[j]); printf("%d",t[n-1]); }
47
23,195
/* * ????reverse-rank-of-int.cpp * ?????? * ????:2012-12-14 * ??????? */ int main(){ int n=0,temp=0,A[100]={0}; //????n,temp???A cin>>n; //???????n for(int i=0;i<n;i++)cin>>*(A+i); //??????n?? for(int *p=A,*q=A+n-1;p<q;p++,q--) //??????????????? { temp=*p; *p=*q; *q=temp; } cout<<*A; //?????????????????? for(int i=1;i<n;i++)cout<<" "<<*(A+i); return 0; //????? }
47
23,196
int main() { int a[100],n,i,count=0; int *pt=a; scanf("%d",&n); for(i=0;i<n;i++,pt++) scanf("%d",pt); for(i=n-1;i>=0;i--) { if(count==0) { printf("%d",*(a+i)); count++; } else printf(" %d",*(a+i)); } printf("\n"); return 0; }
47
23,197
int main() { int n,i,e,j; scanf("%d",&n); int a[100],b[100]; for(i=0;i<n;i++){ scanf("%d",&(a[i])); } for(j=0;j<n;j++){ b[j]=a[n-j-1]; } for(e=0;e<n;e++){ if(e==n-1){ printf("%d",b[e]); } else { printf("%d ",b[e]); } } return 0; }
47
23,198
int main() { int n,i=0,j=0,k=0,sum=0; scanf("%d",&n); int an[100],bn[100]; for(k=0;k<n;k++){ scanf("%d",&an[k]); bn[n-1-k]=an[k]; } for(i=0;i<n-1;i++){ printf("%d ",bn[i]); } printf("%d",bn[n-1]); return 0; }
47
23,199
int main() { int i, n, m, a[100], b[100]; cin >> n; for (i = 1; i <= n; i++) { b[i] = i; cin >> a[b[i]]; } for (i = 1; i <= n / 2; i++) { m = b[i]; b[i] = b[n + 1 - i]; b[n + 1 - i] = m; } for (int j = 1; j <= n; j++) { if (j == n) cout << a[b[j]] << endl; else cout << a[b[j]] << " "; } return 0; }
47