백준 소스코드 [C++] 12605 단어순서 뒤집기

www.acmicpc.net/problem/12605

12605번: 단어순서 뒤집기

백준 소스코드 [C++] 12605 단어순서 뒤집기

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#include <set>
#include <sstream>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
#define make_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
typedef long long ll;
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n;
	string s;
	cin >> n;
	cin.ignore();
	for (int i = 1;i <= n;i++) {
		getline(cin, s);
		stringstream stream;
		stream.str(s);
		vector<string> v;
		while (stream >> s) v.push_back(s);

		cout << "Case #" << i << ": ";
		for (int j = v.size() - 1; 0<=j; j--) cout << v[j] << ' ';
		cout << '\n';

	}

	return 0;
}