id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,000 | int main()
{
void inv(int array[ ],int k);
int i,n,a[100],*p;
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
inv(a,n);
printf("%d",*a);
for(p=a+1;p<a+n;p++)
printf(" %d",*p);
}
void inv(int array[ ],int k)
{
int temp,j,m;
m=k/2;
for(j=0;j<m;j++)
{
temp=*(array+k-j-1);
*(array+k-j-1)=*(array+j);
*(array+j)=temp;
}
return;
} | 47 |
23,001 | 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 |
23,002 | change(int *p,int *q,int n)
{
int t;
for(;p<=q;p++,q--)
{
t=*p;
*p=*q;
*q=t;
}
return;
}
void main()
{
int n,a[1000],*p,i,*q;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=a;
q=a+n-1;
change(p,q,n);
for(i=0;i<n-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+i));
} | 47 |
23,003 |
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 |
23,004 | int main()
{
int n,a[100],i,e;
scanf("%d",&n);
scanf("%d",&a[0]);
for(i=1;i<n;i++){
scanf(" %d",&a[i]);}
for(i=0;i<n/2;i++){
e=a[i];
a[i]=a[n-1-i];
a[n-1-i]=e;}
printf("%d",a[0]);
for(i=1;i<n;i++){
printf(" %d",a[i]);}
return 0;
} | 47 |
23,005 | int main ()
{
int a[100] = {0};
int num;
int cur;
int *temp = &cur;
cin >> num;
for ( int i = 0; i < num; i ++ )
cin >> *(a+i);
for ( int i = 0; i < num/2; i ++ )
{
*temp = *(a+i);
*(a+i) = *(a+num-i-1);
*(a+num-i-1) = *temp;
}
cout << *a;
for ( int i = 1; i < num; i ++ )
cout << " " << *(a+i);
return 0;
} | 47 |
23,006 | /*
* 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 |
23,007 | //????010.cpp
//??????
//?????2013?10?27?
//?????
int main()
{
int a[100];
int i,n;
cin>>n;
for(i=0;i<n;i=i+1)
{
cin>>a[n-1-i];
}
for(i=0;i<n;i=i+1)
{
cout<<a[i];
if(i==n-1)
break;
cout<<' ';
}
return 0;
}
| 47 |
23,008 | int main(){
int n,t,m;
scanf("%d\n",&n);
int sz[n];
for(int i=1;i<=n;i++){
scanf("%d",&(sz[i]));
}
for(int i=n;i>1;i--){
printf("%d ",sz[i]);
}
printf("%d",sz[1]);
return 0;
} | 47 |
23,009 |
int main(){
int N;
cin>>N;
int * ar;
if(NULL==(ar=(int *) malloc(N*sizeof(int)))){
perror("error...");
exit(1);
}
for(int i=0;i<N;i++) cin>>*(ar+i);
for(int i=0;i<N;i++) {
cout<<*(ar+N-i-1);
if(i!=N-1) cout<<' ';
}
free(ar);
ar=NULL;
return 0;
}
| 47 |
23,010 | 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 |
23,011 | void main()
{
int *a,i,j,k,m,n,*p;
scanf("%d",&n);
a=(int *)malloc(n*sizeof(int));
p=(int *)malloc(n*sizeof(int));
for(i=0;i<n;i++)
scanf("%d",(a+i));
for(i=n-1,j=0;i>-1,j<n;i--,j++)
*(p+j)=*(a+i);
printf("%d",*p);
for(j=1;j<n;j++)
printf(" %d",*(p+j));
} | 47 |
23,012 | 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 |
23,013 | int main()
{
int sz[100],n,i,m,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
int *pi=sz;
int *pj=sz+n-1;
for(;pi<pj;pi++,pj--)
{
m=*pi;
*pi=*pj;
*pj=m;
}
for(j=0;j<n-1;j++)
{
printf("%d ",sz[j]);
}
printf("%d",sz[n-1]);
return 0;
} | 47 |
23,014 | /*
* nb.cpp
*
* Created on: 2013-12-5
* Author: de
*/
int main(){
int n,i,t;
cin>>n;
int a[n];
for(i=0;i<n;i++)cin>>a[i];
int *p=NULL,*q=NULL;
p=a;
for(p=a,q=a+n-1;p<q;p++,q--)
{
t=*p;
*p=*q;
*q=t;
}
p=a;
cout<<*p;
for(p=a+1;p<a+n;p++)
cout<<" "<<*p;
return 0;
}
| 47 |
23,015 |
int main() {
int i,n;
cin>>n;
int a[n],b[n]; //?????????a,b
for(i=0;i<n;i++)
cin>>a[i]; //????
for(i=0;i<n;i++){
b[i]=a[n-1-i]; //????
if(i<n-1)
cout<<b[i]<<" ";
else cout<<b[i]; //????????
}
return 0;
}
| 47 |
23,016 | int a[100001];
void swap(int n,int m)
{
int t=a[n];
a[n]=a[m];
a[m]=t;
}
int main()
{
int m,n,i,j;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1,j=n;i<=j;i++,j--)
swap(i,j);
for(i=1;i<n;i++)
cout<<a[i]<<' ';
cout<<a[n];
return 0;
}
| 47 |
23,017 |
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]);
for(i=0;i<n;i++){
b[i]=a[n-1-i];
if(i<n-1)
printf("%d ",b[i]);
else if (i=n-1)
printf("%d",b[i]);}
return 0;
}
| 47 |
23,018 | main()
{
int a[300],n,i;
int *p;
p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
for(i=0;i<n;i++)
*(p+n+99-i)=*(p+i);
for(i=100;i<100+n-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+100+n-1));
} | 47 |
23,019 | int main()
{
int s[100],n,*p,*q,i,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",s+i);
p=s;
q=s+n-1;
while(p<q)
{
temp=*p;
*p=*q;
*q=temp;
p++;
q--;
}
for(i=0;i<n-1;i++)
printf("%d ",*(s+i));
printf("%d",*(s+n-1));
return 0;
} | 47 |
23,020 | void main()
{
int n,i,t,a[100],*p=a;
scanf("%d",&n);
for(i=0;i<n;i++,p++)
scanf("%d",p);
for(p=a,i=0;i<n/2;i++)
{
t=*(p+n-1-i);
*(p+n-1-i)=*(p+i);
*(p+i)=t;
}
for(p=a;p<a+n;p++)
{
printf("%d",*p);
if(p!=a+n-1)
printf(" ");
}
} | 47 |
23,021 |
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 |
23,022 | int main()
{
int i, n, a[110]={0};
int *p=a; //????????
cin >> n;
for (i=0; i<n; i++)
cin >> *(p+i); //?????*(p+i)???????????
for (i=n-1; i>0; i--)
cout << *(p+i) << ' '; //????????
cout << *p << endl;
return 0; //main???????0
} | 47 |
23,023 |
void swap(int * a,int *b){
int * ch;
ch=a;
a=b;
b=ch;
}
int main(){
int n,line[150];
cin>>n;
for (int i=0; i<n; i++) {
cin>>line[i];
}
int * p_1=line;
for (int i=0; i<=((int)n/2)-1; i++) {
swap(*(p_1+i), *(p_1+n-i-1));
}
cout<<* (p_1);
for (int j=1; j<n; j++) {
cout<<' '<<* (p_1+j);
}
return 0;
} | 47 |
23,024 | 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 |
23,025 | int main()
{
int n;
cin>>n;
int tem;
int *p=NULL;
int a[n];
p=a;
for(int i=0;i<n;i++)
{
cin>>p[i];
}
for(int i=0,j=n-1;i<j;i++,j--)
{
tem=*(p+i);
*(p+i)=*(p+j);
*(p+j)=tem;
}
for(int i=0;i<n;i++)
{
cout<<*(p+i);
if(i!=n-1) cout<<' ';
}
}
| 47 |
23,026 | 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 |
23,027 | /*
* 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 |
23,028 | 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 |
23,029 | int a[110];
int main()
{
int n,i;
scanf("%d",&n);
for(i = 1;i <= n;i ++)
scanf("%d",&a[n-i]);
for(i = 0;i < n - 1;i ++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
return 0;
} | 47 |
23,030 | /*???????????????*/
int main()
{
int n,m,i,t,j;
int a[100];
cin>>n;
for(i=0;i<=n-1;i++)cin>>a[i];/*??*/
for(i=0;n-1-i>i;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]<<endl;
return 0;
} | 47 |
23,031 | void main()
{
int i,j,h,n;
int a[100],b[100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=0;j<n;j++)
b[j]=a[n-1-j];
for(h=0;h<n-1;h++)
printf("%d ",b[h]);
printf("%d",b[n-1]);
}
| 47 |
23,032 | int A[100],n,i=0; //??????:??A????,????n,????i
void change() //?????????,?????
{
cin>>A[i];
i++;
if (i<n)
change();
i--;
if (i!=0)
cout<<A[i]<<" ";
else
cout<<A[i];
}
int main()
{
cin>>n; //??????
change(); //????change
return 0;
} | 47 |
23,033 |
void reverse(int* array, int len){
int i = 0, j = len - 1;
while( i < j ){
int temp = array[i];
array[i] = array[j];
array[j] = temp;
i++;
j--;
}
}
int main(){
int len = 0;
scanf("%d", &len);
int * array = (int*)malloc(len * sizeof(int));
int i = 0;
while( i < len){
scanf("%d", array + i);
i++;
}
reverse(array, len);
i = 0;
while( i < len - 1 ){
printf("%d ", array[i]);
i++;
}
printf("%d", array[i]);
return 0;
}
| 47 |
23,034 | //???? ??? 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 |
23,035 |
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 |
23,036 | 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 |
23,037 | int main ()
{
int n,i,k;
int sz[N];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(i=0;i<n;i++){
if(i<n-1){
printf("%d ",sz[n-i-1]);
} else if(i=n-1){
printf("%d",sz[n-i-1]);
}
}
return 0;
}
| 47 |
23,038 |
int main()
{
int i;
int n;
int buf;
int *array;
scanf("%d", &n);
array = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", array + i);
}
for (i = n - 1; i >= 0; i--) {
if (i != n - 1) {
printf(" ");
}
printf("%d", *(array + i));
}
return 0;
} | 47 |
23,039 |
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 |
23,040 | 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 |
23,041 | 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 |
23,042 | int main ()
{
int n,i,j;
cin >>n;
int a[1000],b[1000];
for (i=0;i<n;i++)
cin >>a[i];
for (i=n-1;i>=1;i--)
{
cout <<a[i] <<' ';
}
cout <<a[0]<<endl;
return (0);
}
| 47 |
23,043 |
int main()
{
int i,j,t,n,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--)
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
printf("%d",a[0]);
for (i=1;i<n;i++)
printf(" %d",a[i]);
return 0;
}
| 47 |
23,044 | //
// 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 |
23,045 | /*
* 3.cpp
*????
* Created on: 2012-11-5
* Author: ???
*/
int main()
{
int N,i,j;
cin>>N;
const int n=N;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
cout<<a[n-1];
for(j=1;j<n;j++)
cout<<" "<<a[n-1-j];
}
| 47 |
23,046 | 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 |
23,047 | int main(){
int sz[100];
int n;
int e;
int a,b;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&(sz[i]));}
b=n/2;
for(int k=0;k<b;k++){
a=n-k-1;
e=sz[a];
sz[a]=sz[k];
sz[k]=e;
}
for(int i=0;i<n;i++){
printf("%d",sz[i]);
if(i<n-1){printf(" ");
}
}
return 0;
}
| 47 |
23,048 |
int main()
{
int n,i,t,num[100];
cin>>n;
for (i=0;i<n;i++)
{
cin>>num[i];
}
for (i=0;i<(n+1)/2;i++)
{
t=num[n-1-i];
num[n-1-i]=num[i];
num[i]=t;
}
for (i=0;i<n-1;i++)
{
cout<<num[i]<<" ";
}
cout<<num[i]<<endl;
return 0;
} | 47 |
23,049 | 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 |
23,050 | void main()
{int i,j,*p,a[100]={0},n,t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=&a[0];
for(i=0;i<n-1;i++)
{t=p[n-1];
for(j=n-1;j>=i+1;j--)
{p[j]=p[j-1];}
p[i]=t;
}
printf("%d",*p);
for(p=a+1;p<(a+n);p++)
printf(" %d",*p);
} | 47 |
23,051 | 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 |
23,052 | int main() {
int n,i,j,sz[100],chance[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&sz[i]);
for(j=0;j<n-1;j++){
chance[j]=sz[i-1];
printf("%d ",chance[j]);
i--;
}
j+=1;
chance[j]=sz[i-1];
printf("%d",chance[j]);
return 0;
}
| 47 |
23,053 | int main()
{
int i,n;
int num [100];
scanf("%d",&n);
i=0;
while(i<n){
scanf("%d",&num [i]);
i++;
}
i=n-1;
while(i>0){
printf("%d ",num [i]);
i--;
}
printf("%d",num [0]);
return 0;
}
| 47 |
23,054 | int main()
{
int str[100];
int n,i,temp;
cin>>n;
for(i=0;i<n;i++)
cin>>*(str+i); //??
for(i=0;i<n/2;i++)
{
temp=*(str+i);
*(str+i)=*(str+n-i-1); //????????
*(str+n-i-1)=temp;
}
for(i=0;i<n-1;i++) //?????
cout<<*(str+i)<<" ";
cout<<*(str+n-1);
return 0;
} | 47 |
23,055 | /*
Name: ????
Author: chenminhuan(1200012757)
Date: 10/12/12
*/
const int maxN = 1000;
int main()
{
int a[maxN] ,i ,n, *p = NULL, *q = NULL;
cin>>n;
for (i = 0,p = a; i < n ;++i, ++p) //??????n??
cin>>*p;
for (p = a, q= a+n-1; p<q; ++p,--q) //??????????
swap(*p, *q);//??????
cout<<a[0];
for (p = a+1, i =1; i < n ;++i, ++p) //?????
cout<<" "<< * p;;
return 0;
} | 47 |
23,056 | 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 |
23,057 | void nixu(int a[],int n)
{
for(int i=n-1;i>0;i--)
{
cout<<a[i]<<" ";
}
cout<<a[0];
}
int main()
{
int n;
cin>>n;
int a[100];
for(int i=0;i<n;i++)
{
cin>>a[i];
cin.get();
}
nixu(a,n);
return 0;
}
| 47 |
23,058 | int main()
{
int a[100],b[100];
int n,i,j;
scanf("%d", &n);
for (i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
for (i=0,j=n-1; i<n,j>=0; i++,j--)
{
b[j]=a[i];
}
for (j=0; j<n-1; j++)
{
printf("%d ", b[j]);
}
if(j=n-1)
{
printf("%d",b[j]);
}
return 0;
} | 47 |
23,059 | 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(" ");
}
} | 47 |
23,060 | 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 |
23,061 | int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
int org[100],opp[100];
int i;
for(i=0;i<n;i++)
{
scanf("%d",&org[i]);
}
for(i=0;i<n;i++)
{
opp[i]=0;
}
for(i=0;i<n;i++)
{
opp[n-1-i]=org[i];
}
int k;
for(k=0;k<n-1;k++)
{
printf("%d ",opp[k]);
}
printf("%d",opp[n-1]);
return 0;
} | 47 |
23,062 | void f(int *x,int n)
{
int *p,temp,*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 n,i,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
f(a,n);
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
return 0;
} | 47 |
23,063 | int main()
{
int n=0;
cin>>n;
int i=n,a[100]={0};
int *p=NULL,b;
p=a;
while(i>0)
{
cin>>*p;
p++;
i--;
}
p=a;
for(i=0;i<n/2;i++)//?
{
b=*(p+i);
*(p+i)=*(p+n-i-1);
*(p+n-i-1)=b;
}
i=n-1;
cout<<*p;
p++;
while(i>0)
{
cout<<" "<<*p;
p++;
i--;
}
return 0;
} | 47 |
23,064 | int main()
{
int a[200],n,i;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
a[2*n+1-i]=a[i];
}
for(i=1;i<n;i++)
cout<<a[n+i]<<" ";
cout<<a[2*n]<<endl;
return 0;
} | 47 |
23,065 |
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 |
23,066 | /*??
?????????????????????????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=0;
cin>>n;
int *point=NULL;
int a[100];
point=a;
for(int i=0;i<n;i++)
{
cin>>point[i];
}
for(point=a+n-1;point>=a;point--)
{
if(point==a)
{
cout<<*point;
}
else
{
cout<<*point<<" ";
}
}
return 0;
} | 47 |
23,067 | 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 |
23,068 | /*
* shuzunixu(p).cpp
*
* Created on: 2012-12-12
* Author: 1200012791??
* ???????????????????
*/
int main() {
int a[101];//??1?????
int n = 0, i = 0, temp = 0;//??3??????n?????????
int *p = a;//??1????????a
cin >> n;//??n
for (i = 0; i < n; i++)//????
cin >> *(p + i);//?????????
for (i = 0; i < n / 2; i++) {//????????????
temp = *(p + i);//??????
*(p + i) = *(p + n - i - 1);
*(p + n - i - 1) = temp;
}
cout << *p;//?????????
for (i = 1; i < n; i++)//????
cout << ' ' << *(p + i);//??????????????
return 0;
}
| 47 |
23,069 | int main()
{
int n,i,a[100],k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(k=0;k<n;k++)
{
printf("%d",a[n-1-k]);
if(k!=n-1)
{printf(" ");
}
}
return 0;
}
| 47 |
23,070 | 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 |
23,071 |
int main(){
int n;
cin>>n;
int a[100];
int *p=a,*q=a;
for(;p<a+n;p++)
cin>>*p;
int temp;
for(p--;q<p;q++,p--)
{
temp=*q;
*q=*p;
*p=temp;
}
p=a;
cout<<*p++;
for(;p<a+n;p++)
cout<<" "<<*p;
} | 47 |
23,072 | int main()
{
int n,i,a[100],b[100];
scanf("%d",&n);
int *p,*q;
p=a;
q=b;
for(i=0;i<n;i++)
scanf("%d",(p+i));
for(i=0;i<n;i++)
{
*(q+i)=*(p+(n-1-i));
printf("%d%s",*(q+i),i==n-1?"":" ");
}
} | 47 |
23,073 | int main( )
{
int a[1000];
int n,i;
scanf ("%d",&n);
for(i=0;i<n;i=i+1)
{
scanf ("%d",&a[i]);
}
for(i=0;i<n;i=i+1)
{
if (i==0)
printf("%d",a[n-1]);
else
printf(" %d",a[n-1-i]);
}
return 0;
}
| 47 |
23,074 | void sx(int b[],int n);
void nx(int a[],int b[],int n);
int main(){
int i=0,q,M[1001]={0},N[1001]={0};
scanf("%d\n",&q);
sx(M,q);
nx(N,M,q);
for(i=0;i<q-1;i++){
printf("%d ",N[i]);
}
printf("%d",N[q-1]);
return 0;
}
void sx(int b[],int n){
int i;
for(i=0;i<n;i++){
scanf("%d",&b[i]);
}
}
void nx(int a[],int b[],int n){
int i;
for(i=n-1;i>-1;i--){
a[i]=b[n-i-1];
}
}
| 47 |
23,075 | 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 |
23,076 | //
// 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 |
23,077 | int main(int argc, char* argv[])
{
int n,a[100],t,i;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
for(i=0;i<=(n-1)/2;i++)
{t=a[i];a[i]=a[n-i-1];a[n-i-1]=t;}
for(i=0;i<=n-1;i++)
{if(i!=n-1) printf("%d ",a[i]);
else printf("%d",a[i]);
}
return 0;
} | 47 |
23,078 |
int main(){
int sz[100];
int n,e,m,k;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
}
m=n-1;
k=0;
while(k<m){
e=sz[k];
sz[k]=sz[m];
sz[m]=e;
k+=1;
m-=1;
}
for(int i=0;i<n-1;i++){
printf("%d ",sz[i]);
}
printf("%d",sz[n-1]);
return 0;
}
| 47 |
23,079 | int main()
{
int n;
int a[100]={0};
cin>>n;
for (int i=0;i<n;i++)
{
int x;
cin>>x;
a[i]=x;
}
for (int i=n-1;i>0;i--)
cout<<a[i]<<" ";
cout<<a[0];
return 0;
}
| 47 |
23,080 | 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 |
23,081 | 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 |
23,082 | 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 |
23,083 | int main(){
int x,n,a[100];
int *p,*q;
cin>>n;
for (p=a;p<a+n;p++)
cin>>*p;
for (p=a,q=a+n-1;p<q;p++,q--)
{x=*p;
*p=*q;
*q=x;
}
for (p=a;p<a+n;p++)
{if (p>a) cout<<' ';
cout<<*p;
}
return 0;
} | 47 |
23,084 | const int maxn=100; //??????????????????const??????)
int main()
{
int a[maxn],b[maxn]; //???????????????????????
int n,i=0,j=0; //??n??????????????
cin>>n;
while(i<=(n-1)) //???????????a[n]
{
cin>>a[i];
b[n-1-i]=a[i]; //???????????b?a??????
i++;
}
while(j<(n-1)) //?????
{
cout<<b[j]<<" "; //???????
j++;
}
if(j==(n-1))
cout<<b[j];
return 0;
} | 47 |
23,085 | 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 |
23,086 | 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 |
23,087 | int main()
{
int n=0;
scanf("%d",&n);
int sz[100];
int x;
for(int i=0;i<n;i++){
scanf("%d",&x);
sz[i]=x;}
for(int j=n-1;j>=0;j--){
if(j!=0)
{
printf("%d ",sz[j]);
}
else
{
printf("%d",sz[j]);
}
}
return 0;
}
| 47 |
23,088 | int main(){
int n,i;
scanf("%d",&n);
int sz1[100],sz2[100];
for(i=0;i<n;i++){
if(i<n-1){
scanf("%d ",&sz1[i]);
sz2[n-1-i]=sz1[i];
}else if(i==n-1){
scanf("%d",&sz1[n-1]);
sz2[0]=sz1[n-1];
}
}
for(i=0;i<n;i++){
if(i<n-1){
printf("%d ",sz2[i]);
}else if(i==n-1){
printf("%d",sz2[n-1]);
}
}
return 0;
} | 47 |
23,089 | 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 |
23,090 | //============================================================================
// Name : 2.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
int main() {
int n;
cin>>n;
int a[100],b[100];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
b[i]=a[n-1-i];
cout<<b[0];
for(int i=1;i<n;i++)
{
a[i]=b[i];
cout<<" "<<a[i];
}
return 0;
} | 47 |
23,091 | /*ÎÒÕæÏëÖ±½Ó·´×ÅÊä³öÁË¡­¡­µ«ÊÇÄÇÌ«²»µÀµÂÁËÍÛ¹þ¹þ¹þ*/
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 |
23,092 | void main()
{
void inv(int x[],int b);
int n;
scanf("%d",&n);
int i,a[100];
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]);
}
void inv(int x[],int b)
{
int temp,i,j,m=b/2;
for(i=0;i<m;i++)
{
j=b-1-i;
temp=x[i];x[i]=x[j];x[j]=temp;
}
return;
} | 47 |
23,093 | int main()
{
int n=0;
cin>>n;
int a[100]={0},b[100]={0};
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]); //????
}
for(int i=0;i<n;i++) //????
b[i]=a[n-i-1];
for(int i=0;i<n-1;i++)
{
printf("%d ",b[i]); //????
}
printf("%d",b[n-1]);
} | 47 |
23,094 |
int main()
{
int i,n,j,t,a[100]={0};
cin>>n;
for(i=0;i<=n-1;i++)
cin>>a[i];
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-2;j++)
cout<<a[j]<<" ";
cout<<a[n-1];
return 0;
} | 47 |
23,095 | 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 |
23,096 | int main()
{
int i,n,a[100];
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
int *p = NULL;
p = &a[n-1];
while(i>1)
{
cout<<*p<<" ";
i--;
p--;
}
cout<<*p;
return 0;
} | 47 |
23,097 | const int maxn=100;
int main()
{
int i=0,x=1,n=0;
int a[maxn];
cin>>n;
for(int j=0;j<=n-1;j++)
cin>>a[j];
while(i<(n+1)/2)
{ x=a[i];
a[i]=a[n-1-i];
a[n-1-i]=x;
i++;
}
for(int k=0;k<=n-2;k++)
cout<<a[k]<<" ";
cout<<a[n-1];
return 0
;
} | 47 |
23,098 | int main(){
int n,i,e;
scanf("%d",&n);
int *sz=(int*)malloc(sizeof(int)*n);
for(i=0;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-i-1]=e;
}
}
else
{
for(i=0;i<((n+1)/2);i++)
{
e=sz[i];
sz[i]=sz[n-i-1];
sz[n-i-1]=e;
}
}
for(i=0;i<n;i++)
{
if(i<n-1)
{
printf("%d ",sz[i]);
}
else
{
printf("%d",sz[i]);
}
}
return 0;
} | 47 |
23,099 | //????
//???????
//?????12.12.08
int n,a[100];
int main()
{
cin>>n; //??????
for(int i=0;i<n;i++){
cin>>*(a+i);} //????????????
for(int i=n-1;i>0;i--){
cout<<*(a+i)<<" ";} //????????????
cout<<*a;
return 0;
}
| 47 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.