Submission #4031280
Source Code Expand
#include <stdio.h>
#define N 200
int main(void){
int i,j,n,a,b,k,p[N]={0},flag=1;
scanf("%d%d%d",&n,&a,&b);
scanf("%d",&k);
for(i=0;i<k;i++){
scanf("%d",p+i);
}
for(i=0;i<k;i++){
if(p[i]==a || p[i]==b){
flag=0;
break;
}
}
if(flag){
for(j=0;j<k-1;j++){
for(i=j+1;i<k;i++){
if(p[i]==p[j]){
flag=0;
break;
}
}
if(flag==0){
break;
}
}
}
if(flag){
printf("YES\n");
}else{
printf("NO\n");
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 嘘つきの高橋くん |
User |
Kize |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
566 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
128 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:5:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&n,&a,&b);
^
./Main.cpp:6:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&k);
^
./Main.cpp:8:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",p+i);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
1 ms |
128 KB |
subtask0_sample_02.txt |
AC |
1 ms |
128 KB |
subtask0_sample_03.txt |
AC |
1 ms |
128 KB |
subtask0_sample_04.txt |
AC |
1 ms |
128 KB |
subtask0_sample_05.txt |
AC |
1 ms |
128 KB |
subtask1_01.txt |
AC |
1 ms |
128 KB |
subtask1_02.txt |
AC |
1 ms |
128 KB |
subtask1_03.txt |
AC |
1 ms |
128 KB |
subtask1_04.txt |
AC |
1 ms |
128 KB |
subtask1_05.txt |
AC |
1 ms |
128 KB |
subtask1_06.txt |
AC |
1 ms |
128 KB |
subtask1_07.txt |
AC |
1 ms |
128 KB |
subtask1_08.txt |
AC |
1 ms |
128 KB |
subtask1_09.txt |
AC |
1 ms |
128 KB |
subtask1_10.txt |
AC |
1 ms |
128 KB |
subtask1_11.txt |
AC |
1 ms |
128 KB |
subtask1_12.txt |
AC |
1 ms |
128 KB |
subtask1_13.txt |
AC |
1 ms |
128 KB |
subtask1_14.txt |
AC |
1 ms |
128 KB |
subtask1_15.txt |
AC |
1 ms |
128 KB |
subtask1_16.txt |
AC |
1 ms |
128 KB |
subtask1_17.txt |
AC |
1 ms |
128 KB |
subtask1_18.txt |
AC |
1 ms |
128 KB |
subtask1_19.txt |
AC |
1 ms |
128 KB |
subtask1_20.txt |
AC |
1 ms |
128 KB |
subtask1_21.txt |
AC |
1 ms |
128 KB |
subtask1_22.txt |
AC |
1 ms |
128 KB |
subtask1_23.txt |
AC |
1 ms |
128 KB |
subtask1_24.txt |
AC |
1 ms |
128 KB |