백준 12605번: 단어순서 뒤집기

https://www.acmicpc.net/problem/12605

1. 문제

2. 알고리즘

키워드 - 문자열, 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n; cin >> n;
    cin.ignore();
    for(int i = 1; i <= n; i ++) {
        
        string str;
        getline(cin, str);
        reverse(str.begin(), str.end());
        str += ' ';
        vector<string> vc;
 
        int len = str.size();
 
        int start = 0;
        for (int end = 0; end < len; end++) {
            if (str[end] == ' ') {
                reverse(str.begin() + start, str.begin() + end);
                start = end + 1;
            }
        }
        
        cout << "Case #" << i << ": " << str << endl;
    }
 
    return 0;
}