label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
47 | 23100 | int main(){
int n,tr,i;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(p=a,i=1;i<n;p++,i++)cout<<*p<<" ";
cout<<*(a+n-1);
return 0;
}
|
47 | 23101 | //***********************//
//*????????? *//
//*????? *//
//*???2010.11.12 *//
//***********************//
int main()
{
int a[200];//?????????????????????
int n,i;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=n-1;i>=0;i--)//????????????????????
{
a[i+n]=a[i];
}
for(i=n+n-1;i>=n;i--)//???????????????????????n-1?
{
a[n+n-1-i]=a[i];
}
for(i=0;i<n;i++)
{
if(i!=n-1)
cout<<a[i]<<" ";
else
cout<<a[i];
}
return 0;
} |
47 | 23102 |
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 | 23103 | int main()
{
int n,a[101];
cin>>n;
int i;
for (i=1;i<=n;i++)
{
cin>>a[i];
}
for (i=n;i>=2;i--)
{
cout<<a[i]<<' ';
}
cout<<a[1];
}
|
47 | 23104 | int main()
{
int n,i,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("%d",*(a+n-1));
for(i=n-2;i>=0;i--)
{
printf(" %d",*(a+i));
}
return 0;
} |
47 | 23105 | 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 | 23106 | 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 | 23107 | 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 | 23108 | int main(){
int n,a,b;
int sz[2][101];
scanf("%d",&n);
for(a=0;a<n;a++){
scanf("%d",&sz[0][a]);
}
for(a=0;a<n;a++){
sz[1][a]=sz[0][n-1-a];
}
for(b=0;b<n-1;b++){
printf("%d ",sz[1][b]);
}
printf("%d",sz[1][n-1]);
return 0;
} |
47 | 23109 | /*
* shuzunixu.cpp
*???????
* Created on: 2012-11-3
* Author: ??
*/
int main() {
int n, i;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];//???????
for (i = 0; i <= 0.5 * (n - 1); i++)
swap(a[i], a[n - 1 - i]);//??
cout << a[0];
for (i = 1; i < n; i++)
cout << " " << a[i];//??
return 0;
} |
47 | 23110 |
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 | 23111 | /*
* 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 | 23112 |
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 | 23113 | 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 | 23114 | 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 | 23115 | 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 | 23116 | 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 | 23117 | 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 | 23118 |
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 | 23119 | int n, a[100];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> *(a + i);
for (int i = 1; i < n - i + 1; i++){
int temp = *(a + n - i + 1);
*(a + n - i + 1) = *(a + i);
*(a + i) = temp;
}
for (int i = 1; i < n; i++)
cout << *(a + i) << ' ';
cout << *(a + n) << endl;
return 0;
}
|
47 | 23120 |
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 | 23121 | /*
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 | 23122 | 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 | 23123 | 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 | 23124 | void main()
{
int n,i,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",*(a+n-1));
for(i=n-2;i>=0;i--)
printf(" %d",*(a+i));
} |
47 | 23125 | 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 | 23126 |
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 | 23127 | /*ÎÒÕæÏëÖ±½Ó·´×ÅÊä³öÁË¡­¡­µ«ÊÇÄÇÌ«²»µÀµÂÁËÍÛ¹þ¹þ¹þ*/
int main()
{
int tmp,t,n,a[100];
cin>>n;
t=n/2-1;
for (int i=0; i<=n-1; ++i) cin>>a[i];
for (int i=0; i<=t; ++i)
{
tmp=a[n-1-i];
a[n-1-i]=a[i];
a[i]=tmp;
}
cout<<a[0];
for (int i=1; i<=n-1; ++i) cout<<' '<<a[i];
return 0;
} |
47 | 23128 | //
// 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 | 23129 | int main()
{
int A[100],i,j,t=0,n;
int *pt;
pt=A;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",pt);
pt++;
}
for(pt=A+n-1;pt>=A;pt--)
{
if(t==0)
{
printf("%d",*pt);
t++;
}
else
{
printf(" %d",*pt);
}
}
return 0;
} |
47 | 23130 |
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 | 23131 | int main()
{
int x[100] , n , i , m ;
char c ;
cin >> n ;
for ( i = 1 ; i <= n ; i++ )
{
cin >> x[i] ;
m = i ;
}
for ( i = 1 ; i <= m ; i++ )
{
cout << x[m+1-i] ;
if ( m + 1 - i != 1 )
cout << " " ;
}
} |
47 | 23132 | 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 | 23133 | int main()
{
int a[100]={0};
int n,j,i,p;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
if(n==1)
cout<<a[0];
else
{
cout<<a[n-1];
for(i=n-2;i>=0;i--)
cout<<' '<<a[i];
}
return 0;
} |
47 | 23134 | int main()
{
int n=0,i=0,j=0,p=0;
int arrey[100]={0};
cin>>n;
for(i=0;i<n;i++)
cin>>arrey[i];
for(i=0,j=n-1;i<j;i++,j--)
{
p=arrey[i];
arrey[i]=arrey[j];
arrey[j]=p;
}
for(i=0;i<n-1;i++)
cout<<arrey[i]<<" ";
cout<<arrey[n-1]<<endl;
return 0;
}
|
47 | 23135 | 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 | 23136 | int main()
{
void swap(int *pt1,int *pt2);
int *pt1,*pt2;
int a[100],n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
if(n%2==0){
for(i=0;i<n/2;i++){
pt1=&a[i];
pt2=&a[n-1-i];
swap(pt1,pt2);
}
}
else{
for(i=0;i<n/2;i++){
pt1=&a[i];
pt2=&a[n-1-i];
swap(pt1,pt2);
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
printf(" %d",a[i]);
}
void swap(int *pt1,int *pt2)
{
int temp;
temp=*pt1;
*pt1=*pt2;
*pt2=temp;
} |
47 | 23137 | 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 | 23138 | int main()
{
int n=0,i=0,temp=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<floor(n*0.5);i++)
{
temp=a[n-1-i];
a[n-1-i]=a[i];
a[i]=temp;
}
for(i=0;i<n;i++)
{
if(i<n-1)cout<<a[i]<<' ';
else cout<<a[i]<<endl;
}
return 0;
} |
47 | 23139 | /*
* ????.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 | 23140 | 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 | 23141 | 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 | 23142 | //????
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 | 23143 | 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 | 23144 |
int main()
{
int n,i;
int A[100];
scanf("%d",&n);
for(i=0;i<n;i++){
int a;
scanf("%d",&a);
A[i]=a;
}
for(i=n-1;i>=0;i--){
if(i>0)
printf("%d ",A[i]);
else
printf("%d",A[i]);
}
return 0;
}
|
47 | 23145 | 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 | 23146 | 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 | 23147 |
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 | 23148 | 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 | 23149 | 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 | 23150 | int main()
{
int n,i;
scanf("%d",&n);
int sz[100];
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
int e;
for(int k=1;k<n;k++){
for(i=0;i<n-k;i++){
e=sz[i];
sz[i]=sz[i+1];
sz[i+1]=e;
}
}
for(i=0;i<n;i++){
if(i==0){
printf("%d",sz[i]);
}
else{
printf(" %d",sz[i]);
}
}
return 0;
} |
47 | 23151 | int main()
{
int a[100];
int *p=a;
int n,i,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
if(n==1) printf("%d",*p);
else
{
for(i=0;i<=(n-1)/2;i++)
{
t=*(p+i);
*(p+i)=*(p+n-1-i);
*(p+n-1-i)=t;
}
printf("%d",*p);
for(i=1;i<n;i++)
printf(" %d",*(p+i));
}
printf("\n");
return 0;
}
|
47 | 23152 |
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 | 23153 | 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 | 23154 |
void main()
{
int a[1000],*p,n,i,t;
scanf("%d",&n);
p=a;
for(i=0;i<n;i++,p++)
scanf("%d",p);
for(i=n-1;i>0;i--)
printf("%d ",*(p+i-n));
printf("%d",*(p-n));
}
|
47 | 23155 | 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 | 23156 | void main()
{
int i,temp,*p,*q,n,a[102];
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p++);
p--;
for(q=a;q-p<=0;q++,p--){
temp=*q;
*q=*p;
*p=temp;
}
for(p=a;p<a+n;p++)
printf("%d%c",*p,(p<a+n-1)? ' ':'\n');
} |
47 | 23157 | //============================================================================
// Name : shj.cpp
// Author : ???
// Time : 2013.12.13
// Description : ????
//============================================================================
int main(){
int n=0;
cin>>n;//?????????
int i=0,p[100];
for(i=0;i<n;i++)
cin>>*(p+i);//????
cout<<*(p+n-1);//???????????
if(n>1)
for(i=n-2;i>=0;i--)
cout<<" "<<*(p+i);//???????
cout<<endl;
return 0;
}
|
47 | 23158 | 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 | 23159 | 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 | 23160 | 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 | 23161 | void main()
{
int n,a[100],i;
scanf("%d",&n);
if(n<2 || n>99)
printf("It is a wrong number!");
if(n==10)
{
for(i=1;i<=n+1;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n+1;i++)
{
if(i==1)
printf("%d",a[n+1]);
else
printf(" %d",a[n+2-i]);
}
}
else
{
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
if(i==1)
printf("%d",a[n]);
else
printf(" %d",a[n+1-i]);
}
}
} |
47 | 23162 | 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 | 23163 | 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 | 23164 | 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 | 23165 | /*
* hehe.cpp
*
* Created on: 2012-12-11
* Author:??
* ?????????????????????????8,6,5,4,1?????1,4,5,6,8?
*
*/
int main(){
int n,a[2000],*p,*q,temp;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
p=a;q=n+a-1;
for(;p<q;p++,q--)
{temp=*p;
*p=*q;
*q=temp; //??????????
}
cout<<a[0];
for(int i=1;i<n;i++)
cout<<" "<<a[i];
return 0;
}
|
47 | 23166 | 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 | 23167 |
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 | 23168 | int main()
{
int n,i;
cin>>n;//??n
int a[n+1];
int *p=NULL;
p=&a[0];
for(i=0;i<n;i++)
{
cin>>*(p+i);//????
}
cout<<*(p+n-1);//???????
for(i=n-2;i>=0;i--)
{
cout<<' '<<*(p+i);//?????????
}
return 0;
}
|
47 | 23169 |
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 | 23170 | 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 | 23171 | 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 | 23172 | 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 | 23173 |
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 | 23174 | 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 | 23175 | 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 | 23176 | 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 | 23177 | 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 | 23178 | 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 | 23179 | 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 | 23180 |
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 | 23181 | int main()
{
int n; //n????????
int shun[100];int ni[100]; //shun?????,ni?????
cin>>n;
for(int i=0;i<n;i++) //??????????
{
cin>>shun[i];
}
for(int j=0;j<n;j++) //????????????????
{
ni[j]=shun[n-1-j];
}
cout<<ni[0]; //??ni??
for(int k=1;k<n;k++)
{
cout<<' '<<ni[k];
}
return 0;
} |
47 | 23182 | void main()
{
int n,a[100],*p=a;
scanf("%d",&n);
p=p+n-1;
for(;p>=a;p--)
scanf("%d ",p);
p=a;
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d",*p);
} |
47 | 23183 | 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 | 23184 | void main()
{int i,j,*p,a[100]={0},n,t=0;
scanf("%d",&n);
for(p=a;p<n+a;p++)
scanf("%d",p);
p=a;
for(i=0;i<n-1;i++)
{t=*(a+n-1);
for(p=a+n-1;p>=a+i+1;p--)
{*p=*(p-1);}
*(a+i)=t;
}
printf("%d",*a);
for(p=a+1;p<(a+n);p++)
printf(" %d",*p);
} |
47 | 23185 | /*
*???: reverse_array.cpp
*??: ???
*????: 2012-12-09
*??: ????
*/
int main()
{
int n;
int array[MAXN];
int *begin,*end; //??????
cin >> n;
for (int i=0;i<n;i++)
cin >> array[i];
begin=array; end=array+n-1;
while (begin<end){
int tmp = *begin;
*begin = *end;
*end = tmp;
begin++;
end--;
}
for (int i=0;i<n;i++){
if (i) cout << ' ';
cout << array[i];
}
cout << endl;
return 0;
}
|
47 | 23186 | /*
* 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 | 23187 | int main()
{
int n=0,i;
int a[105]={0};
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=n-1;i>=1;i--)
cout<<a[i]<<" ";
cout<<a[0];
return 0;
} |
47 | 23188 | 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 | 23189 | 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 | 23190 | int main()
{
int a[100];
int n;
int *p=a;
cin>>n;
for(;p<a+n;p++)
cin>>*p;
for(p=a+n-1;p>a;p--)
cout<<*p<<" ";
cout<<*p;
}
|
47 | 23191 | void main()
{
int n,a[100],t,*p=a,*q;
scanf("%d",&n);
for(;p<a+n;p++)
scanf("%d",p);
p=a;q=a+n-1;
for(;p<q;p++,q--)
{ t=*p;
*p=*q;
*q=t;}
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d",*p);
}
|
47 | 23192 | 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 | 23193 | 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 | 23194 | 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 | 23195 | 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 | 23196 | int main()
{
int n;cin>>n;
int a[n];int tr,i;
for( i=0;i<n;i++)cin>>a[i];
i--;
for(int j=0;j<i;j++,i--)
{
tr=a[j];a[j]=a[i];a[i]=tr;
}
for( i=0;i<n;i++){
if(i==0)cout<<a[i];
else cout<<" "<<a[i];
}
return 0;
}
|
47 | 23197 |
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 | 23198 | 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 | 23199 | void main()
{
int n,i,m,t;
int a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
a[i]=m;
}
for(i=0;i<=(int)(n-1)/2;i++)
{
t=a[i];
a[i]=a[n-i-1];
a[n-i-1]=t;
}
for(i=0;i<n;i++)
{
printf("%d",a[i]);
if(i<n-1)
printf(" ");
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.