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 |
|---|---|---|---|---|---|---|---|
p03688 | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 100003;
int n, a[MaxN], a1, a2;
int s1, s2;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
sort(a + 1, a + n + 1);
if (a[n] - a[1] > 1) {
puts("NO");
return 0;
}
if (a[n] == a[1]) {
if (a[n] == n -... | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 100003;
int n, a[MaxN], a1, a2;
int s1, s2;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
sort(a + 1, a + n + 1);
if (a[n] - a[1] > 1) {
puts("No");
return 0;
}
if (a[n] == a[1]) {
if (a[n] == n -... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,360,071 | 1,360,072 | u949835777 | cpp |
p03688 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define each(a, x) for (auto a : (x))
#define all(a) (a).begin(), (a).end()
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define in_range(x, l, r)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define each(a, x) for (auto a : (x))
#define all(a) (a).begin(), (a).end()
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define in_range(x, l, r)... | [
"expression.operation.binary.add"
] | 1,360,073 | 1,360,074 | u106733072 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int N, A[100000];
bool check(int A_0) {
int kind1 = 0;
for (int i = 0; i < N; i++) {
if (A[i] == A_0)
++kind1;
}
int kind2 = N - kind1;
if (A_0 < kind1 - 1 + (kind2 != 0))
return (false);
int sz = A_0 + 1 - kind1;
while (sz > 0 && kind2 > 1) {... | #include <bits/stdc++.h>
using namespace std;
int N, A[100000];
bool check(int A_0) {
int kind1 = 0;
for (int i = 0; i < N; i++) {
if (A[i] == A_0)
++kind1;
}
int kind2 = N - kind1;
if (A_0 < kind1 - 1 + (kind2 != 0))
return (false);
int sz = A_0 + 1 - kind1;
while (sz > 0 && kind2 > 1) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,360,075 | 1,360,076 | u524343822 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int N, A[100000];
bool check(int A_0) {
int kind1 = 0;
for (int i = 0; i < N; i++) {
if (A[i] == A_0)
++kind1;
}
int kind2 = N - kind1;
if (A_0 < kind1 - 1 + (kind2 != 0))
return (false);
int sz = A_0 + 1 - kind1;
while (sz > 0 && kind2 > 1) {... | #include <bits/stdc++.h>
using namespace std;
int N, A[100000];
bool check(int A_0) {
int kind1 = 0;
for (int i = 0; i < N; i++) {
if (A[i] == A_0)
++kind1;
}
int kind2 = N - kind1;
if (A_0 < kind1 - 1 + (kind2 != 0))
return (false);
int sz = A_0 + 1 - kind1;
while (sz > 0 && kind2 > 1) {... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 1,360,077 | 1,360,076 | u524343822 | cpp |
p03688 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <map>
#include <set>
using namespace std;
const double PI = acos(-1);
typedef long long ll;
typedef pair<int, int> pi;
#define fi first
#define se second
#define mp make_pair
#defin... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <map>
#include <set>
using namespace std;
const double PI = acos(-1);
typedef long long ll;
typedef pair<int, int> pi;
#define fi first
#define se second
#define mp make_pair
#defin... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,360,078 | 1,360,079 | u364634902 | cpp |
p03688 |
// Let Our Voices Echo
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAX = 2e5 + 9;
int n, a[MAX];
void no() {
cout << "No";
exit(0);
}
void yes() {
cout << "Yes";
exit(0);
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin ... |
// Let Our Voices Echo
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAX = 2e5 + 9;
int n, a[MAX];
void no() {
cout << "No";
exit(0);
}
void yes() {
cout << "Yes";
exit(0);
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin ... | [
"expression.operation.binary.remove"
] | 1,360,082 | 1,360,083 | u166558461 | cpp |
p03688 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <t... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <t... | [
"control_flow.branch.if.condition.change"
] | 1,360,084 | 1,360,085 | u480543763 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int su[100005];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &su[i]);
}
sort(su, su + n);
if (su[0] == su[n - 1]) {
if ((su[0] == (n - 1)) || su[0] <= n / 2) {
printf("Yes\n");
} else {
printf("No\n");
... | #include <bits/stdc++.h>
using namespace std;
int su[100005];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &su[i]);
}
sort(su, su + n);
if (su[0] == su[n - 1]) {
if ((su[0] == (n - 1)) || su[0] <= n / 2) {
printf("Yes\n");
} else {
printf("No\n");
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,360,086 | 1,360,087 | u339699759 | cpp |
p03688 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define size(n) (int(n.size()))
#define sqr(n) ((n) * (n))
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 5;
int a[N];
string solve(int cntMem, int cnt) {
if (!cnt) {
return "No";
}
if (cnt * 2 <= ... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define size(n) (int(n.size()))
#define sqr(n) ((n) * (n))
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 5;
int a[N];
string solve(int cntMem, int cnt) {
if (cnt <= 0) {
return "No";
}
if (cnt * 2... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 1,360,090 | 1,360,091 | u770961604 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
#define N 100010
using namespace std;
int n, a[N];
int getmin() {
int mn = 1e9;
for (int i = 1; i <= n; i++)
mn = min(mn, a[i]);
return mn;
}
int getmax() {
int mx = 0;
for (int i = 1; i <= n; i++)
mx = max(mx, a[i]);
return mx;
}
int main() {
scanf("%d",... | #include <algorithm>
#include <cstdio>
#define N 100010
using namespace std;
int n, a[N];
int getmin() {
int mn = 1e9;
for (int i = 1; i <= n; i++)
mn = min(mn, a[i]);
return mn;
}
int getmax() {
int mx = 0;
for (int i = 1; i <= n; i++)
mx = max(mx, a[i]);
return mx;
}
int main() {
scanf("%d",... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,360,092 | 1,360,093 | u663639206 | cpp |
p03688 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PB push_back
#define MP make_pair
#define SZ size()
#define Fr first
#define Sc second
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%I64d", &a)
#define s... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PB push_back
#define MP make_pair
#define SZ size()
#define Fr first
#define Sc second
#define si(a) scanf("%d", &a)
#define sl(a) scanf("%I64d", &a)
#define s... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,360,094 | 1,360,095 | u704089794 | cpp |
p03688 | #include <bits/stdc++.h>
#include <stdio.h>
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a... | #include <bits/stdc++.h>
#include <stdio.h>
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a... | [
"control_flow.branch.if.condition.change"
] | 1,360,096 | 1,360,097 | u450163883 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 100010;
int n, a[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (a[n] - a[1] > 1)
printf("No");
else if (a[n] == a[1])
printf(n == a[1] ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 100010;
int n, a[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (a[n] - a[1] > 1)
printf("No");
else if (a[n] == a[1])
printf(n == a[1] ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,360,098 | 1,360,099 | u394645903 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a[100000 + 10];
int main() {
scanf("%d", &n);
int ok = 1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] != n - 1) {
ok = 0;
}
}
if (ok) {
printf("Yes\n");
return 0;
}
int c = *max... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a[100000 + 10];
int main() {
scanf("%d", &n);
int ok = 1;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] != n - 1) {
ok = 0;
}
}
if (ok) {
printf("Yes\n");
return 0;
}
int c = *max... | [
"control_flow.branch.if.condition.change"
] | 1,360,100 | 1,360,101 | u653058866 | cpp |
p03688 | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
int main() {
int n;
cin >> n;
vector<int> vc(n);
for (int &c : vc)
cin >> c;
sort(ALL(vc));
... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
int main() {
int n;
cin >> n;
vector<int> vc(n);
for (int &c : vc)
cin >> c;
sort(ALL(vc));
... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"call.function.change"
] | 1,360,104 | 1,360,105 | u508192873 | cpp |
p03688 | // #includes {{{
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end... | // #includes {{{
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,360,106 | 1,360,107 | u852599784 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define inf 1000000005
#define all(a) (a).begin(), (a).end()
#define ms(a, x) memset(a, x, sizeof(a))
#define mod 1000000007
#define sz(a) ((ll)(a).size())
template <class T> int getbit(T s, int i... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define inf 1000000005
#define all(a) (a).begin(), (a).end()
#define ms(a, x) memset(a, x, sizeof(a))
#define mod 1000000007
#define sz(a) ((ll)(a).size())
template <class T> int getbit(T s, int i... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,360,108 | 1,360,109 | u115770202 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int a[200100], n, mn, flag, p;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
mn = a[1];
for (int i = 1; i <= n; ++i)
mn = min(mn, a[i]);
for (int i = 1; i <= n; ++i)
if (a[i] != mn)
flag = true, p++;
else if (... | #include <bits/stdc++.h>
using namespace std;
int a[200100], n, mn, flag, p;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
mn = a[1];
for (int i = 1; i <= n; ++i)
mn = min(mn, a[i]);
for (int i = 1; i <= n; ++i) {
if (a[i] != mn)
flag = true, p++;
if (a[i... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,360,110 | 1,360,111 | u309043628 | cpp |
p03688 | #include <bits/stdc++.h>
#define Maxn 100007
using namespace std;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int ... | #include <bits/stdc++.h>
#define Maxn 100007
using namespace std;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int ... | [
"control_flow.branch.if.condition.change"
] | 1,360,112 | 1,360,113 | u331121156 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", a + i);
if (n == 2) {
printf("Yes\n");
return 0;
}
bool all_eq = true;
for (int i = 1; i < n; i++)
if (a[i] != a[i - 1])
all_eq = false;
int k = 0, ... | #include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", a + i);
if (n == 2) {
printf("Yes\n");
return 0;
}
bool all_eq = true;
for (int i = 1; i < n; i++)
if (a[i] != a[i - 1])
all_eq = false;
int k = 0, ... | [
"expression.operation.binary.remove"
] | 1,360,114 | 1,360,115 | u303438665 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
int n;
int a[100010];
int main(void) {
int i;
int w = -1;
int p, q;
// freopen("x.in","r",stdin);
scanf("%d", &n);
for (i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (i = 1; i <= n; ++i)
w = std::max(w, a[i]);
for (i = 1; i <= n; ++i)
if (a[i] != w &... | #include <algorithm>
#include <cstdio>
int n;
int a[100010];
int main(void) {
int i;
int w = -1;
int p, q;
// freopen("x.in","r",stdin);
scanf("%d", &n);
for (i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (i = 1; i <= n; ++i)
w = std::max(w, a[i]);
for (i = 1; i <= n; ++i)
if (a[i] != w &... | [
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,360,116 | 1,360,117 | u464006849 | cpp |
p03688 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <... | [
"control_flow.branch.if.condition.change"
] | 1,360,118 | 1,360,119 | u085110627 | cpp |
p03688 | #include <algorithm>
#include <cstdio>
#pragma warning(disable : 4996)
using namespace std;
int n, a[100009];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int l = *min_element(a, a + n), r = *max_element(a, a + n);
if (r - l >= 2)
printf("Yes\n");
else if (r - l == 0)
... | #include <algorithm>
#include <cstdio>
#pragma warning(disable : 4996)
using namespace std;
int n, a[100009];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int l = *min_element(a, a + n), r = *max_element(a, a + n);
if (r - l >= 2)
printf("No\n");
else if (r - l == 0)
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,360,122 | 1,360,123 | u837745858 | cpp |
p03688 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
static int a[100000];
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int M = a[0], X = a[0];
for (int i = 0; i < n; i++) {
M = min(M, a[i]);
X = max(M, a[i]);
}
bool F;
if (M < X - 1) {
F = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
static int a[100000];
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int M = a[0], X = a[0];
for (int i = 0; i < n; i++) {
M = min(M, a[i]);
X = max(X, a[i]);
}
bool F;
if (M < X - 1) {
F = 0;
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,360,124 | 1,360,125 | u085974529 | cpp |
p03688 | #include <algorithm>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fs first
#define sc second
#define forn(i, n) for (int i = 0; i < (i... | #include <algorithm>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define fs first
#define sc second
#define forn(i, n) for (int i = 0; i < (i... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,360,128 | 1,360,129 | u282109438 | cpp |
p03688 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define F0(i, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define F0(i, ... | [
"control_flow.branch.if.condition.change"
] | 1,360,130 | 1,360,131 | u036380392 | cpp |
p03688 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace... | [
"control_flow.branch.if.condition.change"
] | 1,360,134 | 1,360,135 | u495913622 | cpp |
p03684 | /*
problem's name:
statue:
writer:Patrick_y
*/
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#inc... | /*
problem's name:
statue:
writer:Patrick_y
*/
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#inc... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,360,894 | 1,360,895 | u743952783 | cpp |
p03684 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) FOR(i, 0, b)
#define INF mugen
#define dump(x) cerr << #x << "=" << x << endl
#define all(a) (a).begin(), (a).end()
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<vii> viii;
typedef pair<int,... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) FOR(i, 0, b)
#define INF mugen
#define dump(x) cerr << #x << "=" << x << endl
#define all(a) (a).begin(), (a).end()
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<vii> viii;
typedef pair<int,... | [
"assignment.variable.change"
] | 1,360,904 | 1,360,905 | u373844230 | cpp |
p03684 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <s... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <s... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 1,360,908 | 1,360,909 | u545022164 | cpp |
p03684 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF (1ll << 60)
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
typedef pair<int, pii> pip;
int N;
ppi px[100100];
ppi py[100100];
vector<pip> edge;
struct UF {
int N;
const static ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define INF (1ll << 60)
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
typedef pair<int, pii> pip;
int N;
ppi px[100100];
ppi py[100100];
vector<pip> edge;
struct UF {
int N;
const static ... | [
"call.add",
"call.arguments.change"
] | 1,360,913 | 1,360,914 | u015768390 | cpp |
p03684 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(n) for (int i = 0; i < n; i++)
#define repp(j, n) for (int j = 0; j < n; j++)
#define reppp(i, m, n) for (int i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(n) for (int i = 0; i < n; i++)
#define repp(j, n) for (int j = 0; j < n; j++)
#define reppp(i, m, n) for (int i ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,360,917 | 1,360,918 | u986399983 | cpp |
p03684 | #include <bits/stdc++.h>
#define maxn 100050
#define inf 0x3f3f3f3f
#define LL long long
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define mm(a, b) memset(a, b, sizeof(a))
#define mp(a, b) make_pair(a, b)
const LL mod = 1e9 + 7;
const LL INF = (LL)1e18;
using namespace std;
stru... | #include <bits/stdc++.h>
#define maxn 100050
#define inf 0x3f3f3f3f
#define LL long long
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define mm(a, b) memset(a, b, sizeof(a))
#define mp(a, b) make_pair(a, b)
const LL mod = 1e9 + 7;
const LL INF = (LL)1e18;
using namespace std;
stru... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,360,927 | 1,360,928 | u193441181 | cpp |
p03684 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))... | [
"assignment.change"
] | 1,360,934 | 1,360,935 | u649310245 | cpp |
p03684 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define x first
#define y second
#define mp make_pair
#define pb push_... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define x first
#define y second
#define mp make_pair
#define pb push_... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,360,938 | 1,360,939 | u540005219 | cpp |
p03693 | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int ma... | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int ma... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,360,960 | 1,360,961 | u469813907 | cpp |
p03693 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <clas... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <clas... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,360,963 | 1,360,964 | u438662618 | cpp |
p03693 | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
if ((10 * g + b) % 4 == 0)
std::cout << "Yes";
else
std::cout << "No";
return 0;
} | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
if ((10 * g + b) % 4 == 0)
std::cout << "YES";
else
std::cout << "NO";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,360,965 | 1,360,966 | u032315435 | cpp |
p03693 | #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#in... | #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#in... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,360,988 | 1,360,989 | u071396528 | cpp |
p03693 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void solve();
int main() {
solve();
return 0;
}
#define ini(...) ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void solve();
int main() {
solve();
return 0;
}
#define ini(...) ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,360,993 | 1,360,994 | u790616011 | cpp |
p03693 | #include "bits/stdc++.h"
using namespace std;
void Main() {
int r, g, b;
cin >> r >> g >> b;
int n = r * 100 + g * 10 + b;
cout << (n % 4 == 0 ? "YES" : "No") << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void Main() {
int r, g, b;
cin >> r >> g >> b;
int n = r * 100 + g * 10 + b;
cout << (n % 4 == 0 ? "YES" : "NO") << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,360,999 | 1,361,000 | u138886316 | cpp |
p03693 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string r, g, b;
cin >> r >> g >> b;
string rgb = r + g + b;
int RGB = stoi(rgb);
if (RGB % 4 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
string r, g, b;
cin >> r >> g >> b;
string rgb = r + g + b;
int RGB = stoi(rgb);
if (RGB % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,003 | 1,361,004 | u106350124 | cpp |
p03693 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((100 * r + 10 * g + b) % 4 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((100 * r + 10 * g + b) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,005 | 1,361,006 | u106350124 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,009 | 1,361,010 | u059623720 | cpp |
p03693 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = b * 10 + c;
if (d % 4 == 0) {
cout << "Yes\n";
} else
cout << "No\n";
}
| #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = b * 10 + c;
if (d % 4 == 0) {
cout << "YES\n";
} else
cout << "NO\n";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,014 | 1,361,015 | u742666659 | cpp |
p03693 | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int r, g, b;
cin >> r >> g >> b;
// cout << r << g << b;
int answer = (r * 100) + (g * 10) + b;
if (answer % 4 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int r, g, b;
cin >> r >> g >> b;
// cout << r << g << b;
int answer = (r * 100) + (g * 10) + b;
if (answer % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,016 | 1,361,017 | u800603597 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
const int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
const int ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,018 | 1,361,019 | u193866675 | cpp |
p03693 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,023 | 1,361,024 | u693969714 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) / 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,361,029 | 1,361,030 | u418892821 | cpp |
p03693 | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
c += b * 10 * a * 100;
if (c % 4 == 0)
cout << "YES" <<... | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
c += b * 10 + a * 100;
if (c % 4 == 0)
cout << "YES" <<... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,361,031 | 1,361,032 | u534923072 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int number = r * 100 + g * 10 + b;
if (number % 4 == 0) {
cout << 'YES' << endl;
} else {
cout << 'NO' << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int number = r * 100 + g * 10 + b;
if (number % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 1,361,033 | 1,361,034 | u372177994 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,039 | 1,361,040 | u126859973 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | [
"identifier.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 1,361,041 | 1,361,040 | u126859973 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 1,361,042 | 1,361,043 | u371051907 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (((100 * r + 10 * g + b) % 4) == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (((100 * r + 10 * g + b) % 4) == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,054 | 1,361,055 | u047176515 | cpp |
p03693 | #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii, nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade, bde) __gcd(ade, bde)
#define vi vector<int>
#define vll vector<ll>
#define v... | #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii, nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade, bde) __gcd(ade, bde)
#define vi vector<int>
#define vll vector<ll>
#define v... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,058 | 1,361,059 | u403668916 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = 100 * a + 10 * b * c;
if (x % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = 100 * a + 10 * b + c;
if (x % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,361,060 | 1,361,061 | u190875453 | cpp |
p03693 | #include <iostream>
#include <string>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = r * 100 + g * 10 + b;
if (x % 4 == 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = r * 100 + g * 10 + b;
if (x % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 1,361,062 | 1,361,063 | u885010386 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((g * 10 + r) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((g * 10 + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,361,064 | 1,361,065 | u334623794 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((g * 100 + r) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((g * 10 + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 1,361,066 | 1,361,065 | u334623794 | cpp |
p03693 | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
std::cout << ((r * 100 + g * 10 + b) % 4 == 0 ? "Yes" : "No");
} | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
std::cout << ((r * 100 + g * 10 + b) % 4 == 0 ? "YES" : "NO");
} | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,361,078 | 1,361,079 | u509384866 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int number = a * 100 + b * 10 + c;
if (number / 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int number = a * 100 + b * 10 + c;
if (number % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,361,080 | 1,361,081 | u040507818 | cpp |
p03693 | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | [] | 1,361,089 | 1,361,090 | u798339690 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * 100 + b * 10 + c;
if (ans % 4 == 0)
cout << "YES" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll ans = a * 100 + b * 10 + c;
if (ans % 4 == 0) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
}
| [
"variable_declaration.type.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,095 | 1,361,096 | u701527888 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * 100 + b * 10 + c;
if (ans % 4 == 0)
cout << "YES" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * 100 + b * 10 + c;
if (ans % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,095 | 1,361,097 | u701527888 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r + 100 + g * 10 + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" <<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" <<... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,361,105 | 1,361,106 | u010806195 | cpp |
p03693 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
//#include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 10000... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
//#include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 10000... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,107 | 1,361,108 | u986568278 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, s;
cin >> a >> b >> c;
s = 10 * b + c;
if (s % c == 0) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, s;
cin >> a >> b >> c;
s = 10 * b + c;
if (s % 4 == 0) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 1,361,114 | 1,361,115 | u462907578 | cpp |
p03693 | #include <iostream>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
if (100 * A + 10 * B + C % 4 == 0)
cout << "YES\n";
else
cout << "NO\n";
} | #include <iostream>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
if ((100 * A + 10 * B + C) % 4 == 0)
cout << "YES\n";
else
cout << "NO\n";
} | [
"control_flow.branch.if.condition.change"
] | 1,361,118 | 1,361,119 | u110044127 | cpp |
p03693 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((10 * g + b) % 4 == 0)
cout << "Yes"
<< "\n";
else
cout << "No"
<< "\n";
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((10 * g + b) % 4 == 0)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,128 | 1,361,129 | u389054489 | cpp |
p03693 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((g + b) % 4 == 0)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((g * 10 + b) % 4 == 0)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
} | [
"control_flow.branch.if.condition.change"
] | 1,361,130 | 1,361,131 | u589509358 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int r, g, b;
cin >> r >> g >> b;
int tmp = 100 * r + 10 * g + b;
if (tmp % 4 == 0)
cout << "YES";
else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int r, g, b;
cin >> r >> g >> b;
int tmp = 100 * r + 10 * g + b;
if (tmp % 4 == 0)
cout << "YES";
else {
cout << "NO";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,132 | 1,361,133 | u478705580 | cpp |
p03693 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = r * 100;
int y = g * 10;
int ans = x + y + b;
if (ans % 4 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = r * 100;
int y = g * 10;
int ans = x + y + b;
if (ans % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,136 | 1,361,137 | u588317865 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int ans = (r * 100) + (g * 10) + b;
if (ans % 4 == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int ans = (r * 100) + (g * 10) + b;
if (ans % 4 == 0) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,138 | 1,361,139 | u588317865 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((b * 10 + c) % 4 == 0) ? "YES" : "NO";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (((b * 10 + c) % 4 == 0) ? "YES" : "NO");
return 0;
}
| [] | 1,361,140 | 1,361,141 | u818967913 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (10 * g * b % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((10 * g + b) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return (0);
}
| [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change"
] | 1,361,144 | 1,361,145 | u056848279 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (g * b % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((10 * g + b) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return (0);
}
| [
"control_flow.branch.if.condition.change"
] | 1,361,146 | 1,361,145 | u056848279 | cpp |
p03693 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int r, g, b;
cin >> r >> b >> b;
int num = 100 * r + 10 * g + b;
if (num % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int r, g, b;
cin >> r >> g >> b;
int num = 100 * r + 10 * g + b;
if (num % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 1,361,147 | 1,361,148 | u876120259 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int s = 0;
s = r * 100 + g * 10 + b * 1;
if (s % 4 == 0) {
cout << "yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int s = 0;
s = r * 100 + g * 10 + b * 1;
if (s % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,151 | 1,361,152 | u366070419 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (inti = a; i <= b; i++)
#define MOD 1000000009
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
int main() {
int r, g, b;
cin >> r >> g >> b... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (inti = a; i <= b; i++)
#define MOD 1000000009
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
int main() {
int r, g, b;
cin >> r >> g >> b... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,153 | 1,361,154 | u041108736 | cpp |
p03693 | #include <iostream>
using namespace std;
int main(void) {
int r, g, b;
cin >> r >> g >> b;
int num = r * 100 + g * 10 + b;
if (num % 4 == 0) {
cout << "Yes";
} else {
cout << "No";
}
cout << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int r, g, b;
cin >> r >> g >> b;
int num = r * 100 + g * 10 + b;
if (num % 4 == 0) {
cout << "YES";
} else {
cout << "NO";
}
cout << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,161 | 1,361,162 | u351174574 | cpp |
p03693 | #include <iostream>
#include <string>
using namespace std;
int main() {
string a, b, c, d;
int ans;
cin >> a >> b >> c;
d = a + b + c;
// string型からint型へ直接変換
ans = stoi(d);
if (ans % 4) {
printf("YES");
} else {
printf("NO");
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string a, b, c, d;
int ans;
cin >> a >> b >> c;
d = a + b + c;
// string型からint型へ直接変換
ans = stoi(d);
if (ans % 4 == 0) {
printf("YES");
} else {
printf("NO");
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,361,163 | 1,361,164 | u316171408 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,167 | 1,361,168 | u709144111 | cpp |
p03693 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * 100 + b * 10 + c % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((a * 100 + b * 10 + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 1,361,178 | 1,361,179 | u032484360 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (((100 * r) + (10 * g) + (1 * b)) % 4 == 0) {
cout << "Yes" << endl;
}
else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (((100 * r) + (10 * g) + (1 * b)) % 4 == 0) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,195 | 1,361,196 | u510577428 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (((100 * r) + (10 * g) + b) % 4 == 0) {
cout << "Yes" << endl;
}
else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (((100 * r) + (10 * g) + (1 * b)) % 4 == 0) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,197 | 1,361,196 | u510577428 | cpp |
p03693 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "str... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "str... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,202 | 1,361,203 | u124659583 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int c = 100 * r + 10 * g + b;
if (c % 4 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int c = 100 * r + 10 * g + b;
if (c % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,204 | 1,361,205 | u268625354 | cpp |
p03693 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int r, g, b;
cin >> r >> g >> b;
int num = 100 * r + 10 * g + b;
if (num % 4 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int r, g, b;
cin >> r >> g >> b;
int num = 100 * r + 10 * g + b;
if (num % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,210 | 1,361,211 | u969227451 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int total = 100 * a + 10 * b + c;
string s = "No";
if (total % 4 == 0)
s = "Yes";
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int total = 100 * a + 10 * b + c;
string s = "NO";
if (total % 4 == 0)
s = "YES";
cout << s << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 1,361,212 | 1,361,213 | u198319923 | cpp |
p03693 | #include <bits/stdc++.h>
#define lol long long
using namespace std;
int main() {
int a, b, c, ans;
string s, t, q;
cin >> a >> b >> c;
ans = a * 100 + b * 10 + c;
if (ans % 4 == 0)
cout << "Yes\n";
else
cout << "No\n";
return (0);
} | #include <bits/stdc++.h>
#define lol long long
using namespace std;
int main() {
int a, b, c, ans;
string s, t, q;
cin >> a >> b >> c;
ans = a * 100 + b * 10 + c;
if (ans % 4 == 0)
cout << "YES\n";
else
cout << "NO\n";
return (0);
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,231 | 1,361,232 | u240895927 | cpp |
p03693 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if (10 * b + c % 4 == 0) {
std::cout << "YES";
} else {
std::cout << "NO";
}
return 0;
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
if ((10 * b + c) % 4 == 0) {
std::cout << "YES";
} else {
std::cout << "NO";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,361,233 | 1,361,234 | u235321041 | cpp |
p03693 | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
if (2 * g + b % 4 == 0) {
std::cout << "YES";
} else {
std::cout << "NO";
}
return 0;
} | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
if ((2 * g + b) % 4 == 0) {
std::cout << "YES";
} else {
std::cout << "NO";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,361,235 | 1,361,236 | u235321041 | cpp |
p03693 | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
if (10 * g + b % 4 == 0) {
std::cout << "YES";
} else {
std::cout << "NO";
}
return 0;
} | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
if ((2 * g + b) % 4 == 0) {
std::cout << "YES";
} else {
std::cout << "NO";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,361,237 | 1,361,236 | u235321041 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((10 * g + b) % 4 == 0) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((10 * g + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,245 | 1,361,246 | u398233494 | cpp |
p03693 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int r, g, b;
cin >> r >> g >> b;
int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int r, g, b;
cin >> r >> g >> b;
int ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,247 | 1,361,248 | u982747006 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = 10 * g + b;
cout << (x % 4 == 0 ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = 10 * g + b;
cout << (x % 4 == 0 ? "YES" : "NO") << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,251 | 1,361,252 | u303694543 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = g * b;
cout << (x % 4 == 0 ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = 10 * g + b;
cout << (x % 4 == 0 ? "YES" : "NO") << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,254 | 1,361,252 | u303694543 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = 10 * b + c;
if (d % 4 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a * 100 + 10 * b + c;
if (d % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,255 | 1,361,256 | u303694543 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a * 100 + 10 * b + c;
if (d % 4 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a * 100 + 10 * b + c;
if (d % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,361,257 | 1,361,256 | u303694543 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.