Submission #286873
Source Code Expand
Copy
#include <stdio.h> #include <stdlib.h> int main(){ int n,k,i; scanf("%d",&n); scanf("%d",&k); if(n==k){ printf("YES\n"); exit(0); } for(;;){ if(n<=0) break; if(n-2==k){ printf("YES\n"); exit(0); } n-=2; } printf("NO\n"); }
Submission Info
Submission Time | |
---|---|
Task | A - 閉路グラフ |
User | bibinnba9635 |
Language | C (GCC 4.6.4) |
Score | 0 |
Code Size | 359 Byte |
Status | WA |
Exec Time | 24 ms |
Memory | 804 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:8:10: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] ./Main.c:9:10: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
Judge Result
Set Name | Sample | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.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, subtask1_25.txt, subtask1_26.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 20 ms | 796 KB |
subtask0_sample_02.txt | RE | 19 ms | 704 KB |
subtask0_sample_03.txt | RE | 21 ms | 796 KB |
subtask0_sample_04.txt | AC | 20 ms | 800 KB |
subtask1_01.txt | AC | 20 ms | 784 KB |
subtask1_02.txt | RE | 21 ms | 688 KB |
subtask1_03.txt | WA | 21 ms | 796 KB |
subtask1_04.txt | RE | 20 ms | 804 KB |
subtask1_05.txt | AC | 21 ms | 804 KB |
subtask1_06.txt | RE | 19 ms | 792 KB |
subtask1_07.txt | WA | 20 ms | 804 KB |
subtask1_08.txt | AC | 22 ms | 652 KB |
subtask1_09.txt | RE | 21 ms | 800 KB |
subtask1_10.txt | WA | 20 ms | 804 KB |
subtask1_11.txt | RE | 20 ms | 716 KB |
subtask1_12.txt | WA | 20 ms | 792 KB |
subtask1_13.txt | AC | 20 ms | 656 KB |
subtask1_14.txt | WA | 21 ms | 708 KB |
subtask1_15.txt | RE | 19 ms | 704 KB |
subtask1_16.txt | RE | 19 ms | 708 KB |
subtask1_17.txt | AC | 22 ms | 796 KB |
subtask1_18.txt | RE | 20 ms | 700 KB |
subtask1_19.txt | AC | 20 ms | 712 KB |
subtask1_20.txt | RE | 20 ms | 796 KB |
subtask1_21.txt | RE | 21 ms | 788 KB |
subtask1_22.txt | RE | 24 ms | 796 KB |
subtask1_23.txt | RE | 21 ms | 804 KB |
subtask1_24.txt | RE | 21 ms | 712 KB |
subtask1_25.txt | RE | 20 ms | 700 KB |
subtask1_26.txt | AC | 20 ms | 800 KB |