Submission #252702

#TimeUsernameProblemLanguageResultExecution timeMemory
252702VEGAnnMarko (COCI15_marko)C++14
50 / 50
3 ms1280 KiB
#include <bits/stdc++.h> #define sz(x) ((int)x.size()) #define all(x) x.begin(),x.end() #define PB push_back using namespace std; typedef long long ll; const int N = 1010; int alp[26] = {2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9}; string s[N], t; int ans, n; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); #ifdef _LOCAL freopen("in.txt","r",stdin); #endif // _LOCAL cin >> n; for (int i = 0; i < n; i++) cin >> s[i]; cin >> t; for (int i = 0; i < n; i++){ if (sz(s[i]) != sz(t)) continue; bool bad = 0; for (int j = 0; j < sz(t); j++){ int s1 = (s[i][j] - 'a'); int t1 = (t[j] - '0'); if (alp[s1] != t1) { bad = 1; break; } } ans += !bad; } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...