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 <iostream>
// #include<vector>
// #include<algorithm>
// #include<math.h>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
bool result = true;
int count = 1;
for (int i = 1; i <= N; i += 2) {
count++;
}
if (count < K) {
cout << "NO" << endl;
} else {
cout << "YES" << e... | #include <iostream>
// #include<vector>
// #include<algorithm>
// #include<math.h>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
bool result = true;
int count = 1;
for (int i = 1; i + 2 <= N; i += 2) {
count++;
}
if (count < K) {
cout << "NO" << endl;
} else {
cout << "YES" ... | [
"control_flow.loop.for.condition.change"
] | 931,532 | 931,533 | u822172788 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n - k >= k - 1) {
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 >= k - 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,535 | 931,537 | u280512618 | cpp |
p03129 | #pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using... | #pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,541 | 931,543 | u298360432 | cpp |
p03129 | #include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (K <= N / 2 + 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (K <= (N + 1) / 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | #include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (K <= N / 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (K <= (N + 1) / 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | [
"expression.operation.binary.remove"
] | 931,544 | 931,546 | u813840685 | cpp |
p03129 | #include <iostream>
int main(void) {
int N, K;
std::cin >> N >> K;
std::cout << (K <= (N + 1) ? "YES" : "NO") << std::endl;
return 0;
} | #include <iostream>
int main(void) {
int N, K;
std::cin >> N >> K;
std::cout << (K <= (N + 1) / 2 ? "YES" : "NO") << std::endl;
return 0;
} | [
"expression.operation.binary.add"
] | 931,554 | 931,556 | u040550169 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k <= n * 2 + 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
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;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 931,557 | 931,559 | u565219356 | cpp |
p03129 | #include <stdio.h>
int main() {
int N, K;
scanf("%d %d", &N, &K);
int count = 0;
for (int val = 1; val <= N; val += 2) {
count++;
}
if (count <= K) {
printf("NO\n");
} else {
printf("YES\n");
}
} | #include <stdio.h>
int main() {
int N, K;
scanf("%d %d", &N, &K);
int count = 0;
for (int val = 1; val <= N; val += 2) {
count++;
}
if (count < K) {
printf("NO\n");
} else {
printf("YES\n");
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,561 | 931,564 | u657217497 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n - 1) >= k * 2 - 1)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if ((n - 1) / 2 >= k - 1)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 931,566 | 931,568 | u717021668 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = (N + 1) / 2;
if (ans >= K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = (N + 1) / 2;
if (ans >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,570 | 931,572 | u947883560 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | [
"expression.operation.binary.remove"
] | 931,586 | 931,587 | u640323045 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 931,589 | 931,587 | u640323045 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int n, k;
cin >> n >> k;
cout << (k <= n / 2 + n % 2) ? "YES" : "NO";
cout << endl;
exit(0);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int n, k;
cin >> n >> k;
cout << ((k <= n / 2 + n % 2) ? "YES" : "NO");
cout << endl;
exit(0);
}
| [] | 931,591 | 931,593 | u012143329 | cpp |
p03129 | #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;
// typedef tree<
// pair<int, int>, // change type
// null_type,
// less<pa... | #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;
// typedef tree<
// pair<int, int>, // change type
// null_type,
// less<pa... | [
"control_flow.branch.if.condition.change"
] | 931,599 | 931,602 | u611826259 | cpp |
p03129 | #include <bits/stdc++.h>
#define ll long long
#define pll pair<long long, long long>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define Forn(i, n) for (int i = 1; i <= int(n); i++)
using namespace std;
int ma... | #include <bits/stdc++.h>
#define ll long long
#define pll pair<long long, long long>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define Forn(i, n) for (int i = 1; i <= int(n); i++)
using namespace std;
int ma... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,603 | 931,605 | u647463444 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int read() {
char c = getchar();
int x = 0, f = 1;
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
int main() {
int n = read(), k ... | #include <bits/stdc++.h>
using namespace std;
int read() {
char c = getchar();
int x = 0, f = 1;
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
int main() {
int n = read(), k ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,619 | 931,621 | u860104539 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
void doc() {}
void solve() {
int n, k;
cin >> n >> k;
cout << (k >= (n + 1) / 2 ? "YES" : "NO");
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
doc();
solve();
}
| #include <bits/stdc++.h>
using namespace std;
void doc() {}
void solve() {
int n, k;
cin >> n >> k;
cout << (k <= (n + 1) / 2 ? "YES" : "NO");
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
doc();
solve();
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 931,623 | 931,624 | u521455622 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k > (n % 2 == 1 ? n / 2 + 1 : n / 2) + 1 ? "NO" : "YES") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k > (n % 2 == 1 ? n / 2 + 1 : n / 2) ? "NO" : "YES") << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 931,631 | 931,632 | u382073340 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
// string F(int n,int k);
bool F(int n, int k) {
if (2 * (k)-n >= 1) {
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
bool s = F(n, k);
if (s == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// string F(int n,int k);
bool F(int n, int k) {
if (2 * (k)-1 <= n) {
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
bool s = F(n, k);
if (s == true)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 931,635 | 931,636 | u809458301 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
puts(n + 1 >= 2 * k ? "Yes" : "No");
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
puts(n + 1 >= 2 * k ? "YES" : "NO");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,637 | 931,638 | u434765267 | cpp |
p03129 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEB... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define DEBUG
#ifdef DEB... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,641 | 931,642 | u320267258 | cpp |
p03129 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#... | [
"literal.number.change",
"variable_declaration.value.change"
] | 931,643 | 931,644 | u259053514 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define mod 1000000007
#define INF 1e9 + 5
#define fr first
#define se second
#define int long long
#define ll long long
#define PI 3.1415926535
#define pll pair<ll, ll>
#define vl vector<ll>
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define mod 1000000007
#define INF 1e9 + 5
#define fr first
#define se second
#define int long long
#define ll long long
#define PI 3.1415926535
#define pll pair<ll, ll>
#define vl vector<ll>
#de... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,656 | 931,657 | u942813425 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (n * 2 + 1 >= k)
cout << "YES" << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k * 2 - 1 <= n)
cout << "YES" << endl;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 931,662 | 931,663 | u656572785 | cpp |
p03129 | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d %d", &n, &k);
if (n % 2 == 1) {
n--;
}
if (k <= n / 2) {
printf("Yes\n");
} else {
printf("NO\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d %d", &n, &k);
if (n % 2 == 1) {
n++;
}
if (k <= n / 2) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,667 | 931,668 | u217596176 | cpp |
p03129 | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d %d", &n, &k);
if (n % 2 == 1) {
n++;
}
if (k <= n / 2) {
printf("Yes\n");
} else {
printf("NO\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d %d", &n, &k);
if (n % 2 == 1) {
n++;
}
if (k <= n / 2) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 931,669 | 931,668 | u217596176 | cpp |
p03129 | #include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
int judge = 2 * K - 1;
if (N >= judge) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
| #include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
int judge = 2 * K - 1;
if (N >= judge) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,679 | 931,680 | u190018920 | cpp |
p03129 | #include <iostream>
int main(void) {
using namespace std;
int N, K;
cin >> N >> K;
if (N % 2 == 1) {
K += 1;
}
if (N / 2 >= K) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
int main(void) {
using namespace std;
int N, K;
cin >> N >> K;
if (N % 2 == 1) {
N += 1;
}
if (N / 2 >= K) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
return 0;
}
| [
"assignment.variable.change",
"identifier.change"
] | 931,689 | 931,690 | u653206280 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll k, m, n;
ll t[1 << 17], d[1 << 17];
vector<ll> u, v;
int main() {
cin >> n >> k;
for (int i = 1; i < n; i += 2) {
m++;
}
if (m >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll k, m = 0, n;
ll t[1 << 17], d[1 << 17];
vector<ll> u, v;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i += 2) {
m++;
}
if (m >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 931,693 | 931,694 | u394482932 | cpp |
p03129 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 31;
int main() {
int n, k;
cin >> n >> k;
if (n + 1 / 2 >= ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 31;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >... | [
"control_flow.branch.if.condition.change"
] | 931,699 | 931,700 | u999803454 | cpp |
p03129 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 31;
int main() {
int n, k;
cin >> n >> k;
if (n + 1 / 2 > k... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 31;
int main() {
int n, k;
cin >> n >> k;
if ((n + 1) / 2 >... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 931,701 | 931,700 | u999803454 | cpp |
p03129 | #include <cstdio>
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
printf("%s\n", (n / 2 + 1 >= k) ? "YES" : "NO");
return (0);
} | #include <cstdio>
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
printf("%s\n", (n / 2 + n % 2 >= k) ? "YES" : "NO");
return (0);
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 931,702 | 931,703 | u530396049 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int b = 0;
if (N % 2 == 0) {
for (int i = 0; i < N / 2; i++) {
b = b + 1;
}
} else {
for (int j = 0; j < +1; j = j + 2) {
b = b++;
}
}
if (b ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int b = 0;
if (N % 2 == 0) {
for (int i = 0; i < N / 2; i++) {
b = b + 1;
}
} else {
for (int j = 0; j < N + 1; j = j + 2) {
b++;
}
}
if (b >... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 931,709 | 931,710 | u343355096 | cpp |
p03129 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (n - 2 > k)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
if (n - (n / 2) >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 931,714 | 931,715 | u406145181 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef unsigned long long ll;
int main() {
ll N, K;
std::cin >> N >> K;
if (2 * K - 1 <= N) {
std::cout << "Yes" << std::endl... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef unsigned long long ll;
int main() {
ll N, K;
std::cin >> N >> K;
if (2 * K - 1 <= N) {
std::cout << "YES" << std::endl... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 931,718 | 931,719 | u176331779 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, maxv;
cin >> n >> k;
maxv = max((n + 1) / 2, n / 2);
if (maxv <= k)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, maxv;
cin >> n >> k;
maxv = max((n + 1) / 2, n / 2);
if (maxv >= k)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,720 | 931,721 | u543034659 | cpp |
p03129 |
#include <bits/stdc++.h>
#define null ""
#define endl '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fr, to) for (int i = fr; i <= to; ++i)
#define foreach(i, dat) ... |
#include <bits/stdc++.h>
#define null ""
#define endl '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fr, to) for (int i = fr; i <= to; ++i)
#define foreach(i, dat) ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,722 | 931,723 | u263369790 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
/* int i, sum=1;
for(i=0; i<N-2; i++){
sum *= i;
}
if(sum < K) cout << "NO" << endl;
else cout << "YES" << endl;
*/
int sum = N / 2;
if (sum < K)
cout << "NO" << ... | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
/* int i, sum=1;
for(i=0; i<N-2; i++){
sum *= i;
}
if(sum < K) cout << "NO" << endl;
else cout << "YES" << endl;
*/
int sum = (N + 1) / 2;
// cout << sum << endl;
... | [] | 931,724 | 931,725 | u067481442 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
N = N / 2;
} else {
N = N / 2 + 1;
}
if (N >= 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 % 2 == 0) {
N = N / 2;
} else {
N = N / 2 + 1;
}
if (N >= K)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,726 | 931,727 | u915714716 | cpp |
p03129 | #include <iostream>
using namespace std;
int main(void) {
int n, k, max;
cin >> n >> k;
if (n % 2 == 0) {
max = n - 2;
} else {
max = n - 1;
}
if (max >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n, k, max;
cin >> n >> k;
if (n % 2 == 0) {
max = n / 2;
} else {
max = (n + 1) / 2;
}
if (max >= k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"misc.opposites",
"assignment.change"
] | 931,728 | 931,729 | u158734041 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
bool ans = false;
cin >> n >> k;
if (n % 2 == 0) {
if (n / 2 > k) {
ans = true;
}
} else if (n % 2 != 0) {
if ((n + 1) / 2 > k) {
ans = true;
}
}
if (ans)
cout << "YES" << endl;
else
cout << "NO" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
bool ans = false;
cin >> n >> k;
if (n % 2 == 0) {
if (n / 2 >= k) {
ans = true;
}
} else if (n % 2 != 0) {
if ((n + 1) / 2 >= k) {
ans = true;
}
}
if (ans)
cout << "YES" << endl;
else
cout << "NO... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,734 | 931,735 | u250906113 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k, c;
cin >> n >> k;
string s = "No";
c = (n + 1) / 2;
if (k <= c) {
s = "Yes";
}
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k, c;
cin >> n >> k;
string s = "NO";
c = (n + 1) / 2;
if (k <= c) {
s = "YES";
}
cout << s << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 931,738 | 931,739 | u740385803 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,751 | 931,752 | u266874640 | cpp |
p03130 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
vector<int> a(8);
rep(i, 6) { cin >> a[i]; }
vector<int> b(4);
rep(i, 6) {
rep(j, 6) {
if (a[i] == a[j]) {
b[a[i]]++;
break;
}
}
if (b[a[i]] >= 3) {
cout << "No"... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
vector<int> a(8);
rep(i, 6) { cin >> a[i]; }
vector<int> b(4);
rep(i, 6) {
rep(j, 6) {
if (a[i] == a[j]) {
b[a[i]]++;
break;
}
}
if (b[a[i]] >= 3) {
cout << "NO"... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,758 | 931,759 | u451171595 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(6);
vector<int> cnt(4, 0);
for (int i = 0; i < 6; i++) {
cin >> a[i];
cnt[a[i] - 1]++;
}
sort(cnt.begin(), cnt.end());
bool flg = true;
for (int i = 0; i < 4; i++) {
// printf("%d\n",cnt[i]);
if (i < 2 && cnt[i] != 1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(6);
vector<int> cnt(4, 0);
for (int i = 0; i < 6; i++) {
cin >> a[i];
cnt[a[i] - 1]++;
}
sort(cnt.begin(), cnt.end());
bool flg = true;
for (int i = 0; i < 4; i++) {
// printf("%d\n",cnt[i]);
if (i < 2 && cnt[i] != 1)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,760 | 931,761 | u180133008 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | [
"literal.number.change",
"call.arguments.change"
] | 931,762 | 931,763 | u164181205 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(4, 0);
for (int i = 0; i < 6; i++) {
int K;
cin >> K;
vec[K - 1]++;
}
for (int i = 0; i < 4; i++) {
if (vec[i] != 2) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec(4, 0);
for (int i = 0; i < 6; i++) {
int K;
cin >> K;
vec[K - 1]++;
}
for (int i = 0; i < 4; i++) {
if (vec[i] == 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 931,764 | 931,765 | u187772564 | cpp |
p03130 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,766 | 931,767 | u608773191 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 10010... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,772 | 931,773 | u209457657 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int a[6], ap[4];
int main() {
for (int i = 0; i < 6; i++) {
cin >> a[i];
ap[a[i] - 1]++;
}
for (int i = 0; i < 4; i++)
if (ap[i] == 4) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[6], ap[4];
int main() {
for (int i = 0; i < 6; i++) {
cin >> a[i];
ap[a[i] - 1]++;
}
for (int i = 0; i < 4; i++)
if (ap[i] == 3) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 931,774 | 931,775 | u450832845 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) ||... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (h) ||... | [
"literal.number.change",
"call.arguments.change"
] | 931,784 | 931,785 | u813559924 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y... | [
"control_flow.loop.for.condition.change"
] | 931,789 | 931,790 | u765815947 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
vector<int> cnt(4);
int tmp;
rep(i, 3) {
cin >> tmp;
tmp--;
cnt[tmp]++;
}
rep(i, 4) {
if (cnt[i] == ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
vector<int> cnt(4);
int tmp;
rep(i, 6) {
cin >> tmp;
tmp--;
cnt[tmp]++;
}
rep(i, 4) {
if (cnt[i] == ... | [
"literal.number.change",
"call.arguments.change"
] | 931,794 | 931,795 | u552357043 | cpp |
p03130 | #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"
] | 931,798 | 931,799 | u980909653 | cpp |
p03130 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#... | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 931,802 | 931,803 | u927801748 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c[5] = {0};
for (int i = 0; i < 6; i++) {
int ab;
cin >> ab;
c[ab]++;
}
int i;
for (i = 1; i <= 4; i++) {
if (c[i] > 3)
break;
}
if (i == 5)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int c[5] = {0};
for (int i = 0; i < 6; i++) {
int ab;
cin >> ab;
c[ab]++;
}
int i;
for (i = 1; i <= 4; i++) {
if (c[i] >= 3)
break;
}
if (i == 5)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 931,804 | 931,805 | u494609869 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int c[5] = {0};
for (int i = 0; i < 6; i++) {
int ab;
cin >> ab;
c[ab]++;
}
int i;
for (i = 1; i <= 4; i++) {
if (c[i] > 3)
break;
}
if (i == 5)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int c[5] = {0};
for (int i = 0; i < 6; i++) {
int ab;
cin >> ab;
c[ab]++;
}
int i;
for (i = 1; i <= 4; i++) {
if (c[i] >= 3)
break;
}
if (i == 5)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,806 | 931,805 | u494609869 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | [
"literal.number.change",
"call.arguments.change"
] | 931,818 | 931,819 | u545364250 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 931,820 | 931,819 | u545364250 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 931,821 | 931,819 | u545364250 | cpp |
p03130 | #include <algorithm> //辞書順=next_permutation
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <locale>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string> //char 小文字のほうが32大きい
#include <time.h>
#... | #include <algorithm> //辞書順=next_permutation
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <locale>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string> //char 小文字のほうが32大きい
#include <time.h>
#... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 931,824 | 931,825 | u830366840 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int i;
vector<int> v(5);
rep(i, 6) {
cin >> i;
v.at(i)++;
}
if (v.at(1) <= 2 && v.at(2) <= 2 && v.at(3) <= 2 && v.at(4) <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int i;
vector<int> v(5);
rep(j, 6) {
cin >> i;
v.at(i)++;
}
if (v.at(1) <= 2 && v.at(2) <= 2 && v.at(3) <= 2 && v.at(4) <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
... | [
"identifier.change",
"call.arguments.change"
] | 931,830 | 931,831 | u089241640 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int i;
vector<int> v(10);
rep(i, 6) {
cin >> i;
v.at(i)++;
}
if (v.at(1) <= 2 && v.at(2) <= 2 && v.at(3) <= 2 && v.at(4) <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int i;
vector<int> v(5);
rep(j, 6) {
cin >> i;
v.at(i)++;
}
if (v.at(1) <= 2 && v.at(2) <= 2 && v.at(3) <= 2 && v.at(4) <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
... | [
"literal.number.change",
"call.arguments.change",
"identifier.change"
] | 931,832 | 931,831 | u089241640 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
vector<int> g(4, 0);
REP(i, 6) {
int a;
cin >> a;
a--;
g[a]++;
}
REP(i, 4) {
if (g[i] == 0 || g[i] == 3) {
cout << "No"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
void solve() {
vector<int> g(4, 0);
REP(i, 6) {
int a;
cin >> a;
a--;
g[a]++;
}
REP(i, 4) {
if (g[i] == 0 || g[i] == 3) {
cout << "NO"... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,840 | 931,841 | u973991908 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int s[5];
for (int i = 0; i < 5; i++)
s[i] = 0;
for (int i = 0; i < 6; i++) {
int a;
cin >> a;
s[a]++;
}
if (s[1] <= 2 && s[2] <= 2 && s[3] <= 2 && s[4] <= 2)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s[5];
for (int i = 0; i < 5; i++)
s[i] = 0;
for (int i = 0; i < 6; i++) {
int a;
cin >> a;
s[a]++;
}
if (s[1] <= 2 && s[2] <= 2 && s[3] <= 2 && s[4] <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,842 | 931,843 | u955282280 | cpp |
p03130 |
#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 s[4];
rep(i, 3) {
int a, b;
cin >> a >> b;
s[a - 1]++;
... |
#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 s[4] = {};
rep(i, 3) {
int a, b;
cin >> a >> b;
s[a - 1... | [
"variable_declaration.value.change"
] | 931,844 | 931,845 | u561143568 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> data(4);
int a;
for (int i = 0; i < 6; i++) {
cin >> a;
data.at(a - 1)++;
}
int one = 0, two = 0;
for (int i = 0; i < 4; i++) {
if (data.at(i) == 2)
two++;
if (data.at(i) == 1)
one++;
}
int flag = 0;
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> data(4);
int a;
for (int i = 0; i < 6; i++) {
cin >> a;
data.at(a - 1)++;
}
int one = 0, two = 0;
for (int i = 0; i < 4; i++) {
if (data.at(i) == 2)
two++;
if (data.at(i) == 1)
one++;
}
int flag = 0;
if ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,846 | 931,847 | u239087789 | cpp |
p03130 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [
"literal.number.change",
"call.arguments.change"
] | 931,851 | 931,852 | u303039933 | cpp |
p03130 | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FOR(i, m, n) for (int i = m; i < ... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FOR(i, m, n) for (int i = m; i < ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 931,859 | 931,860 | u468262978 | cpp |
p03130 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
vector<int> a(6);
rep(i, 6) cin >> a[i];
vector<int> ans(4);
rep(i, 6) ans[i - 1]++;
bool b = true;
rep(i, 4) {
if (ans[i] = 3)
b = false;
}
if (b)
cout << "YES" << endl... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
vector<int> a(6);
rep(i, 6) cin >> a[i];
vector<int> ans(4);
rep(i, 6) ans[a[i] - 1]++;
bool b = true;
rep(i, 4) {
if (ans[i] == 3)
b = false;
}
if (b)
cout << "YES" << ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 931,861 | 931,862 | u648009244 | cpp |
p03130 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
//定数
#define MOD 1000000007
//マクロ
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n)... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
//定数
#define MOD 1000000007
//マクロ
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reprev(i, n)... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 931,863 | 931,864 | u212083331 | cpp |
p03130 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long lo... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long lo... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 931,865 | 931,866 | u222293734 | cpp |
p03130 | #include "bits/stdc++.h"
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
const long long mod = 1e... | #include "bits/stdc++.h"
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
const long long mod = 1e... | [
"literal.string.change",
"io.output.change"
] | 931,867 | 931,868 | u718774863 | cpp |
p03130 | #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.number.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 931,875 | 931,876 | u412550879 | cpp |
p03130 | #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.number.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 931,877 | 931,876 | u412550879 | cpp |
p03130 | #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... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,878 | 931,879 | u824337972 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != m... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != m... | [
"variable_declaration.value.change"
] | 931,882 | 931,883 | u969116807 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b)-1; (i) >= (a); --(i)) // Re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; --(i)) // Reversi rep
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i)) // Natural for
#define rfor(i, a, b) for (int(i) = (b)-1; (i) >= (a); --(i)) // Re... | [
"expression.operation.binary.add"
] | 931,884 | 931,885 | u801513186 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int city[4] = {};
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a >> b;
city[a - 1]++;
city[b - 1]++;
}
for (int i = 0; i < 3; i++) {
if (city[i] == 0 || city[i] >= 3) {
cout << "NO" << endl;
return 0;
}
}
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int city[4] = {};
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a >> b;
city[a - 1]++;
city[b - 1]++;
}
for (int i = 0; i < 4; i++) {
if (city[i] == 0 || city[i] >= 3) {
cout << "NO" << endl;
return 0;
}
}
cout ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 931,886 | 931,887 | u522200796 | cpp |
p03130 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer 絶対値求めやつ
#include <iomanip> //浮動小数点数を出力する制度の指定
#include <string>
#include <vector>
//使い方 数値をnumとして cout<<setprecision(n)<<num ;nは桁数
#define rep(i, n) for (int i = 0; i < (n); i++)
#defi... | [
"literal.string.change",
"io.output.change"
] | 931,890 | 931,891 | u298620933 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, d = 0;
int c[100] = {};
for (int i = 0; i < 3; i++) {
cin >> a >> b;
c[a]++;
c[b]++;
}
for (int i = 0; i < 5; i++) {
if (c[i] >= 3)
d = 1;
}
if (d)
cout << "YES";
else
cout << "NO";
cout << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, d = 0;
int c[100] = {};
for (int i = 0; i < 3; i++) {
cin >> a >> b;
c[a]++;
c[b]++;
}
for (int i = 0; i < 5; i++) {
if (c[i] >= 3)
d = 1;
}
if (d == 0)
cout << "YES";
else
cout << "NO";
cout << "\n";
} | [
"control_flow.branch.if.condition.change"
] | 931,894 | 931,895 | u831161882 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<int> P(4);
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a;
P[a]++;
cin >> b;
P[b]++;
}
sort(P.begin(), P.end(), greater<int>());
if (P[0] > 2 || P[3] == 0)
cout << "NO" << endl;
else
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
vector<int> P(4);
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a;
P[--a]++;
cin >> b;
P[--b]++;
}
sort(P.begin(), P.end(), greater<int>());
// for(int i = 0; i < 4; i++) cout << P[i] << endl;
if (P[0] ... | [] | 931,898 | 931,899 | u964726243 | cpp |
p03130 | #include <algorithm>
#include <cassert>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main() {
vector<int> vec(4);
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
vec[a]++;
... | #include <algorithm>
#include <cassert>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using ll = unsigned long long;
using namespace std;
int main() {
vector<int> vec(4);
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
vec[a]++;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,902 | 931,903 | u759162415 | cpp |
p03130 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stri... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stri... | [] | 931,908 | 931,909 | u633284019 | cpp |
p03130 | #include <stdio.h>
int main() {
int i, a, b, c[10];
for (i = 0; i < 10; i++)
c[i] = 0;
for (i = 0; i < 3; i++) {
printf("%d%d", &a, &b);
c[a]++;
c[b]++;
}
for (i = 1; i <= 4; i++) {
if (c[i] == 0 || c[i] == 3) {
printf("NO\0");
return 0;
}
}
printf("YES\n");
return 0;... | #include <stdio.h>
int main() {
int i, a, b, c[10];
for (i = 0; i < 10; i++)
c[i] = 0;
for (i = 0; i < 3; i++) {
scanf("%d%d", &a, &b);
c[a]++;
c[b]++;
}
for (i = 1; i <= 4; i++) {
if (c[i] == 0 || c[i] == 3) {
printf("NO\n");
return 0;
}
}
printf("YES\n");
return 0;
... | [
"identifier.change",
"call.function.change",
"io.output.change",
"literal.string.change",
"call.arguments.change",
"io.output.newline.add"
] | 931,910 | 931,911 | u933068010 | cpp |
p03130 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
int cnt[4];
for (int i = 0; i < 6; i++) {
int t;
cin >> t;
cnt[t - 1]++;
}
if (cnt[0] * cnt[1] * cnt[2] * cnt[3] > 0 && cnt[0] < 3 && cnt[1] < 3 &&
cnt[2] <... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
int cnt[4] = {};
for (int i = 0; i < 6; i++) {
int t;
cin >> t;
cnt[t - 1]++;
}
if (cnt[0] * cnt[1] * cnt[2] * cnt[3] > 0 && cnt[0] < 3 && cnt[1] < 3 &&
cnt... | [
"variable_declaration.value.change"
] | 931,914 | 931,915 | u928536113 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | [] | 931,916 | 931,917 | u569778242 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define INF 1e9
#define ALL(v) v.begin(), v.end()
#define max(v) *max_element(v.begin(), v.end())
#define min(v) *min_element(v.begin(), v.end())
using namespace std;
int main(void) {
vector<int> a, b;
int s, t;
for (in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define INF 1e9
#define ALL(v) v.begin(), v.end()
#define max(v) *max_element(v.begin(), v.end())
#define min(v) *min_element(v.begin(), v.end())
using namespace std;
int main(void) {
vector<int> a, b;
int s, t;
for (in... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 931,931 | 931,932 | u054559808 | cpp |
p03130 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | [
"assignment.change"
] | 931,933 | 931,934 | u837951457 | cpp |
p03130 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | [
"assignment.change"
] | 931,935 | 931,934 | u837951457 | cpp |
p03130 |
#include "math.h"
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[4] = {};
int x[6];
for (int i = 0; i < 6; i++) {
cin >> x[i];
}
for (int i = 0; i < 6; i++) {
a[x[i] - 1]++;
if (a[x[i] - 1] == 3) {
cout << "No" << endl;
return 0;
}
}
cout ... |
#include "math.h"
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[4] = {};
int x[6];
for (int i = 0; i < 6; i++) {
cin >> x[i];
}
for (int i = 0; i < 6; i++) {
a[x[i] - 1]++;
if (a[x[i] - 1] == 3) {
cout << "NO" << endl;
return 0;
}
}
cout ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 931,936 | 931,937 | u959822889 | cpp |
p03130 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy ... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy ... | [
"variable_declaration.value.change"
] | 931,938 | 931,939 | u555405510 | cpp |
p03130 | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> count(4, 0);
for (int i = 0; i < 6; i++) {
int a;
cin >> a;
count[a]++;
}
int num = 0;
for (int i = 0; i < 4; i++) {
if (count[i] == 1) {
num++;
}
}
string re... | #include "bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> count(4, 0);
for (int i = 0; i < 6; i++) {
int a;
cin >> a;
a--;
count[a]++;
}
int num = 0;
for (int i = 0; i < 4; i++) {
if (count[i] == 1) {
num++;
}
}
... | [
"expression.unary.arithmetic.add"
] | 931,949 | 931,950 | u487641373 | cpp |
p03130 | #include "bits/stdc++.h"
using namespace std;
int main() {
vector<int> AB(6);
vector<int> cnt(4);
for (int i = 0; i < 6; i++) {
cin >> AB[i];
cnt[AB[i] - 1]++;
}
int res1, res2;
for (int i = 0; i < 4; i++) {
if (cnt[i] == 1)
res1++;
else if (cnt[i] == 2)
res2++;
}
if (res1... | #include "bits/stdc++.h"
using namespace std;
int main() {
vector<int> AB(6);
vector<int> cnt(4);
for (int i = 0; i < 6; i++) {
cin >> AB[i];
cnt[AB[i] - 1]++;
}
int res1 = 0, res2 = 0;
for (int i = 0; i < 4; i++) {
if (cnt[i] == 1)
res1++;
else if (cnt[i] == 2)
res2++;
}
... | [
"variable_declaration.value.change"
] | 931,951 | 931,952 | u365956698 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
#define N 4
#define M 3
int main(void) {
int i, L[N];
pair<int, int> path;
string ans = "YES";
for (i = 0; i < N; i++)
L[i] = 0;
for (i = 0; i < M; i++) {
cin >> path.first >> path.second;
L[path.first - 1]++;
L[path.second - 1]++;
}
for (i =... | #include <bits/stdc++.h>
using namespace std;
#define N 4
#define M 3
int main(void) {
int i, L[N];
pair<int, int> path;
string ans = "YES";
for (i = 0; i < N; i++)
L[i] = 0;
for (i = 0; i < M; i++) {
cin >> path.first >> path.second;
L[path.first - 1]++;
L[path.second - 1]++;
}
for (i =... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 931,957 | 931,958 | u069450081 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[3], b[3];
int ans[5] = {0};
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < 3; i++) {
ans[a[i]]++;
ans[b[i]]++;
}
for (int i = 1; i < 5; i++) {
if (ans[i] >= 3) {
cout << "YES" << endl;
retur... | #include <iostream>
using namespace std;
int main() {
int a[3], b[3];
int ans[5] = {0};
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < 3; i++) {
ans[a[i]]++;
ans[b[i]]++;
}
for (int i = 1; i < 5; i++) {
if (ans[i] >= 3) {
cout << "NO" << endl;
return... | [
"literal.string.change",
"io.output.change"
] | 931,969 | 931,970 | u273110458 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int in[5], i, j, k, x, y;
for (i = 0; i < 3; i++) {
cin >> x >> y;
++in[x];
++in[y];
}
if (in[1] == 0 || in[2] == 0 || in[3] == 0 || in[4] == 0 || in[1] == 3 ||
in[2] == 3 || in[3] == 3 || in[4] == 3)
cout << "NO";
else
cout ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int in[5] = {0}, i, j, k, x, y;
for (i = 0; i < 3; i++) {
cin >> x >> y;
++in[x];
++in[y];
}
if (in[1] == 0 || in[2] == 0 || in[3] == 0 || in[4] == 0 || in[1] == 3 ||
in[2] == 3 || in[3] == 3 || in[4] == 3)
cout << "NO";
else
... | [
"variable_declaration.value.change"
] | 931,975 | 931,976 | u711948228 | cpp |
p03130 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int cnt[4] = {0};
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a >> b;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int cnt[4] = {0};
for (int i = 0; i < 3; i++) {
int a, b;
cin >> a >> b;
... | [] | 931,981 | 931,982 | u105959367 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5] = {0, 0, 0, 0, 0};
int p[6];
bool l = 1;
for (int i = 0; i < 6; i++) {
cin >> p[i];
a[p[i]]++;
}
for (int k = 0; k < 5; k++) {
if (a[k] > 2) {
l = 0;
break;
}
}
if (l = 0) {
cout << "NO" << endl;
} else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5] = {0, 0, 0, 0, 0};
int p[6];
bool l = 1;
for (int i = 0; i < 6; i++) {
cin >> p[i];
a[p[i]]++;
}
for (int k = 0; k < 5; k++) {
if (a[k] > 2) {
l = 0;
break;
}
}
if (l == 0) {
cout << "NO" << endl;
} el... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 931,994 | 931,995 | u833295869 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int num[4] = {0, 0, 0, 0};
for (int i = 0; i < 6; i++) {
int k;
cin >> k;
num[k - 1] += 1;
}
int one, two;
for (int i = 0; i < 4; i++) {
if (num[i] == 1)
one++;
else if (num[i] == 2)
two++;
}
if (one == 2 && two ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num[4] = {0, 0, 0, 0};
for (int i = 0; i < 6; i++) {
int k;
cin >> k;
num[k - 1] += 1;
}
int one = 0, two = 0;
for (int i = 0; i < 4; i++) {
if (num[i] == 1)
one++;
else if (num[i] == 2)
two++;
}
if (one == 2 &... | [
"variable_declaration.value.change"
] | 932,008 | 932,009 | u297590902 | cpp |
p03130 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
... | [
"literal.number.change",
"call.arguments.change"
] | 932,010 | 932,011 | u687470137 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.