#include<bits/stdc++.h>
using namespace std;
int h,w;
char arr[4009][4009];
bool flag1,flag2;
int main(){
/*scanf("%d%d",&h,&w);
for(int x=0;x<h;x++)
scanf("%s",&arr[x]);
for(int x=0;x<h;x++){
for(int y=0;y<w;y++){
flag1=flag1||(arr[x][y]=='F');
flag2=flag2||(arr[x][y]=='R');
}
}
printf("%d\n",(flag1&&flag2)?2:1);*/
printf("4\n");
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
8 |
Incorrect |
3 ms |
256 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
11 |
Correct |
2 ms |
384 KB |
Output is correct |
12 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
13 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
14 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
15 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
16 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
17 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
18 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
4 |
Incorrect |
3 ms |
512 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
6 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
8 |
Incorrect |
3 ms |
256 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
11 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
12 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
13 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
14 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
15 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
16 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
17 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
18 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
19 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
21 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
22 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
23 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
24 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
25 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
26 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
27 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
28 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
29 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
30 |
Incorrect |
3 ms |
256 KB |
Output isn't correct |
31 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
32 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |