题目1039:Zero-complexity Transposition

    xiaoxiao2021-03-29  122

    #include "iostream" #include "stdio.h" #include <vector> #include <cstring> #include <algorithm> #include <string> #include <string.h> #include <stack> #include <ctype.h> #include <functional> #include <math.h> using namespace std; //1039 int n; vector<long long int> v; int main(){     //freopen("input.txt","r",stdin);     while(cin>>n){         v.clear();         while(n--){             long long int t;             cin>>t;             v.push_back(t);         }         reverse(v.begin(),v.end());         cout<<v[0];         for(int i=1;i<v.size();i++){             cout<<" "<<v[i];         }         cout<<endl;     }     return 0; } /**************************************************************     Problem: 1039     User: cust123     Language: C++     Result: Accepted     Time:0 ms     Memory:1520 kb ****************************************************************/

    转载请注明原文地址: https://ju.6miu.com/read-664824.html

    最新回复(0)