id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,300 | 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 |
23,301 | 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 |
23,302 |
void main()
{
int a[100],n,i,flag=0;
int *pt;
scanf("%d",&n);
pt=a;
for(i=0;i<=n-1;i++)
{
scanf("%d",pt+i);
}
for(i=n-1;i>=0;i--)
{
if(flag==0)
{ printf("%d",*(pt+i));
flag=1;}
else
printf(" %d",*(pt+i));
}
}
| 47 |
23,303 | 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 |
23,304 |
int main()
{
int n, a[100];
int *p = a;
cin >> n;
while (p < a + n)
{
cin >> *p++;
}
p--;
while (p > a)
{
cout << *p-- << " ";
}
cout << *p;
return 0;
}
| 47 |
23,305 | 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 |
23,306 |
int main()
{
int cun[100]={0},fang[100]={0};
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
scanf("%d",&cun[i]);
fang[i]=cun[i];
}
for(i=0;i<n-1;i++)
{
cun[i]=fang[n-1-i];
printf("%d ",cun[i]);
}
cun[n-1]=fang[0];
printf("%d",cun[n-1]);
return 0;
} | 47 |
23,307 | 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 |
23,308 | 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 |
23,309 | 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 |
23,310 | int main(){
int n,i;
int sz[100];
int t;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(i=0;i<n/2;i++){
t=sz[i];
sz[i]=sz[n-i-1];
sz[n-i-1]=t;
}
for(i=0;i<n;i++){
if(i<=n-2){
printf("%d ",sz[i]);
}else{
printf("%d",sz[i]);
}
}
return 0;
} | 47 |
23,311 | //============================================================================
// Name : 8.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description :
//============================================================================
int main() {
int n=0,i=0,j=0,t=0;
cin>>n;
int a[100000];
for (i=0;i<n;i++){
cin>>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-1;i++){
cout<<a[i]<<" ";
}
cout<<a[n-1];
return 0;
}
| 47 |
23,312 | int main(){
int n,a;
scanf("%d ",&n);
int sz[n];
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(int k=0;k<(n/2);k++){
a=sz[n-1-k];
sz[n-1-k]=sz[k];
sz[k]=a;
}
for(int k=0;k<n-1;k++){
printf("%d ",sz[k]);
}
printf("%d",sz[n-1]);
return 0;
} | 47 |
23,313 | int main()
{
int sz[100],sz1[100],n,i,j,l,k,e;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
for(int j = 1 ; j <= n ; j++){
for(int l = 0; l < n - j; l++){
e = sz[l+1];
sz[l+1] = sz[l];
sz[l] = e;
}
}
printf("%d",sz[0]);
for(k=1;k<n;k++)
{
printf(" %d",sz[k]);
}
return 0;
} | 47 |
23,314 |
int main(int argc, char* argv[])
{
int n,i,j,a[111],b[111];
scanf ("%d",&n);
j=n-1;
for (i=0;i<n;i++)
{
scanf ("%d",&a[i]);
b[j]=a[i];
j--;
}
for (j=0;j<n-1;j++)
printf("%d ",b[j]);
printf("%d\n",b[n-1]);
return 0;
} | 47 |
23,315 | 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 |
23,316 | 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 |
23,317 | /*
* affairs.cpp
*
* Created on: 2012-11-1
* Author: Administrator
*/
int main() {
int a[100], i, j, k, n, temp;//i,j,k??????temp?????
cin >> n;
for (k = 1; k <= n; k++) {
cin >> a[k];//??????
}
for (i = 1, j = n; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;//??a[i]?a[j]
}
cout << a[1];
for (k = 2; k <= n; k++) {
cout << " " << a[k];//a[1]???????????????????
}
return 0;
}
| 47 |
23,318 | 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 |
23,319 | /*
* ????.cpp
* ??????????????
* Created on: 2012-11-16
* Author: ???
*/
int main()
{
int a[101],i,n,temp;
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i]; //???????
}
if(n%2==0){ //??????????
for(i=n/2+1;i<=n;i++){ //????????????????
temp=a[i];
a[i]=a[n-i+1];
a[n-i+1]=temp;
}
}
else{
for(i=(i+1)/2;i<=n;i++){ //??????????????????????????
temp=a[i];
a[i]=a[n+1-i];
a[n+1-i]=temp;
}
}
cout<<a[1];
for(i=2;i<=n;i++){
cout<<' '<<a[i]; //??????????
}
}
| 47 |
23,320 | int main () {
int a[100],n,i,b[50];
scanf("%d",&n);
for(i=0;i<=n-1;i++) {
scanf("%d", &a[i]);}
for(i=0;i<=(n-1)/2;i++){
b[i]=a[n-i-1];
a[n-i-1]=a[i];
a[i]=b[i];}
for(i=0;i<=n-1;i++){
if (i<=n-2){
printf("%d ",a[i]);}
else{printf("%d",a[i]);}}
return 0;
}
| 47 |
23,321 | int main()
{
int sz[100],i,n,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
if(n%2==0)
{
for(i=0;i<(n/2);i++)
{
t=sz[i];
sz[i]=sz[n-1-i];
sz[n-1-i]=t;
}
}
else if(n%2!=0)
{
for(i=0;i<((n-1)/2);i++)
{
t=sz[i];
sz[i]=sz[n-1-i];
sz[n-1-i]=t;
}
}
for(i=0;i<n;i++)
{
if(i==0)
{
printf("%d",sz[i]);
}
else
{
printf(" %d",sz[i]);
}
}
return 0;
} | 47 |
23,322 | int main(){
int n;
scanf("%d",&n);
int a[100];
int i;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
int x;
x=n/2;
int y;
for(i=0;i<n-x;i++){
y=a[i];
a[i]=a[n-i-1];
a[n-i-1]=y;
}
for(i=0;i<n-1;i++){
printf("%d ",a[i]);
}
printf("%d",a[n-1]);
return 0;
} | 47 |
23,323 |
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 |
23,324 | int main()
{
int n,i;
scanf("%d",&n);
int *Stack= (int *)malloc(n*sizeof(int));
for(i=0;i<n;i++) scanf("%d",Stack+i);
for(i=n-1;i>=0;i--){if(i==0)printf("%d",*(Stack+i));else printf("%d ",*(Stack+i));}
return 0;
}
| 47 |
23,325 | 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 |
23,326 |
int main()
{
int n; //??n
cin>>n; //??n
int a[100],i,j; //????
int *p=&a[0];
for(i=0;i<n;i++)
{
cin>>*(p+i); //????
}
for(j=0;j<n-1;j++)
cout<<*(p+n-j-1)<<" "; //?????
cout<<*p;
return 0;
}
| 47 |
23,327 | /*
* 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 |
23,328 | /*
* zhizheng.cpp
*?? - ????
* Created on: 2012-12-11
* Author: ???
*/
int n,N,temp,i;
int *p=NULL,*q=NULL;
int main(){
cin>>n;
const int N=n;
int a[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<<' ';
cout<<*p<<endl;
return 0;
} | 47 |
23,329 | void p(int n) //??n???
{
int c;
cin>>c;
if(n!=1)
p(n-1); //??????
if(n==1) //???????????
cout<<c;
else
cout<<' '<<c;
}
int main()
{
int n;
cin>>n; //??n
p(n);
cout<<endl;
return 0;
} | 47 |
23,330 | 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 |
23,331 | 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 |
23,332 | 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 |
23,333 | 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 |
23,334 | int main(){
int n=0,m=0,i=0,t=0,w=0;
int a[10000],b[10000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&(a[i]));
}
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",a[i]);
return 0;
}
| 47 |
23,335 | int main()
{
int n,i,j;
scanf("%d\n",&n);
int a[200],b[200];
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
j=n+1-i;
b[j]=a[i];
}
j=1;
while(j<n)
{
printf("%d ",b[j]);
j=j+1;
}
printf("%d",b[j]);
return 0;
} | 47 |
23,336 | int main()
{
int n,i,a[100],t;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
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;i++)
{printf("%d",a[i]);
if(i==n-1)break;
printf(" ");
}
} | 47 |
23,337 | /*
* 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 |
23,338 |
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 |
23,339 | int main(int argc, char* argv[])
{
int yuan[100];
int xin[100];
int n,i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&yuan[i]);
for(i=1;i<=n;i++)
{
j=n-i+1;
xin[j]=yuan[i];
}
printf("%d",xin[1]);
for(j=2;j<=n;j++)
printf(" %d",xin[j]);
return 0;
} | 47 |
23,340 |
int main()
{
int n,i,num[100],result[100];
cin>>n;
for (i=0;i<n;i++)
{
cin>>num[i];
}
for (i=0;i<n;i++)
{
result[n-1-i]=num[i];
}
for (i=0;i<n-1;i++)
{
cout<<result[i]<<" ";
}
cout<<result[i]<<endl;
return 0;
} | 47 |
23,341 | /*??????*/
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 |
23,342 | int main()
{
int n;
scanf("%d",&n);
int i,u,a[100];
for(i=0;i<=n-1;i++){
scanf("%d",&u);
a[n-1-i]=u;
}
printf("%d",a[0]);
for(i=1;i<=n-1;i++){
printf(" %d",a[i]);
}
return 0;
} | 47 |
23,343 |
int main(void)
{
int a[100],n;
cin >>n;
for (int i=0;i<=n-1;i++)
{
cin >>a[i];
}
for (int i=n-1;i>=0;i--)
{
cout <<a[i];
if (i!=0) cout <<" ";
}
return 0;
} | 47 |
23,344 | 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 |
23,345 | 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 |
23,346 | 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 |
23,347 | 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 |
23,348 | /*??? 1200012866
2012.9.28
????*/
int main()
{
int n;
cin>>n;
int a[100],r;
float n2;
if(n%2==0)
n2=n/2;
else
n2=(n-1)/2;
for(int j=0;j<n;j++) cin>>a[j];
for(int i=0;i<n2;i++)
{
r=a[i];
a[i]=a[n-i-1];
a[n-i-1]=r;
}
for(int j=0;j<n-1;j++) cout<<a[j]<<" ";
cout<<a[n-1];
return 0;
} | 47 |
23,349 |
int main()
{
int n,a[120],i,temp;
int *p = NULL;//????
p = a;
cin >> n;
for ( i = 0 ; i < n; i ++ ) cin >> *(p + 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 << ' ' << *(p + i);
return 0;
}
| 47 |
23,350 | //============================================================================
// 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 |
23,351 | void main()
{
struct number
{
int num;
struct number * next;
};
struct number * head=0,* p;
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
p=(struct number *)malloc(sizeof(struct number));
scanf("%d",&p->num);
if(i==1)p->next=0;
else p->next=head;
head=p;
}
if(head!=0)
{
for(i=1;i<=n;i++)
{
printf("%d",p->num);
if(i<n)printf(" ");
else printf("\n");
p=p->next;
}
}
} | 47 |
23,352 | 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 |
23,353 | void main()
{
int n,a[100],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[i]);
} | 47 |
23,354 |
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 |
23,355 | 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 |
23,356 | int main(){
int sz[100],n;
scanf("%d\n",&n);
int i;
for(i=1;i<=n;i++){
if(i<n){
scanf("%d ",&sz[i-1]);
}
else{
scanf("%d",&sz[i-1]);
}
}
for(i=n;i>=1;i--){
if(i>1){
printf("%d ",sz[i-1]);
}
else{
printf("%d",sz[i-1]);
}
}
return 0;
} | 47 |
23,357 | int mark=0;
int main()
{
int sum;
void print(int);
cin>>sum;
print(sum-1);
return 0;
}
void print(int num)
{
int temp;
cin>>temp;
if(num==0)
{
mark=1;
cout<<temp;
return;
}
else
print(num-1);
if(mark)
cout<<" "<<temp;
} | 47 |
23,358 | /*
*????.cpp
*
* Created on: 2012-10-15
* Author: ???
*/
int main() {
int n = 0, b = 0, i = 0; //??????????????
cin >> n;
int a[n];
for (i = 0; i < n; i++) { //??
cin >> a[i];
}
for (i = 0; i < n / 2; i++) { //??????
b = a[i];
a[i] = a[n - 1 - i];
a[n - 1 - i] = b;
}
cout << a[0];
for (i = 1; i < n; i++) { //??
cout << " " << a[i];
}
return 0;
}
| 47 |
23,359 | /*
* shuzunixuzhi.cpp
*???????????
* Created on: 2012-12-17
* Author: ??
*/
int main() {
int a[101];
int i, n, *p = a;//??
cin >> n;//??
for (i = 0; i < n; i++)
cin >> *(p++);//????
p = a;
for (i = 0; i < n / 2; i++)
swap(*(p + i), *(p + n - i - 1));//??
cout << *(p++);//??
n--;
while (n > 0) {
cout << " " << *(p++);
n--;//??????
}
return 0;
}
| 47 |
23,360 | int main(int argc, char* argv[])
{
int n,a[100],i,j,m=0;
scanf ("%d",&n);
for (i=0;i<=n-1;i++)
{
scanf ("%d",&a[i]);
m++;
}
for (j=m-1;j>0;j--)
printf ("%d ",a[j]);
printf ("%d",a[0]);
return 0;
} | 47 |
23,361 | int main (){
int a,b,c,n,i,sz[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&(sz[i]));
}
for(i=n-1;i>0;i--){
printf("%d ",sz[i]);
}
if(i==0){
printf("%d",sz[i]);
}
return 0;
} | 47 |
23,362 | int main()
{
int n,i,q;
scanf("%d", &n);
int a[100];
for(i=1;i<=n;i++){
scanf("%d", &a[i]);
}
for(q=n;q>1;q--){
printf("%d", a[q]);
printf(" ");
}
printf("%d", a[1]);
return 0;
} | 47 |
23,363 | 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 |
23,364 | 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 |
23,365 | void run(int *p,int n){
if(n!=1) cout<<*p<<" ";
else{
cout<<*p;
return;
}
run(p-1,n-1);
return;
}
int main(){
int a[110],n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
//??????????
run(a+n-1,n);
return 0;
}
| 47 |
23,366 |
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
int a[100];
int i;
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[i]);
return 0;
}
| 47 |
23,367 | 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 |
23,368 | void main()
{int n,*p,i=0,*q;
scanf("%d",&n);
p=(int*)malloc(sizeof(int)*n);
q=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{scanf("%d",&p[i]);
}
for(i=0;i<n;i++)
{*(q+n-i-1)=*(p+i);
}
for(i=0;i<n-1;i++)
{printf("%d ",q[i]);
}
if (i==n-1)
printf("%d",q[i]);
} | 47 |
23,369 | int main(){
int a[102]={0},n;
cin>>n;
for(int i=0;i<n;i++){
cin>>*(a+i);
}//??
for(int i=n-1;i>=0;i--){
if(i==n-1)cout<<*(a+i);
else cout<<" "<<*(a+i);
}//??
return 0;
}
| 47 |
23,370 |
int main()
{
int n;
scanf("%d\n",&n);
int sz[n];
int i,x,y;
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
x=n-1;
y=x/2;
for(i=0;i<=y;i++)
{
int e;
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,371 |
int main()
{
int shuzu[Row][Len];
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&shuzu[0][i]);
}
int j,r;
r=0;
for(j=n-1;j>=0;j--){
shuzu[1][r]=shuzu[0][j];
r++;
}
for(r=0;r<n-1;r++){
printf("%d ",shuzu[1][r]);
}
printf("%d",shuzu[1][n-1]);
return 0;
}
| 47 |
23,372 | int main()
{
int n=0,t=0,i=0,j=0,k=0;
int num[100];
cin>>n;
for(i=1;i<=n;i++)
{
cin>>num[i];
}
for(k=1;k<=n;k++)
for(j=1;j<=n-k;j++)
{
t=num[j];num[j]=num[j+1];num[j+1]=t;
}
for(i=1;i<n;i++)
cout<<num[i]<<" ";
cout<<num[n]<<endl;
return 0;
}
| 47 |
23,373 |
void main()
{
void change(int *a,int n);
int i,n,a[100],*p=a;
scanf("%d",&n);
for(i=0;i<n;i++,p++)
scanf("%d",p);
printf("\n");
p=a;
change(p,n);
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d",*p);
}
void change(int *a,int n)
{
int *i,*p,*j,m,temp;
m=(n-1)/2;
p=a+m;
i=a;
j=i+n-1;
for(;i<=p;i++,j--)
{
temp=*i;
*i=*j;
*j=temp;
}
} | 47 |
23,374 | int main(){
int n;
scanf("%d",&n);
int sz[100];
for(int a=0;a<=n-1;a++){
scanf("%d",&(sz[a]));
}
for(int b=n-1;b>=1;b=b-1){
printf("%d ",sz[b]);
}
printf("%d",sz[0]);
return 0;
} | 47 |
23,375 | 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 |
23,376 | int a[100];
void c(int n)
{
int i;
for(i=0;i<n;i++)
cin>>a[i];
}
void b(int n)
{
int i;
for(i=n-1;i>0;i--)
cout<<a[i]<<" ";
cout<<a[0];
}
int main()
{
int n;
cin>>n;
c(n);
b(n);
return 0;
}
| 47 |
23,377 | int main()
{
int n,i,k,m;
int sz[100];
scanf("%d",&n);
m=n/2;
for(i=0;i<n;i++)
scanf("%d",&sz[i]);
for(i=0;i<m;i++){
k=sz[i];
sz[i]=sz[n-i-1];
sz[n-i-1]=k;}
for(i=0;i<n;i++)
if (i<n-1)
printf("%d ",sz[i]);
else printf("%d",sz[i]);
return 0;
}
| 47 |
23,378 | //***********************//
//*????????? *//
//*????? *//
//*???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 |
23,379 | 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 |
23,380 | 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 |
23,381 | /*
* shuzunixu.cpp
*
* Created on: 2012-12-15
* Author: ???
* function:????
*/
void swap(int *a, int *b) {//?????????swap
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
int main() {
int n;
cin >> n;
int num[n + 10];
for (int i = 0; i < n; i++) {//???????
cin >> *(num + i);
}
for (int i = 0, j = n - 1; i < j; i++, j--) {
swap(num + i, num + j);//??????????
}
for (int i = 0; i < n - 1; i++) {
cout << *(num + i) << ' ';//????????
}
cout << *(num + n - 1) << endl;//????????????????????????
return 0;
}
| 47 |
23,382 | int main()
{ int n;
cin>>n;
int num[n];
int i;
int a;
for(i=0;i<n;i++)
{ cin>>a;
num[i]=a;
}
for(i=(n-1);i>=0;i--)
{if(i>0) cout<<num[i]<<' ';
else cout<<num[i];
}
return 0;
} | 47 |
23,383 | 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 |
23,384 | 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 |
23,385 | 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 |
23,386 | int main()
{
int n,i,j,t;
int b[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&b[i]);
}
if(n%2==0)
{
for (j=n-1,i=0;i<(n/2);i++,j--)
{
t=b[i];
b[i]=b[j];
b[j]=t;
}
}
if(n%2!=0)
{
for (j=n-1,i=0;i<((n-1)/2);i++,j--)
{
t=b[i];
b[i]=b[j];
b[j]=t;
}
}
for (i=0;i<(n-1);i++)
{
printf("%d ",b[i]);
}
printf("%d",b[n-1]);
return 0;
}
| 47 |
23,387 | 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 |
23,388 | //????
int main()
{
int n,i,j,k; //?????i?j?k??????
int a[100]; //????
cin>>n;
for (i=0;i<n;i++) //??????????????
cin>>a[i];
int c,d; //c?d????????????
for (j=0;j<(n+1)/2;j++) //???????n/2?(n+1)/2???
{
c=a[j];
d=a[n-j-1];
a[j]=d;
a[n-j-1]=c;
}
for (k=0;k<n-1;k++) //????
cout<<a[k]<<" ";
cout<<a[n-1];
return 0;
} | 47 |
23,389 | int main()
{
void f(int a);
int n,num;
cin>>n;
cin>>num;
f(n-1);
cout<<num;
return 0;
}
void f(int a)
{
int num;
cin>>num;
if(a>0)
{
f(a-1);
cout<<num<<" ";
}
}
| 47 |
23,390 | /*
*???: 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 |
23,391 | int main()
{
int a[100]={1,1,1,1};
int n;
cin>>n;
for(int i=0;i<n;i++)
{cin>>a[i];}
cout<<a[n-1];
for(int i=n-1-1;i>=0;i--)
{cout<<" "<<a[i];}
} | 47 |
23,392 |
int main()
{
int a[100],i=0,j=0,k=0,t1=0,t2=0,sum=0,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
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 |
23,393 | 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 |
23,394 | int main()
{
int sz[max],a[max];
int n,i,k;
scanf("%d\n",&n);
for(i=1;i<=n;i++){
scanf("%d ",&(sz[i]));
}
for(k=1;k<n;k++){
a[k]=sz[n-k+1];
printf("%d ",a[k]);
}
a[n]=sz[1];
printf("%d",a[n]);
return 0;
}
| 47 |
23,395 | int main()
{
int n,i,a[110],*p;
p=a;
cin>>n;
for (i=0;i<n;i++)
cin>>*p++;
for (i=0;i<n-1;i++)
cout<<*--p<<" ";
cout<<*--p;
return 0;
}
| 47 |
23,396 | int main(){
int n,i,e;
scanf("%d",&n);
int sz[101];
i=0;e=n-1;
while(i<n){
scanf("%d",&sz[i]);
i++;
}
while(e>0&&e<n){
printf("%d ",sz[e]);
e--;
}
printf("%d",sz[e]);
return 0;
}
| 47 |
23,397 | int main()
{
int n;
scanf("%d",&n);
int sz[100],i;
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
for(i=0;i<n-1;i++)
{
int e;
if(i<n/2)
{
e=sz[i];
sz[i]=sz[n-i-1];
sz[n-i-1]=e;
}
printf("%d ",sz[i]);
}
printf("%d",sz[n-1]);
return 0;
}
| 47 |
23,398 | int main()
{
int n;
cin >> n; //n?????
int first [100] = {0};
for (int i = 0;i <= n-1;i++)
{
cin >> first[i];
}
for (int i = 0;i <= n-1;i++)
{
if (i != n-1)
cout << first[n-1-i] <<" ";
else
cout << first[n-1-i];
}
cin.get();
cin.get();
return 0;
} | 47 |
23,399 |
int main()
{
int a[100],b[100],n,i,j,f=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[n-i-1]=a[i];
}
for(i=0;i<n;i++)
{
if(f==0)
{
printf("%d",b[i]);
f=1;
}
else
{
printf(" %d",b[i]);
}
}
printf("\n");
return 0;
}
| 47 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.