14 条题解

  • 8
    @ 2023-9-17 22:29:57

    #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; }

    • 4
      @ 2024-4-24 22:06:27
      #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;
      }//
      
      • 4
        @ 2023-7-28 1:36:59

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

        #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();
            }
        }
        
        • 4
          @ 2022-10-13 15:56:19

          #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; }

          • 1
            @ 2025-9-28 20:18:43
            #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;
            }
            
            • 1
              @ 2025-9-25 23:10:46

              #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;

              }

              • 0
                @ 2025-10-14 19:39:44
                #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;	
                	
                	
                	
                }
                
                • 0
                  @ 2025-6-9 13:55:32
                  n = int(input())
                  arr = list(map(int, input().split()))
                  reversed_arr = arr[::-1]
                  print(n)
                  print(' '.join(map(str, reversed_arr)))
                  
                  
                  • @ 2025-6-9 13:56:32

                    你可以学一下map映射,语言之间是相通的

                • 0
                  @ 2024-11-21 21:02:33

                  #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; }

                  • 0
                    @ 2024-11-19 20:16:48

                    #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; }

                    • 0
                      @ 2024-11-6 19:39:23

                      #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; }

                      • 0
                        @ 2024-10-28 22:07:03

                        #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; }

                        • 0
                          @ 2023-11-20 17:53:14

                          我就支持一下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;
                          }
                          
                          
                          • 0
                            @ 2023-10-25 21:27:04

                            #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; }

                            • 1

                            信息

                            ID
                            20
                            时间
                            1000ms
                            内存
                            128MiB
                            难度
                            8
                            标签
                            递交数
                            14549
                            已通过
                            2099
                            上传者