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 |
|---|---|---|---|---|---|---|---|
p03130 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <u... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <u... | [
"expression.operation.binary.add"
] | 932,012 | 932,013 | u576524226 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n;
int b[4];
for (int i = 0; i < 6; i++) {
cin >> n;
b[n - 1]++;
}
int odd = 0;
for (int i = 0; i < 4; i++) {
if (b[i] % 2 == 1) {
odd++;
}
}
cout << (odd == 2 ? "Y... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n;
int b[4] = {0};
for (int i = 0; i < 6; i++) {
cin >> n;
b[n - 1]++;
}
int odd = 0;
for (int i = 0; i < 4; i++) {
if (b[i] % 2 == 1) {
odd++;
}
}
cout << (odd == ... | [
"variable_declaration.value.change"
] | 932,026 | 932,027 | u875541682 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int memo[4];
int main() {
int a, b;
for (int i = 0; i < 3; i++) {
cin >> a >> b;
memo[a]++;
memo[b]++;
}
if (1 <= memo[0] && memo[0] <= 2 && 1 <= memo[1] && memo[1] <= 2 &&
1 <= memo[2] && memo[2] <= 2 && 1 <= memo[3] && memo[3] <= 2) {
cout... | #include <bits/stdc++.h>
using namespace std;
int memo[4];
int main() {
int a, b;
for (int i = 0; i < 3; i++) {
cin >> a >> b;
memo[a - 1]++;
memo[b - 1]++;
}
if (1 <= memo[0] && memo[0] <= 2 && 1 <= memo[1] && memo[1] <= 2 &&
1 <= memo[2] && memo[2] <= 2 && 1 <= memo[3] && memo[3] <= 2) {
... | [
"expression.operation.binary.add"
] | 932,028 | 932,029 | u565219356 | cpp |
p03130 | #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 mai... | #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 mai... | [
"literal.number.change",
"call.arguments.change"
] | 932,030 | 932,031 | u650565403 | cpp |
p03130 | #include <iostream>
// #include<vector>
// #include<algorithm>
// #include<math.h>
using namespace std;
int main() {
int count[4];
int a, b;
for (int i = 0; i < 4; i++) {
count[i] = 0;
}
for (int i = 0; i < 3; i++) {
cin >> a >> b;
count[a]++;
count[b]++;
}
for (int i = 0; i < 4; i++) ... | #include <iostream>
// #include<vector>
// #include<algorithm>
// #include<math.h>
using namespace std;
int main() {
int count[4];
int a, b;
for (int i = 0; i < 4; i++) {
count[i] = 0;
}
for (int i = 0; i < 3; i++) {
cin >> a >> b;
count[a - 1]++;
count[b - 1]++;
}
for (int i = 0; i < ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 932,032 | 932,033 | u822172788 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int i, j, k, n, m, l, f, x, y, z;
string s;
int a[6];
rep(i, 6) cin >> a[i];
int X[4] = {0};
rep(i, 6) { X[a[i]] += 1; }
rep(i, 4) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int i, j, k, n, m, l, f, x, y, z;
string s;
int a[6];
rep(i, 6) cin >> a[i];
int X[6] = {0};
rep(i, 6) { X[a[i]] += 1; }
rep(i, 6) {
if... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 932,034 | 932,035 | u854612287 | cpp |
p03128 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | [
"expression.operation.binary.remove"
] | 932,052 | 932,053 | u856232850 | cpp |
p03128 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int match[10] = {INF, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
int n, m, ans = 0;
cin >> n ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int match[10] = {INF, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main() {
int n, m, ans = 0;
cin >> n ... | [
"control_flow.loop.for.condition.change"
] | 932,073 | 932,074 | u480806810 | cpp |
p03128 | /*
ID: seekho
PROG: friday
LANG: C++14
*/
/* LANG can be C++11 or C++14 for those more recent releases */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds... | /*
ID: seekho
PROG: friday
LANG: C++14
*/
/* LANG can be C++11 or C++14 for those more recent releases */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 932,116 | 932,117 | u325189601 | cpp |
p03130 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | [
"expression.operation.binary.add"
] | 932,139 | 932,140 | u134810655 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int a[5];
int main() {
int x, y;
cin >> x >> y;
a[x]++;
a[y]++;
cin >> x >> y;
a[x]++;
a[y]++;
cin >> x >> y;
a[x]++;
a[y]++;
bool flag = false;
for (int i = 1; i <= 4; i++)
if (a[i] >= 3)
flag = false;
if (flag)
cout << "YES" << endl... | #include <bits/stdc++.h>
using namespace std;
int a[5];
int main() {
int x, y;
cin >> x >> y;
a[x]++;
a[y]++;
cin >> x >> y;
a[x]++;
a[y]++;
cin >> x >> y;
a[x]++;
a[y]++;
bool flag = true;
for (int i = 1; i <= 4; i++)
if (a[i] >= 3)
flag = false;
if (flag)
cout << "YES" << endl;... | [
"misc.opposites",
"variable_declaration.value.change"
] | 932,141 | 932,142 | u676323984 | cpp |
p03130 | /*input
4 2
2 3
3 1
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define... | /*input
4 2
2 3
3 1
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define... | [
"variable_declaration.value.change"
] | 932,145 | 932,146 | u010467501 | cpp |
p03130 | /*input
4 2
2 3
3 1
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define... | /*input
4 2
2 3
3 1
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 932,147 | 932,146 | u010467501 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | [
"literal.string.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 932,148 | 932,149 | u398942100 | cpp |
p03130 | #include <iostream>
#include <vector>
#define MOD (1000000007l)
using namespace std;
int main(void) {
int foo[4] = {0};
for (int i = 0; i < 3; i++) {
int tmp;
cin >> tmp;
foo[tmp - 1]++;
cin >> tmp;
foo[tmp - 1]++;
}
for (int i = 0; i < 3; i++) {
if (foo[i] > 2) {
cout << "NO" <<... | #include <iostream>
#include <vector>
#define MOD (1000000007l)
using namespace std;
int main(void) {
int foo[4] = {0};
for (int i = 0; i < 3; i++) {
int tmp;
cin >> tmp;
foo[tmp - 1]++;
cin >> tmp;
foo[tmp - 1]++;
}
for (int i = 0; i < 4; i++) {
if (foo[i] > 2) {
cout << "NO" <<... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,150 | 932,151 | u995792346 | cpp |
p03130 | #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
lin c[4];
int main(void) {
rep(i, 3) {
lin a, b;
cin >> a >> b;
c[a]++;
c[b]++;
}
... | #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
lin c[4];
int main(void) {
rep(i, 3) {
lin a, b;
cin >> a >> b;
c[a - 1]++;
c[b - 1]... | [
"expression.operation.binary.add"
] | 932,156 | 932,157 | u762193256 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define MOD9 998244353
#define Pi acos(-1)
#define LL long long
#define ULL unsigned l... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define MOD9 998244353
#define Pi acos(-1)
#define LL long long
#define ULL unsigned l... | [
"expression.operation.binary.remove"
] | 932,160 | 932,161 | u246275061 | cpp |
p03130 | #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 c[5... | #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 c[5... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,164 | 932,163 | u114234520 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define lgN 18
#define LL long long int
const int MOD = 1e9 + 7;
vector<int> g[5];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, i;
for (i = 0; i < 3; i++) {
cin >> a >> b;
g[a].push_back(b);
g[b]... | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define lgN 18
#define LL long long int
const int MOD = 1e9 + 7;
vector<int> g[5];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, i;
for (i = 0; i < 3; i++) {
cin >> a >> b;
g[a].push_back(b);
g[b]... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,167 | 932,168 | u248340295 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int deg[1001];
int main() {
int i, x, y;
for (i = 1; i <= 3; i++) {
scanf("%d%d", &x, &y);
deg[x]++;
deg[y]++;
}
int sum = 0;
for (i = 1; i <= 4; i++)
if (deg[i] == 0 || deg[i] >= 2)
sum++;
if (sum == 0)
printf("YES\n");
else
prin... | #include <bits/stdc++.h>
using namespace std;
int deg[1001];
int main() {
int i, x, y;
for (i = 1; i <= 3; i++) {
scanf("%d%d", &x, &y);
deg[x]++;
deg[y]++;
}
int sum = 0;
for (i = 1; i <= 4; i++)
if (deg[i] == 0 || deg[i] >= 3)
sum++;
if (sum == 0)
printf("YES\n");
else
prin... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 932,169 | 932,170 | u137690186 | cpp |
p03130 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, d;
int n[6];
a = 0;
b = 0;
c = 0;
d = 0;
for (int i = 0; i < 6; i++)
cin >> n[i];
for (int i = 0; i < 6; i++) {
if (n[i] == 1) {
a++;
}
if (n[i] == 2) {
b++;
}
if (n[i] == 3) {
c++;
} els... | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, d;
int n[6];
a = 0;
b = 0;
c = 0;
d = 0;
for (int i = 0; i < 6; i++)
cin >> n[i];
for (int i = 0; i < 6; i++) {
if (n[i] == 1) {
a++;
} else if (n[i] == 2) {
b++;
} else if (n[i] == 3) {
c++;
} ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 932,173 | 932,174 | u622742758 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int n;
int m;
int a = 0, b = 0, c = 0, d = 0;
for (int i = 0; i < 4; ++i) {
cin >> n;
cin >> m;
if (n == 1) {
a++;
} else if (n == 2) {
b++;
} else if (n == 3) {
c++;
} else if (n == 4) {
d++;
}
if (m =... | #include <iostream>
using namespace std;
int main() {
int n;
int m;
int a = 0, b = 0, c = 0, d = 0;
for (int i = 0; i < 3; ++i) {
cin >> n;
cin >> m;
if (n == 1) {
a++;
} else if (n == 2) {
b++;
} else if (n == 3) {
c++;
} else if (n == 4) {
d++;
}
if (m =... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,189 | 932,190 | u654470292 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[3];
int b[3];
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
int x[4] = {0};
for (int i = 0; i < 3; i++) {
if (a[i] == 1) {
x[0] += 1;
} else if (a[i] == 2) {
x[1] += 1;
} else if (a[i] == 3) {
x[2] += 1;
... | #include <iostream>
using namespace std;
int main() {
int a[3];
int b[3];
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
int x[4] = {0};
for (int i = 0; i < 3; i++) {
if (a[i] == 1) {
x[0] += 1;
} else if (a[i] == 2) {
x[1] += 1;
} else if (a[i] == 3) {
x[2] += 1;
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,197 | 932,198 | u481856377 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
void solveA() {
int n, k;
cin >> n >> k;
if (k <= (n + 1) / 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
void solveB() {
int a[3], b[3];
int cnt[4] = {0};
bool flg = true;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
... | #include <bits/stdc++.h>
using namespace std;
void solveA() {
int n, k;
cin >> n >> k;
if (k <= (n + 1) / 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
void solveB() {
int a[3], b[3];
int cnt[4] = {0};
bool flg = true;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
... | [
"expression.operation.binary.add"
] | 932,201 | 932,202 | u735499035 | cpp |
p03130 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
int main() {
int towns[4] = {0, 0, 0, 0};
for (int i = 0; i < 3; i++) {
int a, b;
scanf("%d", &a);
scanf("%d", &b);
towns[a]++;
towns[b]++;
}
for (int i = 0... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
int main() {
int towns[4] = {0, 0, 0, 0};
for (int i = 0; i < 3; i++) {
int a, b;
scanf("%d", &a);
scanf("%d", &b);
towns[a - 1]++;
towns[b - 1]++;
}
for (i... | [
"expression.operation.binary.add"
] | 932,205 | 932,206 | u591105068 | cpp |
p03130 | #include <iostream>
#include <map>
using namespace std;
int main() {
int n;
map<int, int> m;
for (int i = 0; i < 6; ++i) {
cin >> n;
m[n]++;
}
for (int i = 0; i < 4; ++i) {
if (m[i] > 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| #include <iostream>
#include <map>
using namespace std;
int main() {
int n;
map<int, int> m;
for (int i = 0; i < 6; ++i) {
cin >> n;
m[n]++;
}
for (int i = 1; i < 5; ++i) {
if (m[i] > 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 932,209 | 932,210 | u843175622 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[3], b[3];
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
int c[4];
for (int i = 0; i < 4; i++) {
c[i] = 0;
}
for (int i = 0; i < 3; i++) {
c[a[i]]++;
c[b[i]]++;
}
for (int i = 0; i < 4; i++) {
if (3 <= c[i]) {
... | #include <iostream>
using namespace std;
int main() {
int a[3], b[3];
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
int c[4];
for (int i = 0; i < 4; i++) {
c[i] = 0;
}
for (int i = 0; i < 3; i++) {
c[a[i] - 1]++;
c[b[i] - 1]++;
}
for (int i = 0; i < 4; i++) {
if (3 <= c[i])... | [
"expression.operation.binary.add"
] | 932,211 | 932,212 | u111160776 | cpp |
p03130 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF 1e+18
#define MOD 1000000007
using namespace std... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF 1e+18
#define MOD 1000000007
using namespace std... | [
"variable_declaration.value.change"
] | 932,213 | 932,214 | u251433890 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[3];
int b[3];
int num[4] = {0, 0, 0, 0};
bool ans = false;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < 3; i++) {
num[a[i] - 1]++;
num[b[i] - 1]++;
}
for (int i = 0; i < 3; i++) {
if (num[i] == 3)... | #include <iostream>
using namespace std;
int main() {
int a[3];
int b[3];
int num[4] = {0, 0, 0, 0};
bool ans = false;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < 3; i++) {
num[a[i] - 1]++;
num[b[i] - 1]++;
}
for (int i = 0; i < 4; i++) {
if (num[i] == 3)... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,215 | 932,216 | u576167201 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[3];
int b[3];
int num[3] = {0, 0, 0};
bool ans = false;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < 3; i++) {
num[a[i] - 1]++;
num[b[i] - 1]++;
}
for (int i = 0; i < 3; i++) {
if (num[i] == 3)
... | #include <iostream>
using namespace std;
int main() {
int a[3];
int b[3];
int num[4] = {0, 0, 0, 0};
bool ans = false;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < 3; i++) {
num[a[i] - 1]++;
num[b[i] - 1]++;
}
for (int i = 0; i < 4; i++) {
if (num[i] == 3)... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,217 | 932,216 | u576167201 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[4];
for (int i = 0; i < 4; i++) {
a[i] = 0;
}
for (int i = 0; i < 6; i++) {
int x = 0;
cin >> x;
a[x] += 1;
}
for (int i = 0; i < 4; i++) {
if (a[i] > 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES"... | #include <iostream>
using namespace std;
int main() {
int a[4];
for (int i = 0; i < 4; i++) {
a[i] = 0;
}
for (int i = 0; i < 6; i++) {
int x = 0;
cin >> x;
a[x - 1] += 1;
}
for (int i = 0; i < 4; i++) {
if (a[i] > 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "... | [
"assignment.change"
] | 932,218 | 932,219 | u076936237 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int count[4] = {0};
for (int i = 0; i < 6; i++) {
int temp;
cin >> temp;
count[temp]++;
}
int ans = 0;
for (int i = 0; i < 4; i++) {
if (count[i] == 3)
ans++;
}
if (ans == 1)
cout << "NO" << endl;
else
cout << "YES... | #include <bits/stdc++.h>
using namespace std;
int main() {
int count[4] = {0};
for (int i = 0; i < 6; i++) {
int temp;
cin >> temp;
temp -= 1;
count[temp]++;
}
int ans = 0;
for (int i = 0; i < 4; i++) {
if (count[i] >= 3)
ans++;
}
if (ans == 1)
cout << "NO" << endl;
else
... | [
"assignment.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,222 | 932,223 | u591914971 | cpp |
p03130 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a[3], b[3], c[4] = {};
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
c[a[i] - 1]++;
c[b[i] - 1]++;
}
if (c[0] == 1 && c[1] == 1 && c[2] == 2 && c[3] == 2) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int a[3], b[3], c[4] = {};
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
c[a[i] - 1]++;
c[b[i] - 1]++;
}
if (c[0] == 1 && c[1] == 1 && c[2] == 2 && c[3] == 2) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,224 | 932,225 | u542670845 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int one = 0, two = 0, th = 0, fr = 0;
int a, b;
for (int i = 0; i < 3; i++) {
cin >> a >> b;
if (a == 1)
one++;
if (a == 2)
two++;
if (a == 3)
th++;
if (a == 4)
fr++;
if (b == 1)
one++;
if (b == 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int one = 0, two = 0, th = 0, fr = 0;
int a, b;
for (int i = 0; i < 3; i++) {
cin >> a >> b;
if (a == 1)
one++;
if (a == 2)
two++;
if (a == 3)
th++;
if (a == 4)
fr++;
if (b == 1)
one++;
if (b == 2... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 932,226 | 932,227 | u527398664 | cpp |
p03130 | // Last Change: 02/09/2019 21:10:27.
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace s... | // Last Change: 02/09/2019 21:22:21.
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace s... | [] | 932,228 | 932,229 | u915934642 | cpp |
p03130 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n[6];
int a[4] = {};
for (int i = 0; i < 6; i++) {
cin >> n[i];
a[n[i]]++;
}
sort(&a[0], &a[4]);
if (a[3] >= 3)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n[6];
int a[4] = {};
for (int i = 0; i < 6; i++) {
cin >> n[i];
a[n[i] - 1]++;
}
sort(&a[0], &a[4]);
if (a[3] >= 3)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 932,236 | 932,237 | u190234543 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int a[4] = {0, 0, 0, 0};
for (int i = 0; i < 6; i++) {
int x;
cin >> x;
a[x - 1]... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int a[4] = {0, 0, 0, 0};
for (int i = 0; i < 6; i++) {
int x;
cin >> x;
a[x - 1]... | [
"variable_declaration.value.change"
] | 932,238 | 932,239 | u285598935 | cpp |
p03130 | #include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) for (int i = (n)-1; 0 <= i; --i)
#define each(e, v) for (auto &&e : (v))
#define all(v) begin(v), end(v)
#define dump(x) cerr << #x << ": " << (x) << endl
using namespace std;
template <class T> vo... | #include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) for (int i = (n)-1; 0 <= i; --i)
#define each(e, v) for (auto &&e : (v))
#define all(v) begin(v), end(v)
#define dump(x) cerr << #x << ": " << (x) << endl
using namespace std;
template <class T> vo... | [
"literal.number.change",
"call.arguments.change"
] | 932,242 | 932,243 | u667543757 | cpp |
p03130 | #include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) for (int i = (n)-1; 0 <= i; --i)
#define each(e, v) for (auto &&e : (v))
#define all(v) begin(v), end(v)
#define dump(x) cerr << #x << ": " << (x) << endl
using namespace std;
template <class T> vo... | #include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) for (int i = (n)-1; 0 <= i; --i)
#define each(e, v) for (auto &&e : (v))
#define all(v) begin(v), end(v)
#define dump(x) cerr << #x << ": " << (x) << endl
using namespace std;
template <class T> vo... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 932,244 | 932,243 | u667543757 | cpp |
p03130 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a[4];
for (int i = 0; i < 3; i++) {
int b, c;
cin >> b >> c;
a[b - 1]++;
a[c - 1]++;
}
int f1 = 0;
int f2 = 0;
for (int i = 0; i < 4; i++) {
if (a[i] == 1)
f1++;
if (a[i] == 2)
f2++;
}
if (... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a[4] = {0};
for (int i = 0; i < 3; i++) {
int b, c;
cin >> b >> c;
a[b - 1]++;
a[c - 1]++;
}
int f1 = 0;
int f2 = 0;
for (int i = 0; i < 4; i++) {
if (a[i] == 1)
f1++;
if (a[i] == 2)
f2++;
}
... | [
"variable_declaration.value.change"
] | 932,245 | 932,246 | u702906718 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a, b;
int ans[4] = {0};
for (int i = 0; i < 3; i++) {
cin >> a >> b;
ans[a]++;
ans[b]++;
}
int c1 = 0;
int c2 = 0;
for (int i = 0; i < 4; i++) {
if (ans[i] == 1) {
c1++;
} else if (ans[i] == 2) {
c2++;
}
}
... | #include <iostream>
using namespace std;
int main() {
int a, b;
int ans[4] = {0};
for (int i = 0; i < 3; i++) {
cin >> a >> b;
ans[a - 1]++;
ans[b - 1]++;
}
int c1 = 0;
int c2 = 0;
for (int i = 0; i < 4; i++) {
if (ans[i] == 1) {
c1++;
} else if (ans[i] == 2) {
c2++;
... | [
"expression.operation.binary.add"
] | 932,247 | 932,248 | u341347211 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define... | [
"expression.operation.binary.add"
] | 932,255 | 932,256 | u196497077 | cpp |
p03130 | #include <cstdio>
#include <utility>
#include <vector>
int main() {
int a[5];
for (int i = 0; i < 6; ++i) {
int j;
scanf("%d", &j);
++a[j];
if (a[j] >= 3)
return !printf("NO\n");
}
puts("YES");
}
| #include <cstdio>
#include <utility>
#include <vector>
int main() {
int a[5] = {};
for (int i = 0; i < 6; ++i) {
int j;
scanf("%d", &j);
++a[j];
if (a[j] >= 3)
return !printf("NO\n");
}
puts("YES");
}
| [
"variable_declaration.value.change"
] | 932,259 | 932,260 | u352499693 | cpp |
p03130 | #include <iostream>
using namespace std; // 575
int main() {
int a, b, c[4] = {0, 0, 0, 0};
for (int i = 0; i < 3; ++i) {
cin >> a >> b;
++c[a];
++c[b];
}
for (int i = 0; i < 4; ++i) {
if (c[i] >= 3) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
/*
31536000のコメント... | #include <iostream>
using namespace std; // 575
int main() {
int a, b, c[4] = {0, 0, 0, 0};
for (int i = 0; i < 3; ++i) {
cin >> a >> b;
++c[a - 1];
++c[b - 1];
}
for (int i = 0; i < 4; ++i) {
if (c[i] >= 3) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
/*
31536... | [
"expression.operation.binary.add"
] | 932,261 | 932,262 | u550314572 | cpp |
p03130 | #include <algorithm>
#include <cctype>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, b, e) for (ll i = (ll)b; i < (ll)e; i++)
#define rep0(i, n) REP(i, 0ll, n)
#define r... | #include <algorithm>
#include <cctype>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, b, e) for (ll i = (ll)b; i < (ll)e; i++)
#define rep0(i, n) REP(i, 0ll, n)
#define r... | [
"expression.unary.arithmetic.add"
] | 932,263 | 932,264 | u297045966 | cpp |
p03130 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,265 | 932,266 | u294159462 | cpp |
p03130 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define dep(i, a,... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define dep(i, a,... | [
"variable_declaration.value.change"
] | 932,267 | 932,268 | u986898382 | cpp |
p03130 | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define endl '\n'... | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define endl '\n'... | [
"variable_declaration.value.change"
] | 932,269 | 932,270 | u666772276 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define nn 65536 * 4
#define ll long long
#define mod 998244353
int in[43];
int main() {
for (int i = 0; i < 3; i++) {
int x, y;
cin >> x >> y;
in[x]++, in[y]++;
}
for (int i = 1; i <= 4; i++)
if (in[i] > 2) {
puts("No");
exit(0);
};
... | #include <bits/stdc++.h>
using namespace std;
#define nn 65536 * 4
#define ll long long
#define mod 998244353
int in[43];
int main() {
for (int i = 0; i < 3; i++) {
int x, y;
cin >> x >> y;
in[x]++, in[y]++;
}
for (int i = 1; i <= 4; i++)
if (in[i] > 2) {
puts("NO");
exit(0);
};
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 932,271 | 932,272 | u395046051 | cpp |
p03130 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"variable_declaration.value.change"
] | 932,273 | 932,274 | u693386219 | cpp |
p03130 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, i, flag = 0;
vector<int> L(6);
vector<int> T(4);
for (i = 0; i < 4; i++) {
T[i] = 0;
}
for (i = 0; i < 6; i++) {
cin >> L[i];
T[L[i] - 1]++;
if (T[L[i] - 1] == 3)
flag = 1;
}
fo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, i, flag = 0;
vector<int> L(6);
vector<int> T(4);
for (i = 0; i < 4; i++) {
T[i] = 0;
}
for (i = 0; i < 6; i++) {
cin >> L[i];
T[L[i] - 1]++;
if (T[L[i] - 1] == 3)
flag = 1;
}
fo... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,281 | 932,282 | u959718851 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int main() {
int a[4];
for (int i = 0; i < 4; i++) {
a[i] = 0;
}
for (int i = 0; i < 6; i++) {
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int main() {
int a[4];
for (int i = 0; i < 4; i++) {
a[i] = 0;
}
for (int i = 0; i < 6; i++) {
int... | [
"expression.operation.binary.add"
] | 932,283 | 932,284 | u649423108 | cpp |
p03130 | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(4, 0);
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a >> b;
v[a]++;
v[b]++;
}
int cnt = 0;
for (auto it : v) {
if (it >= 3) {
cout << "NO";
return 0;
}
if (it == 2) {
cnt++;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> v(5, 0);
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a >> b;
v[a]++;
v[b]++;
}
int cnt = 0;
for (auto it : v) {
if (it >= 3) {
cout << "NO";
return 0;
}
if (it == 2) {
cnt++;
... | [
"literal.number.change",
"call.arguments.change"
] | 932,285 | 932,286 | u931704862 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
int b;
int c[4] = {0};
for (int i = 0; i < 3; i++) {
cin >> a >> b;
c[a]++;
c[b]++;
}
for (int i = 1; i < 4; i++) {
if (c[i] >= 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a;
int b;
int c[5] = {0};
for (int i = 0; i < 3; i++) {
cin >> a >> b;
c[a]++;
c[b]++;
}
for (int i = 1; i <= 4; i++) {
if (c[i] >= 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,287 | 932,288 | u413492096 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,289 | 932,290 | u335839000 | cpp |
p03130 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 9999999999;
const long long MOD = 1e9 + 7;
const double pi = 3.1415926535897932384626;
const int SIZE = 1 << 17;
int cou[5];
int main() {
int k[5], l[5];
for (int i = 0; i < 3; ++i) {
cin >> k[i] >> l[i];
++cou[k[... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 9999999999;
const long long MOD = 1e9 + 7;
const double pi = 3.1415926535897932384626;
const int SIZE = 1 << 17;
int cou[5];
int main() {
int k[5], l[5];
for (int i = 0; i < 3; ++i) {
cin >> k[i] >> l[i];
++cou[k[... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 932,293 | 932,294 | u539402331 | cpp |
p03130 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 9999999999;
const long long MOD = 1e9 + 7;
const double pi = 3.1415926535897932384626;
const int SIZE = 1 << 17;
int cou[5];
int main() {
int k[5], l[5];
for (int i = 0; i < 3; ++i) {
cin >> k[i] >> l[i];
++cou[k[... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const long long INF = 9999999999;
const long long MOD = 1e9 + 7;
const double pi = 3.1415926535897932384626;
const int SIZE = 1 << 17;
int cou[5];
int main() {
int k[5], l[5];
for (int i = 0; i < 3; ++i) {
cin >> k[i] >> l[i];
++cou[k[... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 932,295 | 932,294 | u539402331 | cpp |
p03130 | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
#include <bits/stdc++.h>
using namespace std;
#define y1 y11
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
//#define mp make_pair
#define pb push_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
#include <bits/stdc++.h>
using namespace std;
#define y1 y11
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
//#define mp make_pair
#define pb push_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 932,296 | 932,297 | u980716006 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define FOR(INDEX, START, END) for (int INDEX = (START); INDEX < (END); ++INDEX)
#define REP(INDEX, COUNT) for (int INDEX = 0; INDEX < (COUNT); ++INDEX)
int main() {
int cnt[5] = {0};
REP(i, 6) {
LL v;
cin >> v;
cnt[v]++;
}
bool ... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define FOR(INDEX, START, END) for (int INDEX = (START); INDEX < (END); ++INDEX)
#define REP(INDEX, COUNT) for (int INDEX = 0; INDEX < (COUNT); ++INDEX)
int main() {
int cnt[5] = {0};
REP(i, 6) {
LL v;
cin >> v;
cnt[v]++;
}
bool ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,298 | 932,299 | u658243311 | cpp |
p03130 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int c[4];
int main() {
int a, b;
rep(i, 3) {
cin >> a >> b;
c[a]++;
c[b]++;
}
bool flg = true;
rep(i, 4) flg &= c[i] <= 2;
if (flg)
cout << "YES" <<... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int c[5];
int main() {
int a, b;
rep(i, 3) {
cin >> a >> b;
c[a]++;
c[b]++;
}
bool flg = true;
rep(i, 5) flg &= c[i] <= 2;
if (flg)
cout << "YES" <<... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change"
] | 932,302 | 932,303 | u458187055 | cpp |
p03130 | // Chat I am Trash
#include <bits/stdc++.h>
#define ll long long int
#define FASTIO std::ios::sync_with_stdio(false);
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define inf 1e18
#define debug(x) cout << x << endl
#define all(x) x.begin(), x.end()
using namespace s... | // Chat I am Trash
#include <bits/stdc++.h>
#define ll long long int
#define FASTIO std::ios::sync_with_stdio(false);
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define inf 1e18
#define debug(x) cout << x << endl
#define all(x) x.begin(), x.end()
using namespace s... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,304 | 932,305 | u880004889 | cpp |
p03130 | #include <bits/stdc++.h> //2fat2code a.k.a grandmixer420
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_ba... | #include <bits/stdc++.h> //2fat2code a.k.a grandmixer420
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_ba... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 932,308 | 932,307 | u022510862 | cpp |
p03130 | #include <bits/stdc++.h> //2fat2code a.k.a grandmixer420
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_ba... | #include <bits/stdc++.h> //2fat2code a.k.a grandmixer420
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_ba... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 932,310 | 932,307 | u022510862 | cpp |
p03130 | #include <bits/stdc++.h> //2fat2code a.k.a grandmixer420
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_ba... | #include <bits/stdc++.h> //2fat2code a.k.a grandmixer420
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_ba... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 932,311 | 932,307 | u022510862 | cpp |
p03130 | #include "bits/stdc++.h"
#include <iostream>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, a) for (ll i = 0; i < a; i++)
#define jkl ll debug = 0;
#define RREP(i, a) for (ll i = a - 1; i >= 0; i--)
#define rrep(i, a, b) for (ll i = a - 1; i >= b;... | #include "bits/stdc++.h"
#include <iostream>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, a) for (ll i = 0; i < a; i++)
#define jkl ll debug = 0;
#define RREP(i, a) for (ll i = a - 1; i >= 0; i--)
#define rrep(i, a, b) for (ll i = a - 1; i >= b;... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 932,320 | 932,321 | u009275459 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"identifier.change",
"call.function.change"
] | 932,322 | 932,323 | u096883693 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef double lld;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<double> vdl;
typedef vector<vector<lli>> mat;
typedef vector<vdl> mad;
typedef unordered_map<lli, unordered_map<lli, lli>> graph;
typedef complex<double> cmp;
type... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef double lld;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<double> vdl;
typedef vector<vector<lli>> mat;
typedef vector<vdl> mad;
typedef unordered_map<lli, unordered_map<lli, lli>> graph;
typedef complex<double> cmp;
type... | [
"expression.operation.binary.add"
] | 932,324 | 932,325 | u842401785 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73,... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,326 | 932,327 | u764234894 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
vector<int> b(3);
vector<int> cnt(4);
bool flag = true;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
cnt[a[i]]++;
cnt[b[i]]++;
}
for (int i = 0; i < 4; i++) {
if (cnt[i] >= 3)
flag = false;
}
if (f... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
vector<int> b(3);
vector<int> cnt(5);
bool flag = true;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
cnt[a[i]]++;
cnt[b[i]]++;
}
for (int i = 0; i < 5; i++) {
if (cnt[i] >= 3)
flag = false;
}
if (f... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,328 | 932,329 | u664743926 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll a = 0, b = 0, c = 0, d = 0;
void input() {
int temp;
for (ll i = 0; i < 6; i++) {
cin >> temp;
if (temp == 1) {
a++;
} else if (temp == 2) {
b++;
} else if (temp == 3) {
c++;
} else if (temp == 4) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll a = 0, b = 0, c = 0, d = 0;
void input() {
int temp;
for (ll i = 0; i < 6; i++) {
cin >> temp;
if (temp == 1) {
a++;
} else if (temp == 2) {
b++;
} else if (temp == 3) {
c++;
} else if (temp == 4) {
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,330 | 932,331 | u790171360 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n % 2 == 0 && n / 2 >= k)
cout << "Yes" << endl;
else if (n % 2 == 0 && n / 2 < k)
cout << "No" << endl;
else if (n % 2 == 1 && (n + 1) / 2 >= k)
cout << "Yes" << endl;
else
cout << "No" << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n % 2 == 0 && n / 2 >= k)
cout << "YES" << endl;
else if (n % 2 == 0 && n / 2 < k)
cout << "NO" << endl;
else if (n % 2 == 1 && (n + 1) / 2 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
retur... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,336 | 932,337 | u634527561 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n % 2 == 0 && n / 2 >= k)
cout << "Yes" << endl;
else if (n % 2 == 0 && n / 2 < k)
cout << "No" << endl;
else if (n % 2 == 1 && (n + 1) / 2 >= k)
cout << "Yes" << endl;
else
cout << "No" << endl;
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n % 2 == 0 && n / 2 >= k)
cout << "YES" << endl;
else if (n % 2 == 0 && n / 2 < k)
cout << "NO" << endl;
else if (n % 2 == 1 && (n + 1) / 2 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
retur... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,339 | 932,337 | u634527561 | cpp |
p03129 | #include <iostream>
int n, k;
void kekka(int a, int b);
int main() {
std::cin >> n >> k;
kekka(n, k);
return 0;
}
void kekka(int a, int b) {
// std::cout << a << " " << b << std:: endl;
int sum1, sum2, maxsum;
for (int i = 1; i < a; i++) {
if (i % 2 == 0) {
sum1++;
} else {
sum2++;
... | #include <iostream>
int n, k;
void kekka(int a, int b);
int main() {
std::cin >> n >> k;
kekka(n, k);
return 0;
}
void kekka(int a, int b) {
// std::cout << a << " " << b << std:: endl;
int sum1 = 0, sum2 = 0, maxsum;
for (int i = 1; i <= a; i++) {
if (i % 2 == 0) {
sum1++;
} else {
s... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,345 | 932,346 | u165829448 | cpp |
p03129 | #include <bits/stdc++.h>
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>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,357 | 932,358 | u277354326 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n > k * 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <iostream>
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,363 | 932,364 | u953095464 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n > k * 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <iostream>
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 932,365 | 932,364 | u953095464 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#defi... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 932,366 | 932,367 | u890870565 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i += 2) {
ans++;
}
if (ans <= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i += 2) {
ans++;
}
if (ans >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,372 | 932,373 | u950046716 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a = 0;
cin >> n >> x;
for (int i = 1; i < n; i += 2) {
a++;
}
if (a >= x)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a = 0;
cin >> n >> x;
for (int i = 1; i <= n; i += 2) {
a++;
}
if (a >= x)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,374 | 932,375 | u418568023 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i += 2) {
ans++;
}
if (ans < k) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, k, ans = 0;
cin >> n >> k;
for (int i = 1; i <= n; i += 2) {
ans++;
}
if (k <= ans) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 932,380 | 932,381 | u114838227 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
if ((n + 1) > (2 * k)) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
if ((n + 1) >= (2 * k)) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,385 | 932,386 | u883323885 | cpp |
p03129 | #include <iostream>
#include <string>
using namespace std;
int main() {
int x, t;
cin >> x >> t;
if (t < 0) {
cout << "NO" << endl;
}
if (t == 0) {
cout << "YES" << endl;
}
if (x >= 2 * (t - 1)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int x, t;
cin >> x >> t;
if (t < 0) {
cout << "NO" << endl;
}
if (t == 0) {
cout << "YES" << endl;
}
if (x >= (2 * (t - 1) + 1)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 932,387 | 932,388 | u976439457 | cpp |
p03129 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define MOD 1000000007
#define ll long long
using n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define MOD 1000000007
#define ll long long
using n... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,415 | 932,416 | u388552482 | cpp |
p03129 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,417 | 932,418 | u380908793 | cpp |
p03129 | #include <iostream>
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 <iostream>
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,419 | 932,420 | u856772183 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int 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"
] | 932,424 | 932,425 | u769043786 | cpp |
p03129 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N;
int K;
int J;
cin >> N;
cin >> K;
if (N % 2 == 1) {
N = N + 1;
}
J = N / 2;
if (J > K) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N;
int K;
int J;
cin >> N;
cin >> K;
if (N % 2 == 1) {
N = N + 1;
}
J = N / 2;
if (J >= K) {
cout << "YES";
} else {
cout << "NO";
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,428 | 932,429 | u756614568 | cpp |
p03129 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <vector>
using... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <vector>
using... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 932,433 | 932,434 | u103539599 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N - K <= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (N - K <= 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 == 0) {
if (N - K >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (N - K >= K - 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,435 | 932,436 | u297195722 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string ans = "N0";
if ((N + 1) / 2 >= K)
ans = "YES";
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string ans = "NO";
if ((N + 1) / 2 >= K)
ans = "YES";
cout << ans << endl;
return 0;
} | [
"literal.string.change",
"variable_declaration.value.change"
] | 932,439 | 932,440 | u722397179 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
ll x;
void input() { cin >> N >> M; }
void solve() { x = N / 2 + (N % 2); }
int main(void) {
// Your code here!
input();
solve();
cout << ((M < N) ? "YES" : "NO") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
ll x;
void input() { cin >> N >> M; }
void solve() { x = N / 2 + (N % 2); }
int main(void) {
// Your code here!
input();
solve();
cout << ((M <= x) ? "YES" : "NO") << endl;
}
| [] | 932,441 | 932,442 | u790171360 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
ll x;
void input() { cin >> N >> M; }
void solve() { x = N / 2 + (N % 2); }
int main(void) {
// Your code here!
input();
solve();
cout << ((M < N) ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
ll x;
void input() { cin >> N >> M; }
void solve() { x = N / 2 + (N % 2); }
int main(void) {
// Your code here!
input();
solve();
cout << ((M <= x) ? "YES" : "NO") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,443 | 932,442 | u790171360 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N / 2 < K)
cout << "NO" << endl;
else
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 < K)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 932,454 | 932,455 | u572077985 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if ((n / 2.0 + 1) > k) {
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 ((n / 2.0 + 1) > k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,458 | 932,459 | u743340542 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int cnt = 0;
for (int i = 1; i <= N; i = i + 2) {
// cout << i << " ";
cnt++;
}
// cout << endl;
// cout << cnt << endl;
if (cnt >= K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int cnt = 0;
for (int i = 1; i <= N; i = i + 2) {
// cout << i << " ";
cnt++;
}
// cout << endl;
// cout << cnt << endl;
if (cnt >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,460 | 932,461 | u099535456 | cpp |
p03129 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
if (k <= ceil(n / 2))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iostream>
#include <math.h>
using namespace std;
int main() {
double n, k;
cin >> n >> k;
if (k <= ceil(n / 2))
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,462 | 932,463 | u809700806 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N / 2 + 1) >= K)
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 + N % 2) >= K)
cout << "YES" << endl;
else {
cout << "NO" << endl;
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 932,467 | 932,468 | u376859266 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N / 2) >= K)
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 + N % 2) >= K)
cout << "YES" << endl;
else {
cout << "NO" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 932,469 | 932,468 | u376859266 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N / 2 + 1) > K)
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 + N % 2) >= K)
cout << "YES" << endl;
else {
cout << "NO" << endl;
}
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 932,470 | 932,468 | u376859266 | cpp |
p03129 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,479 | 932,480 | u089869622 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.