problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k โ | fixed_code stringlengths 12 526k โ | labels listlengths 0 15 โ | buggy_submission_id int64 1 1.54M โ | fixed_submission_id int64 2 1.54M โ | user_id stringlengths 10 10 โ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03129 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,239 | 931,240 | u118846704 | cpp |
p03129 | /* Bismillahirrahmanirrahim */
/* Author : Jehian Norman Saviero (@Reiva5) */
#include <bits/stdc++.h>
// MACROS SAMPAH
#define Jehian using
#define Norman namespace
#define Saviero std
Jehian Norman Saviero;
// MACROS TYPE
typedef long l;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pi;
typedef pair<l, l> pl;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<l> vl;
typedef vector<ll> vll;
// MACROS FOR PRINT
#define nl printf("\n")
#define sp printf(" ")
// MACROS FOR ATTRIBUTE
#define fi first
#define se second
// MACROS FOR FUNCTION AND METHOD
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ALL(x) (x).begin(), (x).end()
#define ALLN(x, n) (x), (x) + (n)
#define CUBE(x) (SQR(x) * (x))
#define SET(x, y) \
for (int _qwe = sizeof(x) / sizeof(x[0]); _qwe;) \
x[--_qwe] = (y)
#define SQR(x) ((x) * (x))
#define SSORT(x, sz) sort(ALLN(x, sz))
#define RESET(x) memset((x), 0, sizeof(x))
#define VSORT(x) sort(ALL(x))
// MACROS READ INPUT
#define sci(x) scanf("%d", &x)
#define scl(x) scanf("%ld", &x)
#define scll(x) scanf("%lld", &x)
#define scul(x) scl(x)
#define scull(x) scll(x)
int main() {
int N, K;
sci(N), sci(K);
++N;
N /= 2;
puts(N < K ? "YES" : "NO");
return 0;
} | /* Bismillahirrahmanirrahim */
/* Author : Jehian Norman Saviero (@Reiva5) */
#include <bits/stdc++.h>
// MACROS SAMPAH
#define Jehian using
#define Norman namespace
#define Saviero std
Jehian Norman Saviero;
// MACROS TYPE
typedef long l;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pi;
typedef pair<l, l> pl;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<l> vl;
typedef vector<ll> vll;
// MACROS FOR PRINT
#define nl printf("\n")
#define sp printf(" ")
// MACROS FOR ATTRIBUTE
#define fi first
#define se second
// MACROS FOR FUNCTION AND METHOD
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ALL(x) (x).begin(), (x).end()
#define ALLN(x, n) (x), (x) + (n)
#define CUBE(x) (SQR(x) * (x))
#define SET(x, y) \
for (int _qwe = sizeof(x) / sizeof(x[0]); _qwe;) \
x[--_qwe] = (y)
#define SQR(x) ((x) * (x))
#define SSORT(x, sz) sort(ALLN(x, sz))
#define RESET(x) memset((x), 0, sizeof(x))
#define VSORT(x) sort(ALL(x))
// MACROS READ INPUT
#define sci(x) scanf("%d", &x)
#define scl(x) scanf("%ld", &x)
#define scll(x) scanf("%lld", &x)
#define scul(x) scl(x)
#define scull(x) scll(x)
int main() {
int N, K;
sci(N), sci(K);
++N;
N /= 2;
puts(N >= K ? "YES" : "NO");
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 931,243 | 931,244 | u000351359 | cpp |
p03129 | /* Bismillahirrahmanirrahim */
/* Author : Jehian Norman Saviero (@Reiva5) */
#include <bits/stdc++.h>
// MACROS SAMPAH
#define Jehian using
#define Norman namespace
#define Saviero std
Jehian Norman Saviero;
// MACROS TYPE
typedef long l;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pi;
typedef pair<l, l> pl;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<l> vl;
typedef vector<ll> vll;
// MACROS FOR PRINT
#define nl printf("\n")
#define sp printf(" ")
// MACROS FOR ATTRIBUTE
#define fi first
#define se second
// MACROS FOR FUNCTION AND METHOD
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ALL(x) (x).begin(), (x).end()
#define ALLN(x, n) (x), (x) + (n)
#define CUBE(x) (SQR(x) * (x))
#define SET(x, y) \
for (int _qwe = sizeof(x) / sizeof(x[0]); _qwe;) \
x[--_qwe] = (y)
#define SQR(x) ((x) * (x))
#define SSORT(x, sz) sort(ALLN(x, sz))
#define RESET(x) memset((x), 0, sizeof(x))
#define VSORT(x) sort(ALL(x))
// MACROS READ INPUT
#define sci(x) scanf("%d", &x)
#define scl(x) scanf("%ld", &x)
#define scll(x) scanf("%lld", &x)
#define scul(x) scl(x)
#define scull(x) scll(x)
int main() {
int N, K;
sci(N), sci(K);
++N;
N /= 2;
puts(N >= K ? "Yes" : "No");
return 0;
} | /* Bismillahirrahmanirrahim */
/* Author : Jehian Norman Saviero (@Reiva5) */
#include <bits/stdc++.h>
// MACROS SAMPAH
#define Jehian using
#define Norman namespace
#define Saviero std
Jehian Norman Saviero;
// MACROS TYPE
typedef long l;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pi;
typedef pair<l, l> pl;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<l> vl;
typedef vector<ll> vll;
// MACROS FOR PRINT
#define nl printf("\n")
#define sp printf(" ")
// MACROS FOR ATTRIBUTE
#define fi first
#define se second
// MACROS FOR FUNCTION AND METHOD
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ALL(x) (x).begin(), (x).end()
#define ALLN(x, n) (x), (x) + (n)
#define CUBE(x) (SQR(x) * (x))
#define SET(x, y) \
for (int _qwe = sizeof(x) / sizeof(x[0]); _qwe;) \
x[--_qwe] = (y)
#define SQR(x) ((x) * (x))
#define SSORT(x, sz) sort(ALLN(x, sz))
#define RESET(x) memset((x), 0, sizeof(x))
#define VSORT(x) sort(ALL(x))
// MACROS READ INPUT
#define sci(x) scanf("%d", &x)
#define scl(x) scanf("%ld", &x)
#define scll(x) scanf("%lld", &x)
#define scul(x) scl(x)
#define scull(x) scll(x)
int main() {
int N, K;
sci(N), sci(K);
++N;
N /= 2;
puts(N >= K ? "YES" : "NO");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,245 | 931,244 | u000351359 | cpp |
p03129 | #include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
cout << ((2 * K - 1 <= N) ? "Yes" : "No") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
cout << ((2 * K - 1 <= N) ? "YES" : "NO") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,246 | 931,247 | u330913290 | cpp |
p03129 | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define EPS 1e-4
#define OUTPUT(i) (cout << (ll)i << endl)
#define ALL(a) ((a).begin(), (a).end())
bool operator<(const pair<ll, ll> &a, const pair<ll, ll> &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(15);
int N, K;
cin >> N >> K;
if ((N - K + 1) / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
const ll MOD = 1e9 + 7;
const double pi = acos(-1);
typedef pair<int, int> P;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define EPS 1e-4
#define OUTPUT(i) (cout << (ll)i << endl)
#define ALL(a) ((a).begin(), (a).end())
bool operator<(const pair<ll, ll> &a, const pair<ll, ll> &b) {
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(15);
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 931,248 | 931,249 | u181719868 | cpp |
p03129 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n + 1 >= k * 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n + 1 >= k * 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,250 | 931,251 | u772304668 | cpp |
p03129 | #include <algorithm>
#include <complex>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <complex>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,252 | 931,253 | u852158538 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
int main(void) {
int n, k;
cin >> n >> k;
bool res = (n + 1) / 2 >= k;
if (res)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
int main(void) {
int n, k;
cin >> n >> k;
bool res = (n + 1) / 2 >= k;
if (res)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,258 | 931,259 | u762193256 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int tmp;
if (N % 2 == 0) {
tmp = N / 2;
} else {
tmp = N / 2 + 1;
}
if (tmp >= K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int tmp;
if (N % 2 == 0) {
tmp = N / 2;
} else {
tmp = N / 2 + 1;
}
if (tmp >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,260 | 931,261 | u341347211 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
#ifdef DEBUG
#define debug(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
#else
#define debug(fmt, ...)
#endif
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1; var <= (n); ++var)
#define repC2(vari, varj, n) \
for (int vari = 0; vari < (n)-1; ++vari) \
for (int varj = vari + 1; varj < (n); ++varj)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define tr(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define found(s, e) ((s).find(e) != (s).end())
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define mid(x, y) ((x) + ((y) - (x)) / 2)
#define IN(x, a, b) ((a) <= (x) && (x) <= (b))
#define cons make_pair
#define PQ(T) priority_queue<T>
#define RPQ(T) priority_queue<T, vector<T>, greater<T>>
template <class T> inline void amin(T &a, T const &b) { a = min(a, b); }
template <class T> inline void amax(T &a, T const &b) { a = max(a, b); }
inline ll square(ll x) { return x * x; }
// ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
inline ll gcd(ll a, ll b) {
while (a)
swap(a, b %= a);
return b;
}
template <typename T> inline T mod(T a, T b) { return ((a % b) + b) % b; }
const ll MOD = 1000000007LL;
ll ADD(ll x, ll y) { return (x + y) % MOD; }
ll SUB(ll x, ll y) { return (x - y + MOD) % MOD; }
ll MUL(ll x, ll y) { return x * y % MOD; }
ll POW(ll x, ll e) {
ll v = 1;
for (; e; x = MUL(x, x), e >>= 1)
if (e & 1)
v = MUL(v, x);
return v;
}
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/
return MUL(x, POW(y, MOD - 2));
}
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v,
// n-i+1),i); return v; }
//
int main() {
int N, K;
cin >> N >> K;
int m = (K - 1) * 2;
cout << (N >= m ? "YES" : "NO") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
#ifdef DEBUG
#define debug(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
#else
#define debug(fmt, ...)
#endif
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1; var <= (n); ++var)
#define repC2(vari, varj, n) \
for (int vari = 0; vari < (n)-1; ++vari) \
for (int varj = vari + 1; varj < (n); ++varj)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define tr(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define found(s, e) ((s).find(e) != (s).end())
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define mid(x, y) ((x) + ((y) - (x)) / 2)
#define IN(x, a, b) ((a) <= (x) && (x) <= (b))
#define cons make_pair
#define PQ(T) priority_queue<T>
#define RPQ(T) priority_queue<T, vector<T>, greater<T>>
template <class T> inline void amin(T &a, T const &b) { a = min(a, b); }
template <class T> inline void amax(T &a, T const &b) { a = max(a, b); }
inline ll square(ll x) { return x * x; }
// ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
inline ll gcd(ll a, ll b) {
while (a)
swap(a, b %= a);
return b;
}
template <typename T> inline T mod(T a, T b) { return ((a % b) + b) % b; }
const ll MOD = 1000000007LL;
ll ADD(ll x, ll y) { return (x + y) % MOD; }
ll SUB(ll x, ll y) { return (x - y + MOD) % MOD; }
ll MUL(ll x, ll y) { return x * y % MOD; }
ll POW(ll x, ll e) {
ll v = 1;
for (; e; x = MUL(x, x), e >>= 1)
if (e & 1)
v = MUL(v, x);
return v;
}
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/
return MUL(x, POW(y, MOD - 2));
}
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v,
// n-i+1),i); return v; }
//
int main() {
int N, K;
cin >> N >> K;
int m = 1 + (K - 1) * 2;
cout << (N >= m ? "YES" : "NO") << endl;
return 0;
}
| [
"assignment.change"
] | 931,262 | 931,263 | u108808596 | cpp |
p03129 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
if (K * 2 + 1 <= N)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
if (K * 2 - 1 <= N)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 931,264 | 931,265 | u942774736 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
#define CIN(type, x) \
type x; \
cin >> x
#define TRUE__ "YES"
#define FALSE__ "NO"
#define PRINT(f) \
if ((f)) { \
cout << (TRUE__) << endl; \
} else { \
cout << FALSE__ << endl; \
}
#define RS(N) resize(N)
#define CINV(v, N) \
do { \
v.RS(N); \
rep(i, N) cin >> v[i]; \
} while (0);
#define RCINV(v, N) \
do { \
v.RS(N); \
rrep(i, N) cin >> v[i]; \
} while (0);
#define MOD 1000000007
template <class T> inline T GET() {
T x;
cin >> x;
return x;
}
void init();
void solve();
signed main() {
init();
solve();
}
void init() {}
void solve() {
int N, K;
cin >> N >> K;
for (int i = 1; i < N; i += 2) {
K--;
}
PRINT(K <= 0);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
#define CIN(type, x) \
type x; \
cin >> x
#define TRUE__ "YES"
#define FALSE__ "NO"
#define PRINT(f) \
if ((f)) { \
cout << (TRUE__) << endl; \
} else { \
cout << FALSE__ << endl; \
}
#define RS(N) resize(N)
#define CINV(v, N) \
do { \
v.RS(N); \
rep(i, N) cin >> v[i]; \
} while (0);
#define RCINV(v, N) \
do { \
v.RS(N); \
rrep(i, N) cin >> v[i]; \
} while (0);
#define MOD 1000000007
template <class T> inline T GET() {
T x;
cin >> x;
return x;
}
void init();
void solve();
signed main() {
init();
solve();
}
void init() {}
void solve() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; i += 2) {
K--;
}
PRINT(K <= 0);
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 931,266 | 931,267 | u946322619 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
#define CIN(type, x) \
type x; \
cin >> x
#define TRUE__ "YES"
#define FALSE__ "NO"
#define PRINT(f) \
if ((f)) { \
cout << (TRUE__) << endl; \
} else { \
cout << FALSE__ << endl; \
}
#define RS(N) resize(N)
#define CINV(v, N) \
do { \
v.RS(N); \
rep(i, N) cin >> v[i]; \
} while (0);
#define RCINV(v, N) \
do { \
v.RS(N); \
rrep(i, N) cin >> v[i]; \
} while (0);
#define MOD 1000000007
template <class T> inline T GET() {
T x;
cin >> x;
return x;
}
void init();
void solve();
signed main() {
init();
solve();
}
void init() {}
void solve() {
int N, K;
cin >> N >> K;
for (int i = 1; i < N; i++) {
K--;
}
PRINT(K <= 0);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
#define CIN(type, x) \
type x; \
cin >> x
#define TRUE__ "YES"
#define FALSE__ "NO"
#define PRINT(f) \
if ((f)) { \
cout << (TRUE__) << endl; \
} else { \
cout << FALSE__ << endl; \
}
#define RS(N) resize(N)
#define CINV(v, N) \
do { \
v.RS(N); \
rep(i, N) cin >> v[i]; \
} while (0);
#define RCINV(v, N) \
do { \
v.RS(N); \
rrep(i, N) cin >> v[i]; \
} while (0);
#define MOD 1000000007
template <class T> inline T GET() {
T x;
cin >> x;
return x;
}
void init();
void solve();
signed main() {
init();
solve();
}
void init() {}
void solve() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; i += 2) {
K--;
}
PRINT(K <= 0);
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 931,268 | 931,267 | u946322619 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int N, K;
cin >> N >> K;
bool ans = (N + 1) / 2 >= K;
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
int N, K;
cin >> N >> K;
bool ans = (N + 1) / 2 >= K;
if (ans)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,270 | 931,271 | u666394517 | cpp |
p03129 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K, count = 0;
cin >> N >> K;
for (int i = 1; i < N; i += 2) {
count += 1;
}
if (count >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K, count = 0;
cin >> N >> K;
for (int i = 1; i <= N; i += 2) {
count += 1;
}
if (count >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 931,274 | 931,275 | u500026208 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k <= (n + 1) / 2)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k <= (n + 1) / 2)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,276 | 931,277 | u440556285 | cpp |
p03129 | #include "algorithm"
#include "bitset"
#include "cmath"
#include "complex"
#include "deque"
#include "fstream"
#include "iomanip"
#include "iostream"
#include "iterator"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
#include "vector"
#include <cassert>
#include <cstdio>
#include <ctime>
using namespace std;
//#define f(i,n) for(int i=0; i<n;i++)
//#define rf(i, n) for(int i=n-1;i>=0;i--)
//#define forn(i, j, n) for(int i=j; i<n; i++)
//#define ff(i, j, n) f(i, n)f(j, n)
#define pb push_back
#define mp make_pair
#define maxi(a, b) a = max(a, b);
#define mini(a, b) a = min(a, b);
#define endl '\n'
#define all(a) a.begin(), a.end()
#define sqr(x) ((x) * (x))
#define SZ(a) ((int)(a.size()))
#define watch(x) cout << (#x) << " = " << x << endl;
// typedef long long ll;
typedef long double ld;
#define int long long
#define double ld
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef vector<char> vc;
template <class T> void show(const vector<T> &a) {
for (T x : a)
cout << x << " ";
cout << endl;
}
const int sze = 1e5 + 50, oo = 1e18 + 500, mod = 1e9 + 7;
const double eps = 1e-9, PI = 2 * acos(0.0);
vi vertices[sze];
vc visit(sze, false);
vi arr(sze, 0);
int n, m, k;
int A, B;
int cnt = 0;
// int s, t;
//
// struct edge {
// int from, to, flow, cap;
//};
//
// vector<edge> e;
//
// void add_edge(int u, int v, int w)
//{
// edge e1 = { u, v, 0, w };
// edge e2 = { v, u, 0, 0 };
//
// vertices[u].pb(e.size());
// e.pb(e1);
// vertices[v].pb(e.size());
// e.pb(e2);
//}
//
// int d[sze], ptr[sze];
//
// bool bfs()
//{
// queue<int> q;
// q.push(s);
//
// fill(d, d + n + 10, -1);
// d[s] = 0;
//
// while (!q.empty() && d[t] == -1)
// {
// int v = q.front();
// q.pop();
//
// for (auto id : vertices[v])
// {
// int to = e[id].to;
//
// if (d[to] == -1 && e[id].cap > e[id].flow)
// {
// q.push(to);
// d[to] = d[v] + 1;
// }
// }
// }
//
// return d[t] != -1;
//}
//
// int dfs(int v, int flow)
//{
// if (!flow)
// return 0;
//
// if (v == t && flow != oo)
// return flow;
//
// for (; ptr[v] < vertices[v].size(); ptr[v] ++)
// {
// int id = vertices[v][ptr[v]];
// int to = e[id].to;
//
// if (d[to] != d[v] + 1) continue;
//
// int pushed = dfs(to, min(flow, e[id].cap - e[id].flow));
//
// if (pushed)
// {
// e[id].flow += pushed;
// e[id ^ 1].flow -= pushed;
// return pushed;
// }
// }
//
// return 0;
//}
//
//
// int dinic()
//{
// int flow = 0;
//
// while (bfs())
// {
// fill(ptr, ptr + n + 10, 0);
// while (int pushed = dfs(s, oo))
// {
// flow += pushed;
// }
// }
//
// return flow;
//}
//
// bool from[sze], to[sze];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
cnt = (n + 1) / 2;
if (cnt >= k) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| #include "algorithm"
#include "bitset"
#include "cmath"
#include "complex"
#include "deque"
#include "fstream"
#include "iomanip"
#include "iostream"
#include "iterator"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
#include "vector"
#include <cassert>
#include <cstdio>
#include <ctime>
using namespace std;
//#define f(i,n) for(int i=0; i<n;i++)
//#define rf(i, n) for(int i=n-1;i>=0;i--)
//#define forn(i, j, n) for(int i=j; i<n; i++)
//#define ff(i, j, n) f(i, n)f(j, n)
#define pb push_back
#define mp make_pair
#define maxi(a, b) a = max(a, b);
#define mini(a, b) a = min(a, b);
#define endl '\n'
#define all(a) a.begin(), a.end()
#define sqr(x) ((x) * (x))
#define SZ(a) ((int)(a.size()))
#define watch(x) cout << (#x) << " = " << x << endl;
// typedef long long ll;
typedef long double ld;
#define int long long
#define double ld
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef vector<char> vc;
template <class T> void show(const vector<T> &a) {
for (T x : a)
cout << x << " ";
cout << endl;
}
const int sze = 1e5 + 50, oo = 1e18 + 500, mod = 1e9 + 7;
const double eps = 1e-9, PI = 2 * acos(0.0);
vi vertices[sze];
vc visit(sze, false);
vi arr(sze, 0);
int n, m, k;
int A, B;
int cnt = 0;
// int s, t;
//
// struct edge {
// int from, to, flow, cap;
//};
//
// vector<edge> e;
//
// void add_edge(int u, int v, int w)
//{
// edge e1 = { u, v, 0, w };
// edge e2 = { v, u, 0, 0 };
//
// vertices[u].pb(e.size());
// e.pb(e1);
// vertices[v].pb(e.size());
// e.pb(e2);
//}
//
// int d[sze], ptr[sze];
//
// bool bfs()
//{
// queue<int> q;
// q.push(s);
//
// fill(d, d + n + 10, -1);
// d[s] = 0;
//
// while (!q.empty() && d[t] == -1)
// {
// int v = q.front();
// q.pop();
//
// for (auto id : vertices[v])
// {
// int to = e[id].to;
//
// if (d[to] == -1 && e[id].cap > e[id].flow)
// {
// q.push(to);
// d[to] = d[v] + 1;
// }
// }
// }
//
// return d[t] != -1;
//}
//
// int dfs(int v, int flow)
//{
// if (!flow)
// return 0;
//
// if (v == t && flow != oo)
// return flow;
//
// for (; ptr[v] < vertices[v].size(); ptr[v] ++)
// {
// int id = vertices[v][ptr[v]];
// int to = e[id].to;
//
// if (d[to] != d[v] + 1) continue;
//
// int pushed = dfs(to, min(flow, e[id].cap - e[id].flow));
//
// if (pushed)
// {
// e[id].flow += pushed;
// e[id ^ 1].flow -= pushed;
// return pushed;
// }
// }
//
// return 0;
//}
//
//
// int dinic()
//{
// int flow = 0;
//
// while (bfs())
// {
// fill(ptr, ptr + n + 10, 0);
// while (int pushed = dfs(s, oo))
// {
// flow += pushed;
// }
// }
//
// return flow;
//}
//
// bool from[sze], to[sze];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
cnt = (n + 1) / 2;
if (cnt >= k) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,278 | 931,279 | u957962914 | cpp |
p03129 | #include <functional>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (2 * K - 1 <= N) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <functional>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (2 * K - 1 <= N) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,280 | 931,281 | u775451660 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (unsigned int i = 0; i < (n); i++)
#define EREP(i, n) for (int i = 1; i <= (n); i++)
#define ALL(a) (a).begin(), (a).end()
//#define EVEL 1
#ifdef EVEL
#define DEB(X) cout << #X << ":" << X << " ";
#define TF(f) f ? cout << "true " : cout << "false ";
#define END cout << "\n";
#else
#define DEB(X) \
{}
#define TF(f) \
{}
#define END \
{}
#endif
const int MOD = 1000000007;
const int INF = 2000000000;
ll A, B, C, D, N;
ll ans = 0;
ll X[4];
string S[4];
int main() {
cin >> N >> A;
if (N % 2 == 0)
cout << (N / 2 >= A ? "Yes" : "No") << endl;
else
cout << (N / 2 + 1 >= A ? "Yes" : "No") << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (unsigned int i = 0; i < (n); i++)
#define EREP(i, n) for (int i = 1; i <= (n); i++)
#define ALL(a) (a).begin(), (a).end()
//#define EVEL 1
#ifdef EVEL
#define DEB(X) cout << #X << ":" << X << " ";
#define TF(f) f ? cout << "true " : cout << "false ";
#define END cout << "\n";
#else
#define DEB(X) \
{}
#define TF(f) \
{}
#define END \
{}
#endif
const int MOD = 1000000007;
const int INF = 2000000000;
ll A, B, C, D, N;
ll ans = 0;
ll X[4];
string S[4];
int main() {
cin >> N >> A;
if (N % 2 == 0)
cout << (N / 2 >= A ? "YES" : "NO") << endl;
else
cout << (N / 2 + 1 >= A ? "YES" : "NO") << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,282 | 931,283 | u549743442 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) >= 2 * k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,284 | 931,285 | u773916255 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, k;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
if (k >= (n + 1) / 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, k;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
if (k <= (n + 1) / 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,286 | 931,287 | u878355493 | cpp |
p03129 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef queue<P> Q;
int main() {
int a, b;
cin >> a >> b;
if (a >= b * 2) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef queue<P> Q;
int main() {
int a, b;
cin >> a >> b;
if (a >= b * 2 - 1) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,288 | 931,289 | u114234520 | cpp |
p03129 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
#define POWER9 1000000000
#define MOD POWER9 + 7
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483647
#define INT_MAX 2147483647
#define LL_MIN (LL) - 9223372036854775807
#define LL_MAX (LL)9223372036854775807
#define PI 3.14159265359
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
int N, K;
cin >> N >> K;
if (ceil((double)N / 2) >= K)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
return 0;
}
*/
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
return 0;
}
*/
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(9);
return 0;
}
*/
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(9);
return 0;
}
*/
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(9);
return 0;
}
*/ | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
#define POWER9 1000000000
#define MOD POWER9 + 7
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483647
#define INT_MAX 2147483647
#define LL_MIN (LL) - 9223372036854775807
#define LL_MAX (LL)9223372036854775807
#define PI 3.14159265359
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
int N, K;
cin >> N >> K;
if (ceil((double)N / 2) >= K)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
return 0;
}
*/
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(9);
return 0;
}
*/
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(9);
return 0;
}
*/
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(9);
return 0;
}
*/
/*
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(9);
return 0;
}
*/ | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,290 | 931,291 | u422592877 | cpp |
p03129 | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define infll 1000000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define mpr make_pair
#define fi first
#define se second
#define pq priority_queue<int>
#define pqll priority_queue<ll>
#define up(x, y) (x < (y) ? x = (y) : 0)
#define dn(x, y) (x > (y) ? x = (y) : 0)
#define ad(x, y) (x = (x + (y)) % mod)
using namespace std;
int read() {
int x = 0;
char ch = getchar();
bool flag = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
flag = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return flag ? -x : x;
}
ll readll() {
ll x = 0;
char ch = getchar();
bool flag = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
flag = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return flag ? -x : x;
}
int main() {
int a, b;
scanf("%d%d", &a, b);
puts((b <= (a + 1 >> 1)) ? "YES" : "NO");
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define infll 1000000000000000000ll
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define mpr make_pair
#define fi first
#define se second
#define pq priority_queue<int>
#define pqll priority_queue<ll>
#define up(x, y) (x < (y) ? x = (y) : 0)
#define dn(x, y) (x > (y) ? x = (y) : 0)
#define ad(x, y) (x = (x + (y)) % mod)
using namespace std;
int read() {
int x = 0;
char ch = getchar();
bool flag = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
flag = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return flag ? -x : x;
}
ll readll() {
ll x = 0;
char ch = getchar();
bool flag = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
flag = 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return flag ? -x : x;
}
int main() {
int a, b;
scanf("%d%d", &a, &b);
puts((b <= (a + 1 >> 1)) ? "YES" : "NO");
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 931,292 | 931,293 | u070528238 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
typedef pair<ll, ll> P;
int main() {
int n, m;
cin >> n >> m;
if (n - 1 >= m * 2) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
typedef pair<ll, ll> P;
int main() {
int n, m;
cin >> n >> m;
if (n + 1 >= m * 2) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 931,294 | 931,295 | u987476436 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N / 2 + N % 2 >= K)
cout << "YES";
else
cout << "OUT";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N / 2 + N % 2 >= K)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 931,296 | 931,297 | u778347695 | cpp |
p03129 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = 0; i < sz; i++) {
cout << v[i] << " \n"[i == sz - 1];
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int res = 0;
for (int i = 1; i <= n; i += 2)
res++;
cout << ((res >= k) ? "Yes" : "No") << endl;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = 0; i < sz; i++) {
cout << v[i] << " \n"[i == sz - 1];
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int res = 0;
for (int i = 1; i <= n; i += 2)
res++;
cout << ((res >= k) ? "YES" : "NO") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,298 | 931,299 | u968834127 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> mm;
#define ll long long
#define ld long double
#define PI 3.14159265358979l
int main() {
int n, k;
cin >> n >> k;
if (k + 2 - 1 <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> mm;
#define ll long long
#define ld long double
#define PI 3.14159265358979l
int main() {
int n, k;
cin >> n >> k;
if (k * 2 - 1 <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 931,300 | 931,301 | u154672915 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (long long i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (long long i = (a); i >= (b); --i)
#define REPR(i, n) FORR(i, n, 0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (long long i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (long long i = (a); i >= (b); --i)
#define REPR(i, n) FORR(i, n, 0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,304 | 931,305 | u128676584 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <iomanip> // << fixed << precision(10)
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(s) cout << s << "\n"
#define SORT(A) sort(A.begin(), A.end())
#define EACHPRINT(A, T) \
for_each(begin(A), end(A), [&](T i) { cout << i << " "; }); \
cout << "\n"
#define MOD 1000000007
typedef long lint;
typedef vector<lint> V;
typedef pair<lint, lint> P;
bool lessPair(const P &l, const P &r) { return l.second < r.second; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lint N;
cin >> N;
lint K;
cin >> K;
if (1 + 2 * K <= N) {
PRINT("YES");
} else {
PRINT("NO");
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip> // << fixed << precision(10)
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(s) cout << s << "\n"
#define SORT(A) sort(A.begin(), A.end())
#define EACHPRINT(A, T) \
for_each(begin(A), end(A), [&](T i) { cout << i << " "; }); \
cout << "\n"
#define MOD 1000000007
typedef long lint;
typedef vector<lint> V;
typedef pair<lint, lint> P;
bool lessPair(const P &l, const P &r) { return l.second < r.second; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lint N;
cin >> N;
lint K;
cin >> K;
if (1 + 2 * (K - 1) <= N) {
PRINT("YES");
} else {
PRINT("NO");
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 931,306 | 931,307 | u291278680 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
ll mod(ll a) {
if (a > 0)
return a % MOD;
if (a % MOD == 0)
return 0;
ll x = -a / MOD + 1;
a += x * MOD;
return a % MOD;
}
template <typename T> void dump(T x) { cout << x << endl; }
void dumpf(double x, int t) { cout << setprecision(t) << fixed << x << endl; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
// int dx[4] = {1, 0, -1, 0};
// int dy[4] = {0, 1, 0, -1};
// ll pas[5001][5002];
int main() {
IOS();
ll n, k;
cin >> n >> k;
dump(2 * k - 1 <= n ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
void IOS() { ios::sync_with_stdio(false), cin.tie(0); }
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
ll mod(ll a) {
if (a > 0)
return a % MOD;
if (a % MOD == 0)
return 0;
ll x = -a / MOD + 1;
a += x * MOD;
return a % MOD;
}
template <typename T> void dump(T x) { cout << x << endl; }
void dumpf(double x, int t) { cout << setprecision(t) << fixed << x << endl; }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
// int dx[4] = {1, 0, -1, 0};
// int dy[4] = {0, 1, 0, -1};
// ll pas[5001][5002];
int main() {
IOS();
ll n, k;
cin >> n >> k;
dump(2 * k - 1 <= n ? "YES" : "NO");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 931,308 | 931,309 | u872959410 | cpp |
p03129 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a > (b << 1))
puts("YES");
else
puts("NO");
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a >= (b << 1) - 1)
puts("YES");
else
puts("NO");
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,310 | 931,311 | u058288007 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int mx = (n + 1) / 2;
if (mx <= k)
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int mx = (n + 1) / 2;
if (k <= mx)
cout << "YES";
else
cout << "NO";
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 931,314 | 931,315 | u151669663 | cpp |
p03129 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
a %= MOD;
}
int main(void) {
int n, k;
cin >> n >> k;
++n;
n /= 2;
cout << ((n < k) ? "No" : "Yes") << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
a %= MOD;
}
int main(void) {
int n, k;
cin >> n >> k;
++n;
n /= 2;
cout << ((n < k) ? "NO" : "YES") << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,316 | 931,317 | u548624367 | cpp |
p03129 | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
if (i % 2)
k--;
}
if (k <= 0)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
if (i % 2)
k--;
}
if (k <= 0)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,318 | 931,319 | u178725037 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long int n, k;
cin >> n >> k;
if ((n / 2) + 1 < k)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
long long int n, k;
cin >> n >> k;
if ((n / 2) + n % 2 < k)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 931,322 | 931,323 | u116076146 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i += 2)
k--;
if (k <= 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i += 2)
k--;
if (k <= 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,324 | 931,325 | u364987137 | cpp |
p03129 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (n > k) {
cout << "YES"
<< "\n";
} else {
cout << "NO"
<< "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (n + 1 >= k * 2) {
cout << "YES"
<< "\n";
} else {
cout << "NO"
<< "\n";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,329 | 931,330 | u269981094 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k <= n / 2 + 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k <= (n - 1) / 2 + 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,337 | 931,338 | u076936237 | cpp |
p03129 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
#ifdef LOCAL
#define cerr (cerr << "-- line " << __LINE__ << " -- ")
#else
class CerrDummy {
} cerrDummy;
template <class T> CerrDummy &operator<<(CerrDummy &cd, const T &) {
return cd;
}
using charTDummy = char;
using traitsDummy = char_traits<charTDummy>;
CerrDummy &operator<<(CerrDummy &cd,
basic_ostream<charTDummy, traitsDummy> &(
basic_ostream<charTDummy, traitsDummy> &)) {
return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr << "reached" << endl
#define DMP(x) cerr << #x << ":" << x << endl
#define ZERO(x) memset(x, 0, sizeof(x))
#define ONE(x) memset(x, -1, sizeof(x))
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
#define CAPITAL
void Yes(bool ex = true) {
#ifdef CAPITAL
cout << "YES" << endl;
#else
cout << "Yes" << endl;
#endif
if (ex)
exit(0);
}
void No(bool ex = true) {
#ifdef CAPITAL
cout << "NO" << endl;
#else
cout << "No" << endl;
#endif
if (ex)
exit(0);
}
const ll infLL = LLONG_MAX / 3;
#ifdef int
const int inf = infLL;
#else
const int inf = INT_MAX / 2 - 100;
#endif
signed main() {
int N = read(), K = read();
if (round(N / 2.0) > K)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
#ifdef LOCAL
#define cerr (cerr << "-- line " << __LINE__ << " -- ")
#else
class CerrDummy {
} cerrDummy;
template <class T> CerrDummy &operator<<(CerrDummy &cd, const T &) {
return cd;
}
using charTDummy = char;
using traitsDummy = char_traits<charTDummy>;
CerrDummy &operator<<(CerrDummy &cd,
basic_ostream<charTDummy, traitsDummy> &(
basic_ostream<charTDummy, traitsDummy> &)) {
return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr << "reached" << endl
#define DMP(x) cerr << #x << ":" << x << endl
#define ZERO(x) memset(x, 0, sizeof(x))
#define ONE(x) memset(x, -1, sizeof(x))
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
#define CAPITAL
void Yes(bool ex = true) {
#ifdef CAPITAL
cout << "YES" << endl;
#else
cout << "Yes" << endl;
#endif
if (ex)
exit(0);
}
void No(bool ex = true) {
#ifdef CAPITAL
cout << "NO" << endl;
#else
cout << "No" << endl;
#endif
if (ex)
exit(0);
}
const ll infLL = LLONG_MAX / 3;
#ifdef int
const int inf = infLL;
#else
const int inf = INT_MAX / 2 - 100;
#endif
signed main() {
int N = read(), K = read();
if (round(N / 2.0) >= K)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,339 | 931,340 | u700484101 | cpp |
p03129 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
#ifdef LOCAL
#define cerr (cerr << "-- line " << __LINE__ << " -- ")
#else
class CerrDummy {
} cerrDummy;
template <class T> CerrDummy &operator<<(CerrDummy &cd, const T &) {
return cd;
}
using charTDummy = char;
using traitsDummy = char_traits<charTDummy>;
CerrDummy &operator<<(CerrDummy &cd,
basic_ostream<charTDummy, traitsDummy> &(
basic_ostream<charTDummy, traitsDummy> &)) {
return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr << "reached" << endl
#define DMP(x) cerr << #x << ":" << x << endl
#define ZERO(x) memset(x, 0, sizeof(x))
#define ONE(x) memset(x, -1, sizeof(x))
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
#define CAPITAL
void Yes(bool ex = true) {
#ifdef CAPITAL
cout << "YES" << endl;
#else
cout << "Yes" << endl;
#endif
if (ex)
exit(0);
}
void No(bool ex = true) {
#ifdef CAPITAL
cout << "NO" << endl;
#else
cout << "No" << endl;
#endif
if (ex)
exit(0);
}
const ll infLL = LLONG_MAX / 3;
#ifdef int
const int inf = infLL;
#else
const int inf = INT_MAX / 2 - 100;
#endif
signed main() {
int N = read(), K = read();
if (round(N / 2.0) <= K)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
#ifdef LOCAL
#define cerr (cerr << "-- line " << __LINE__ << " -- ")
#else
class CerrDummy {
} cerrDummy;
template <class T> CerrDummy &operator<<(CerrDummy &cd, const T &) {
return cd;
}
using charTDummy = char;
using traitsDummy = char_traits<charTDummy>;
CerrDummy &operator<<(CerrDummy &cd,
basic_ostream<charTDummy, traitsDummy> &(
basic_ostream<charTDummy, traitsDummy> &)) {
return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr << "reached" << endl
#define DMP(x) cerr << #x << ":" << x << endl
#define ZERO(x) memset(x, 0, sizeof(x))
#define ONE(x) memset(x, -1, sizeof(x))
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
REP(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
ll read() {
ll i;
scanf("%" SCNd64, &i);
return i;
}
void printSpace() { printf(" "); }
void printEoln() { printf("\n"); }
void print(ll x, int suc = 1) {
printf("%" PRId64, x);
if (suc == 1)
printEoln();
if (suc == 2)
printSpace();
}
string readString() {
static char buf[3341000];
scanf("%s", buf);
return string(buf);
}
char *readCharArray() {
static char buf[3341000];
static int bufUsed = 0;
char *ret = buf + bufUsed;
scanf("%s", ret);
bufUsed += strlen(ret) + 1;
return ret;
}
template <class T, class U> void chmax(T &a, U b) {
if (a < b)
a = b;
}
template <class T, class U> void chmin(T &a, U b) {
if (b < a)
a = b;
}
template <class T> T Sq(const T &t) { return t * t; }
#define CAPITAL
void Yes(bool ex = true) {
#ifdef CAPITAL
cout << "YES" << endl;
#else
cout << "Yes" << endl;
#endif
if (ex)
exit(0);
}
void No(bool ex = true) {
#ifdef CAPITAL
cout << "NO" << endl;
#else
cout << "No" << endl;
#endif
if (ex)
exit(0);
}
const ll infLL = LLONG_MAX / 3;
#ifdef int
const int inf = infLL;
#else
const int inf = INT_MAX / 2 - 100;
#endif
signed main() {
int N = read(), K = read();
if (round(N / 2.0) >= K)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,341 | 931,340 | u700484101 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define INF 1100000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007
#define Decimal fixed << setpresicion(20)
#define SHOWP(x) cerr << "(" << (x).FI << ", " << (x).SE << ")" << endl;
#define SHOWX(x) cerr << #x << ": " << x << endl;
#define SHOWVEC(v, e) \
REP(i, e) cerr << (v[i]) << ' '; \
cerr << endl;
#define SHOW2D(a, h, w) \
REP(i, h) { \
REP(j, w) cerr << setw(3) << (a[i][j]) << ' '; \
cerr << endl; \
}
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int N, K;
cin >> N >> K;
if (K <= N / 2 + 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define INF 1100000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007
#define Decimal fixed << setpresicion(20)
#define SHOWP(x) cerr << "(" << (x).FI << ", " << (x).SE << ")" << endl;
#define SHOWX(x) cerr << #x << ": " << x << endl;
#define SHOWVEC(v, e) \
REP(i, e) cerr << (v[i]) << ' '; \
cerr << endl;
#define SHOW2D(a, h, w) \
REP(i, h) { \
REP(j, w) cerr << setw(3) << (a[i][j]) << ' '; \
cerr << endl; \
}
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int N, K;
cin >> N >> K;
if (K <= (N + 1) / 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 931,346 | 931,347 | u973997867 | cpp |
p03129 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m <= ((n - 1) / 2 + 1))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m <= ((n - 1) / 2 + 1))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,357 | 931,358 | u190234543 | cpp |
p03129 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define pb push_back
#define mp make_pair
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define repf(i, st, end, inc) for (int i = st; i < end; i += inc)
#define repb(i, st, end, dec) for (int i = st; i >= end; i -= dec)
#define MOD 1000000007
#define trace1(a) cout << a << endl;
#define trace2(a, b) cout << a << " | " << b << endl;
#define trace3(a, b, c) cout << a << " | " << b << " | " << c << endl;
#define trace4(a, b, c, d) \
cout << a << " | " << b << " | " << c << " | " << d << endl;
using namespace std;
using namespace std::chrono;
int main() {
fast;
auto start = high_resolution_clock::now();
int n, k;
cin >> n >> k;
if (n >= 2 * k - 1)
cout << "Yes";
else
cout << "No";
auto stop = high_resolution_clock::now();
auto duration = duration_cast<microseconds>(stop - start);
// cout << endl;
// cout << double(duration.count()) / 1000000 << endl;
return 0;
}
| #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define pb push_back
#define mp make_pair
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define repf(i, st, end, inc) for (int i = st; i < end; i += inc)
#define repb(i, st, end, dec) for (int i = st; i >= end; i -= dec)
#define MOD 1000000007
#define trace1(a) cout << a << endl;
#define trace2(a, b) cout << a << " | " << b << endl;
#define trace3(a, b, c) cout << a << " | " << b << " | " << c << endl;
#define trace4(a, b, c, d) \
cout << a << " | " << b << " | " << c << " | " << d << endl;
using namespace std;
using namespace std::chrono;
int main() {
fast;
auto start = high_resolution_clock::now();
int n, k;
cin >> n >> k;
if (n >= 2 * k - 1)
cout << "YES";
else
cout << "NO";
auto stop = high_resolution_clock::now();
auto duration = duration_cast<microseconds>(stop - start);
// cout << endl;
// cout << double(duration.count()) / 1000000 << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,359 | 931,360 | u506626378 | cpp |
p03129 | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
bool ans = false;
if (N % 2 == 0) {
ans = K < N / 2;
} else {
ans = K <= (N + 1) / 2;
}
cout << (ans ? "YES" : "NO") << endl;
return 0;
}
| #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
bool ans = false;
if (N % 2 == 0) {
ans = K <= N / 2;
} else {
ans = K <= (N + 1) / 2;
}
cout << (ans ? "YES" : "NO") << endl;
return 0;
}
| [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 931,363 | 931,364 | u642210599 | cpp |
p03129 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <numeric>
#include <sstream>
#include <vector>
int main() {
int N, K;
int res;
std::cin >> N >> K;
if (K * 2 - 1 <= N)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <numeric>
#include <sstream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
if (K * 2 - 1 <= N)
std::cout << "YES" << std::endl;
else
std::cout << "NO" << std::endl;
return 0;
}
| [
"variable_declaration.remove",
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 931,369 | 931,370 | u005702636 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define EPS (1e-5)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#define YN(f) ((f) ? "YES" : "NO")
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N, K;
cin >> N >> K;
cout << YN(K <= N - 1) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define EPS (1e-5)
#define MOD ((int)1e9 + 7)
#define endl "\n"
#define yn(f) ((f) ? "Yes" : "No")
#define YN(f) ((f) ? "YES" : "NO")
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N, K;
cin >> N >> K;
cout << YN(K <= (N + 1) / 2) << endl;
return 0;
} | [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 931,374 | 931,375 | u233393801 | cpp |
p03129 | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d %d", &n, &k);
if ((n + 1) / 2 >= k)
printf("Yes");
else
printf("No");
} | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d %d", &n, &k);
if ((n + 1) / 2 >= k)
printf("YES");
else
printf("NO");
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,378 | 931,379 | u356991267 | cpp |
p03129 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K = 0;
cin >> N >> K;
string s = "";
if ((double)N / 2 - 0.5 < K) {
s = "YES";
} else {
s = "NO";
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K = 0;
cin >> N >> K;
string s = "";
if ((double)N / 2 + 0.5 >= K) {
s = "YES";
} else {
s = "NO";
}
cout << s << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 931,380 | 931,381 | u798514691 | cpp |
p03129 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K = 0;
cin >> N >> K;
string s = "";
if ((double)N / 2 - 0.5 <= K) {
s = "YES";
} else {
s = "NO";
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K = 0;
cin >> N >> K;
string s = "";
if ((double)N / 2 + 0.5 >= K) {
s = "YES";
} else {
s = "NO";
}
cout << s << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 931,382 | 931,381 | u798514691 | cpp |
p03129 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N + 1 / 2 * K >= 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N + 1 - 2 * K >= 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 931,385 | 931,386 | u086366728 | cpp |
p03129 | //#pragma GCC optimize(2)
// Happy TLE and WA every day!
// by: zxb the vegetable chicken
#include <bits/stdc++.h>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define foreach(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define BINF 0x7fffffff
#define INF 0x3f3f3f3f
#define LINF 4557430888798830399
#define pb push_back
#define F first
#define S second
#define Time clock() / CLOCKS_PER_SEC
#define read ZXBs_fast_input
#define write ZXBs_fast_output
//#define usingFiles
using namespace std;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef long long ll;
inline bool read(int &x) {
x = 0;
int c;
int sign = 1;
while ((c = getchar()) < '0' || c > '9')
if (c == '-')
sign = -1;
x = c ^ '0';
while ((c = getchar()) >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ '0');
x *= sign;
return 1;
}
inline bool write(int x) {
if (x >= 10)
write(x / 10);
putchar(x % 10 + '0');
return 1;
}
const int rp = 666666;
const bool debug = 1;
const bool I_good_vegetable_a = 1;
signed main() {
ios::sync_with_stdio(false);
#ifdef usingFiles
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
if ((n + 1) / 2 <= k)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | //#pragma GCC optimize(2)
// Happy TLE and WA every day!
// by: zxb the vegetable chicken
#include <bits/stdc++.h>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define foreach(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define BINF 0x7fffffff
#define INF 0x3f3f3f3f
#define LINF 4557430888798830399
#define pb push_back
#define F first
#define S second
#define Time clock() / CLOCKS_PER_SEC
#define read ZXBs_fast_input
#define write ZXBs_fast_output
//#define usingFiles
using namespace std;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef long long ll;
inline bool read(int &x) {
x = 0;
int c;
int sign = 1;
while ((c = getchar()) < '0' || c > '9')
if (c == '-')
sign = -1;
x = c ^ '0';
while ((c = getchar()) >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ '0');
x *= sign;
return 1;
}
inline bool write(int x) {
if (x >= 10)
write(x / 10);
putchar(x % 10 + '0');
return 1;
}
const int rp = 666666;
const bool debug = 1;
const bool I_good_vegetable_a = 1;
signed main() {
ios::sync_with_stdio(false);
#ifdef usingFiles
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,391 | 931,392 | u083800325 | cpp |
p03129 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n / 2 + n % 2 > k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n / 2 + n % 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,393 | 931,394 | u382826454 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = (a + 1) / b;
if (c < b)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = (a + 1) / 2;
if (c < b)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 931,401 | 931,402 | u127856129 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = (a + 1) / b;
if (c > b)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = (a + 1) / 2;
if (c < b)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,403 | 931,402 | u127856129 | cpp |
p03129 | #include <iostream>
using namespace std;
int main(void) {
int n, k;
n = 0;
k = 0;
cin >> n >> k;
if (n % 2 != 0) {
if ((n + 1) / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (n / 2 > k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, k;
n = 0;
k = 0;
cin >> n >> k;
if (n % 2 != 0) {
if ((n + 1) / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (n / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,406 | 931,407 | u229603190 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
bool yes = false;
if (n % 2 == 0) {
yes = (n / 2) >= k;
} else {
yes = (n / 2) + 1 >= k;
}
cout << (yes ? "Yes" : "No") << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
bool yes = false;
if (n % 2 == 0) {
yes = (n / 2) >= k;
} else {
yes = (n / 2) + 1 >= k;
}
cout << (yes ? "YES" : "NO") << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,410 | 931,411 | u452317942 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, ans;
cin >> n >> k;
ans = n / 2;
if (ans % 2 == 1)
ans++;
if (ans >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, ans;
cin >> n >> k;
ans = n / 2;
if (n % 2 == 1)
ans++;
if (ans >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 931,421 | 931,422 | u591914971 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, ans;
cin >> n >> k;
ans = n / 2;
if (ans % 2 == 1)
ans++;
if (ans > k)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, ans;
cin >> n >> k;
ans = n / 2;
if (n % 2 == 1)
ans++;
if (ans >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 931,423 | 931,422 | u591914971 | cpp |
p03129 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
// start of 0uts1de's library
int cin_int_arr(vector<int> &arr) {
for (int i = 0; i < arr.size(); ++i) {
cin >> arr.at(i);
}
return 0;
}
int cin_int_arr(vector<int> &arr, int n) { // overload
for (int i = 0; i < n; ++i) {
cin >> arr.at(i);
}
return 0;
}
int cin_double_arr(vector<double> &arr) {
for (int i = 0; i < arr.size(); ++i) {
cin >> arr.at(i);
}
return 0;
}
int cin_double_arr(vector<double> &arr, int n) { // overload
for (int i = 0; i < n; ++i) {
cin >> arr.at(i);
}
return 0;
}
int cout_int_arr(vector<int> &arr) {
for (int i = 0; i < arr.size(); ++i) {
cout << arr.at(i) << endl;
}
return 0;
}
int cout_int_arr(vector<int> &arr, int n) { // overload
for (int i = 0; i < n; ++i) {
cout << arr.at(i) << endl;
}
return 0;
}
int cout_double_arr(vector<double> &arr) {
for (int i = 0; i < arr.size(); ++i) {
cout << arr.at(i) << endl;
}
return 0;
}
int cout_double_arr(vector<double> &arr, int n) { // overload
for (int i = 0; i < n; ++i) {
cout << arr.at(i) << endl;
}
return 0;
}
int max_int_arr(std::vector<int> &arr) { // data mode
int maxVal = INT_MIN; // min of int
for (int i = 0; i < arr.size(); ++i) {
if (arr.at(i) > maxVal) {
maxVal = arr.at(i);
}
}
return maxVal;
}
int max_int_arr(std::vector<int> &arr, int mode) { // overload index mode
int maxVal = INT_MIN; // min of int
int maxIndex = 0;
for (int i = 0; i < arr.size(); ++i) {
if (arr.at(i) > maxVal) {
maxVal = arr.at(i);
maxIndex = i;
}
}
return maxIndex;
}
double max_double_arr(std::vector<double> &arr) { // data mode
double maxVal = -DBL_MAX; // min of double
for (int i = 0; i < arr.size(); ++i) {
if (arr.at(i) > maxVal) {
maxVal = arr.at(i);
}
}
return maxVal;
}
int max_double_arr(std::vector<double> &arr, int mode) { // overload index mode
double maxVal = -DBL_MAX; // min of double
int maxIndex = 0;
for (int i = 0; i < arr.size(); ++i) {
if (arr.at(i) > maxVal) {
maxVal = arr.at(i);
maxIndex = i;
}
}
return maxIndex;
}
// end of 0uts1de's library
int main() {
int n, k;
cin >> n >> k;
if (n / 2 > k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
// start of 0uts1de's library
int cin_int_arr(vector<int> &arr) {
for (int i = 0; i < arr.size(); ++i) {
cin >> arr.at(i);
}
return 0;
}
int cin_int_arr(vector<int> &arr, int n) { // overload
for (int i = 0; i < n; ++i) {
cin >> arr.at(i);
}
return 0;
}
int cin_double_arr(vector<double> &arr) {
for (int i = 0; i < arr.size(); ++i) {
cin >> arr.at(i);
}
return 0;
}
int cin_double_arr(vector<double> &arr, int n) { // overload
for (int i = 0; i < n; ++i) {
cin >> arr.at(i);
}
return 0;
}
int cout_int_arr(vector<int> &arr) {
for (int i = 0; i < arr.size(); ++i) {
cout << arr.at(i) << endl;
}
return 0;
}
int cout_int_arr(vector<int> &arr, int n) { // overload
for (int i = 0; i < n; ++i) {
cout << arr.at(i) << endl;
}
return 0;
}
int cout_double_arr(vector<double> &arr) {
for (int i = 0; i < arr.size(); ++i) {
cout << arr.at(i) << endl;
}
return 0;
}
int cout_double_arr(vector<double> &arr, int n) { // overload
for (int i = 0; i < n; ++i) {
cout << arr.at(i) << endl;
}
return 0;
}
int max_int_arr(std::vector<int> &arr) { // data mode
int maxVal = INT_MIN; // min of int
for (int i = 0; i < arr.size(); ++i) {
if (arr.at(i) > maxVal) {
maxVal = arr.at(i);
}
}
return maxVal;
}
int max_int_arr(std::vector<int> &arr, int mode) { // overload index mode
int maxVal = INT_MIN; // min of int
int maxIndex = 0;
for (int i = 0; i < arr.size(); ++i) {
if (arr.at(i) > maxVal) {
maxVal = arr.at(i);
maxIndex = i;
}
}
return maxIndex;
}
double max_double_arr(std::vector<double> &arr) { // data mode
double maxVal = -DBL_MAX; // min of double
for (int i = 0; i < arr.size(); ++i) {
if (arr.at(i) > maxVal) {
maxVal = arr.at(i);
}
}
return maxVal;
}
int max_double_arr(std::vector<double> &arr, int mode) { // overload index mode
double maxVal = -DBL_MAX; // min of double
int maxIndex = 0;
for (int i = 0; i < arr.size(); ++i) {
if (arr.at(i) > maxVal) {
maxVal = arr.at(i);
maxIndex = i;
}
}
return maxIndex;
}
// end of 0uts1de's library
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 931,426 | 931,427 | u833117432 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
if (n > 2 * k - 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
if (n < 2 * k - 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,428 | 931,429 | u517935400 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, K;
scanf("%d%d", &n, &K);
if (n % 2 == 0)
--n;
n = n / 2 + 1;
(n >= K) ? puts("Yes") : puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, K;
scanf("%d%d", &n, &K);
if (n % 2 == 0)
--n;
n = n / 2 + 1;
(n >= K) ? puts("YES") : puts("NO");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,436 | 931,437 | u469934619 | cpp |
p03129 | // 09, 02, 2019, 10:01:29 Rafaelcs cpp
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
if (n / 2 + 1 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | // 09, 02, 2019, 10:01:29 Rafaelcs cpp
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 931,440 | 931,441 | u215522871 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = (0); (i) < (n); ++i)
#define ll long long
#define INF 1000000000
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int(i) = (0); (i) < (n); ++i)
#define ll long long
#define INF 1000000000
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,442 | 931,443 | u263518976 | cpp |
p03129 | /**
* @author torith
* @date 2019-02-09
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int K;
cin >> K;
if (N % 2 == 1) {
if (N / 2 + 1 >= K)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
} else {
if (N / 2 >= K)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
}
return 0;
}
| /**
* @author torith
* @date 2019-02-09
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int K;
cin >> K;
if (N % 2 == 1) {
if (N / 2 + 1 >= K)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
} else {
if (N / 2 >= K)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,444 | 931,445 | u278446060 | cpp |
p03129 | #include <cstdio>
int main() {
int n, k;
scanf("%d%d", &n, &k);
puts(k > (n + 1) / 2 ? "No" : "Yes");
}
| #include <cstdio>
int main() {
int n, k;
scanf("%d%d", &n, &k);
puts(k > (n + 1) / 2 ? "NO" : "YES");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,450 | 931,451 | u760178976 | cpp |
p03129 | #include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int LL;
typedef vector<int> VI;
int main() {
int N, K;
cin >> N >> K;
if (N > K * 2 - 1) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | #include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int LL;
typedef vector<int> VI;
int main() {
int N, K;
cin >> N >> K;
if (N < K * 2 - 1) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,455 | 931,457 | u597940868 | cpp |
p03129 | #include <stdio.h>
int main() {
int N, K;
scanf("%d %d", &N, &K);
if ((N + 1) > K) {
printf("YES\n");
} else {
printf("NO\n");
}
} | #include <stdio.h>
int main() {
int N, K;
scanf("%d %d", &N, &K);
if ((N + 1) / 2 >= K) {
printf("YES\n");
} else {
printf("NO\n");
}
}
| [
"control_flow.branch.if.condition.change"
] | 931,492 | 931,495 | u686303803 | cpp |
p03129 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n / 2 > k - 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
if (n / 2 > k - 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 931,498 | 931,501 | u702906718 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
if (((n / 2) + 1) >= k)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
if (((n + 1) / 2) >= k)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,510 | 931,515 | u055148700 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define sync \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
sync int n, k;
cin >> n >> k;
if (n / 3 + 1 >= k)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sync \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
sync int n, k;
cin >> n >> k;
if ((n / 2 + n % 2) >= k)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"identifier.replace.add",
"literal.replace.remove"
] | 931,518 | 931,520 | u325552314 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N >= (K * 2 + 1)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N >= (K * 2 - 1)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 931,523 | 931,525 | u934064105 | cpp |
p03129 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n + 1 / 2 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 931,534 | 931,536 | u654240084 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n >= k * 2 - 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n >= k * 2 - 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,555 | 931,558 | u071198097 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N >= 2 * K)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N >= 2 * K - 1)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,560 | 931,562 | u957204897 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n > (k + 1) / 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k > (n + 1) / 2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 931,563 | 931,565 | u501008235 | cpp |
p03129 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,567 | 931,569 | u371535422 | cpp |
p03129 | #include <cstdlib>
#include <iostream>
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n, k;
std::cin >> n >> k;
std::cout << ((n > k) ? "YES" : "NO") << std::endl;
return EXIT_SUCCESS;
}
| #include <cstdlib>
#include <iostream>
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n, k;
std::cin >> n >> k;
std::cout << ((n >= k * 2 - 1) ? "YES" : "NO") << std::endl;
return EXIT_SUCCESS;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 931,575 | 931,577 | u350906518 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = n / 2;
if (n % 2 != 0) {
ans++;
}
if (k <= ans) {
cout << "Yes";
} else {
cout << "No";
}
cout << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = n / 2;
if (n % 2 != 0) {
ans++;
}
if (k <= ans) {
cout << "YES";
} else {
cout << "NO";
}
cout << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,581 | 931,582 | u622878217 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vector<signed> v;
signed main() {
int n, k;
cin >> n >> k;
int ans = n / 2 + 1;
cout << (ans >= k ? "YES" : "NO") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vector<signed> v;
signed main() {
int n, k;
cin >> n >> k;
int ans = (n - 1) / 2 + 1;
cout << (ans >= k ? "YES" : "NO") << endl;
return 0;
}
| [] | 931,588 | 931,590 | u423624748 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
for (int i = 0; i <= n; i += 2)
ans++;
if (ans >= k || k == 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
for (int i = 1; i <= n; i += 2)
ans++;
if (ans >= k || k == 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 931,592 | 931,594 | u136378781 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
for (int i = 0; i <= n; i += 2)
ans++;
if (ans >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
for (int i = 1; i <= n; i += 2)
ans++;
if (ans >= k || k == 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 931,596 | 931,594 | u136378781 | cpp |
p03129 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a / 2 + 1 >= b)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a + 1 >= b * 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 931,598 | 931,600 | u903311413 | cpp |
p03129 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a / 2 >= b)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a + 1 >= b * 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,601 | 931,600 | u903311413 | cpp |
p03129 | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) for (int i = (a); i > (b); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 0)
#define WHITE 1 //๏ผๆช่จชๅ๏ผ
#define GRAY \
2 //๏ผ่จชๅ๏ผๆชใ ใซ่จชๅใใฆใใชใ้ ็นใธใฎ่พบใๆใฃใฆใใใในใฟใใฏใซ้้ฟใ
#define BLACK 3 //๏ผ่จชๅๅฎไบ๏ผๆช่จชๅใธใฎ้ ็นใธใฎ่พบใๆใใชใ
#define N 100
#define INFTY (1 << 21) // 10^21
int M[N][N]; //้ฃๆฅ่กๅ
int color[N];
// 1ๅไธใใๆ่จๅจใ
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//ไธๅณไธๅทฆ
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> Vector;
typedef vector<Vector> DVector;
int n;
//้
ๅใฎ่กจ็คบ
void printArray(int array[], int n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int k;
int cnt = 0;
cin >> n >> k;
if (n % 2) {
//ไฝใๆใ
cnt = n / 2 + 1;
} else {
cnt = n / 2;
}
// cout << cnt << endl;
if (cnt <= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
// cin.sync_with_stdio(false);
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR_EQ(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOR_RE(i, a, b) for (int i = (a); i > (b); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep_eq(i, n) FOR_EQ(i, 0, n)
#define rep_re(i, n) FOR_RE(i, n, 0)
#define WHITE 1 //๏ผๆช่จชๅ๏ผ
#define GRAY \
2 //๏ผ่จชๅ๏ผๆชใ ใซ่จชๅใใฆใใชใ้ ็นใธใฎ่พบใๆใฃใฆใใใในใฟใใฏใซ้้ฟใ
#define BLACK 3 //๏ผ่จชๅๅฎไบ๏ผๆช่จชๅใธใฎ้ ็นใธใฎ่พบใๆใใชใ
#define N 100
#define INFTY (1 << 21) // 10^21
int M[N][N]; //้ฃๆฅ่กๅ
int color[N];
// 1ๅไธใใๆ่จๅจใ
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//ไธๅณไธๅทฆ
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
static const int NIL = -1;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> Vector;
typedef vector<Vector> DVector;
int n;
//้
ๅใฎ่กจ็คบ
void printArray(int array[], int n) {
rep(i, n) {
if (i)
cout << " ";
cout << array[i];
}
cout << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int k;
int cnt = 0;
cin >> n >> k;
if (n % 2) {
//ไฝใๆใ
cnt = n / 2 + 1;
} else {
cnt = n / 2;
}
// cout << cnt << endl;
if (k <= cnt) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 931,608 | 931,610 | u669551866 | cpp |
p03129 | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = a; i < n; i++)
#define RREP(i, a, n) for (ll i = n - 1; i >= a; i--)
typedef long long ll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (1 + 2 * (k - 1) <= n)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = a; i < n; i++)
#define RREP(i, a, n) for (ll i = n - 1; i >= a; i--)
typedef long long ll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (1 + 2 * (k - 1) <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,612 | 931,614 | u204337666 | cpp |
p03129 | #pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define mod 1000000007
#define int long long
#define inf (1LL << 30)
const int maxnodes = 1005;
#define LL long long
#define N 1001
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
if ((n + 1) / 2 <= k)
cout << "YES";
else
cout << "NO";
return 0;
} | #pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define mod 1000000007
#define int long long
#define inf (1LL << 30)
const int maxnodes = 1005;
#define LL long long
#define N 1001
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,616 | 931,618 | u811982971 | cpp |
p03129 | //
// atcoder.cpp
//
//
// Created by ไธญๅท้ฟๆดฅๅฟ on 2018/12/05.
//
#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
//#include "atcoder.hpp"
long long gcd(long long a, long long b) {
if (a > b)
swap(a, b);
auto r = b % a;
return (r ? gcd(r, a) : a);
}
int main() {
int N, K;
cin >> N >> K;
REP(i, N) { int a, b; }
cout << ((N + 1) / 2 <= K ? "YES" : "NO") << endl;
return 0;
}
| //
// atcoder.cpp
//
//
// Created by ไธญๅท้ฟๆดฅๅฟ on 2018/12/05.
//
#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
//#include "atcoder.hpp"
long long gcd(long long a, long long b) {
if (a > b)
swap(a, b);
auto r = b % a;
return (r ? gcd(r, a) : a);
}
int main() {
int N, K;
cin >> N >> K;
REP(i, N) { int a, b; }
cout << ((N + 1) / 2 >= K ? "YES" : "NO") << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 931,620 | 931,622 | u766779796 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
bool finished = false;
if (N % 2 == 1) {
if (K <= (N + 1) / 2)
finished = true;
} else {
if (K <= N / 2)
finished = true;
}
if (finished)
cout << "YES" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
bool finished = false;
if (N % 2 == 1) {
if (K <= (N + 1) / 2)
finished = true;
} else {
if (K <= N / 2)
finished = true;
}
if (finished)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,453 | 931,456 | u086199024 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 1e9
typedef long long int ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (2 * (k - 1) <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 1e9
typedef long long int ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (2 * (k - 1) + 1 <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,461 | 931,462 | u811528179 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 1e9
typedef long long int ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((k + 1) / 2 <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 1e9
typedef long long int ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (2 * (k - 1) + 1 <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 931,464 | 931,462 | u811528179 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
if (k * 2 - 1 <= n)
cout << 'YES' << endl;
else
cout << 'NO' << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
if (k * 2 - 1 <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 931,471 | 931,473 | u259652259 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define forn(i, x, n) for (int i = x; i < n; i++)
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long double ld;
typedef long long ll;
template <typename... Args> void dbg(Args &&...args) {
using expander = int[];
(void)expander{
0,
(static_cast<void>(void(cout << std::forward<Args>(args) << " ")), 0)...};
cout << endl;
}
void gen() { exit(0); }
int n, k;
void input() { scanf("%d %d", &n, &k); }
void solve() {
int x = n - (n / 3);
if (x >= k) {
printf("YES\n");
} else {
printf("NO\n");
}
}
void clean() { scanf(" "); }
int main() {
#ifdef DEBUG
freopen("input", "r", stdin);
// freopen("output", "w", stdout);
// gen();
while (!feof(stdin)) {
#endif
input();
solve();
#ifdef DEBUG
clean();
}
#endif
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define forn(i, x, n) for (int i = x; i < n; i++)
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
typedef long double ld;
typedef long long ll;
template <typename... Args> void dbg(Args &&...args) {
using expander = int[];
(void)expander{
0,
(static_cast<void>(void(cout << std::forward<Args>(args) << " ")), 0)...};
cout << endl;
}
void gen() { exit(0); }
int n, k;
void input() { scanf("%d %d", &n, &k); }
void solve() {
int x = n - (n / 2);
if (x >= k) {
printf("YES\n");
} else {
printf("NO\n");
}
}
void clean() { scanf(" "); }
int main() {
#ifdef DEBUG
freopen("input", "r", stdin);
// freopen("output", "w", stdout);
// gen();
while (!feof(stdin)) {
#endif
input();
solve();
#ifdef DEBUG
clean();
}
#endif
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 931,481 | 931,482 | u304782567 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k;
cin >> n >> k;
if ((n - 1) / 2 >= k) {
cout << "YES";
} else
cout << "NO\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k) {
cout << "YES";
} else
cout << "NO\n";
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 931,496 | 931,497 | u608668320 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A - (A % 2)) / 2 + 1 >= B) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A + (A % 2)) / 2 >= B) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 931,505 | 931,506 | u390306292 | cpp |
p03129 | #include <cstdio>
int main() {
int n, k;
scanf("%d%d", &n, &k);
if ((n + 1) / 2 <= k)
printf("YES\n");
else
printf("NO\n");
return 0;
} | #include <cstdio>
int main() {
int n, k;
scanf("%d%d", &n, &k);
if ((n + 1) / 2 >= k)
printf("YES\n");
else
printf("NO\n");
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,513 | 931,514 | u536406706 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
signed main() {
int n, k;
cin >> n >> k;
if ((n - 1) / k >= 1)
puts("YES");
else
puts("NO");
getchar();
getchar();
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
signed main() {
int n, k;
cin >> n >> k;
if ((n - 1) / 2 + 1 >= k)
puts("YES");
else
puts("NO");
getchar();
getchar();
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 931,516 | 931,517 | u971256474 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
signed main() {
int n, k;
cin >> n >> k;
if ((n - 1) / k >= 1)
puts("YES");
else
puts("NO");
getchar();
getchar();
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ll long long
using namespace std;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
signed main() {
int n, k;
cin >> n >> k;
if ((n - 1) / 2 + 1 >= k)
puts("YES");
else
puts("NO");
getchar();
getchar();
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 931,516 | 931,519 | u971256474 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //ๆ้
#define RALL(obj) (obj).rbegin(), (obj).rend() //้้
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if (n / 2 + n % 2 > k) {
print("YES");
} else {
print("NO");
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end() //ๆ้
#define RALL(obj) (obj).rbegin(), (obj).rend() //้้
#define print(obj) cout << obj << endl
#define scan(obj) cin >> obj
typedef long long ll;
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if (n / 2 + n % 2 >= k) {
print("YES");
} else {
print("NO");
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,521 | 931,522 | u650565403 | cpp |
p03129 | #include <iostream>
// #include<vector>
// #include<algorithm>
// #include<math.h>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
if (N >= (K - 1) * 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} // g++ -std=c++11 test.cpp -o test && ./test | #include <iostream>
// #include<vector>
// #include<algorithm>
// #include<math.h>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
if (N >= (K - 1) * 2 + 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} // g++ -std=c++11 test.cpp -o test && ./test | [
"control_flow.branch.if.condition.change"
] | 931,529 | 931,530 | u822172788 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.