#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
string arr[h];
for( int i = 0 ; i < h ; i++ ) cin >> arr[i];
bool isVis[26] = {0};
for( int i = 0 ; i < h ; i++ ){
for( int j = 0 ; j < w ; j++ ){
if( arr[i][j] == '.' ) continue;
isVis[arr[i][j] - 'A'] = 1;
}
}
int c = 0;
for( int i = 0 ; i < 26 ; i++ ) c += isVis[i];
cout << c << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
1100 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
3 ms |
704 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
444 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
600 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
12 |
Incorrect |
2 ms |
548 KB |
Output isn't correct |
13 |
Incorrect |
2 ms |
448 KB |
Output isn't correct |
14 |
Incorrect |
3 ms |
600 KB |
Output isn't correct |
15 |
Incorrect |
4 ms |
1112 KB |
Output isn't correct |
16 |
Incorrect |
4 ms |
1140 KB |
Output isn't correct |
17 |
Incorrect |
5 ms |
1104 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
604 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
2 |
Incorrect |
22 ms |
4188 KB |
Output isn't correct |
3 |
Incorrect |
257 ms |
46056 KB |
Output isn't correct |
4 |
Incorrect |
61 ms |
11092 KB |
Output isn't correct |
5 |
Incorrect |
134 ms |
20528 KB |
Output isn't correct |
6 |
Incorrect |
256 ms |
46176 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
608 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
532 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
11 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
13 |
Incorrect |
25 ms |
4184 KB |
Output isn't correct |
14 |
Incorrect |
14 ms |
2904 KB |
Output isn't correct |
15 |
Incorrect |
16 ms |
3232 KB |
Output isn't correct |
16 |
Incorrect |
11 ms |
1760 KB |
Output isn't correct |
17 |
Incorrect |
64 ms |
11916 KB |
Output isn't correct |
18 |
Incorrect |
65 ms |
11844 KB |
Output isn't correct |
19 |
Incorrect |
62 ms |
11136 KB |
Output isn't correct |
20 |
Incorrect |
52 ms |
10456 KB |
Output isn't correct |
21 |
Incorrect |
133 ms |
21260 KB |
Output isn't correct |
22 |
Incorrect |
134 ms |
20536 KB |
Output isn't correct |
23 |
Incorrect |
119 ms |
17284 KB |
Output isn't correct |
24 |
Incorrect |
130 ms |
20984 KB |
Output isn't correct |
25 |
Incorrect |
263 ms |
46300 KB |
Output isn't correct |
26 |
Correct |
185 ms |
25540 KB |
Output is correct |
27 |
Incorrect |
259 ms |
46052 KB |
Output isn't correct |
28 |
Incorrect |
256 ms |
46108 KB |
Output isn't correct |
29 |
Incorrect |
256 ms |
46244 KB |
Output isn't correct |
30 |
Incorrect |
239 ms |
45352 KB |
Output isn't correct |
31 |
Incorrect |
149 ms |
22356 KB |
Output isn't correct |
32 |
Incorrect |
246 ms |
46160 KB |
Output isn't correct |