UVa 10126 - Zipf's Law

10126.cpp

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

#define F first
#define S second
#define endl '\n'
#define PB push_back

typedef long long ll;
typedef vector<ll> vll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;

const int oo = ~(1<<31);

int main() {

    #ifndef CBDAVIDES
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
    #endif

    int n, idx=0;
    string s;

    vector< vector<string> > sol;
    while(cin >> n) {
        map<string, int> T;

        while(cin >> s) {
            if(s == "EndOfText") {
                idx++;
                break;
            }

            string w = "";
            for(char c : s) {
                if(islower(c) || isupper(c)) w.PB(tolower(c));
                else {
                    if(w != "")T[w]++;
                    w = "";
                }
            }
            if(w != "") T[w]++;
        }

        vector<string> tmp;
        for(auto p : T)
            if(p.S == n) tmp.PB(p.F);

        sol.PB(tmp);
    }

    for(int i=0; i<sol.size(); i++) {
        if(i) cout << endl;
        if(!sol[i].size()) cout << "There is no such word." << endl;
        else for(string t : sol[i]) cout << t << endl;
    }

    return 0;
}