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 8
values |
|---|---|---|---|---|---|---|---|
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a > (b + 1) / 2 ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a > (b - 1) * 2 ? "YES" : "NO") << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 930,763 | 930,764 | u991713078 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a > b * 2 - 1 ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a > (b - 1) * 2 ? "YES" : "NO") << endl;
} | [
"expression.operation.binary.remove"
] | 930,765 | 930,764 | u991713078 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a > b ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a > (b - 1) * 2 ? "YES" : "NO") << endl;
} | [
"expression.operation.binary.add"
] | 930,766 | 930,764 | u991713078 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
int count = 1;
for (int i = 1; i <= n; i += 2) {
count++;
}
if (count >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
int count = 0;
for (int i = 1; i <= n; i += 2) {
count++;
}
if (count >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 930,767 | 930,768 | u485821416 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, k;
cin >> n >> k;
bool ok = false;
if (k == 1)
ok = true;
else if (n % 2) {
if (n / 2 > k)
ok = true;
} else {
if (n / 2 >= k)
ok = true;
}
if (ok)
cout << "YES" << '\n... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n, k;
cin >> n >> k;
bool ok = false;
if (k == 1)
ok = true;
else if (n % 2) {
if (n / 2 + 1 >= k)
ok = true;
} else {
if (n / 2 >= k)
ok = true;
}
if (ok)
cout << "YES" <... | [
"control_flow.branch.if.condition.change"
] | 930,771 | 930,772 | u596385287 | cpp |
p03129 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#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;
}
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#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;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,776 | 930,777 | u239409893 | cpp |
p03129 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#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;
}
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#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;
}
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,778 | 930,777 | u239409893 | cpp |
p03129 | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DB cerr << "D" << endl
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const int INF = 1e9;
const ll LINF = 1e18;
const double dINF = 1e18;
c... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DB cerr << "D" << endl
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const int INF = 1e9;
const ll LINF = 1e18;
const double dINF = 1e18;
c... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,779 | 930,780 | u548163222 | cpp |
p03129 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <string>
#include <vector>
// cout << fixed << setprecision(20) << *** << endl;
#define rep(i, N) for (int i ... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <string>
#include <vector>
// cout << fixed << setprecision(20) << *** << endl;
#define rep(i, N) for (int i ... | [
"expression.operation.binary.remove"
] | 930,783 | 930,784 | u230139835 | cpp |
p03129 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n, k;
cin >> n >> k;
cout << (n >= (k - 1) * 2 ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n, k;
cin >> n >> k;
cout << (n >= k * 2 - 1 ? "YES" : "NO") << endl;
} | [
"expression.operation.binary.add"
] | 930,785 | 930,786 | u225660136 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0)
return 1;
if (n % 2 == 0) {
long long t = modpow(m... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 930,789 | 930,790 | u687204015 | cpp |
p03129 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typede... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typede... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,795 | 930,796 | u980909653 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 == K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (N / 2 + 1 == K) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (N / 2 + 1 >= K) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,810 | 930,811 | u629548179 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 == K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} else {
if (N / 2 + 1 == K) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (N / 2 + 1 >= K) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,812 | 930,811 | u629548179 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | [
"literal.number.change",
"expression.operation.binary.change"
] | 930,815 | 930,816 | u995725911 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (n / 2 + 1 < k)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if ((n - 1) / 2 + 1 < k)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 930,817 | 930,818 | u754114382 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } // MAX
int lcm(int a, int b) { return a * b / gcd(a, b); }
// MIN
main() {
int n, k;
cin >> n >> k;
int che = n - (n % 2);
if (che >= k)
cout << "YES" << endl;
else
cout <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } // MAX
int lcm(int a, int b) { return a * b / gcd(a, b); }
// MIN
main() {
int n, k;
cin >> n >> k;
int che = n - n / 2;
if (che >= k)
cout << "YES" << endl;
else
cout << "... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 930,819 | 930,820 | u157433024 | cpp |
p03129 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9 + 1;
const ll INFll = 2e18 + 1;
ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return __gcd(a, b); } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >=... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9 + 1;
const ll INFll = 2e18 + 1;
ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return __gcd(a, b); } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >=... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,823 | 930,824 | u991846372 | cpp |
p03129 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9 + 1;
const ll INFll = 2e18 + 1;
ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return __gcd(a, b); } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
int main() {
int N, K;
cin >> N >> K;
if (N + 1 / 2 >= K... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9 + 1;
const ll INFll = 2e18 + 1;
ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return __gcd(a, b); } //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //最小公倍数
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >=... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,825 | 930,824 | u991846372 | 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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #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 equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 930,831 | 930,832 | u759721333 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <string>
int main() {
int N, K;
std::cin >> N >> K;
std::cout << ((N + 1) / 2 >= K ? "Yes" : "No") << std::endl;
} | #include <algorithm>
#include <iostream>
#include <string>
int main() {
int N, K;
std::cin >> N >> K;
std::cout << ((N + 1) / 2 >= K ? "YES" : "NO") << std::endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 930,838 | 930,839 | u821432765 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N, K;
if (N % 2 == 0) {
if (N / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if... | [] | 930,853 | 930,854 | u767481489 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << (((N + 1) / 2 >= K) ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << (((N + 1) / 2 >= K) ? "YES" : "NO") << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,855 | 930,856 | u217508499 | cpp |
p03129 | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N, K;
cin >> N >> K;
if ((N + 1) / 2 < K)
cout << "No" << endl;
else
... | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N, K;
cin >> N >> K;
if ((N + 1) / 2 < K)
cout << "NO" << endl;
else
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,866 | 930,867 | u331948661 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_... | [
"expression.operation.binary.remove"
] | 930,872 | 930,873 | u722535636 | cpp |
p03129 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
if (n <= k && (n + 1) / 2 >= k) {
cout ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
if (n >= k && (n + 1) / 2 >= k) {
cout ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,876 | 930,875 | u561143568 | cpp |
p03129 | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
//問題読み間違えた．．．
int main() {
ll N, K;
cin >> N >> K;
//奇数同士を選ぶと最大の選び方ができる
if (N / 2 + 1 >=... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
//問題読み間違えた．．．
int main() {
ll N, K;
cin >> N >> K;
//奇数同士を選ぶと最大の選び方ができる
if (N / 2 + N % ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 930,877 | 930,878 | u048791623 | cpp |
p03129 | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
int main() {
ll N, K;
cin >> N >> K;
if (N - 1 >= K) {
cout << "YES" << endl;
} el... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
//問題読み間違えた．．．
int main() {
ll N, K;
cin >> N >> K;
//奇数同士を選ぶと最大の選び方ができる
if (N / 2 + N % ... | [
"control_flow.branch.if.condition.change"
] | 930,879 | 930,878 | u048791623 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define lp(start, finish) for (int i = start; i < finish; i++)
#define read freopen("input.txt", "r", stdin);
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int main() {
// read
int n, k;
cin >> n >> k;
int gap = 0;
lp(1, n + 1) {
gap++;... | #include <bits/stdc++.h>
using namespace std;
#define lp(start, finish) for (int i = start; i < finish; i++)
#define read freopen("input.txt", "r", stdin);
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int main() {
// read
int n, k;
cin >> n >> k;
int gap = 0;
lp(1, n + 1) {
gap++;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,882 | 930,883 | u369847413 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string ans = "NO";
if ((n / 2) + (n % 2) <= k) {
ans = "YES";
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string ans = "NO";
if ((n / 2) + (n % 2) >= k) {
ans = "YES";
}
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,884 | 930,885 | u323864528 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,886 | 930,887 | u347057617 | cpp |
p03129 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a + b - 1) / b
#define ok cout << "ok" << endl;
#define sp << ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a + b - 1) / b
#define ok cout << "ok" << endl;
#define sp << ... | [
"call.add",
"call.arguments.change"
] | 930,888 | 930,889 | u026620445 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int s = 1;
int cou = 1;
while (1) {
if (cou == k || s > n) {
if (s > n) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
break;
}
s += 2;
cou++;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int s = 1;
int cou = 1;
while (1) {
if (cou == k || s > n) {
if (s > n) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
break;
}
s += 2;
cou++;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,890 | 930,891 | u457483230 | cpp |
p03129 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll flag;
if (n % 2 == 0) {
flag = n / 2;
} else {
flag = n /... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll flag;
if (n % 2 == 0) {
flag = n / 2;
} else {
flag = n /... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,894 | 930,895 | u473023730 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
cout << (n / 2 <= k ? "YES" : "NO") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
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"
] | 930,896 | 930,897 | u970690920 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + 1 >= b) {
cout << "YES";
} else
cout << "NO";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + 1 >= b * 2) {
cout << "YES";
} else
cout << "NO";
}
| [
"control_flow.branch.if.condition.change"
] | 930,908 | 930,909 | u222643545 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + 1 >= b) {
cout << "Yes";
} else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + 1 >= b * 2) {
cout << "YES";
} else
cout << "NO";
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,910 | 930,909 | u222643545 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << ((N + 1) / 2 > K ? "YES" : "No") << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << ((N + 1) / 2 >= K ? "YES" : "NO") << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change",
"literal.string.case.change"
] | 930,911 | 930,912 | u620626180 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 == k)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k)
cout << "YES";
else
cout << "NO";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,921 | 930,922 | u021358975 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::c... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::c... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 930,925 | 930,926 | u155216115 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000;
double PI = 3.1415926535;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<pair<ll, ll>>>;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll INF = 100000000;
double PI = 3.1415926535;
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<pair<ll, ll>>>;
int main() {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,931 | 930,932 | u393754572 | cpp |
p03129 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"call.arguments.change"
] | 930,933 | 930,934 | u043443359 | cpp |
p03129 | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
const int maxn = 205;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N, K;
cin >> N >> K;
int l = 1;
while (K--)
l += 2;... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
const int maxn = 205;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N, K;
cin >> N >> K;
int l = 1;
--K;
while (K--)
... | [
"expression.unary.arithmetic.add"
] | 930,941 | 930,942 | u506628560 | cpp |
p03129 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const bool DEBAG = fa... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const bool DEBAG = fa... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,943 | 930,944 | u412550879 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL << 60)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,945 | 930,946 | u592610268 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a / 2 > b) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if ((a + 1) / 2 >= b) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 930,947 | 930,948 | u259356079 | cpp |
p03129 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typede... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,953 | 930,954 | u824337972 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 29) - 1;
int main() {
int N, K;
cin >> N >> K;
string result = ((N + 1) / 2 <= K) ? "YES" : "NO";
cout ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 29) - 1;
int main() {
int N, K;
cin >> N >> K;
string result = ((N + 1) / 2 >= K) ? "YES" : "NO";
cout ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 930,957 | 930,958 | u680707192 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int cnt = n / 2 + n % 2;
if (cnt >= k) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int cnt = n / 2 + n % 2;
if (cnt >= k) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,959 | 930,960 | u960687982 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((int)(n * 0.5 + 0.5) >= k) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((int)(n * 0.5 + 0.5) >= k) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,961 | 930,962 | u912087911 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define INF ((1 << 30) - 1) // int32_t
#define MOD 1000000007
#define MOD2
#define all(a) (a).begin(), (a).end()
#define mkp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
bool flag = false;
... | #include <bits/stdc++.h>
using namespace std;
#define INF ((1 << 30) - 1) // int32_t
#define MOD 1000000007
#define MOD2
#define all(a) (a).begin(), (a).end()
#define mkp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
bool flag = false;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,968 | 930,969 | u355424600 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N < (2 * K - 1)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N < (2 * K - 1)) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,970 | 930,971 | u747415691 | cpp |
p03129 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,972 | 930,973 | u132033278 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a > b) {
cout << "YES" << '\n';
} else
cout << "NO" << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a >= b * 2 - 1) {
cout << "YES" << '\n';
} else
cout << "NO" << '\n';
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,974 | 930,975 | u623468376 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define be begin()
#define en end()
#define le length()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (__typeof(n) i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define be begin()
#define en end()
#define le length()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (__typeof(n) i = 0; i < n; i+... | [
"control_flow.branch.if.condition.change"
] | 930,976 | 930,977 | u062908837 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | [
"control_flow.branch.if.condition.change"
] | 930,983 | 930,984 | u225581241 | cpp |
p03129 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#inc... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#inc... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,985 | 930,986 | u180077477 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
n++;
if (n / 2 >= k)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
n++;
if (n / 2 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,987 | 930,988 | u207048881 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 930,991 | 930,992 | u608258653 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b * 2 <= a) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b * 2 - 1 <= a) {
cout << "YES\n";
} else {
cout << "NO\n";
}
} | [
"control_flow.branch.if.condition.change"
] | 930,993 | 930,994 | u652908807 | cpp |
p03129 | #include <algorithm>
#include <cassert>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int m = (k - 1) * 2 + 1;
if (m <= n) {
cout << "Yes" << endl;
} else {
cout <... | #include <algorithm>
#include <cassert>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int m = (k - 1) * 2 + 1;
if (m <= n) {
cout << "YES" << endl;
} else {
cout <... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 930,997 | 930,998 | u759162415 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <... | [
"literal.string.change",
"io.output.change"
] | 930,999 | 931,000 | u820341516 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,001 | 931,000 | u820341516 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int tmp = 1;
for (int i = 0; i < K; i++) {
tmp += 2;
}
if (tmp <= N) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int tmp = 1;
for (int i = 1; i < K; i++) {
tmp += 2;
}
if (tmp <= N) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 931,010 | 931,011 | u273355214 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
int n, k;
cin >> n >> k;
cout << (n / 2 + 1 <= k ? "YES" : "NO") << endl;
// end
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
int n, k;
cin >> n >> k;
cout << (k * 2 - 1 <= n ? "YES" : "NO") << endl;
// end
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"identifier.change"
] | 931,012 | 931,013 | u376234649 | cpp |
p03129 | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
typedef long long ll;
using namespace std;
const int N = 1e5;
int a[N + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
if (k ... | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
typedef long long ll;
using namespace std;
const int N = 1e5;
int a[N + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
if (k ... | [
"control_flow.branch.if.condition.change"
] | 931,027 | 931,028 | u409343817 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, k;
cin >> n >> k;
if (n - 1 >= k) {
cout << "YES... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, k;
cin >> n >> k;
if (k * 2 - 1 <= n) {
cout << ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 931,037 | 931,038 | u167755809 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n >= 2 * k + 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n >= 2 * k - 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 931,039 | 931,040 | u244626757 | cpp |
p03129 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define mp make_pair... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define mp make_pair... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,051 | 931,052 | u949755084 | cpp |
p03129 | #include <stdio.h>
int main(void) {
int N, K;
scanf("%d%d", &N, &K);
int A;
A = N + 1;
if (N % 2 == 0) {
if (N / 2 >= K) {
printf("Yes");
} else
printf("No");
} else {
if (A / 2 >= K) {
printf("Yes");
} else
printf("No");
}
return 0;
} | #include <stdio.h>
int main(void) {
int N, K;
scanf("%d%d", &N, &K);
int A;
A = N + 1;
if (N % 2 == 0) {
if (N / 2 >= K) {
printf("YES");
} else
printf("NO");
} else {
if (A / 2 >= K) {
printf("YES");
} else
printf("NO");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,061 | 931,062 | u956941456 | cpp |
p03129 | // https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_a?lang=en
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K;
cin >> N;
cin >> K;
int odd = N % 2;
if (K <= (N / 2 + odd))
cout << "Yes";
else
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K;
cin >> N;
cin >> K;
int odd = N % 2;
// cout << odd;
if (K <= (N / 2 + odd))
cout << "YES";
else
cout << "NO";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,063 | 931,064 | u594294012 | cpp |
p03129 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 931,085 | 931,086 | u493750228 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int max_k = (n + 1) / 2;
if (k < max_k)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int max_k = (n + 1) / 2;
if (k > max_k)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,090 | 931,091 | u089032001 | cpp |
p03129 | #include <iostream>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if (n / 2 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
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,104 | 931,105 | u141004837 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
if ((n + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
if ((n + ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,108 | 931,109 | u029876051 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int x = 1 * 2 * (k - 1);
if (x <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int x = 1 + 2 * (k - 1);
if (x <= n)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 931,110 | 931,111 | u546943614 | cpp |
p03129 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,117 | 931,118 | u388817534 | cpp |
p03129 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {... | [] | 931,121 | 931,122 | u129134470 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
ll n, k;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
if (n >= k * 3 + 1)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
ll n, k;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
if (n >= k * 2 - 1)
cout << "YES";
else
cout << "NO";
return 0;
} | [] | 931,125 | 931,126 | u327144291 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K)
cout << "YES";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K)
cout << "YES";
else
cout << "NO";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,127 | 931,128 | u890354065 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
if (K <= (N + 1) / 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
if (K <= (N + 1) / 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,131 | 931,132 | u069450081 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int num = n % 2 ? n / 2 + 1 : n / 2;
if (num < k) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int num = n % 2 ? n / 2 + 1 : n / 2;
if (num < k) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,139 | 931,140 | u865604924 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n / 2 + 1 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
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.operation.binary.remove"
] | 931,143 | 931,144 | u376079344 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n / 2.0 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
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",
"literal.number.change"
] | 931,145 | 931,144 | u376079344 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n / 2 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
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,146 | 931,144 | u376079344 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n / 2) + 1 >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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,153 | 931,154 | u846686917 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
unsigned char N, K;
cin >> N >> K;
if (K <= (N + 1) / 2)
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)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 931,157 | 931,158 | u693212819 | cpp |
p03129 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,165 | 931,166 | u010004797 | cpp |
p03129 | #include <algorithm>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
using namespace std;
#define DIV 998244353
int main() {
int n, k;
scanf("%d %d", &n, &k);
if (k >= (n + 1) / 2)
printf("YES\n");
else
printf("NO\n");
} | #include <algorithm>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
#define ll long long
using namespace std;
#define DIV 998244353
int main() {
int n, k;
scanf("%d %d", &n, &k);
if (k <= (n + 1) / 2)
printf("YES\n");
else
printf("NO\n");
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,169 | 931,170 | u866617792 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N <= K)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N < 2 * K - 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,173 | 931,174 | u994577348 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (1 + (b - 1) * 2 <= a)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (1 + (b - 1) * 2 <= a)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,193 | 931,194 | u425701555 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n - 1 < k)
cout << "NO";
else
cout << "YES";
}
| #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 < k)
cout << "NO";
else
cout << "YES";
}
| [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 931,201 | 931,202 | u808738521 | cpp |
p03129 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define pb push_back
#defi... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define pb push_back
#defi... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,205 | 931,206 | u578035814 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 >= K) {
cout << " YES" << endl;
} else {
cout << " NO" << endl;
}
} else {
if (N / 2 + 1 >= K) {
cout << " YES" << endl;
} else {
cout << " NO" << endl;
}... | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (N / 2 + 1 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}... | [
"literal.string.change",
"io.output.change"
] | 931,207 | 931,208 | u360564214 | cpp |
p03129 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define IL inline
using namespace std;
typedef long long LL;
typedef unsig... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define IL inline
using namespace std;
typedef long long LL;
typedef unsig... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 931,211 | 931,212 | u595215321 | cpp |
p03129 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll n, k;
cin >> n >> k;
if (n / 2 >= k)
co... | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll n, k;
cin >> n >> k;
if ((n + 1) / 2 >= k)
... | [
"control_flow.branch.if.condition.change"
] | 931,213 | 931,214 | u828752458 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef double db;
typedef long long ll;
typedef pair<int, int> P;
int n, k;
int main() {
scanf("%d%d", &n, &k);
puts(n <= 2 * k - 1 ? "YES" : "NO");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef double db;
typedef long long ll;
typedef pair<int, int> P;
int n, k;
int main() {
scanf("%d%d", &n, &k);
puts(n >= 2 * k - 1 ? "YES" : "NO");
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 931,220 | 931,221 | u182914272 | cpp |
p03129 | // Author: Jinhai Chen
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int main() {
#ifdef CJHCJH
// freopen("data.in","r",stdin);
#endif
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k * 2 - 1 <= n... | // Author: Jinhai Chen
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int main() {
#ifdef CJHCJH
// freopen("data.in","r",stdin);
#endif
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k * 2 - 1 <= n... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,222 | 931,223 | u645239706 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x *x + y * y)
#define MOD 1e9 + 7
#define sp ' '
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x *x + y * y)
#define MOD 1e9 + 7
#define sp ' '
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 931,231 | 931,232 | u306142032 | cpp |
p03129 | #include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int n, k;
int main() {
scanf("%d%d", &n, &k);
if (k >= (n + 1) / 2) {
printf("YES");
} else {
printf("NO");
}
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int n, k;
int main() {
scanf("%d%d", &n, &k);
if (k > (n + 1) / 2) {
printf("NO");
} else {
printf("YES");
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 931,233 | 931,234 | u396278429 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.