题目1039：Zero-complexity Transposition

最新推荐文章于 2023-12-14 23:53:29 发布

原创最新推荐文章于 2023-12-14 23:53:29 发布 · 349 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++

ACM 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一个简单的编程问题，即如何实现零复杂度的序列反转。任务要求编写一个程序，该程序读取一系列整数并按相反顺序打印这些整数。文章提供了C++示例代码来解决这个问题。

题目描述：

You are given a sequence of integer numbers. Zero-complexity transposition of the sequence is the reverse of this sequence. Your task is to write a program that prints zero-complexity transposition of the given sequence.

输入：

For each case, the first line of the input file contains one integer n-length of the sequence (0 ＜ n ≤ 10 000). The second line contains n integers numbers-a1, a2, …, an (-1 000 000 000 000 000 ≤ ai ≤ 1 000 000 000 000 000).

输出：

For each case, on the first line of the output file print the sequence in the reverse order.

样例输入：

5
-3 4 6 -8 9

样例输出：

9 -8 6 4 -3

C++代码：

#include<iostream>
#include<string>
#include<vector>

using namespace std;

int n;
vector<string> s;

int main(){
    while(cin>>n){
        for(int i=0;i<n;i++){
            string str;
            cin>>str;
            s.push_back(str);
        }
        int first = 1;
        for(int i=s.size()-1;i>=0;i--){
            if(first==1)
                first=0;
            else
                cout<<" ";
            cout<<s[i];
        }
        cout<<endl;
        s.clear();
    }
    return 0;
}