Submission #461330

#TimeUsernameProblemLanguageResultExecution timeMemory
461330JasperLUtrka (COCI14_utrka)C++14
80 / 80
283 ms10368 KiB
#include <iostream>
#include <vector>
#include <map>
using namespace std;

#define maxn 100005

int n;
map<string,int> f;

int main() {
    cin >> n;
    for (int i = 0; i < 2*n-1; i++) {
        string s; cin >> s;
        if (!f.count(s)) f[s] = 1;
        else f[s]++;
    }
    for (auto z : f) {
        if (z.second%2 == 1) cout << z.first << endl;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...