label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
47 | 23200 | int main()
{
int i,n,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[n-1-i]);
}
for(i=0;i<n;i++)
{
if(i==n-1)
printf("%d",a[i]);
else
printf("%d ",a[i]);
}
return 0;
} |
47 | 23201 | //**************************************************
//*??????????.cpp *
//*?????? *
//*?????2011.10.26 *
//*??????????? *
//**************************************************
int main()
{
int n=0,i=0,j=0; int num[100]; //??????n???????????????0???????i,j??????0???????num,????????
cin>>n;
for(i=0;i<n;i++) //????????
{
cin>>num[i];
}
j=n-1; //?????
do
{ cout<<num[j];
if(j>0)
{
cout<<" ";
}
j--;
}while(j>=0);
return 0;
} |
47 | 23202 | 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 | 23203 | /*
* ????.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 | 23204 | /*??? 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 | 23205 |
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 | 23206 | /*
*???redo.cpp
*????????
*????: 2012-12-10
*?????1200012825
*/
int main(void)
{
int n;
cin>>n;
int *p=NULL,a[100],*q=NULL;
for(q=a;q<=a+n-1;q++){
cin>>*q;//??
}
cout<<*(p=a+n-1);
for(p=a+(n-2);p>=a;p--){
cout<<" "<<*p;//????
}
return 0;
}
|
47 | 23207 |
int main()
{
int a[100],b[100],n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n-1;i++)
{
b[i]=a[n-1-i];
printf("%d ",b[i]);
}
printf("%d",a[0]);
return 0;
}
|
47 | 23208 |
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 | 23209 |
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 | 23210 | 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 | 23211 | int main()
{
int n,a[100],i,j,m,d,c[100];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
a[i]=m;
}
if(n/2==0)
d=n/2;
else
d=(n+1)/2;
for(j=0;j<d;j++)
{
c[j]=a[n-1-j];
printf("%d ",c[j]);
}
for(j=d;j<n;j++)
{
c[j]=a[n-1-j];
if(j==(n-1))
printf("%d",c[j]);
else
printf("%d ",c[j]);
}
return 0;
}
|
47 | 23212 | int main(){
int n,tr;cin>>n;
int a[n];
int *p=a;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0,j=n-1;i<j;i++,j--)
{
tr=*(p+i);
*(p+i)=*(p+j);
*(p+j)=tr;
}
for(int i=0;i<n-1;i++)cout<<a[i]<<" ";
cout<<a[n-1];//*?p+i???????a???i???
return 0;
}
|
47 | 23213 |
int main() {
int n,a[100],temp=0; //????
cin>>n;
int *p=NULL,*q=NULL; //??????p?q?????
for(p=a;p<a+n;++p) //??????
cin>>*p;
for(p=a,q=a+n-1;p<q;++p,--q) //????
{
temp=*p;
*p=*q;
*q=temp;
}
p=a;
cout<<*p; //?????
for(p=a+1;p<a+n;++p)
cout<<' '<<*p;
return 0;
}
|
47 | 23214 | int main()
{
int i,a[100];
int n;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d ",&a[i]);
}
for(i=n-1;i>=1;i--){
printf("%d ",a[i]);
}
for(i=0;i>=0;i--){
printf("%d",a[i]);
}
return 0;
}
|
47 | 23215 | /*
* 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 | 23216 |
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 | 23217 |
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 | 23218 | 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 | 23219 | void main()
{
int n,i,a[100];
int *p;
p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
for(i=n-1;i>0;i--)
printf("%d ",*(p+i));
printf("%d\n",*p);
}
|
47 | 23220 | int a[100]={0};
int f(int i,int t)
{
cin>>a[i];//i??????
if(i<t)
{
f(i+1,t);
}//??????????????????
if(i==1) cout<<a[i];
else cout<<a[i]<<' ';
}
int main()
{
int t,i=1;
cin>>t;
f(i,t);
return 0;
}
|
47 | 23221 | 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 | 23222 | int n,inp[MAX],oup[MAX],i;
int main(){
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d",&inp[i]);
}
for(i=0;i<=n-1;i++){
oup[i]=inp[n-1-i];
}
for(i=0;i<n-1;i++){
printf("%d ",oup[i]);
}
printf("%d",oup[n-1]);
return 0;
}
|
47 | 23223 | 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 | 23224 | 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 | 23225 |
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 | 23226 | 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 | 23227 | int main()
{
int n,a[100];
int i;
for(i=0;i<100;i++)
a[i]=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=n;i>=1;i--)
{
if(i>1)
printf("%d ",a[i]);
else
printf("%d",a[i]);
}
return 0;
}
|
47 | 23228 | int main()
{
int n,e,sz[100];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
}
for(int k=1;k<=n;k++){
for(int i=0;i<n-k;i++){
e=sz[i];
sz[i]=sz[i+1];
sz[i+1]=e;
}
}
for(int j=0;j<n;j++){
if(j<n-1)
printf("%d ",sz[j]);
else
printf("%d",sz[j]);
}
return 0;
}
|
47 | 23229 | 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 | 23230 | 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 | 23231 | int main()
{
int a[100],i,k,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=n-1;i>0;i--){
printf("%d ",a[i]);
}
a[0]=a[0];
printf("%d",a[i]);
return 0;
} |
47 | 23232 | 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 | 23233 | int main()
{
int n;
scanf("%d",&n);
int a[100];
for(int i=0;i<n;i++)
{
int x;
scanf("%d",&x);
a[i]=x;
}
int *pi=a;
int *pj=a+n;
int t;
for(;pi<pj;pi++,pj--)
{
t=*pi;
*pi=*pj;
*pj=t;
}
for(int k=1;k<n;k++)
{
printf("%d ",a[k]);
}
printf("%d",a[n]);
return 0;
}
|
47 | 23234 | int main()
{
int i,n,a[100],m;
scanf("%d",&n);
m=n;
while(n!=0)
{
scanf("%d",&a[0]);
for(i=1;i<n;i++)
{
a[i]=a[i-1];
}
n--;
}
for(i=0;i<m-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[m-1]);
return 0;
} |
47 | 23235 | 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 | 23236 | int main()
{
int n,i,a[100],b[100];
cin>>n;
for(i=0;i<=n-1;i++)
cin>>a[i];
for(i=0;i<=n-1;i++)
b[i]=a[n-1-i];
for(i=0;i<=n-2;i++)
{cout<<b[i]<<" ";}
cout<<b[n-1];
return 0;
} |
47 | 23237 | 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 | 23238 | 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 | 23239 | 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 | 23240 |
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 | 23241 |
int main (void)
{
int n, a[100], i, j;
cin >> n;
for (i = 0; i < n; i++)
cin>> a[i];
cout << a[n-1];
for (i = n-2; i >= 0; i--)
cout <<' '<<a[i];
cout << endl;
return 0;
} |
47 | 23242 |
int main() {
int N;
cin >>N;
const int n=N;
int a[n];
for (int i=0;i<=n-1;i++)
{
cin >>a[i];
}
int b[n];
for (int i=0;i<=n-1;i++)
{
b[i]=a[n-i-1];
}
for (int i=0;i<=n-1;i++)
{
cout <<b[i];
if (i<n-1)
cout <<" ";
}
return 0;
} |
47 | 23243 | int main (){
int n,m,e,i;
int sz[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&(sz[i]));
}
if(n%2==0){
m=n/2;
}else{
m=(n-1)/2;
}
for(i=0;i<m;i++){
e=sz[i];
sz[i]=sz[n-1-i];
sz[n-1-i]=e;
}
if(n%2!=0){
sz[m]=sz[m];
}
for(i=0;i<n-1;i++){
printf("%d ",(sz[i]));
}
printf("%d",sz[n-1]);
return 0;
}
|
47 | 23244 | void reverse(int n)
{
if(n>0)
{
int c;
char d;
cin>>c;
d=getchar();
reverse(n-1);
cout<<d<<c;}
}
int main()
{
int n;
cin>>n;
reverse(n);
return 0;
}
|
47 | 23245 | int main(){
int n;
int number[NUMBER];
scanf("%d", &n);
int i=0;
int a;
while(i<n){
scanf("%d", &a);
number[i]=a;
i++;
}
while((n-1)>=0){
if((n-1)>0){
printf("%d ", number[n-1]);
n--;
}
else{
printf("%d", number[0]);
n--;
}
}
return 0;
scanf("%d",1);
} |
47 | 23246 |
int main()
{
int n,a[101]={0},b[101]={0},i;
scanf("%d",&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",b[n-1]);
return 0;
}
|
47 | 23247 |
int main()
{
int n,a[1000];
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
int t;
for(int i=0;i<=(int)(0.5*(n+1))-1;i++)
{
t=a[i];
a[i]=a[n-1-i];
a[n-1-i]=t;
}
for(int i=0;i<n;i++)
{
cout<<a[i];
if(i!=n-1) cout<<" ";
}
cout<<endl;
return 0;
} |
47 | 23248 | int main()
{
int n;
int a[100]={0};
int *p,*q,r;
cin>>n;
for(p=a;p<a+n;p++)
{
cin>>*p;
}
for(p=a,q=a+n-1;p<q;p++,q--)
{r=*p;*p=*q;*q=r;}
for(p=a;p<a+n-1;p++)
{cout<<*p<<" ";}
cout<<*p;
return 0;
} |
47 | 23249 | 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 | 23250 | 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 | 23251 | /*
* 12.24.2.cpp
*
* Created on: 2012-12-11
* Author: slkingxr
*/
int main()
{
int a[101],i;
int n,*p=NULL,*q=NULL,t;
cin>>n;
for(i=0;i<n;i++)
cin >>a[i];
for(p=a,q=a+n-1;p<q;p++,q--)
{
t=*p;
*p=*q;
*q=t;
}
for(p=a;p<a+n-1;p++)
cout <<*p<<" ";
cout <<*p;
return 0;
}
|
47 | 23252 |
int main()
{
int n,i,j,temp;
cin>>n;
int a[101];
for (i = 0;i < n;i++)
cin>>a[i];
int *p = a;
for (i = 0,j = n-1;i < j;i++,j-- )
{
temp = *( p + i );
*( p + i ) = *( p + j );
*( p + j ) = temp;
}
for (i = 0;i < n;i++)
{
if (i == n-1)
cout<<p[i];
else
cout<<p[i]<<' ';
}
} |
47 | 23253 |
int main(int argc, char* argv[])
{
int n,i;
scanf("%d",&n);
int sz[100];
for(i=1;i<=n;i++){
if(i<n){
scanf("%d ",&sz[i]);
}else{
scanf("%d",&sz[i]);
}
}
for(i=n;i>=1;i--){
if(i>1){
printf("%d ",sz[i]);
}else{
printf("%d",sz[i]);
}
}
return 0;
}
|
47 | 23254 | 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 | 23255 | 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 | 23256 | 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 | 23257 |
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 | 23258 | /*???????????????*/
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 | 23259 | 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 | 23260 | void main()
{
int n,i=0,a[10000];
scanf("%d",&n);
while(i<n)
{
scanf("%d",&a[i]);
i++;
}
while(i>1)
{
i--;
printf("%d ",a[i]);
}
printf("%d",a[0]);
} |
47 | 23261 | int main()
{
int n,i;
scanf("%d",&n);
int *sz=(int*)malloc(sizeof(int)*n);
int *sf=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
sf[n-1-i]=sz[i];
}
for(i=0;i<n;i++)
{
if(i<n-1)
{
printf("%d ",sf[i]);
}
if(i==n-1)
{
printf("%d",sf[i]);
}
}
return 0;
} |
47 | 23262 | 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 | 23263 | void main()
{int *i,*j,n,x[100],y[100];
scanf("%d",&n);
for (i=x;i<x+n;i++)
scanf("%d",i);
for (j=y,i=i-1;i>=x;i--,j++)
*j=*i;
for (i=x,j=y;i<x+n;i++,j++)
*i=*j;
for (i=x;i<x+n-1;i++)
printf("%d ",*i);
printf("%d",*i);
} |
47 | 23264 | 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 | 23265 | int main()
{
int a[100];//??????
int n;
cin >>n;
cout <<endl;
for (int i = 0;i <= n-1;i++)//?????????
cin >>a[i];
cout <<endl;
for (int k = n-1;k >=1;k--)//?????????
cout <<a[k]<<" ";
cout <<a[0];
cout <<endl;
return 0;
} |
47 | 23266 | int main(){
int n,a[100],i,b,c,d,f[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);}
c=n-1;
b=a[c];
for(i=0;i<n;i++){
d=n-1-i;
f[d]=a[i];}
for(i=0;i<c;i++){
printf("%d ",f[i]);}
printf("%d",f[c]);
return 0;
} |
47 | 23267 | int main()
{
int sz[100],dx[100];
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
j=n-1-i;
dx[j]=sz[i];
}
for(j=0;j<n-1;j++)
{
printf("%d ",dx[j]);
}
if(j==n-1)
printf("%d",dx[j]);
return 0;
}
|
47 | 23268 | 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 | 23269 | 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 | 23270 | 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 | 23271 | int main()
{
int n;
scanf("%d",&n);
int i,sz[100];
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
int k=0,j=n-1,e;
while((k<=n/2)&&(j>=n/2)){
e=sz[k];
sz[k]=sz[j];
sz[j]=e;
k++;
j--;
}
for(i=0;i<n-1;i++){
printf("%d ",sz[i]);
}
printf("%d",sz[n-1]);
int a;
scanf("%d",&a);
return 0;
}
|
47 | 23272 | 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 | 23273 | 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 | 23274 | /*
* 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 | 23275 | int main()
{
int n;
scanf("%d",&n);
int sz[n];
for(int i=0;i<n;i++)
{
scanf("%d",&(sz[i]));
}
for(int j=n-1;j>=0;j--)
{
if(j==0)
{
printf("%d",sz[j]);
}
else
{
printf("%d ",sz[j]);
}
}
return 0;
}
|
47 | 23276 | 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 | 23277 | /*
* 20121113-8.cpp
*
* Created on: 2012-11-20
* Author: ???
*/
int main(){
int n,i,j,k;
cin>>n;
int a[n],b[n];
for(i=1;i<=n;i++)
{
cin>>a[i];//??
}
for(j=1;j<=n;j++)
{
b[j]=a[n+1-j];//??
}
cout<<b[1];
for(k=2;k<=n;k++)
{
cout<<" "<<b[k];
}
return 0;
}
|
47 | 23278 |
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 | 23279 | int main(){
int u[200],i,n,a[200];
scanf("%d",&n);
for(i=0;i<n;i++){
if(i==n-1){
scanf("%d",&(u[i]));
break;
}
scanf("%d ",&(u[i]));
}
for(i=0;i<n;i++){
a[n-1-i]=u[i];
}
for(i=0;i<n;i++){
if(i==n-1){
printf("%d",a[i]);
break;
}
printf("%d ",a[i]);
}
return 0;
}
|
47 | 23280 | 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 | 23281 | void main()
{
int n,a[100],i,*p,tem;
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p+i);
for(i=0;i<n/2;i++)
{
tem=*(p+i);
*(p+i)=*(p+n-1-i);
*(p+n-1-i)=tem;
}
for(p=a;p<a+n;p++)
printf("%d%s",*p,p==a+n-1?"":" ");
}
|
47 | 23282 | 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 | 23283 | int main(){
int n,i,e;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(shuzu)* n);
for(i=0;i<n;i++){
scanf("%d",&shuzu[i]);
}
for(i=0;i<n/2;i++){
e=shuzu[i];
shuzu[i]=shuzu[n-1-i];
shuzu[n-1-i]=e;
}
for(i=0;i<n-1;i++){
printf("%d ",shuzu[i]);
}
printf("%d",shuzu[n-1]);
return 0;
} |
47 | 23284 | int main()
{
int n,i,a[100],*p,b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=b;
for(i=n-1;i>=0;i--)
*p++=a[i];
for(i=0;i<n-1;i++)
printf("%d ",b[i]);
printf("%d",b[n-1]);
return 0;
} |
47 | 23285 | 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 | 23286 | int main(){
int SZ[100],ZS[100];
int n,m=0,i;
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
{
scanf("%d ",&(SZ[i]));
}
scanf("%d",&(SZ[n-1]));
while(n>0){
ZS[m]=SZ[n-1];
n--;
m++;
}
for(i=0;i<m-1;i++)
printf("%d ",ZS[i]);
printf("%d",ZS[m-1]);
return 0;
} |
47 | 23287 | 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 | 23288 | 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 | 23289 | int main ()
{
int n, i = 0, a[10000];
scanf("%d",&n);
printf("\n");
for(i = 0; i < n; i++)
scanf("%d",&a[i]);
for(i = n - 1 ; i > 0; i--)
printf ("%d ",a[i]);
printf("%d\n",a[0]);
return 0;
} |
47 | 23290 | 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 | 23291 |
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 | 23292 | /*
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 | 23293 |
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 | 23294 | 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 | 23295 |
int main()
{
int a[100];
int n,t;
scanf("%d",&n);
int i;
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
}
if(n%2==0){
for(i=0;i<=n/2-1;i++){
t=a[i];
a[i]=a[n-1-i];
a[n-1-i]=t;
}
for(i=0;i<=n-1;i++)
if(i<n-1)
printf("%d ",a[i]);
if(i=n-1)
printf("%d",a[i]);
}
if(n%2==1){
for(i=0;i<=(n-1)/2-1;i++){
t=a[i];
a[i]=a[n-1-i];
a[n-i-1]=t;
}
for(i=0;i<=n-1;i++)
if(i<n-1)
printf("%d ",a[i]);
if(i=n-1)
printf("%d",a[i]);
}
return 0;
}
|
47 | 23296 | int main()
{
int n,i,j,num[50]={0};
int *p;
p=num;
cin>>n;
for(p=num+0;p<num+n;p++)
cin>>*p;
p=num+n-1;
cout<<*p;
for(p=num+n-2;p>=num+0;p--)
cout<<" "<<*p;
cout<<endl;
return 0;
}
|
47 | 23297 | int main()
{
int i, n, m, a[100], b[100];
cin >> n;
for (i = 1; i <= n; i++)
{
b[i] = i;
cin >> a[b[i]];
}
for (i = 1; i <= n / 2; i++)
{
m = b[i];
b[i] = b[n + 1 - i];
b[n + 1 - i] = m;
}
for (int j = 1; j <= n; j++)
{
if (j == n)
cout << a[b[j]] << endl;
else
cout << a[b[j]] << " ";
}
return 0;
} |
47 | 23298 | int main()
{
int n,i;
int a[100];
cin>>n;
for(i=0;i<n;i++)
cin>>*(a+i);
for(i=n-1;i>0;i--)
cout<<*(a+i)<<" ";
cout<<*a<<endl;
return 0;
}
|
47 | 23299 | void main()
{
int i,n;
scanf("%d",&n);
int a[100];
int *p=a;
int *e=p+(n-1);
for(i=0;i<n;i++,p++)
scanf("%d",p);
for(i=0;i<n-1;i++,e=e-1)
printf("%d ",*e);
printf("%d",*e);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.