Submission #3220140


Source Code Expand

#include <stdio.h>

int P[105];
int visit[105];

int main(){

	int N;

	scanf("%d",&N);

	int a,b;

	scanf("%d %d",&a,&b);

	int K;

	scanf("%d",&K);

	int i;

	visit[a]++;
	visit[b]++;

	for(i=0;i<K;i++){
	scanf(" %d",&P[i]);
	visit[P[i]]++;
	}

	for(i=0;i<=100;i++){
		if(visit[i]>1){
			printf("NO\n");
			return 0;
		}
	}

	printf("YES\n");

	return 0;
}

Submission Info

Submission Time
Task B - 嘘つきの高橋くん
User tekitouk
Language C (GCC 5.4.1)
Score 100
Code Size 397 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:10:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
  ^
./Main.c:14:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&a,&b);
  ^
./Main.c:18:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&K);
  ^
./Main.c:26:2: warning: ignoring return value of ‘scanf’, 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
AC × 5
AC × 29
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 0 ms 128 KB
subtask0_sample_02.txt AC 0 ms 128 KB
subtask0_sample_03.txt AC 0 ms 128 KB
subtask0_sample_04.txt AC 1 ms 128 KB
subtask0_sample_05.txt AC 0 ms 128 KB
subtask1_01.txt AC 1 ms 128 KB
subtask1_02.txt AC 0 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