#include<stdio.h> int main() { int n,a[100000]; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&a[i]);} printf("%d\n",n); for(int i=n;i>=1;i--) printf("%d ",a[i]); return 0; }

#include <stdio.h>
int main()
{
    int n,i=1;
    scanf("%d",&n);
    int a[n];
    while(i<=n){scanf("%d",&a[i]);i++;}
    printf("%d\n",n);
    i=n;
    while(i>0){printf("%d ",a[i]);i--;}
    return 0;
}//

没人用栈吗？ 这道题拿来练栈不错的。

#include<iostream>
#include<vector>
using namespace std;
vector<int> stack;
int main() {
    int n;
    cin >> n;
    cout << n << endl;
    while (n--) {
        int temp;
        cin >> temp;
        stack.push_back(temp);
    }
    while (!stack.empty()) {
        cout << stack.back()<<" ";
        stack.pop_back();
    }
}

#include <stdio.h> int main() { int n, i; scanf("%d",&n); int ai[n]; for (i=0;i<n;i++) { scanf("%d",&ai[i]); } printf("%d\n",n); for (i=n-1;i>=0;i--) { printf("%d ",ai[i]); } return 0; }

#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    int ai[100000];
    for(int i=0;i<n;i++){
        scanf("%d",&ai[i]);
    }
    printf("%d\n",n);
    for(int i=n-1;i>=0;i--){
        printf("%d",ai[i]);
        if(i>0){
         printf(" ");
        }
    }
    printf("\n");
    return 0;
}

#include<stdio.h> int main(){ int n; scanf ("%d",&n); int arr [n]; for (int i=0;n>i;i++) { scanf("%d",&arr[i]); } printf("%d\n",n); for (int i=n-1;i>=0;i--) { printf("%d ",arr[i]); } return 0;

}

#include <stdio.h> int main() { int n; scanf("%d",&n); int number[n]; int a=0; int b; for(b=0;b<n;b++) {scanf("%d",&number[b]);} printf("%d\n",n); for(b=n-1;b>=0;b--) { printf("%d",number[b]); a++; if(a<n) printf(" "); else break; } return 0; }

#include<stdio.h>
int main(){
int n,i;	
scanf("%d",&n);
int ai[n];	
for(i=0;i<n;i++){
	scanf("%d",&ai[i]);
}	
printf("%d\n",n);	

for(i=n-1;i>=0;i--){
	printf("%d ",ai[i]);
}	
return 0;	
	
	
	
}

n = int(input())
arr = list(map(int, input().split()))
reversed_arr = arr[::-1]
print(n)
print(' '.join(map(str, reversed_arr)))

#include <stdio.h> int main() { int n,i; scanf("%d",&n); int str[n]; for(i=0;i<n;i++) { scanf("%d ",&str[i]); } printf("%d\n",n); i=n-1; while(i>=0) { printf("%d ",str[i]); i--; } return 0; }

#include<stdio.h> int main() { int n,i; scanf("%d\n",&n); int a[n]; for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=n-1;i>=0;i--) { printf("%2d",a[i]); } return 0; }

#include<stdio.h> int main() { int n; scanf("%d",&n); int a[n]; for(int i=0;i<n;i++) { scanf("%d",&a[i]); } printf("%d\n",n); for(int i=n-1;i>=0;i--) { printf("%d ",a[i]); } return 0; }

#include<stdio.h> int main() { int a[100000]; int i; scanf("%d",&i); int n; for(n=0;n<i;n++){ scanf("%d",&a[n]); } printf("%d\n",i); for(n=i-1;n>=0;n--){ printf("%d",a[n]); } return 0; }

我就支持一下c++吧

#include<iostream>
using namespace std;
int main() {
    int n;
    cin >> n;
    int num[n];
    for (int i = 0; i < n; i++) {
        cin >> num[i];
    }
    cout << n << endl;
    for (int i = n - 1; i >= 0; i--) {
        cout << num[i] << " ";
    }

    return 0;
}

#include<stdio.h> int main() { int n,ai[100000]; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&ai[i]); } printf("%d\n",n); for(int i=n;i>=1;i--) { printf("%d ",ai[i]); } return 0; }