# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87396 | jvalsortav | Utrka (COCI14_utrka) | C++14 | 742 ms | 25936 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
#include <ctime>
#include <set>
#include <string>
#include <map>
using namespace std;
int n, n2;
string str;
set <string> s;
map <string, int> m;
int main() {
cin >> n;
n2 = n;
while(n--){
cin >> str;
s.insert(str);
m[str]++;
}
/*for (set <string> :: iterator it = s.begin(); it != s.end(); it++){
cout << *it << " " << m[*it] << endl;
}
cout << endl;*/
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |