#include <stdio.h>
#define MAX_N 101
int main()
{
int N=0;
int input_temp=-1;
int num_cute=0;
int num_not_cute=0;
scanf("%d", &N);
for(int i=0;i<N;i++)
{
input_temp=-1;
scanf("%d", &input_temp);
if(input_temp==0) num_not_cute++;
else if(input_temp==1) num_cute++;
}
if(num_not_cute>num_cute) printf("Junhee is not cute!");
else if(num_not_cute<num_cute) printf("Junhee is cute!");
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1088 KB |
Output is correct |
