BOJ 12605単語の順序を反転

質問する

アルゴリズム#アルゴリズム#

s = list(input().rstrip().split(' '))

vector<string> v;
string temp, word;
getline(cin, temp);
stringstream ss;
ss.str(temp);

while (ss >> word) {
    v.push_back(word);
}

s = s[::-1]

print("Case #" + str(i) + ":", *s)

cout << "Case #" << i << ": "; 

for (int i = v.size() - 1; i >= 0; i--) {
    cout << v[i] << ' ';
}

cout << '\n';

コード#コード#

import sys

input = sys.stdin.readline

N = int(input())

for i in range(1, N + 1):
    s = list(input().rstrip().split(' '))
    s = s[::-1]
    print("Case #" + str(i) + ":", *s)

[print("Case #"+str(i)+":",*(list(input().rstrip().split(' '))[::-1])) for i in range(1,int(input())+1)]

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

void fastio() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int32_t main(int32_t argc, char *argv[]) {

    fastio();
    
    int N;
    cin >> N;
    cin.ignore();

    for (int i = 1; i <= N; i++) {
        vector<string> v;
        string temp, word;
        getline(cin, temp);
        stringstream ss;
        ss.str(temp);

        while (ss >> word) {
            v.push_back(word);
        }

        cout << "Case #" << i << ": "; 

        for (int i = v.size() - 1; i >= 0; i--) {
            cout << v[i] << ' ';
        }

        cout << '\n';
    }

    return 0;
}

結果