#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m, r, x, y, i, j, ans, t;
cin >> n;
string str[n + 2];
for ( i= 1; i <= n; i ++) {
cin >> str[i];
}
map < char, ll > A;
string str1;
cin >> str1;
for (i = 0; i < str1.size(); i ++) {
if ( str1[i] == '2') {
A['a'] = A['b'] = A['c'] = A['c'] = 1;
}
if ( str1[i] == '3') {
A['d'] = A['e'] = A['f'] = A['f'] = 1;
}
if ( str1[i] == '4') {
A['g'] = A['h'] = A['i'] = A['i'] = 1;
}
if ( str1[i] == '5') {
A['j'] = A['k'] = A['l'] = A['l'] = 1;
}
if ( str1[i] == '6') {
A['m'] = A['n'] = A['o'] = A['o'] = 1;
}
if ( str1[i] == '7') {
A['p'] = A['q'] = A['r'] = A['s'] = 1;
}
if ( str1[i] == '8') {
A['t'] = A['u'] = A['v'] = A['v'] = 1;
}
if ( str1[i] == '9') {
A['w'] = A['x'] = A['y'] = A['z'] = 1;
}
}
ans = 0;
for (i = 1; i <= n; i ++) {
ans ++;
for (j = 0; j < str[i].size(); j ++) {
if ( A[str[i][j]] == 0) {
ans --;
break;
}
}
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |