Submission #286427
Source Code Expand
#include<cstdio> #include<cstring> #include<vector> #include<queue> #include<algorithm> #include<cmath> #include<climits> #include<string> using namespace std; #define rep(i,n) for(int i=0;i<(n);i++) #define reg(i,a,b) for(int i=(a);i<=(b);i++) #define irep(i,n) for(int i=((int)(n))-1;i>=0;i--) #define ireg(i,a,b) for(int i=(b);i>=(a);i--) typedef long long int lli; typedef pair<int,int> mp; #define fir first #define sec second #define IINF INT_MAX #define LINF LLONG_MAX int n,k; int main(void){ scanf("%d%d",&n,&k); if(n/2>=k)printf("YES\n"); else printf("NO\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 閉路グラフ |
User | satos |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 620 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 804 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:23:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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 |
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 | 21 ms | 796 KB |
subtask0_sample_02.txt | AC | 20 ms | 792 KB |
subtask0_sample_03.txt | AC | 22 ms | 652 KB |
subtask0_sample_04.txt | AC | 21 ms | 656 KB |
subtask1_01.txt | AC | 21 ms | 800 KB |
subtask1_02.txt | AC | 21 ms | 804 KB |
subtask1_03.txt | AC | 21 ms | 796 KB |
subtask1_04.txt | AC | 20 ms | 800 KB |
subtask1_05.txt | AC | 22 ms | 652 KB |
subtask1_06.txt | AC | 21 ms | 656 KB |
subtask1_07.txt | AC | 21 ms | 700 KB |
subtask1_08.txt | AC | 20 ms | 708 KB |
subtask1_09.txt | AC | 26 ms | 804 KB |
subtask1_10.txt | AC | 21 ms | 788 KB |
subtask1_11.txt | AC | 23 ms | 704 KB |
subtask1_12.txt | AC | 22 ms | 712 KB |
subtask1_13.txt | AC | 22 ms | 676 KB |
subtask1_14.txt | AC | 21 ms | 700 KB |
subtask1_15.txt | AC | 21 ms | 700 KB |
subtask1_16.txt | AC | 22 ms | 784 KB |
subtask1_17.txt | AC | 20 ms | 796 KB |
subtask1_18.txt | AC | 20 ms | 804 KB |
subtask1_19.txt | AC | 23 ms | 788 KB |
subtask1_20.txt | AC | 21 ms | 788 KB |
subtask1_21.txt | AC | 22 ms | 788 KB |
subtask1_22.txt | AC | 20 ms | 796 KB |
subtask1_23.txt | AC | 22 ms | 800 KB |
subtask1_24.txt | AC | 21 ms | 656 KB |
subtask1_25.txt | AC | 21 ms | 800 KB |
subtask1_26.txt | AC | 20 ms | 796 KB |