11 solutions

  • 2
    @ 2024-10-22 19:41:20

    碇级方法,除非脑子有坑绝对想不出来

    #include<bits/stdc++.h>
    using namespace std;
    bool a=true;
    int main(){
    	if(a==true){
    		int x;
    		cin>>x;
    		a=false;
    	}
    	int a;
    	if(cin>>a){
    		main();
    		cout<<a<<" ";
    	}
    	return 0;
    }
    
  • 1
    @ 2024-1-22 11:41:47

    #include<bits/stdc++.h> using namespace std;

    int a[105];

    int main() { int n; cin >> n; for(int i = 1; i <= n; i++) cin >> a[i];

    for(int i = n; i >= 1; i--)
    	cout << a[i] << " ";
    
    cout << endl;
    return 0;
    

    }

    • 1
      @ 2023-10-5 9:27:57
      #include<iostream>
      using namespace std;
      int a[100];
      int main(){
          int n;
          cin>>n;
          for(int i=0;i<n;i++) cin>>a[i];
          for(int i=n-1;i>=0;i--)cout<<a[i]<<" ";
      }不能抄袭仅供本人使用
      
      • 1
        @ 2023-9-27 13:39:03
        #include <bits/stdc++.h>
        using namespace std;
        int main(int argc, char **argv){
        	int n,a[105] = {0};
        	cin >> n;
        	for (int i = 0;i < n;i++){
        		cin >> a[i];
        	}
        	for (int i = n - 1;i >= 0;i--){
        		printf("%d ",a[i]);
        	}
        	return 0;
        }
        
        • 1
          @ 2023-9-9 15:52:13

          投机取巧的办法,但保证对,就是会被骂

          #include<iostream>
          
          using namespace std;
          long n;
          int main(){
          	cin>>n;
          	int a[n];
          	for(int i=0;i<n;i++) cin>>a[i];
          	for(int i=n-1;i>=0;i--) cout<<a[i]<<' ';
          	return 0;
          }
          
        • 0
          @ 2025-1-30 11:47:14
          
          #include<bits/stdc++.h>
          using namespace std;
          short n;
          int l[105],num;
          int main(){
             cin>>n;
             for(int i=1;i<=n;i++){
             cin>>num;
             l[i]=num;}
             for(int i=n;i>=1;i--){
             cout<<l[i]<<' ';}
             return 0;
          }
          
          • 0
            @ 2024-8-7 10:45:20
            #include<iostream>
            using namespace std;
            const int MAXN=101;
            int n,a[MAXN];
            int main() {
            	cin>>n;
            	for(int i=0;i<n;++i)
            	{
            	cin>>a[i];
            	}
            	for(int j=n-1;j>=0;--j)
            	{
            	cout<<a[j]<<' ';
            	}
            	return 0;
            }
            
            • 0
              @ 2024-7-10 19:54:06
              #include<iostream>
              using namespace std;
              int n,a[101],m,s;
              int main()
              {
              	cin>>n;
                  for(int i=1;i<=n;i++)
                  {
                  	cin>>a[i];
              	}
              	for(int j=n;j>=1;j--) 
                  {
                  	cout<<a[j]<<" ";
              	}
              	return 0;
              }
              
              • 0
                @ 2023-10-3 11:09:22

                #include<bits/stdc++.h> using namespace std;

                int main(){ int a; cin>>a; int b[a]; for(int i=0;i<a;i++){ cin>>b[i]; } for(int i=a-1;i>=0;i--){ cout<<b[i]<<" "; } }

                • 0
                  @ 2023-10-3 10:44:20

                  #include<bits/stdc++.h> using namespace std;

                  int main(){ int N; cin>>N; const int n=N; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; } for(int j=n-1;j>=0;j--){ cout<<a[j]<<" "; } return 0; }``

                  • 0
                    @ 2023-9-21 22:27:50
                    #include <iostream>
                    using namespace std;
                    int n,m,ans=0;
                    int main(){
                    	cin>>n;
                    	int a[n]={0};
                    	for(int i=1;i<=n;i++) cin>>a[i];
                    	for(int i=n;i>=1;i--) cout<<a[i]<<" ";
                    	return 0;
                    }
                    
                    • 1

                    Information

                    ID
                    591
                    Time
                    1000ms
                    Memory
                    256MiB
                    Difficulty
                    3
                    Tags
                    # Submissions
                    122
                    Accepted
                    66
                    Uploaded By