# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165898 | itiam | Marko (COCI15_marko) | C++11 | 65 ms | 32652 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 <iostream>
#include <algorithm>
#include <cstdio>
#include <sstream>
using namespace std;
char La[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 Lb[1000003];
int main(){
string s,s2="",br;
int N,b2,x;
cin >> N;
for (int i=0;i<N;i++){
cin >> s;
s2="";
b2=0;
x=s.length();
for (int j=0;j<x;j++){
s2+=La[(int)s[j]-97];
}
Lb[i]=s2;
}
int bro=0;
cin >> br;
for (int i=0;i<N;i++){
if (Lb[i]==br) bro+=1;
}
cout << bro;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |