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 |
|---|---|---|---|---|---|---|---|
p03693 | #include <iostream>
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 <iostream>
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;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,263 | 1,363,264 | u815363531 | cpp |
p03693 | #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;
}
return 0;
} | #include <iostream>
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;
}
| [
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,265 | 1,363,264 | u815363531 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = (100 * r) + (10 * g) + b;
if (x % 4 == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int x = (100 * r) + (10 * g) + b;
if (x % 4 == 0) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,266 | 1,363,267 | u815363531 | cpp |
p03693 | // 7/4 Tuesday
#include <iostream>
using namespace std;
int main() {
int r, g, b, t;
bool m1 = true;
cin >> r >> g >> b;
t = r * 100 + g * 10 + b;
while (t != 0) {
if (t == 1) {
cout << "YES" << endl;
m1 = false;
break;
}
t = t / 4;
}
if (m1) {
cout << "NO" << endl;
... | // 7/4 Tuesday
#include <iostream>
using namespace std;
int main() {
int r, g, b, t;
bool m1 = true;
cin >> r >> g >> b;
t = r * 100 + g * 10 + b;
while (t >= 0) {
if (t == 0) {
cout << "YES" << endl;
m1 = false;
break;
}
t = t - 4;
}
if (m1) {
cout << "NO" << endl;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,363,268 | 1,363,269 | u183464876 | cpp |
p03693 | #include <bits/stdc++.h>
const long long MOD = 1000000007;
const int INF = INT_MAX / 2;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (int i = (ll)(r); i < (ll)(n); i++)
#define REP(i, n) FOR(i, (0), n)
#define ALL(r) r.begin(), r.end()
#define ll long long int
using namespace std;
vector<ll> v;
vector<str... | #include <bits/stdc++.h>
const long long MOD = 1000000007;
const int INF = INT_MAX / 2;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (int i = (ll)(r); i < (ll)(n); i++)
#define REP(i, n) FOR(i, (0), n)
#define ALL(r) r.begin(), r.end()
#define ll long long int
using namespace std;
vector<ll> v;
vector<str... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,274 | 1,363,275 | u125046593 | cpp |
p03693 | //====================================//
#include <bits/stdc++.h>
//====================================//
using namespace std;
#define ll long long
//====== Data Structure =//
//=======================//
//====== Variables ======//
int a, b, c;
//=======================//
//====== Functions ======//
//==========... | //====================================//
#include <bits/stdc++.h>
//====================================//
using namespace std;
#define ll long long
//====== Data Structure =//
//=======================//
//====== Variables ======//
int a, b, c;
//=======================//
//====== Functions ======//
//==========... | [
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,363,276 | 1,363,277 | u919899667 | cpp |
p03693 | //====================================//
#include <bits/stdc++.h>
//====================================//
using namespace std;
#define ll long long
//====== Data Structure =//
//=======================//
//====== Variables ======//
int a, b, c;
//=======================//
//====== Functions ======//
//==========... | //====================================//
#include <bits/stdc++.h>
//====================================//
using namespace std;
#define ll long long
//====== Data Structure =//
//=======================//
//====== Variables ======//
int a, b, c;
//=======================//
//====== Functions ======//
//==========... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,363,278 | 1,363,277 | u919899667 | cpp |
p03693 | //====================================//
#include <bits/stdc++.h>
//====================================//
using namespace std;
#define ll long long
//====== Data Structure =//
//=======================//
//====== Variables ======//
int a, b, c;
//=======================//
//====== Functions ======//
//==========... | //====================================//
#include <bits/stdc++.h>
//====================================//
using namespace std;
#define ll long long
//====== Data Structure =//
//=======================//
//====== Variables ======//
int a, b, c;
//=======================//
//====== Functions ======//
//==========... | [
"identifier.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,279 | 1,363,277 | u919899667 | cpp |
p03693 | #include <iostream>
using namespace std;
int main(void) {
int r;
int g;
int b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int r;
int g;
int b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,280 | 1,363,281 | u843336967 | cpp |
p03693 | #include "iostream"
using namespace std;
int r, g, b;
int main() {
cin >> r >> g >> b;
if (100 * r + 10 * g + b % 4) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include "iostream"
using namespace std;
int r, g, b;
int main() {
cin >> r >> g >> b;
if ((100 * r + 10 * g + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,363,289 | 1,363,290 | u382176401 | cpp |
p03693 | #include <iostream>
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 <iostream>
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,363,291 | 1,363,292 | u328735699 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, b, g;
cin >> r >> b >> g;
int num = r * 100 + b * 10 + g;
if (num % 4 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, b, g;
cin >> r >> b >> g;
int num = r * 100 + b * 10 + g;
if (num % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,293 | 1,363,294 | u837103896 | cpp |
p03693 | #include <iostream>
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;
} | #include <iostream>
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;
} | [
"control_flow.branch.if.condition.change"
] | 1,363,295 | 1,363,296 | u966667387 | cpp |
p03693 | #include <iostream>
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;
} | #include <iostream>
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;
} | [
"control_flow.branch.if.condition.change"
] | 1,363,297 | 1,363,296 | u966667387 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int num = 10 * g + b;
if (num % 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;
int num = 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,363,298 | 1,363,299 | u573451081 | cpp |
p03693 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
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;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
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;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 1,363,302 | 1,363,303 | u234623541 | cpp |
p03693 | #include <iostream>
#include <string>
using namespace std;
int main() {
string r, g, b;
string combine;
int n;
cin >> r >> g >> b;
combine = r + g + b;
n = atoi(combine.c_str());
if (4 % n == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
system("pause");
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string r, g, b;
string combine;
int n;
cin >> r >> g >> b;
combine = r + g + b;
n = atoi(combine.c_str());
if (n % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
system("pause");
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,363,304 | 1,363,305 | u283745751 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r, g, b, total;
cin >> r >> g >> b;
r = r * 100;
g = g * 10;
total = r + g + b;
if (4 % total == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r, g, b, total;
cin >> r >> g >> b;
r = r * 100;
g = g * 10;
total = r + g + b;
if (total % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,363,306 | 1,363,307 | u283745751 | cpp |
p03693 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if ((a * 100 + b + 10 + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
if ((a * 100 + b * 10 + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,363,315 | 1,363,316 | u278641898 | cpp |
p03693 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#in... | [] | 1,363,317 | 1,363,318 | u335104842 | cpp |
p03693 |
#include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int s;
s = 100 * r + 10 * g + b;
if (s % 4 == 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int s;
s = 100 * r + 10 * g + b;
if (s % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,363,319 | 1,363,320 | u308136093 | cpp |
p03693 | #include <cstdio>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b * 10 * c) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <cstdio>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b * 10 + c) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,363,325 | 1,363,326 | u109105878 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,363,340 | 1,363,341 | u598462304 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g + 10 + b) % 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,363,342 | 1,363,341 | u598462304 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if (r * 100 + g + 10 + b % 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,363,343 | 1,363,341 | u598462304 | cpp |
p03693 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <limits>
#include <string>
#include <utility>
#include <vector>
int main() {
using namespace std;
int r, g, b;
cin >> r >> g >> b;
int n = r * 100 + g * 10 + b;
if (n % 4 == 0)
cout << "Yes" << endl;
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <limits>
#include <string>
#include <utility>
#include <vector>
int main() {
using namespace std;
int r, g, b;
cin >> r >> g >> b;
int n = g * 10 + b;
if (n % 4 == 0)
cout << "YES" << endl;
else
... | [
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,344 | 1,363,345 | u257946282 | cpp |
p03693 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <limits>
#include <string>
#include <utility>
#include <vector>
int main() {
using namespace std;
int r, g, b;
cin >> r >> g >> b;
int n = g * 10 + b;
if (n % 4 == 0)
cout << "Yes" << endl;
else
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <limits>
#include <string>
#include <utility>
#include <vector>
int main() {
using namespace std;
int r, g, b;
cin >> r >> g >> b;
int n = g * 10 + b;
if (n % 4 == 0)
cout << "YES" << endl;
else
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,346 | 1,363,345 | u257946282 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((a * 100 + b * 10 + c) % 4 ? "No\n" : "Yes\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((a * 100 + b * 10 + c) % 4 ? "NO\n" : "YES\n");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,351 | 1,363,352 | u429443682 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (!((a * 100 + b * 10 + c) % 4) ? "Yes\n" : "No\n");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((a * 100 + b * 10 + c) % 4 ? "NO\n" : "YES\n");
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,363,353 | 1,363,352 | u429443682 | cpp |
p03693 | #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 <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;
}
| [
"control_flow.branch.if.condition.change"
] | 1,363,356 | 1,363,357 | u124250704 | cpp |
p03693 | #include <iostream>
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 <iostream>
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,363,358 | 1,363,359 | u537459297 | cpp |
p03693 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a, b, c;
d = 100 * a + 10 * b + c;
if (d % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = (100 * a + 10 * b + c);
if (d % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [] | 1,363,382 | 1,363,383 | u060710065 | cpp |
p03693 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a, b, c;
d == (100 * a + 10 * b + c);
if (d % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = (100 * a + 10 * b + c);
if (d % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,363,384 | 1,363,383 | u060710065 | cpp |
p03693 | #include <iostream>
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;
}
return 0;
} | #include <iostream>
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;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,363,388 | 1,363,389 | u534661831 | cpp |
p03693 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <random>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <random>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0... | [
"call.arguments.change"
] | 1,363,390 | 1,363,391 | u698760125 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int sum = r * 100 + g * 10 + b;
if (sum % 4 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int sum = r * 100 + g * 10 + b;
if (sum % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,392 | 1,363,393 | u516869225 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
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;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
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.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,396 | 1,363,397 | u833393891 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((2 * 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 ((2 * g + b) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,398 | 1,363,399 | u940102677 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((2 * 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 ((2 * g + b) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,400 | 1,363,399 | u940102677 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b * 10 + c) % 4 == 0)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b * 10 + c) % 4 == 0)
cout << "YES";
else
cout << "NO";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,406 | 1,363,407 | u525117558 | cpp |
p03693 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << ((((a * 100 + b * 10 + c) % 4) == 0) ? "Yes" : "No")
<< std::endl;
return 0;
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << ((((a * 100 + b * 10 + c) % 4) == 0) ? "YES" : "NO")
<< std::endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,363,408 | 1,363,409 | u939641510 | 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\n";
} else {
cout << "No\n";
}
}
| #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\n";
} else {
cout << "NO\n";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,410 | 1,363,411 | u403753892 | cpp |
p03693 | #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;
return 0;
}
| #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;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,414 | 1,363,415 | u772304668 | cpp |
p03693 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
b += 100 * r + 10 * g;
cout << ((b % 4) ? "No" : "Yes") << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
b += 100 * r + 10 * g;
cout << ((b % 4) ? "NO" : "YES") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,422 | 1,363,423 | u120190063 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((100 * a + 10 * b + c % 4) == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((100 * a + 10 * b + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 1,363,424 | 1,363,425 | u773548422 | cpp |
p03693 | #include <iostream>
using namespace std;
int r, g, b;
int main() {
cin >> r >> g >> b;
cout << ((r + g + b) % 4 == 0 ? "YES" : "NO");
return 0;
} | #include <iostream>
using namespace std;
int r, g, b;
int main() {
cin >> r >> g >> b;
cout << ((r * 100 + g * 10 + b) % 4 == 0 ? "YES" : "NO");
return 0;
}
| [
"expression.operation.binary.add"
] | 1,363,426 | 1,363,427 | u486232694 | cpp |
p03693 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
//#include "u... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
//#include "u... | [] | 1,363,428 | 1,363,429 | u034865202 | cpp |
p03693 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (10 * b + c % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((10 * b + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 1,363,435 | 1,363,436 | u899712094 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0)
cou... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
int main() {
int r, g, b;
cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0)
cou... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,437 | 1,363,438 | u526367939 | cpp |
p03693 | #include <iostream>
using namespace std;
int r, g, b;
int main(void) {
cin >> r >> g >> b;
if (10 * g + b % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <iostream>
using namespace std;
int r, g, b;
int main(void) {
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,363,439 | 1,363,440 | u319282133 | cpp |
p03693 | #include <stdio.h>
int main() {
int r, g, b;
scanf("%d %d %d ", &r, &g, &b);
if (r * 100 + g * 10 + b % 4 == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
| #include <stdio.h>
int main() {
int r, g, b;
scanf("%d %d %d ", &r, &g, &b);
if ((r * 100 + g * 10 + b) % 4 == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 1,363,441 | 1,363,442 | u811528179 | cpp |
p03693 | #include <stdio.h>
int main() {
int r, g, b;
scanf("%d %d %d ", &r, &g, &b);
if (g * 10 + b % 4 == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
| #include <stdio.h>
int main() {
int r, g, b;
scanf("%d %d %d ", &r, &g, &b);
if ((r * 100 + g * 10 + b) % 4 == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 1,363,443 | 1,363,442 | u811528179 | cpp |
p03693 | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
int d = a * 100 + b * 10 + c;
if (d % 4 == 0) {
printf("YES");
} else {
printf("COM");
}
return 0;
} | #include <iostream>
int main() {
int a, b, c;
std::cin >> a >> b >> c;
int d = a * 100 + b * 10 + c;
if (d % 4 == 0) {
printf("YES");
} else {
printf("NO");
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,363,444 | 1,363,445 | u284188208 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
int n;
cin >> r >> g >> b;
n = r * 100 + g * 10 + b;
if (n % 4 == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int r, g, b;
int n;
cin >> r >> g >> b;
n = r * 100 + g * 10 + b;
if (n % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,448 | 1,363,449 | u219873012 | cpp |
p03693 | #include <iostream>
using namespace std;
int main(void) {
int r, g, b;
cin >> r >> g >> b;
if (100 * r + 10 * g + b % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int r, g, b;
cin >> r >> g >> b;
if ((100 * r + 10 * g + b) % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 1,363,452 | 1,363,453 | u114589485 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if ((a * 100 + b * 10 + c) % 4 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if ((a * 100 + b * 10 + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,455 | 1,363,456 | u965730380 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
b += r * 100 + g * 10;
if (b % 4 == 0) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
b += r * 100 + g * 10;
if (b % 4 == 0) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,462 | 1,363,463 | u994793728 | cpp |
p03693 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
#define lowbit(x) ((x) & (-x))
#define INF 0x3f3f3f3f
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
#define lowbit(x) ((x) & (-x))
#define INF 0x3f3f3f3f
#define ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,363,470 | 1,363,471 | u094036798 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
int a, b, c;
int main(int argc, char const *argv[]) {
ios_base::sync_with... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
int a, b, c;
int main(int argc, char const *argv[]) {
ios_base::sync_with... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,363,479 | 1,363,480 | u950925609 | cpp |
p03690 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define SZ(x) (int((x).size()))
#define ALL(x) (x).begin(), (x).end()
temp... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define SZ(x) (int((x).size()))
#define ALL(x) (x).begin(), (x).end()
temp... | [
"assignment.change"
] | 1,363,483 | 1,363,484 | u703634590 | cpp |
p03690 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | [
"literal.number.change",
"assignment.value.change"
] | 1,363,487 | 1,363,488 | u613658617 | cpp |
p03690 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change"
] | 1,363,489 | 1,363,488 | u613658617 | cpp |
p03690 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int u[108000];
int done[108000];
int dig[108000];
int cnt;
void ng() {
cout << -1 << endl;
exit(0);
}
int r(int x) {
if (x == u[x])
return x;
return u[x] = r(u[x]);
}
void unite(int x, int y) {
x = r(x);
y = r(y);
if (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int u[108000];
int done[108000];
int dig[108000];
int cnt;
void ng() {
cout << -1 << endl;
exit(0);
}
int r(int x) {
if (x == u[x])
return x;
return u[x] = r(u[x]);
}
void unite(int x, int y) {
x = r(x);
y = r(y);
if (... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 1,363,496 | 1,363,497 | u299869545 | cpp |
p03691 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 405;
vector<pair<int, int>> adj[MAX_N];
int vis[MAX_N];
int fuck[MAX_N];
vector<pair<int, pair<int, int>>> constr[MAX_N];
void add_constr(int u, int t, int src) {
vis[u] = 1;
for (pair<int, int> nxt : adj[u]) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 405;
vector<pair<int, int>> adj[MAX_N];
int vis[MAX_N];
int fuck[MAX_N];
vector<pair<int, pair<int, int>>> constr[MAX_N];
void add_constr(int u, int t, int src) {
vis[u] = 1;
for (pair<int, int> nxt : adj[u]) {
... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,363,512 | 1,363,513 | u882575405 | cpp |
p03691 | #include <bits/stdc++.h>
const int MAXN = 15;
int n, m, xs[MAXN], ys[MAXN], ans;
std::bitset<MAXN> B[MAXN];
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n >> m;
for (int i = 1; i <= m; ++i)
std::cin >> xs[i] >> ys[i];
for (int i = 1; i <= n; ++i) {
B[i].set(i);
f... | #include <bits/stdc++.h>
const int MAXN = 410;
int n, m, xs[100010], ys[100010], ans;
std::bitset<MAXN> B[MAXN];
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n >> m;
for (int i = 1; i <= m; ++i)
std::cin >> xs[i] >> ys[i];
for (int i = 1; i <= n; ++i) {
B[i].set(i);
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 1,363,518 | 1,363,517 | u827712003 | cpp |
p03691 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int a[203030], b[202020], ali[404][404], p[404];
int main() {
int n, m, i, ans = 0, j, x, y, k;
scanf("%d%d", &n, &m);
for (i = 1; i <= m; i++)
scanf("%d%d", &a[i], &b[i]);
for (i = 1; i <= n... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int a[203030], b[202020], ali[404][404], p[404];
int main() {
int n, m, i, ans = 0, j, x, y, k;
scanf("%d%d", &n, &m);
for (i = 1; i <= m; i++)
scanf("%d%d", &a[i], &b[i]);
for (i = 1; i <= n... | [
"literal.number.change",
"assignment.value.change"
] | 1,363,552 | 1,363,553 | u556820423 | cpp |
p03691 | #include <algorithm>
#include <bitset>
#include <cstdio>
using namespace std;
const int MAXN = 505, MAXM = 100005;
int N, M;
bitset<MAXN> alive[MAXN];
bool dead[MAXN];
int x[MAXM], y[MAXM];
int main() {
scanf("%d%d", &N, &M);
for (int i = 1; i <= M; i++)
scanf("%d%d", &x[i], &y[i]);
for (int i = 1; i <= N; ... | #include <algorithm>
#include <bitset>
#include <cstdio>
using namespace std;
const int MAXN = 505, MAXM = 100005;
int N, M;
bitset<MAXN> alive[MAXN];
bool dead[MAXN];
int x[MAXM], y[MAXM];
int main() {
scanf("%d%d", &N, &M);
for (int i = 1; i <= M; i++)
scanf("%d%d", &x[i], &y[i]);
for (int i = 1; i <= N; ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 1,363,558 | 1,363,559 | u970234197 | cpp |
p03691 | #include <cfenv>
#include <iostream>
using namespace std;
typedef long long i64;
const int MAXN = 400 + 5;
const int MAXM = 1e5 + 10;
i64 answer;
int N, M;
int A[MAXM], B[MAXM];
bool eatenWith[MAXN][MAXN];
bool certainDeath[MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M;
f... | #include <cfenv>
#include <iostream>
using namespace std;
typedef long long i64;
const int MAXN = 400 + 5;
const int MAXM = 1e5 + 10;
i64 answer;
int N, M;
int A[MAXM], B[MAXM];
bool eatenWith[MAXN][MAXN];
bool certainDeath[MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M;
f... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,363,560 | 1,363,561 | u792082864 | cpp |
p03691 | #include <bitset>
#include <cstdio>
using namespace std;
const int N = 400;
const int M = 1e5;
bitset<N + 3> f[N + 3], tmp;
int a[M + 2], b[M + 2];
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++)
scanf("%d%d", &a[i], &b[i]);
for (int i = 1; i <= n; i++) {
f[i][i] = true;
f... | #include <bitset>
#include <cstdio>
using namespace std;
const int N = 400;
const int M = 1e5;
bitset<N + 3> f[N + 3], tmp;
int a[M + 2], b[M + 2];
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++)
scanf("%d%d", &a[i], &b[i]);
for (int i = 1; i <= n; i++) {
f[i][i] = true;
f... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,363,562 | 1,363,563 | u396278429 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
cout << abs(a[n - 1] - a[0]) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
cout << abs(a[n - 1] - a[0]) << endl;
return 0;
}
| [] | 1,363,595 | 1,363,596 | u415325136 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, v, n, i;
vector<int> s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
s.push_back(a);
}
int c = 0;
sort(s.begin(), s.end());
for (i = 0; i < n; i++) {
v = abs(s[i] - s[i + 1]);
c = c + v;
}
cout << c << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, v, n, i;
vector<int> s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
s.push_back(a);
}
int c = 0;
sort(s.begin(), s.end());
for (i = 0; i < n - 1; i++) {
v = abs(s[i] - s[i + 1]);
c = c + v;
}
cout << c << endl;
ret... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,363,597 | 1,363,598 | u089230684 | cpp |
p03694 | #include <bits/stdc++.h>
#define arep(a, i, n) for (ll i = (a); i < (n); i++)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define cinf(x, n) \
for (ll i = 0; i < (n); i++) \
cin >> x[i];
#define coutf(x,... | #include <bits/stdc++.h>
#define arep(a, i, n) for (ll i = (a); i < (n); i++)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define cinf(x, n) \
for (ll i = 0; i < (n); i++) \
cin >> x[i];
#define coutf(x,... | [] | 1,363,600 | 1,363,601 | u067797863 | cpp |
p03694 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s = 1000;
int e = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < s) {
s = a;
} else if (e < a) {
e = a;
}
}
cout << e - s << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s = 1000;
int e = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < s) {
s = a;
}
if (e < a) {
e = a;
}
}
cout << e - s << endl;
return 0;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,363,604 | 1,363,605 | u351174574 | cpp |
p03694 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"expression.operation.binary.remove"
] | 1,363,606 | 1,363,607 | u947236878 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | [
"call.arguments.change"
] | 1,363,614 | 1,363,615 | u110044127 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | [
"call.arguments.change",
"call.function.change",
"expression.operation.binary.change"
] | 1,363,616 | 1,363,615 | u110044127 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, min = 1001, max = 0, a;
cin >> N;
rep(i, N) {
cin >> a;
if (a < min) {
min = a;
} else if (a > max) {
max = a;
}
}
cout << max - min << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, min = 1001, max = -1, a;
cin >> N;
rep(i, N) {
cin >> a;
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
cout << max - min << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,363,617 | 1,363,618 | u114366889 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mx = 0, mn = 0;
cin >> n;
vector<int> a(n);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
mx = max(mx, a[i]);
mn = min(mn, a[i]);
}
cout << mx - mn << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, mx = -11, mn = 100000;
cin >> n;
vector<int> a(n);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
mx = max(mx, a[i]);
mn = min(mn, a[i]);
}
cout << mx - mn << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 1,363,621 | 1,363,622 | u834753207 | cpp |
p03694 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, s, t;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
s = max(s, a[i]);
t = min(t, a[i]);
}
cout << s - t << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, s = 0, t = 101010;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
s = max(s, a[i]);
t = min(t, a[i]);
}
cout << s - t << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 1,363,623 | 1,363,624 | u056912761 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
cout << A.at(N) - A.at(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
cout << A.at(N - 1) - A.at(0) << endl;
}
| [
"expression.operation.binary.add"
] | 1,363,633 | 1,363,634 | u028061225 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin... | [] | 1,363,643 | 1,363,644 | u987594251 | cpp |
p03694 | // #include <iostream>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
cout << v.end() - v.begin() << endl;
return 0;
}
| // #include <iostream>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
cout << v.back() - v.front() << endl;
return 0;
}
| [
"call.function.change",
"io.output.change"
] | 1,363,649 | 1,363,650 | u610414278 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
cout << vec[N] - vec[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
cout << vec[N - 1] - vec[0] << endl;
} | [
"expression.operation.binary.add"
] | 1,363,653 | 1,363,654 | u016183710 | cpp |
p03694 | #include <iostream>
using namespace std;
int main() {
int n, x;
int small = 1001, big = -1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x < small)
small = x;
else if (x > big)
big = x;
}
cout << big - small << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, x;
int small = 10001, big = -1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x <= small)
small = x;
if (x >= big)
big = x;
}
cout << big - small << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,363,655 | 1,363,657 | u723721005 | cpp |
p03694 | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
int ans = 0;
re... | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
int ans = 0;
re... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,363,659 | 1,363,661 | u745267317 | cpp |
p03694 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int a[100];
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
sort(a, a + N);
printf("%d\n", a[N - 1] - a[N]);
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int a[100];
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
sort(a, a + N);
printf("%d\n", a[N - 1] - a[0]);
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,363,660 | 1,363,662 | u684448032 | cpp |
p03694 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, ma = -1, mi = 1001;
rep(i, n) {
int a;
cin >> a;
ma = max(ma, a);
mi = min(mi, a);
}
cout << ma - mi << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, ma = -1, mi = 1001;
cin >> n;
rep(i, n) {
int a;
cin >> a;
ma = max(ma, a);
mi = min(mi, a);
}
cout << ma - mi << endl;
return 0;
} | [] | 1,363,669 | 1,363,670 | u071396528 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
sort(a.begin(), a.end());
cout << a[a.size() - 1] - a[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
sort(a.begin(), a.end());
cout << a[a.size() - 1] - a[0] << endl;
return 0;
} | [] | 1,363,699 | 1,363,700 | u336145516 | cpp |
p03693 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = a * 100 + b * 10 + c;
(x % 4) ? cout << "No" : cout << "Yes";
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = a * 100 + b * 10 + c;
(x % 4) ? cout << "NO" : cout << "YES";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,363,703 | 1,363,704 | u047170835 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back
using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;
const int inf = 1001001001;
const lint linf = 1001001001... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back
using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;
const int inf = 1001001001;
const lint linf = 1001001001... | [
"literal.string.change",
"io.output.change"
] | 1,363,705 | 1,363,706 | u802071009 | cpp |
p03693 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
using namespace std;
int main() {
// freopen("test.in");
int a, b, c;
cin >> a >> b >> c;
int d = 100 * c + 10 * b + a;
if (d % 4)
cout << "NO" << endl;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
using namespace std;
int main() {
// freopen("test.in");
int a, b, c;
cin >> a >> b >> c;
int d = 100 * a + 10 * b + c;
if (d % 4)
cout << "NO" << endl;
... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,363,707 | 1,363,708 | u203063262 | cpp |
p03693 | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
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 <algorithm>
#include <deque>
#include <iostream>
#include <vector>
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;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,711 | 1,363,712 | u902500155 | cpp |
p03693 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) ... | [
"expression.operation.binary.add"
] | 1,363,719 | 1,363,720 | u016572066 | cpp |
p03693 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (100 * a + 10 * b + c % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((100 * a + 10 * b + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,363,721 | 1,363,722 | u414947284 | cpp |
p03693 | #include <bits/stdc++.h>
#define LL long long
#define P pair<int, int>
#define P2 pair<LL, int>
#define ls(i) seg[i].lc
#define rs(i) seg[i].rc
using namespace std;
const int N = 18;
const int mod = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * 100 + b * 100 + c;
if (ans % 4 == 0)
p... | #include <bits/stdc++.h>
#define LL long long
#define P pair<int, int>
#define P2 pair<LL, int>
#define ls(i) seg[i].lc
#define rs(i) seg[i].rc
using namespace std;
const int N = 18;
const int mod = 1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * 100 + b * 10 + c;
if (ans % 4 == 0)
pu... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,363,725 | 1,363,726 | u980487329 | cpp |
p03693 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, g, b;
int a;
cin >> r;
cin >> g;
cin >> b;
a = r * 100 + g * 10 + b;
cout << ((a % 4) == ... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, g, b;
int a;
cin >> r;
cin >> g;
cin >> b;
a = r * 100 + g * 10 + b;
cout << (((a % 4) ==... | [
"io.output.change"
] | 1,363,727 | 1,363,728 | u874706642 | cpp |
p03693 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, g, b;
int a;
cin >> r;
cin >> g;
cin >> b;
a = r * 100 + g * 10 + b;
cout << ((a % 4) == ... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int r, g, b;
int a;
cin >> r;
cin >> g;
cin >> b;
a = r * 100 + g * 10 + b;
cout << (((a % 4) ==... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,363,729 | 1,363,728 | u874706642 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (((b * 10) + c) % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,363,732 | 1,363,733 | u816523040 | cpp |
p03693 | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
} | #include <iostream>
int main() {
int r, g, b;
std::cin >> r >> g >> b;
if ((r * 100 + g * 10 + b) % 4 == 0)
std::cout << "YES" << std::endl;
else
std::cout << "NO" << std::endl;
} | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,363,734 | 1,363,735 | u492926158 | cpp |
p03693 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
main() {
int a, b, c;
int num = 0;
cin >> a;
num += a * 100;
num += b * 10;
nu... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
main() {
int a, b, c;
int num = 0;
cin >> a >> b >> c;
num += a * 100;
num += b ... | [
"expression.operation.binary.add"
] | 1,363,736 | 1,363,737 | u562777854 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.