# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919521 | 2024-02-01T04:19:30 Z | TIN | Marko (COCI15_marko) | C++17 | 46 ms | 1364 KB |
#include <bits/stdc++.h> using namespace std; #define FNAME "test" const int N = 1005; int n; string s; map<string,int> mp; void Task() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed << setprecision(9); if (fopen(FNAME".inp","r")) { freopen(FNAME".inp","r",stdin); freopen(FNAME".out","w",stdout); } } string stringtonum(string s) { string ret = ""; for (char c : s) { if ('a' <= c && c <= 'c') ret = ret + '2'; if ('d' <= c && c <= 'f') ret = ret + '3'; if ('g' <= c && c <= 'i') ret = ret + '4'; if ('j' <= c && c <= 'l') ret = ret + '5'; if ('m' <= c && c <= 'o') ret = ret + '6'; if ('p' <= c && c <= 's') ret = ret + '7'; if ('t' <= c && c <= 'v') ret = ret + '8'; if ('w' <= c && c <= 'z') ret = ret + '9'; } return ret; } void Solve() { //Your Code cin >> n; for (int i = 1; i <= n; i++) { cin >> s; mp[stringtonum(s)]++; } cin >> s; cout << mp[s]; } int main() { Task(); Solve(); cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms"; return 37^37; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 44 ms | 1360 KB | Output is correct |
5 | Correct | 6 ms | 600 KB | Output is correct |
6 | Correct | 6 ms | 600 KB | Output is correct |
7 | Correct | 23 ms | 1112 KB | Output is correct |
8 | Correct | 46 ms | 1364 KB | Output is correct |
9 | Correct | 6 ms | 600 KB | Output is correct |
10 | Correct | 33 ms | 1104 KB | Output is correct |