label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
47 | 23300 | int main()
{
int i,n,a[100],* p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",p++);
}
p--;
for(i=0;i<n;i++,p--)
{
if(i==0)
printf("%d",* p);
else
printf(" %d",* p);
}
return 0;
}
|
47 | 23301 | int main(){
int n,a[100];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int t=n-1;t>=0;t--){
if(t>0)printf("%d ",a[t]);
else{printf("%d",a[t]);}
}
return 0;
} |
47 | 23302 | void main()
{
int a[100],*p,n,i,j,m,t;
p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&*(p+i));
m=(n)/2;
for(i=0;i<m;i++)
{
j=n-i-1;
t=*(p+i);
*(p+i)=*(p+j);
*(p+j)=t;
}
for(i=0;i<n-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+n-1));
} |
47 | 23303 |
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 | 23304 | 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 | 23305 |
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 | 23306 | 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 | 23307 | /*
* point1002.cpp
*
* Created on: 2013-12-4
* Author: weng
*/
int main()
{
int n , t ;
cin >> n ;
int a[n] ;
int * p = NULL , * q = NULL ;
for( p = a ; p < a + n ; p ++ )
cin >> * p ;
p = a ;
q = a + n - 1 ;
for( ; p < q ; p ++ , q -- )
{
t = * p ;
* p = * q ;
* q = t ;
}
p = a ;
cout << * p ++ ;
for( ; p < a + n ; p ++ )
cout << " " << * p ;
cout << endl ;
return 0 ;
}
|
47 | 23308 | int a[100],sz[100];
void change(int sz[],int n);
int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
change(sz,n);
for(i=0;i<n-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n-1]);
return 0;
}
void change(int sz[],int n)
{
for(int i=0;i<n;i++)
{
a[i]=sz[n-1-i];
}
} |
47 | 23309 | 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 | 23310 | int main(){
int n;
scanf("%d\n",&n);
int zx[n];
int dx[n];
for(int i=1;i<=n;i++){
scanf("%d",&zx[i]);
}
for(int j=1;j<=n;j++){
dx[j]=zx[n-j+1];
}
for(int j=1;j<n;j++){
printf("%d ",dx[j]);
}
printf("%d",dx[n]);
return 0;
}
|
47 | 23311 | 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 | 23312 | int main()
{
int *p=NULL,*q=NULL;
int n,a[110];
p=a;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>*p++;
}//????
for(p=a,q=a+n-1;p<q;q--,p++)
{
int t;
t=*p;*p=*q;*q=t;//????
}
for(p=a;p<a+n-1;)
cout<<*p++<<" ";
cout<<*p<<endl;//??
return 0;
} |
47 | 23313 | 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 | 23314 |
int main()
{
int n,i,a[100];
int *b[100];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
b[i]=&a[n+1-i];
}
printf("%d",*b[1]);
for(i=2;i<=n;i++)
{
printf(" %d",*b[i]);
}
return 0;
} |
47 | 23315 | 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 | 23316 | int main()
{
int k;//??????
cin>>k;
int i=0;
int a[100];
for(i=0;i<k;i++)
{
cin>>a[i];
}
for(i=0;i<(k-1);i++)
{
cout<<a[(k-i-1)]<<" ";
}
cout<<a[(k-i-2)];
return 0;
}
|
47 | 23317 | int main()
{
int n,i,t;
int a[150];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
if(n%2==0)
{
for(i=0;i<n/2;i++)
{
t=a[i];
a[i]=a[n-1-i];
a[n-1-i]=t;
}
for(i=0;i<n-1;i++)
{
printf("%d ",a[i]);
}
printf("%d\n",a[n-1]);
}
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-1;i++)
{
printf("%d ",a[i]);
}
printf("%d\n",a[n-1]);
}
return 0;
}
|
47 | 23318 | //????
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 | 23319 | /*
* ????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 | 23320 | 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 | 23321 | int main(){
int n;
int a[10000];
int i;
scanf("%d",&n);
for(i=0;i<n;i++){
if(i<n-1){
scanf("%d ",&a[i]);
}
else{
scanf("%d",&a[i]);
}
}
for(i=n-1;i>=0;i--){
if(i>0){
printf("%d ",a[i]);
}
else{
printf("%d",a[i]);
}
}
return 0;
} |
47 | 23322 | 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 | 23323 | void main()
{
int n,i;
int a[100];
scanf("%d",&n);
int *p;
p=a;
for(i=0;i<n;i++)
{
scanf("%d",p);
p=p+1;
}
p=p-1;
for(i=0;i<n-1;i++)
{
printf("%d ",*p);
p=p-1;
}
printf("%d",*p);
}
|
47 | 23324 | 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 | 23325 | 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 | 23326 |
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 | 23327 | int main(){
int sz[100];
int n,i,e;
e=0;
scanf("%d",&n);
for(i=2;i<=n+1;i++){
scanf(" %d",&sz[i]);
e=sz[i];
sz[i]=sz[i-1];
sz[i-1]=e;
}
for(i=n;i>=2;i--){
printf("%d ",sz[i]);
}
if(i=1)
printf("%d",sz[i]);
return 0;
} |
47 | 23328 | int main()
{
int s[100],n;
cin>>n;
for(int i=0;i<n;i++)
cin>>s[i];
int *p=&s[n];
while(n>1)
{
p--;
n--;
cout<<*p<<' ';
}p--;
cout<<*p<<endl;
return 0;
}
|
47 | 23329 | 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 | 23330 | 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 | 23331 | int main()
{
int n=0,i=0,m=0,s=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
if(n%2==1)m=n/2+1;
if(n%2==0)m=n/2;
for(i=0;i<m;i++)
{
s=a[i];
a[i]=a[n-1-i];
a[n-1-i]=s;
}
for(i=0;i<n;i++)
{
if(i<n-1)cout<<a[i]<<' ';
if(i==n-1)cout<<a[i];
}
cout<<endl;
return 0;
}
|
47 | 23332 | 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 | 23333 | int main(int argc, char* argv[])
{
int n,i;
scanf("%d",&n);
int *A,*B;
A=(int *)malloc(sizeof(int)*n);
B=(int *)malloc(sizeof(int)*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]);
}
return 0;
}
|
47 | 23334 | int main ()
{
int a[100]={0};
int n;
cin>>n;
int *p=a;
for (int i=0;i<n;i++)
cin>>*p++;
for (int i=0;i<n;i++)
{
if (i!=0)
cout<<" ";
cout<<*--p;
}
return 0;
} |
47 | 23335 | 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 | 23336 | 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 | 23337 | //???? ??? 20121208
int s[111];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>*(s+i);
}
for(int i=0;i<n;i++)
{
if(i!=n-1)
cout<<*(s+n-i-1)<<' ';
else
cout<<*(s+n-i-1);
}
return 0;
}
|
47 | 23338 | 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 | 23339 |
int main(){
int a[100],*p=NULL;
int n;
cin>>n;
for(p=a;p<n+a;p++)
cin>>*p;
for(p=a+n-1;p>a;p--){
cout<<*p<<" ";
}
p=a;
cout<<*p;
}
|
47 | 23340 | int main(){
int i,n;
int h[100];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&(h[i]));
}
for(i=n;i>0;i--){
if(i==1){
printf("%d",h[1]);
}else{
printf("%d ",h[i]);
}
}
return 0;
}
|
47 | 23341 | 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 | 23342 | 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 | 23343 | 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 | 23344 | int main(){
int n,a[100],i,j,t;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
j=n-1;
for(i=0;i<j;i++){
t=a[i];
a[i]=a[j];
a[j]=t;
j--;
}
for(i=0;i<n;i++){
if(i<n-1) printf("%d ",a[i]);
else printf("%d",a[i]);
}
return 0;
} |
47 | 23345 | /*
* ????????.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 | 23346 | 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 | 23347 |
int main(){
int k,i,e,n,sz[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
printf("%d ",sz[n-1]);
for(i=n-2;i>=1;i--){
printf("%d ",sz[i]);
}
printf("%d",sz[0]);
return 0;
}
|
47 | 23348 | 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 | 23349 | 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 | 23350 | int main()
{
int a[100],n,i,j,m,temp;
int *p,*q;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);}
for(j=0;j<n/2;j++)
{ p=&a[j];
q=&a[n-1-j];
temp=*p;
*p=*q;
*q=temp;
}
for(m=0;m<n-1;m++)
{ printf("%d ",a[m]);}
printf("%d",a[n-1]);
return 0;} |
47 | 23351 | 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 | 23352 | int main(){
int n,e;
scanf("%d",&n);
int sz[100];
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(int k=0;k<n/2;k++){
e=sz[k];
sz[k]=sz[n-1-k];
sz[n-1-k]=e;
}
printf("%d",sz[0]);
for(int j=1;j<n;j++){
printf(" %d",sz[j]);
}
return 0;
} |
47 | 23353 |
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 | 23354 | /*
* ????????.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 | 23355 | 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 | 23356 | 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 | 23357 | 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 | 23358 | /*
* 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 | 23359 | 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 | 23360 | /*
* 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 | 23361 | 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 | 23362 | int main()
{
int a[100],i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=n-1;j>0;j--)
printf("%d ",a[j]);
printf("%d",a[0]);
return 0;
}
|
47 | 23363 | 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 | 23364 | 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 | 23365 | /*
* 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 | 23366 | 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 | 23367 |
int data[1000] = {0};
int n = 0, m = 0;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++) cin >> data[i];
for(int i = 1; i <= n / 2; i++)
{
int j = data[i];
data[i] = data[n - i + 1];
data[n - i + 1] = j;
}
cout << data[1];
for(int i = 2; i <= n; i++) cout << ' ' << data[i];
} |
47 | 23368 | 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 | 23369 | 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 | 23370 | int main()
{
int n,i,t;
int a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("%d",a[n-1]);
for(i=1;i<n-1;i++)
{
t=a[n-i-1];
printf("% d",t);
}
printf(" %d\n",a[0]);
return 0;
} |
47 | 23371 | int main(){
int n,i,k,t;
scanf("%d",&n);
int a[100];
for(i=0;i<n-1;i++){
scanf("%d ",&a[i]);
}
if(i=n-1){
scanf("%d",&a[i]);
}
int e;
for(k=1;k<n/2+1;k++){
e=a[n-k];
a[n-k]=a[k-1];
a[k-1]=e;
}
for(t=0;t<n-1;t++){
printf("%d ",a[t]);
}
if(t=n-1){
printf("%d",a[t]);
}
return 0;
} |
47 | 23372 | int main()
{
int n,i,e,j;
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++)
{
for(j=0;j<n;j++)
if(i+j==n-1)
{
e=sz[i];
sz[i]=sz[j];
sz[j]=e;
}
}
}
else
{
for(i=0;i<(n+1)/2;i++)
{
for(j=0;j<n;j++)
if(i+j== n-1)
{
e=sz[i];
sz[i]=sz[j];
sz[j]=e;
}
}
}
for(i=0;i<n-1;i++)
{
printf("%d ",sz[i]);
}
printf("%d",sz[n-1]);
return 0;
} |
47 | 23373 |
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 | 23374 | int main()
{
int n,i,j=0,an[100],bn[100]={0};
cin>>n;
for(i=0;i<n;i++)
cin>>an[i];
for(i=n-1;i>=0;i--)
{
bn[j++]=an[i];
}
for(i=0;i<n;i++)
an[i]=bn[i];
for(i=0;i<n-1;i++)
cout<<an[i]<<' ';
cout<<an[n-1];
return 0;
} |
47 | 23375 | int main()
{
int i,n,x,a[100];
cin >>n;
for(i=1;i<=n;i++)
cin >>a[i];
for(i=1;i<=n/2;i++)
{
x=a[i];
a[i]=a[n-i+1];
a[n-i+1]=x;
}
for(i=1;i<=n-1;i++)
cout <<a[i]<<" ";
cout <<a[n];
return 0;
}
|
47 | 23376 | int main()
{
int n,a[101],i,*pt1,*pt2,c;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
if(i==0)
scanf("%d",&a[i]);
else
scanf(" %d",&a[i]);
}
for(i=0;i<(n/2);i++){
pt1=&a[n-1-i];
pt2=&a[i];
c=*pt1;
a[n-1-i]=*pt2;
a[i]=c;
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
return 0;
}
|
47 | 23377 | 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 | 23378 | int main()
{
int a[100];
int i, n;
cin>>n;
if(n!=10)
{
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=n-1;i>=0;i--)
{
if(i>0)
cout<<a[i]<<" ";
else
cout<<a[i]<<endl;
}
}
else
{
for(i=0;i<n+1;i++)
{
cin>>a[i];
}
for(i=n;i>=0;i--)
{
if(i>0)
cout<<a[i]<<" ";
else
cout<<a[i]<<endl;
}
}
return 0;
} |
47 | 23379 | 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 | 23380 | int main()
{
int n,i;
int a[110];
int *t=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",t++); //?????
//??????
for(i=0;i<n/2;i++)
{
*t=*(a+i);
*(a+i)=*(a+n-1-i); //?????
*(a+n-1-i)=*t;
}
printf("%d",*a); //?????
for(i=1;i<n;i++)
printf(" %d",*(a+i));
return 0;
} |
47 | 23381 |
int main()
{
int n,a[100];
cin>>n;
for(int i=0;i<n;i++)//????
{
cin>>a[i];
}
for(int i=0;i<n-1;i++)//????
{
cout<<a[n-1-i]<<' ';
}
cout<<a[0];//???????
return 0;
}
|
47 | 23382 | 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 | 23383 | 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 | 23384 | //
// 8.cpp
// poj
//
// Created by ChuPan,Wong on 10/25/13.
// Copyright (c) 2013 ChuPan,Wong. All rights reserved.
//
int main(){
int n;
int* num;
int i,j;
scanf("%d", &n);
num = (int*)malloc(sizeof(int)*n);
j = n; i = 0;
while (j--) {
scanf("%d", &num[i]);
i++;
}
for (i = 0; i <= (n-1)/2; i++) {
j = num[i];
num[i] = num[n-1-i];
num[n-1-i] = j;
}
for (i = 0; i < n; i++) {
if(i!=0)
printf(" ");
printf("%d", num[i]);
}
printf("\n");
return 0;
} |
47 | 23385 | 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 | 23386 | /*
* 12.10.10b.cpp
* Created on: 2012-10-10
* Author: ???
* ???????
*/
int main()
{
int n,m,a[100],i=0;
cin>>n;
m=n;
while(n--)
{i=i+1;
cin>>a[i];
}
while(m--)
{if(m!=0)
{
cout<<a[i]<<' ';
i=i-1;
}
else cout<<a[1];
}
return 0;
} |
47 | 23387 | 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 | 23388 | 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 | 23389 | 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 | 23390 | //
// main.cpp
// LZW_Work
//
// Created by LZW on 9/28/12.
//
//
int main ()
{
int n;
cin >> n;
int a[100] = {0};
int i;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
for (i = n - 1; ; i--)
{
if(i == 0)
{
cout << a[0];
break;
}
cout << a[i] << " ";
}
}
|
47 | 23391 |
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 | 23392 | int main(){
int n,i=0;
int z[100];
scanf("%d",&n);
while(i<n){
scanf("%d",&z[i]);
i++;
}
i=1;
while(i<=n){
if(i<n){
printf("%d ",z[n-i]);
}else{
printf("%d",z[n-i]);
}
i++;
}
return 0;
} |
47 | 23393 |
int main(int argc, char* argv[])
{
int a[100],n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[n-i-1]);
}
for(i=0;i<n-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n-1]);
return 0;
}
|
47 | 23394 | /*??????*/
void main()
{
int a[100];
int n,i,b;
scanf("%d\n",&n);
i=1;
while(i<=n){
scanf("%d",&a[i]);
i++;
}
i=1;
while(i<=n/2)
{
b=a[i],a[i]=a[n-i+1],a[n-i+1]=b;
i++;
}
i=1;
while(i<n)
{
printf("%d ",a[i]);
i++;
}
printf("%d",a[n]);
} |
47 | 23395 | int main()
{
int a[100],n,i,e;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<(n/2);i++)
{
e=a[i];
a[i]=a[n-i-1];
a[n-i-1]=e;
}
for(i=0;i<n;i++)
{
if(i!=(n-1))
{
printf("%d ",a[i]);
}
if(i==(n-1))
{
printf("%d",a[i]);
}
}
return 0;
}
|
47 | 23396 | void main()
{
int i,j,k,m,n;
int*p;
p=(int*)malloc(200*sizeof(int));
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",p+i);
}
for(i=0;i<n/2;i++)
{
m=*(p+i);
*(p+i)=*(p+n-1-i);
*(p+n-1-i)=m;
}
for(i=0;i<n-1;i++)
{
printf("%d ",*(p+i));
}
printf("%d",*(p+n-1));
}
|
47 | 23397 | //????
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 | 23398 | int main()
{
int a[100] = {0};
int n,temp;
cin>>n;
for (int i=0;i<n;i++)
{
cin>>a[i];
}
for (int j=0;j<n/2;j++)
{
temp = a[j];
a[j] = a[n-1-j];
a[n-1-j] = temp;
}
for (int i=0;i<n;i++)
{
if (i==n-1)
{
cout<<a[i]<<endl;
}
else
{
cout<<a[i]<<' ';
}
}
cout<<endl;
return 0;
} |
47 | 23399 | 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;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.