Submission #286727
Source Code Expand
//include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>
//using namespace--------------------------------------------------------------------------------------------------------------
using namespace std;
//define-----------------------------------------------------------------------------------------------------------------------
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
//typedef----------------------------------------------------------------------------------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
//const------------------------------------------------------------------------------------------------------------------------
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
//global-----------------------------------------------------------------------------------------------------------------------
int n, m;
//#define DEBUG
//function-------------------------------------------------------------------------------------------------------------------
int main() {
scanf( "%d", &n );
scanf( "%d", &m );
if ( n / 2 >= m ) {
printf( "YES\n" );
}
else {
printf( "NO\n" );
}
return 0;
}
Submission Info
Submission Time
2014-11-29 21:13:54+0900
Task
A - 閉路グラフ
User
stone725
Language
C++ (G++ 4.6.4)
Score
100
Code Size
2478 Byte
Status
AC
Exec Time
27 ms
Memory
920 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:48:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:49:19: 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
23 ms
796 KB
subtask0_sample_02.txt
AC
21 ms
800 KB
subtask0_sample_03.txt
AC
22 ms
796 KB
subtask0_sample_04.txt
AC
21 ms
792 KB
subtask1_01.txt
AC
22 ms
804 KB
subtask1_02.txt
AC
22 ms
800 KB
subtask1_03.txt
AC
21 ms
676 KB
subtask1_04.txt
AC
22 ms
672 KB
subtask1_05.txt
AC
22 ms
800 KB
subtask1_06.txt
AC
22 ms
732 KB
subtask1_07.txt
AC
22 ms
732 KB
subtask1_08.txt
AC
21 ms
800 KB
subtask1_09.txt
AC
21 ms
904 KB
subtask1_10.txt
AC
23 ms
804 KB
subtask1_11.txt
AC
22 ms
804 KB
subtask1_12.txt
AC
23 ms
796 KB
subtask1_13.txt
AC
23 ms
796 KB
subtask1_14.txt
AC
21 ms
796 KB
subtask1_15.txt
AC
21 ms
800 KB
subtask1_16.txt
AC
21 ms
668 KB
subtask1_17.txt
AC
21 ms
804 KB
subtask1_18.txt
AC
22 ms
804 KB
subtask1_19.txt
AC
21 ms
916 KB
subtask1_20.txt
AC
25 ms
760 KB
subtask1_21.txt
AC
25 ms
760 KB
subtask1_22.txt
AC
24 ms
920 KB
subtask1_23.txt
AC
27 ms
804 KB
subtask1_24.txt
AC
24 ms
804 KB
subtask1_25.txt
AC
23 ms
800 KB
subtask1_26.txt
AC
22 ms
800 KB