【Google Code Jam】Reverse Words

Problem here

Problem

Given a list of space separated words, reverse the order of the words. Each line of text contains L letters and W words. A line will only consist of letters and space characters. There will be exactly one space character between each pair of consecutive words.

Input

The first line of input gives the number of cases, N.
N test cases follow. For each test case there will a line of letters and space characters indicating a list of space separated words. Spaces will not appear at the start or end of a line.

Output

For each test case, output one line containing “Case #x: ” followed by the list of words in reverse order.

Limits

Small dataset

N = 5
1 ≤ L ≤ 25

Large dataset

N = 100
1 ≤ L ≤ 1000

Sample

Input

3
this is a test
foobar
all your base

Output

Case #1: test a is this
Case #2: foobar
Case #3: base your all

Solution

用struct將字串一塊塊的存在vector，然後放入stack進行反轉輸出

#include <iostream>
#include <stack>
#include <vector>
#include <fstream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
using namespace std;

struct word{
    string w;
};

ofstream fout("B-large-practice.out");
//ofstream fout("B-small-practice.out");
//ifstream fin("B-small-practice.in");
ifstream fin("B-large-practice.in");

int main(){
    int n;
    fin >> n;
    fin.ignore();
    for(int cnt = 1; cnt <= n; cnt++){
        string input;
        getline(fin, input);
        vector<word>words;
        int start = 0;

        for(int i = 0 ; i <= input.length(); i++){
            if(i == input.length()){
                string tmp = "";
                word wtmp;
                for(int j = start; j < i; j++){
                    tmp+= input[j];
                }
                wtmp.w = tmp;
                words.push_back(wtmp);
                start = i+1;
            }        
            if(input[i] == ' '){
                string tmp = "";
                word wtmp;
                for(int j = start; j < i; j++){
                    tmp += input[j];
                }
                wtmp.w = tmp;
                words.push_back(wtmp);
                start = i+1;
            }
        }

        stack<word> ws;
        for(int i = 0; i < words.size(); i++){
            ws.push(words[i]);
        }
        int count = 0;
        fout << "Case #" << cnt << ": ";
        while(!ws.empty()){
            if(count != 0){
                fout << " " << ws.top().w;                
            }else{
                fout << ws.top().w;            
            }
            ws.pop();
            count++;
        }
        fout << endl;
    }

    return 0;
}