id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,200 | int main(){
int n,tr;cin>>n;
int a[n];
int *p=a;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0,j=n-1;i<j;i++,j--)
{
tr=*(p+i);
*(p+i)=*(p+j);
*(p+j)=tr;
}
for(int i=0;i<n-1;i++)cout<<a[i]<<" ";
cout<<a[n-1];//*?p+i???????a???i???
return 0;
}
| 47 |
23,201 | int main()
{
int n;
scanf("%d",&n);
int a[100];
for(int i=0;i<n;i++)
{
int x;
scanf("%d",&x);
a[i]=x;
}
int *pi=a;
int *pj=a+n;
int t;
for(;pi<pj;pi++,pj--)
{
t=*pi;
*pi=*pj;
*pj=t;
}
for(int k=1;k<n;k++)
{
printf("%d ",a[k]);
}
printf("%d",a[n]);
return 0;
}
| 47 |
23,202 | //
// main.cpp
// nixu
//
// Created by blues cookie on 12-12-9.
// Copyright (c) 2012? blues cookie. All rights reserved.
//
int main(int argc, const char * argv[])
{
int n,i,j,k;
cin>>n;
int a[n+3];
int *p=a;
for(i=0;i<n;i++) cin>>a[i];//????
for(i=0;i<n/2;i++)//??
{
j=*(p+i);
*(p+i)=*(p+n-i-1);
*(p+n-i-1)=j;
}
for(i=0;i<n-1;i++) cout<<*(a+i)<<' ';
cout<<*(a+n-1);
return 0;
}
| 47 |
23,203 |
int dfs(int m,int dep)
{
int t;
cin>>t;
if (m==dep) {cout<<t;return 0;}
dfs(m+1,dep);
cout<<' '<<t;
return 0;
}
int main()
{
int n;
cin>>n;
dfs(1,n);
return 0;
}
| 47 |
23,204 | int main()
{
int n,a[100],i;
int *p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
p=&a[0];
for(i=0;i<n;i++)
{
if(i<n-1)
printf("%d ",*(p+n-i-1));
else
printf("%d",*(p+n-i-1));
}
return 0;
} | 47 |
23,205 |
int main(){
int n,*m,i,j,tmp;
scanf("%d",&n);
m=(int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%d",m+i);
}
for(i=0,j=n-1;i<j;i++,j--){
tmp=m[i];
m[i]=m[j];
m[j]=tmp;
}
printf("%d",m[0]);
for(i=1;i<n;i++){
printf(" %d",m[i]);
}
return 0;
}
| 47 |
23,206 | int main ()
{
int a[100] , b[100] , n , i;
cin >> n ;
for (i = 0 ; i <= n-1 ; i++)
{
cin >> a[i] ;
b[n-i-1] = a[i];
}
for (i =0 ; i <= n-2 ; i++)
{
cout << b[i] ;
cout << " " ;
}
cout << b[n-1] <<endl ;
return 0 ;
}
| 47 |
23,207 | int main()
{
int n,i;//i???????
cin>>n;//n????????
int s[n],m[n];
for(i=0;i<=n-1;i++)
{
cin>>s[i];
}
for(i=0;i<=n-1;i++)
{
m[i]=s[n-1-i];
}
for(i=0;i<=n-1;i++)
{
if(i!=0)
cout<<" "<<m[i];
if(i==0)
cout<<m[0];
}
return 0;
}
| 47 |
23,208 |
int main()
{
int m,i;
scanf("%d",&m);
int A[100],B[100];
for (i=0;i<m;i++)
scanf("%d",&A[i]);
for (i=0;i<m;i++)
B[i]=A[m-i-1];
for (i=0;i<m-1;i++)
printf("%d ",B[i]);
printf("%d",B[m-1]);
return 0;
} | 47 |
23,209 | int main(){
int sz[98];
int n;
scanf("%d\n",&n);
for(int i=0;i<n;i++){
scanf("%d ",&(sz[i]));}
int end[98];
for(int m=0;m<n-1;m++){
end[m]=sz[n-1-m];
printf("%d ",end[m]);}
end[n-1]=sz[0];
printf("%d",end[n-1]);
return 0;
}
| 47 |
23,210 | int main()
{
int n,i=0,temp=0,a[100];
cin>>n;
while(cin>>a[i++])
;
i=0;
while(i<=(n-1)/2)
{
temp=a[i];
a[i]=a[n-1-i];
a[n-1-i]=temp;
i++;
}
cout<<a[0];
for(i=1;i<n;i++)cout<<" "<<a[i];
return 0;
} | 47 |
23,211 |
int main() {
int n,a[100],temp=0; //????
cin>>n;
int *p=NULL,*q=NULL; //??????p?q?????
for(p=a;p<a+n;++p) //??????
cin>>*p;
for(p=a,q=a+n-1;p<q;++p,--q) //????
{
temp=*p;
*p=*q;
*q=temp;
}
p=a;
cout<<*p; //?????
for(p=a+1;p<a+n;++p)
cout<<' '<<*p;
return 0;
}
| 47 |
23,212 |
void main()
{
int n,a[MAX];
int *p;
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
for(p=a+n-1;p>=a;p--){
if(p==a+n-1)
printf("%d",*p);
else
printf(" %d",*p);
}
printf("\n");
}
| 47 |
23,213 | int main(){
int n,i,e;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(shuzu)* n);
for(i=0;i<n;i++){
scanf("%d",&shuzu[i]);
}
for(i=0;i<n/2;i++){
e=shuzu[i];
shuzu[i]=shuzu[n-1-i];
shuzu[n-1-i]=e;
}
for(i=0;i<n-1;i++){
printf("%d ",shuzu[i]);
}
printf("%d",shuzu[n-1]);
return 0;
} | 47 |
23,214 | int main(){
int n,sz[100];
scanf("%d",&n);
for(int i=0;i<n;i++){
if(i!=n-1){
scanf("%d ",&sz[i]);
} else{
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,215 |
int main()
{
int *p=NULL;
int n;
int init[100];
cin>>n;
cin>>init[0];
p=&init[0];
for(int i=1; i<n ;i++)
cin>>*(p+i);
for(int i=1;i<n;i++)
cout<<*(p+n-i)<<' ';
cout<<*p;
return 0;
}
| 47 |
23,216 |
int main(){
int n,num[100],i,a,j,b;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&num[i]);
}
if(n%2!=0){
b=(n-1)/2;
}
else{
b=n/2;
}
for(i=0;i<b;i++){
a=num[i];
num[i]=num[n-i-1];
num[n-i-1]=a;
}
for(i=0;i<n-1;i++){
printf("%d ",num[i]);
}
printf("%d",num[n-1]);
return 0;
}
| 47 |
23,217 | int main()
{
int n=0,a[101],i=0,j=0,k=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n-1;i++)
cout<<a[n+1-i]<<' ';
cout<<a[1];
return 0;
} | 47 |
23,218 | void main()
{
int i, a[100],*p,*p1=NULL,temp,n,s;
p=a;
scanf("%d",&n);
for(;p<n+a;p++)
scanf("%d",p);
p=a;
p1=a+n-1;s=n/2;
for(i=0;i<s;i++)
{
temp=*p;
*p=*p1;
*p1=temp;
p++;
p1--;
}
p=a;
for(;p<n+a-1;p++)
printf("%d ",*p);printf("%d",*p);
}
| 47 |
23,219 |
void invert(int ip[],int n)
{
int i;
int s=1;
for(i=0;i<n;i++)
{
if(s==1){printf("%d",ip[n-1-i]);s=0;}
else{printf(" %d",ip[n-1-i]);}
}
return;
}
int main() {
int n;
scanf("%d",&n);
int ip[n];
int i;
for(i=0;i<n;i++)
{
scanf("%d",&(ip[i]));
}
invert(ip,n);
return 0;
} | 47 |
23,220 | int main()
{
int n;
cin>>n;
int a[105];
int i=0;
int b;
while(i<n)
{
cin>>a[i];
i++;
}
int c=n-1;
while(c>=1 && c<=(n-1))
{
cout<<a[c];
cout<<" ";
c--;
}
cout<<a[0];
return 0 ;
} | 47 |
23,221 |
int main(){
int i, n, a[MAX];
scanf("%d", &n);
for(i=0; i!=n; ++i) scanf("%d", a+i);
for(i=n-1; i!=0; --i) printf("%d ", a[i]);
printf("%d\n", a[0]);
}
| 47 |
23,222 | int main()
{
int i,j,n;
scanf("%d",&n);
int a[100];
for(i=0;i<n;i++)
{
scanf("%d ",&a[i]);
}
int m;
for(i=n-1;i>0;i--)
{
for(j=0;j<i;j++)
{
m=a[j+1];
a[j+1]=a[j];
a[j]=m;
}
}
for(i=0;i<n;i++)
{
if(i==n-1)printf("%d",a[i]);
else printf("%d ",a[i]);
}
}
| 47 |
23,223 | int main()
{int n,i,k;
i=0;
k=0;
scanf("%d",&n);
int w[n];
while(i<=n-1)
{i=n-1-i;
scanf("%d",&(w[i]));
i=n-1-i;
i=i+1;
}
while(k<=n-1)
{ if(k==n-1)
{printf("%d",(w[k]));
}
else{
printf("%d ",(w[k]));
}
k=k+1;
}
return 0;
}
| 47 |
23,224 | void main()
{int a[100],b[100];
int n,*p,*t;
scanf("%d",&n);
for(p=a;p<=a+n-1;p++)
scanf("%d",p);
for(p=a,t=b+n-1;p<=a+n-1;p++,t--)
*t=*p;
for(t=b;t<b+n-1;t++)
printf("%d ",*t);
printf("%d",*t);
} | 47 |
23,225 | //????
//???
//2012-11-04
int main(){
int n, i, j,m;
cin >> n;
int a[n];//????
for(i=0;i<n;i++)
cin >> a[i];//????????
for(i=0,j=n-1;i<=j;i++,j--){//??????????
m=a[i];
a[i]=a[j];
a[j]=m;}
cout << a[0];
for(i=1;i<n;i++)
cout << " " << a[i];
return 0;
}
| 47 |
23,226 | int main(){
int n,i,j,e;
int sz[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);}
for(j=0;j<(n/2);j++){
e=sz[j];
sz[j]=sz[n-j-1];
sz[n-j-1]=e;}
for(j=0;j<n;j++){if(j==0){
printf("%d",sz[j]);}
else{
printf(" %d", sz[j]);}}
return 0;
} | 47 |
23,227 |
int main()
{
int * array;
int n,i,buffer;
scanf("%d",&n);
array=(int *)malloc(sizeof(int) * n);
for (i=0;i<n;i++)
{
scanf("%d",(array+i));
}
for (i=0;i<=(n-1)/2;i++)
{
buffer=* (array+i);
* (array+i)=* (array+(n-i-1));
* (array+(n-i-1))=buffer;
}
int first;
first=1;
for (i=0;i<n;i++)
{
if (first)
{
printf("%d",* (array+i));
first=0;
}
else
{
printf(" %d",* (array+i));
}
}
free(array);
return 0;
}
| 47 |
23,228 | int main()
{
int n,i,a[100],*p,b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=b;
for(i=n-1;i>=0;i--)
*p++=a[i];
for(i=0;i<n-1;i++)
printf("%d ",b[i]);
printf("%d",b[n-1]);
return 0;
} | 47 |
23,229 |
int main(int argc, const char * argv[])
{
int n;
scanf("%d", &n);
int od[n], i;
for (i=0; i<n; i++) {
scanf("%d", &(od[i]));
}
int abod[n], j, k;
for (j=0; j<n; j++) {
abod[j]=od[n-j-1];
}
for (k=0; k<n-1; k++) {
printf("%d ", abod[k]);
}
printf("%d", abod[n-1]);
return 0;
}
| 47 |
23,230 | int main()
{
int n=0;
cin>>n;
int a[n];
int b[n];
int i=0;
for (i=0;i<n;i++)
{
cin>>a[i];
}
for (i=0;i<n;i++)
{
b[i]=a[n-1-i];
}
for (i=0;i<n;i++)
{
a[i]=b[i];
if (i<n-1)cout<<a[i]<<" ";
else cout<<a[i];
}
return 0;
}
| 47 |
23,231 | void main()
{
int i,a[100],b[100],n;
scanf("%d",&n);
i=1;
while (i<=n)
{
scanf("%d",&a[i]);
i=i+1;
}
i=1;
while (i<=n)
{
b[n+1-i]=a[i];
i=i+1;
}
i=1;
while (i<=n-1)
{
printf("%d ",b[i]);
i=i+1;
}
printf("%d",b[i]);
} | 47 |
23,232 | /*
* sznx.cpp
* ????
* Created on: 2012-12-10
* Author: Salforever
*/
int main()
{
int *p,n,i,x[105];
cin >> n;
for (i=1;i<=n;i++)
{
cin >> x[i];
}
p=&x[n];//??????????
cout << *p;//??????????????
p--;
n--;
while (n>0)
{
cout << ' ' << *p;//?????????????????
p--;
n--;
}
return 0;//????
}
| 47 |
23,233 | int main()
{
int a[101],i,m,n;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
m=i;
for(i=m-1;i>0;i--)
{
cout<<a[i]<<" ";
}cout<<a[0];
cin.get();cin.get();cin.get();
return 0;
}
| 47 |
23,234 |
int main(){
int n,i,sz[100];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(int i=n-1;i>0;i--){
printf("%d ",sz[i]);
}
printf("%d",sz[0]);
return 0;
} | 47 |
23,235 | int main()
{
int n,a[100],i,j,m,d,c[100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
a[i]=m;
}
if(n/2==0)
d=n/2;
else
d=(n+1)/2;
for(j=0;j<d;j++)
{
c[j]=a[n-1-j];
printf("%d ",c[j]);
}
for(j=d;j<n;j++)
{
c[j]=a[n-1-j];
if(j==(n-1))
printf("%d",c[j]);
else
printf("%d ",c[j]);
}
return 0;
}
| 47 |
23,236 |
int main(){
int i,n,a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
b[i]=a[i];
for(i=0;i<n;i++)
a[i]=b[n-1-i];
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
return 0;
}
| 47 |
23,237 | int main()
{
int n,i;
scanf("%d\n",&n);
int a[100],b[100];
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,238 | int main(int argc, char* argv[])
{
int n,i,a[N];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
i--;
printf("%d",a[i]);
i--;
for(;i>=0;i--)
printf(" %d",a[i]);
return 0;
} | 47 |
23,239 | void main()
{
int a[10000],i,n,*p;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=&a[n-1];
for(p=&a[n-1];p!=&a[0];p--)
printf("%d ",*p);
printf("%d",a[0]);
}
| 47 |
23,240 | int main ()
{
int n, i = 0, a[10000];
scanf("%d",&n);
printf("\n");
for(i = 0; i < n; i++)
scanf("%d",&a[i]);
for(i = n - 1 ; i > 0; i--)
printf ("%d ",a[i]);
printf("%d\n",a[0]);
return 0;
} | 47 |
23,241 | int main(){
int n,i,a,b,e,sz[100];
scanf("%d\n",&n);
for(i=0;i<n;i++){scanf("%d",&sz[i]);}
if(n%2==1){
a=(n-1)/2;
for(i=0;i<a;i++){
e=sz[n-1-i];
sz[n-1-i]=sz[i];
sz[i]=e;
}}
else{
b=n/2;
for(i=0;i<b;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,242 | int main()
{
int a[100],i,k,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=n-1;i>0;i--){
printf("%d ",a[i]);
}
a[0]=a[0];
printf("%d",a[i]);
return 0;
} | 47 |
23,243 | int main()
{
int n,i,m[100],t=0,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&m[i]);
for(i=0;i<n/2;i++)
{
j=n-i-1;
t=m[i];
m[i]=m[j];
m[j]=t;
}
printf("%d",m[0]);
for(i=1;i<n;i++)
printf(" %d",m[i]);
return 0;
} | 47 |
23,244 | int main()
{
int n,a[100],b[100],i;
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-1;i++) cout<<b[i]<<' ';
cout<<b[n-1]; //??
return 0;
}
| 47 |
23,245 | int main()
{
int n;
cin>>n;
int a[n],*p=a,v;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<=n/2-1;i++)
{
v=*(p+i);
*(p+i)=*(p+n-1-i);
*(p+n-1-i)=v;
}
cout<<a[0];
for(int i=1;i<n;i++)
{
cout<<' '<<a[i];
}
return 0;
}
| 47 |
23,246 | int main()
{
int i,n,a[100],b[100];
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,247 | int main(int argc, char* argv[])
{
int n,i,a[100],b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
for(i=n-1;i>0;i--)
{
printf("%d ",b[i]);
}
printf("%d",a[0]);
return 0;
}
| 47 |
23,248 | int main()
{
void nixu(int,int a[]);
int i,a[100]={0},n;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
nixu(n,a);
return 0;
}
void nixu(int n,int a[])
{
if(n==1) cout<<a[0];
else
{
cout<<a[n-1]<<' ';
nixu(n-1,a);
}
} | 47 |
23,249 | int main(int argc, char* argv[])
{
int n,i,b;
scanf("%d",&n);
int a[1000];
for(i=1;i<=n;i++)
{
scanf("%d",&b);
a[i]=b;
}
for(i=n;i>1;i--)
{
b=a[i];
printf("%d ",b);
}
b=a[1];
printf("%d",b);
return 0;
}
| 47 |
23,250 | int main()
{
int n,a[100]={0},i,j,m;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
for(j=1;j<=(n/2);j++)
{
m=a[j];
a[j]=a[n-j+1];
a[n-j+1]=m;
}
for(i=1;i<n;i++)
{
cout<<a[i]<<" ";
}
cout<<a[n];
return 0;
}
| 47 |
23,251 | main()
{
int n,i,num[100],*p;
p=num;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&num[i]);
sort(n,p);
for(;p<num+n-1;p++)
printf("%d ",*p);
printf("%d",*p);
}
void sort(int m,int *p1)
{
int i,t;
for(i=0;i<m/2;i++)
{ t=*(p1+i);
*(p1+i)=*(p1+m-1-i);
*(p1+m-1-i)=t;}
} | 47 |
23,252 | void main()
{
int n,s[100],b[100],i,j,a;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a);
s[n+1-i]=a;
}
for(j=1;j<=n-1;j++)
{
printf("%d ",s[j]);
}
printf("%d",s[n]);
} | 47 |
23,253 | int main(int argc, char* argv[])
{
int i,A[N],B[N],n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&A[i]);
}
printf("%d",A[n-1]);
for(i=1;i<n;i++)
{
B[i]=A[n-1-i];
printf(" %d",B[i]);
}
return 0;
}
| 47 |
23,254 | void function(int len,int rem);
int main()
{
int len,rem;
cin>>len;
rem=len;
function(len,rem);
return 0;
}
void function(int len,int rem)
{ int num;
if(len>0){
cin>>num;
function(len-1,rem);
if(len==rem)cout<<num;
else cout<<num<<" ";
}
}
| 47 |
23,255 | int main()
{
int n;
scanf ("%d",&n);
int shuzu[n],Shuzu[n];
for(int k=0;k<n;k++)
scanf ("%d",&shuzu[k]);
for(int i=0;i<n;i++)
Shuzu[i]=shuzu[n-1-i];
for (int r=0;r<n-1;r++)
printf ("%d ",Shuzu[r]);
printf ("%d",Shuzu[n-1]);
return 0;
}
| 47 |
23,256 | int main()
{
int a[100];
int i,t,n;
cin>>n;
for(int i=0;i<=n-1;i++)
cin>>a[i];
if(n/2==1)
{
for(i=0;i<(n-1)/2;i++)
{
a[n-1-i]=t;
a[n-1-i]=a[i];
a[i]=t;
}
}
else
{
for(i=0;i<=(n-1)/2;i++)
{
t=a[i];
a[i]=a[n-1-i];
a[n-1-i]=t;
}
}
for(i=0;i<=n-2;i++)
cout<<a[i]<<" ";
cout<<a[n-1];
return 0;
}
| 47 |
23,257 | int main()
{int n=0;
scanf("%d",&n);
int i=0,as[100];
while(i<n)
{scanf("%d",&as[i]);
i++;
}
int zx[100];
i=0;
while(i<n)
{
zx[i]=as[i];
i++;
}
i=n-1;
while(i>0)
{
printf("%d ",zx[i]);
i--;
}
printf("%d",zx[0]);
} | 47 |
23,258 | void NX();
int n;
int sz[100],nx[100];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
}
NX();
for(int i=0;i<n;i++){
if(i<n-1){
printf("%d ",nx[i]);
}else{
printf("%d",nx[i]);
}
}
return 0;
}
void NX(){
int j;
j=0;
for(int i=n-1;i>=0;i--){
nx[j]=sz[i];
j++;
}
}
| 47 |
23,259 | int main()
{
int n,i,a[100]={0};
int *point;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
point=&a[n-1]; //point????????
for(i=0;i<n-1;i++)
cout<<*point--<<' ';//????
cout<<*point;
return 0;
} | 47 |
23,260 | int main()
{
int i,n,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[n-1-i]);
}
for(i=0;i<n;i++)
{
if(i==n-1)
printf("%d",a[i]);
else
printf("%d ",a[i]);
}
return 0;
} | 47 |
23,261 |
void reverse(int *p,int n)
{
int temp,i,j;
for(i=0,j=n-1;i<j;i++,j--)
{
temp=*(p+i);
*(p+i)=*(p+j);
*(p+j)=temp;
}
}
void main()
{
int n,i,*p;
scanf("%d",&n);
p=(int *)malloc(sizeof(int));
for(i=0;i<n;i++)
scanf("%d",p+i);
reverse(p,n);
for(i=0;i<n;i++)
{
printf("%d",*(p+i));
if(i!=n-1)
printf(" ");
else
printf("\n");
}
} | 47 |
23,262 | int i=0;int n;
int f()
{
int a;
cin>> a;i++; //???????????????
if(i==n) {cout<< a;return 0;} //?????????????????
if(i!=n) {f();} //?????????????????
cout<<" "<< a; //???????????????
}
int main()
{
cin>> n;
f();
return 0;
} | 47 |
23,263 | int main ()
{
int n,c[100],i,k = 0,a;
cin >> n;
for (i = 0; i < n; i++)
cin >> c[i];
for (i = (n - 1); i >= 0; i--)
{
if (k == 1)
cout << " " ;
cout << c[i] ;
k = 1;
}
cout << endl;
return 0;
}
| 47 |
23,264 | int main()
{
int n,a[100];
int i;
for(i=0;i<100;i++)
a[i]=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=n;i>=1;i--)
{
if(i>1)
printf("%d ",a[i]);
else
printf("%d",a[i]);
}
return 0;
}
| 47 |
23,265 | int main()
{
int a[100]={0},i=0,n=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=n-1;i>0;i--)
{
cout<<a[i]<<' ';
}
cout<<a[0]<<endl;
return 0;
} | 47 |
23,266 | int main()
{
int n;
scanf("%d",&n);
int i,a[100],tem=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
if(n%2!=0)
{
for(i=0;i<=n/2;i++)
{
tem=a[i];
a[i]=a[n-i-1];
a[n-i-1]=tem;
}
}
if(n%2==0)
{
for(i=0;i<=n/2-1;i++)
{
tem=a[i];
a[i]=a[n-i-1];
a[n-i-1]=tem;
}
}
for(i=1;i<n;i++)
{
printf("%d ",a[i-1]);//?i?1?????a[i-1]????????a[i-2]????????????
}
printf("%d",a[i-1]);//(???????????????)
return 0;
} | 47 |
23,267 |
int main()
{
int x[100];
int n,i;
int *p=NULL;
scanf("%d",&n);
p=&x[0];
for(i=0;i<n;i++)
scanf("%d",&x[i]);
for(i=0;i<n;i++)
{
if(i!=0)
printf(" ");
printf("%d",*(p+n-i-1));
}
printf("\n");
return 0;
} | 47 |
23,268 | int main(){
int n,e,i,k;
scanf("%d\n",&n);
int sz[n];
e=0;
while(e<n){
scanf("%d",&sz[e]);
e=e+1;
}
if(n%2==0){
e=0;
k=n/2;
while(e<k){
i=sz[e];
sz[e]=sz[n-e-1];
sz[n-e-1]=i;
e=e+1;
}
e=0;
while(e<n-1){
printf("%d ",sz[e]);
e=e+1;
}
printf("%d",sz[n-1]);
}else if(n%2==1){
e=0;
k=n-1;
k=k/2;
while(e<k){
i=sz[e];
sz[e]=sz[n-e-1];
sz[n-e-1]=i;
e=e+1;
}
e=0;
while(e<n-1){
printf("%d ",sz[e]);
e=e+1;
}
printf("%d",sz[n-1]);
}
return 0;
}
| 47 |
23,269 | int main()
{
int n;
int a[100]={0};
int *p,*q,r;
cin>>n;
for(p=a;p<a+n;p++)
{
cin>>*p;
}
for(p=a,q=a+n-1;p<q;p++,q--)
{r=*p;*p=*q;*q=r;}
for(p=a;p<a+n-1;p++)
{cout<<*p<<" ";}
cout<<*p;
return 0;
} | 47 |
23,270 |
int main()
{
int a[100],b[100],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-1-i];
printf("%d ",b[i]);
}
printf("%d",a[0]);
return 0;
}
| 47 |
23,271 | int main(){
int n,i,b;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++){scanf("%d",&a[i]);}
for(i=n-1;i>=0;i--){printf("%d",a[i]);
if(i!=0){printf(" ");}
}
return 0;
} | 47 |
23,272 | int main(void)
{
int n,a[100];
int *a_pointer=NULL;
cin>>n;
a_pointer=a;
for(int i=0;i<n;i++) cin>>*a_pointer++;
*a_pointer--;
for(int i=0;i<n-1;i++) cout<<*a_pointer--<<' ';
cout<<*a_pointer;
return 0;
}
| 47 |
23,273 | int main()
{
int n,i;
int a[300],b[300];
int *p,*p1;
p=a;
p1=b;
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%d",p);
*p1=*p;
p1++;
p++;
}
p=a;
p1=b;
i=0;
for(i=0;i<n;i++,p++)
{ *p=*(p1+n-1-i);
}
p=a;
printf("%d",*p);
for(i=1;i<n;i++)
printf(" %d",*(++p));
return 0;
} | 47 |
23,274 | int main()
{
int a[100],n,k=0;
int *p=a;
scanf("%d",&n);
for(;;p++)
{
if(k==n)
break;
scanf("%d",p);
k++;
}
p--;
printf("%d",*p);
p--;
do
{
printf(" %d",*p);
p--;
}while(p>=a);
return 0;
} | 47 |
23,275 | int main()
{
int n;
scanf("%d",&n);
int i,sz[100];
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
int k=0,j=n-1,e;
while((k<=n/2)&&(j>=n/2)){
e=sz[k];
sz[k]=sz[j];
sz[j]=e;
k++;
j--;
}
for(i=0;i<n-1;i++){
printf("%d ",sz[i]);
}
printf("%d",sz[n-1]);
int a;
scanf("%d",&a);
return 0;
}
| 47 |
23,276 |
int main()
{
int a[100],i,temp,n;
scanf ("%d\n",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n/2;i++)
{
temp=a[i];
a[i]=a[n+1-i];
a[n+1-i]=temp;
}
for(i=1;i<n;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n]);
return 0;
} | 47 |
23,277 | int main()
{
int sz[max],dx[max],n,i,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&(sz[i]));
}
for(m=0,i=n-1;i>0,m<n-1;i--,m++)
{
dx[m]=sz[i];
printf("%d ",dx[m]);
}
dx[n-1]=sz[0];
printf("%d\n",dx[m]);
return 0;
}
| 47 |
23,278 | void main()
{
int a[100],b[100],n,i,*p,*q;
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
q=b;
p--;
for(i=0;i<n;i++)
*q++=*p--;
q=b;
for(i=0;i<n-1;i++)
printf("%d ",*q++);
printf("%d",*q);
} | 47 |
23,279 | int main()
{
int i,n;
int a[100];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i-1]);
}
for(i=n;i>=2;i--){
printf("%d ",a[i-1]);
}
printf("%d",a[0]);
return 0;
} | 47 |
23,280 | /*
* ????reverse.cpp
* ?????1200012840
* ?????2012-12-13
* ????????????????????????????8,6,5,4,1?????1,4,5,6,8?
*/
int main()
{
int n,i,a[102],*p=NULL,*q=NULL,temp;//????
cin>>n;//??
for(i=0;i<n;i++)//????
cin>>a[i];
for(p=a,q=a+n-1;p<q;p++,q--)//??????
{
temp=*p;
*p=*q;
*q=temp;
}
for(p=a;p<(a+n-1);p++)//??
cout<<*p<<' ';
p=a+n-1;
cout<<*p<<endl;
return 0;//????
}
| 47 |
23,281 |
int main()
{
int i, j, n;
int a[100];
/* ???? */
scanf("%d", &n);
for (i=0; i<n; i++) {
scanf("%d", &a[i]);
}
/* ???? */
for (i=0,j=n-1; i<j; i++,j--) {
int t = a[i];
a[i] = a[j];
a[j] = t;
}
/* ???? */
for (i=0; i<n; i++){
printf("%d", a[i]);
if(i!=n-1) printf(" ");
}
return 0;
} | 47 |
23,282 | int main()
{
int n,i,*p;
scanf("%d",&n);
p=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%d",p);
p++;
}
p--;
for(;i>0;i--,p--)
{
if(i==n)
printf("%d",*p);
else
printf(" %d",*p);
}
return 0;
} | 47 |
23,283 | //??????
int main()
{
int n=0,i=0,j=0;
int a[10000]={0};
int *p=a;
cin>>n;
for (i=0;i<n;i++)
cin>>a[i];
for (i=0;i<n/2;i++)
{
j=*(p+i);
*(p+i)=*(p+n-1-i);
*(p+n-1-i)=j;
}
for (i=0;i<n;i++)
{
if (i!=n-1)
cout<<a[i]<<" ";
if (i==n-1)
cout<<a[i];
}
return 0;
}
| 47 |
23,284 | int main()
{
int a[100];//??????
int n;
cin >>n;
cout <<endl;
for (int i = 0;i <= n-1;i++)//?????????
cin >>a[i];
cout <<endl;
for (int k = n-1;k >=1;k--)//?????????
cout <<a[k]<<" ";
cout <<a[0];
cout <<endl;
return 0;
} | 47 |
23,285 | int main()
{
int n,i,tem;
int *p1;
scanf("%d",&n);
p1=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&p1[i]);
}
for(i=0;i<n/2;i++)
{
tem=p1[i];
p1[i]=p1[n-1-i];
p1[n-1-i]=tem;
}
printf("%d",p1[0]);
for(i=1;i<n;i++)
{
printf(" %d",p1[i]);
}
free(p1);
return 0;
}
| 47 |
23,286 |
int a[10000];
int p;
void oppo(int n);
void printa(int n);
int main(){
int n;
scanf("%d",&n);
oppo(n);
printa(n);
return 0;
}
void oppo(int n){
for(int i1=0;i1<n;i1++){
scanf("%d",&(a[i1]));
}
for(int i2=0;i2<n;i2++){
for(int j=0;j<n-i2-1;j++){
p=a[j];a[j]=a[j+1];a[j+1]=p;
}
}
}
void printa(int n){
for(int i3=0;i3<n;i3++){
if(i3==0){
printf("%d",a[i3]);
}else{
printf(" %d",a[i3]);
}
}
} | 47 |
23,287 |
int main()
{
int n,a[120],i,temp;
int *p = NULL;//????
p = a;
cin >> n;
for ( i = 0 ; i < n; i ++ ) cin >> a[i];
for ( i = 0 ; i < n / 2 ; i ++ )//?????
{
temp = *(p + i);
*(p + i) = *(p + n - 1 - i);
*(p + n - 1- i ) = temp;
}
cout << a[0];
for ( i = 1 ; i < n; i ++) cout << ' ' << a[i];
return 0;
} | 47 |
23,288 | /*
* shuzunixu.cpp
*
* Created on: 2012-11-2
* Author: ??
*/
int main(){ //?????
int n,i,j,k,p; //????
cin>>n; //??n
int a[n]; //????
for(i=0;i<n;i++) //????
{cin>>a[i];}
for(j=0;j<=n/2-1;j++) //???????????
{p=a[j]; //?????????????????
a[j]=a[n-1-j];
a[n-1-j]=p;}
for(k=0;k<n;k++) //????
{if(k==0){cout<<a[k];}
else{cout<<' '<<a[k];}
}
return 0; //???????????
}
| 47 |
23,289 | /*
* hw131019_8.cpp
*??
?????????????????????????8,6,5,4,1?????1,4,5,6,8?
????
?????????????????n?1 < n < 100)?????n?????????????????
????
??????????????????????????????
* Created on: 2013?10?21?
* Author: KyLin
*/
int main ()
{
int n;
cin>>n;
const int n1=n;
int a[n1],t1;
for (t1=0;t1<n1;++t1)
cin>>a[t1];
for (t1=n1-1;t1>=0;--t1)
{
if (t1==(n1-1))
cout<<a[t1];
else
cout<<" "<<a[t1];
}
return 0;
}
| 47 |
23,290 | int main()
{
int sz[100];
int n,i,e;
scanf("%d",&n);
for(i=0;i<n;i=i+1){
scanf("%d ",&sz[i]);
}
for(i=0;i<n/2;i=i+1){
e=sz[i];
sz[i]=sz[n-1-i];
sz[n-1-i]=e;
}
for(i=0;i<n;i=i+1){
if(i<n-1) printf("%d ",sz[i]);
else printf("%d",sz[i]);
}
return 0;
} | 47 |
23,291 |
int main()
{
int sz[100];
int n;
scanf("%d",&n);
for(int m=0;m<n;m++)
{
scanf("%d",&sz[m]);
}
if(n%2==0)
{
for(int i=0;i<n/2;i++)
{
int e;
e=sz[i];
sz[i]=sz[n-i-1];
sz[n-i-1]=e;
}
}
else
{
for(int k=0;k<=(n-1)/2;k++)
{
int f;
f=sz[n-1-k];
sz[n-1-k]=sz[k];
sz[k]=f;
}
}
for(int a=0;a<n-1;a++)
{
printf("%d ",sz[a]);
}
printf("%d",sz[n-1]);
return 0;
} | 47 |
23,292 | int main()
{
int n,*q,i,j;
cin>>n;
int a[n];
q=a;
for(int i=0;i<n;i++)
cin>>a[i]; //????
cout<<*(q+n-1);
for( j=n-2;j>=0;j--)
cout<<" "<<*(q+j); //??????????
cout<<endl;
return 0;
}
| 47 |
23,293 | int main()
{
int n,num[101],i,j,num2[101];
cin>>n;
for(i=0;i<n;i++)
{
cin>>num[i];
num2[n-i-1]=num[i];//???D???¨°
}
cout<<num2[0];
for(i=1;i<n;i++)
cout<<" "<<num2[i];//?????Á??¨®?T?????¤???
return 0;
}
| 47 |
23,294 | int main(int argc, char* argv[])
{
int n,i;
scanf("%d",&n);
int m[NUMBER];
for(i=0;i<n;i++){
scanf("%d",&m[i]);
}
int q;
printf("%d",m[n-1]);
for(q=n-2;q>=0;q--){
printf(" %d",m[q]);
}
return 0;
} | 47 |
23,295 | int main()
{
int num[1000],rev_num[1000];
int n,m,i;
cin>>n;
m=n-1;
for (i=0;i<n;i++)
cin>>num[i];
for (i=0;i<n;i++)
rev_num[m--]=num[i];
for (i=0;i<n-1;i++)
cout<<rev_num[i]<<" ";
cout<<rev_num[i];
return 0;
}
| 47 |
23,296 | int main(int argc, char* argv[])
{
int a[100];
int i;
int n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=n-1;i>0;i--)
{
printf("%d ",a[i]);
}
i=0;
printf("%d\n",a[i]);
return 0;
}
| 47 |
23,297 | int main()
{
int n,a[101],b[101],i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
for(i=1;i<=n;i++)
{
a[i]=b[n-i+1];
if(i!=n)
printf("%d ",a[i]);
else printf("%d",a[i]);
}
return 0;
}
| 47 |
23,298 | int main(){
int n,a[100],i,b,c,d,f[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);}
c=n-1;
b=a[c];
for(i=0;i<n;i++){
d=n-1-i;
f[d]=a[i];}
for(i=0;i<c;i++){
printf("%d ",f[i]);}
printf("%d",f[c]);
return 0;
} | 47 |
23,299 | int main()
{
int i=0,n=0,a[1000]={0};
int *p=a;
cin>>n;
for(i=0;i<n;i++)
cin>>*p++;//????
for(p=a+n-1;p>a;p--)
cout<<*p<<" ";
cout<<*p;//????
return 0;
} | 47 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.