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 "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | [
"control_flow.branch.if.condition.change"
] | 1,363,740 | 1,363,741 | u918357423 | cpp |
p03693 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); ... | [
"control_flow.branch.if.condition.change"
] | 1,363,744 | 1,363,745 | u357887823 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const N = 100 * 1000 + 16;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int x = 0;
for (int i = 0; i < 4; ++i) {
int z;
cin >> z;
x = x * 10 + z;
}
cout << (x % 4 == 0 ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const N = 100 * 1000 + 16;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int x = 0;
for (int i = 0; i < 3; ++i) {
int z;
cin >> z;
x = x * 10 + z;
}
cout << (x % 4 == 0 ? "YES" : "NO") << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,363,748 | 1,363,749 | u003223716 | cpp |
p03693 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long 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 <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long 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,750 | 1,363,751 | u050865477 | cpp |
p03693 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define maxn 100005
#define ll long long
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define rc(s) return cout << s, 0
#define _ \
ios_base::sync_with_stdio(false); ... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define maxn 100005
#define ll long long
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define rc(s) return cout << s, 0
#define _ \
ios_base::sync_with_stdio(false); ... | [
"expression.operation.binary.add"
] | 1,363,752 | 1,363,753 | u288444854 | cpp |
p03693 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ---------------------
// repetition
#define FOR(i, a, b) for (... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ---------------------
// repetition
#define FOR(i, a, b) for (... | [
"control_flow.branch.if.condition.change"
] | 1,363,754 | 1,363,755 | u430622110 | cpp |
p03694 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD ... | [
"io.output.change",
"call.add"
] | 1,363,769 | 1,363,770 | u824337972 | cpp |
p03694 | #include <iostream>
#include <limits.h>
using namespace std;
int main() {
int n, max = 0, min = INT_MAX;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
if (max < a) {
max = a;
}
if (min > a) {
min = a;
}
}
cout << max - min << endl;
} | #include <iostream>
#include <limits.h>
using namespace std;
int main() {
int n, max = 0, min = INT_MAX;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (max < a) {
max = a;
}
if (min > a) {
min = a;
}
}
cout << max - min << endl;
} | [] | 1,363,787 | 1,363,788 | u172258329 | 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,793 | 1,363,794 | u389766217 | cpp |
p03694 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, l, n) for (int i = (l); i < (n); i++)
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
int main() {
int N;
cin >> N;
vector<int> house(... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, l, n) for (int i = (l); i < (n); i++)
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
int main() {
int N;
cin >> N;
vector<int> house(... | [
"expression.operation.binary.add"
] | 1,363,815 | 1,363,816 | u705561278 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
cout << a[n - 1] - a[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[i];
}
sort(a.begin(), a.end());
cout << a[n - 1] - a[0] << endl;
}
| [] | 1,363,841 | 1,363,842 | u962609087 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ma = -1;
int mi = 10000;
vector<int> ie(n);
for (int i = 0; i < n; i++) {
cin >> ie[i];
ma = max(ma, ie[i]);
mi = min(mi, ie[i]);
}
cout << ma - mi << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ma = -1;
int mi = 10000;
vector<int> ie(n);
for (int i = 0; i < n; i++) {
cin >> ie[i];
ma = max(ma, ie[i]);
mi = min(mi, ie[i]);
}
cout << ma - mi << endl;
}
| [] | 1,363,845 | 1,363,846 | u885523920 | cpp |
p03694 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, a, maxi = -1, mini = 1001;
for (int i = 0; i < N; i++) {
cin >> a;
maxi = max(a, maxi);
mini = min(mini, a);
}
cout << maxi - ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, a, maxi = -1, mini = 1001;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
maxi = max(a, maxi);
mini = min(mini, a);
}
cou... | [] | 1,363,847 | 1,363,848 | u444349080 | cpp |
p03694 | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (auto &i : a) {
std::cin >> i;
}
std::cout << *std::max_element(a.cbegin(), a.cend()) +
*std::min_element(a.cbegin(), a.cend())
<< std::endl;
return 0;
}
| #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (auto &i : a) {
std::cin >> i;
}
std::cout << *std::max_element(a.cbegin(), a.cend()) -
*std::min_element(a.cbegin(), a.cend())
<< std::endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 1,363,855 | 1,363,856 | u438319362 | cpp |
p03694 | #include <iostream>
using namespace std;
int main() {
int i, a, b;
int min, max;
cin >> a;
for (i = 0; i < a; i++) {
cin >> b;
if (max < b) {
max = b;
}
if (min > b)
min = b;
}
cout << max - min << endl;
}
| #include <iostream>
using namespace std;
int main() {
int i, a, b;
int min = 1001, max = -1;
cin >> a;
for (i = 0; i < a; i++) {
cin >> b;
if (max < b) {
max = b;
}
if (min > b)
min = b;
}
cout << max - min << endl;
}
| [
"variable_declaration.value.change"
] | 1,363,857 | 1,363,858 | u401902038 | cpp |
p03694 | #include <algorithm>
#include <iostream>
#include <string>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, b) FOR(i, 0, b)
using namespace std;
int main(void) {
int n;
int a[101];
cin >> n;
FOR(i, 1, n + 1) { cin >> a[i]; }
sort(a, a + n);
cout << a[n] - a[1] << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, b) FOR(i, 0, b)
using namespace std;
int main(void) {
int n;
int a[101];
cin >> n;
FOR(i, 0, n) { cin >> a[i]; }
sort(a, a + n);
cout << a[n - 1] - a[0] << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,363,859 | 1,363,860 | u057611820 | cpp |
p03694 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a, ma = 1000, mi = 0;
while (cin >> a) {
ma = max(ma, a);
mi = min(mi, a);
}
cout << ma - mi << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a, ma = 0, mi = 1000;
while (cin >> a) {
ma = max(ma, a);
mi = min(mi, a);
}
cout << ma - mi << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,363,861 | 1,363,862 | u598050616 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
ret... | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
ret... | [
"call.remove",
"call.add"
] | 1,363,867 | 1,363,868 | u811472478 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (int i = n - 2; i = 0; i--) {
sum += v[i + 1] - v[i];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (int i = n - 2; i >= 0; i--) {
sum += v[i + 1] - v[i];
}
cout << sum << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 1,363,878 | 1,363,879 | u401900157 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < n; i++) {
sum += v[i] - v[i + 1];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
sum += v[i] - v[i + 1];
}
cout << sum << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,363,880 | 1,363,881 | u401900157 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < n; i++) {
sum += v[i + 1] - v[i];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
sum += v[i] - v[i + 1];
}
cout << sum << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove",
"assignment.change"
] | 1,363,882 | 1,363,881 | u401900157 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a, u = -1, d = 10000;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
u = max(u, a);
d = max(d, a);
}
cout << u - d;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a, u = -1, d = 10000;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
u = max(u, a);
d = min(d, a);
}
cout << u - d;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,363,887 | 1,363,888 | u058348416 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << vec[n] - vec[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << vec[n - 1] - vec[0] << endl;
} | [
"expression.operation.binary.add"
] | 1,363,889 | 1,363,890 | u529813812 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << vec[n] - vec[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << vec[n - 1] - vec[0] << endl;
} | [
"variable_declaration.type.primitive.change"
] | 1,363,891 | 1,363,890 | u529813812 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << vec[n] - vec[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << vec[n - 1] - vec[0] << endl;
} | [
"expression.operation.binary.add"
] | 1,363,889 | 1,363,892 | u529813812 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << vec[n] - vec[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
cout << vec[n - 1] - vec[0] << endl;
} | [
"variable_declaration.type.primitive.change"
] | 1,363,891 | 1,363,892 | u529813812 | cpp |
p03694 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
templ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
templ... | [
"expression.operation.binary.change"
] | 1,363,895 | 1,363,896 | u635484372 | cpp |
p03694 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
templ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
templ... | [
"variable_declaration.name.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,363,897 | 1,363,896 | u635484372 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> place(n);
for (int i = 0; i < n; i++) {
cin >> place.at(i);
}
sort(place.begin(), place.end());
cout << place.at(n - 1) - place.at(1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> place(n);
for (int i = 0; i < n; i++) {
cin >> place.at(i);
}
sort(place.begin(), place.end());
cout << place.at(n - 1) - place.at(0) << endl;
} | [
"literal.number.change",
"io.output.change"
] | 1,363,898 | 1,363,899 | u240748165 | cpp |
p03694 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), ... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), ... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,363,902 | 1,363,903 | u771541325 | cpp |
p03694 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), ... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,363,904 | 1,363,903 | u771541325 | cpp |
p03694 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> pos(N);
for (int i = 0; i < N; i++) {
cin >> pos[i];
}
sort(pos.begin(), pos.end());
int max, min, ans;
max = pos[N];
min = pos[0];
ans = max - min;
cout << a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> pos(N);
for (int i = 0; i < N; i++) {
cin >> pos[i];
}
sort(pos.begin(), pos.end());
int max, min, ans;
max = pos[N - 1];
min = pos[0];
ans = max - min;
cout ... | [
"assignment.change"
] | 1,363,907 | 1,363,908 | u432332916 | cpp |
p03694 | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N, mini = -1, maxi = 2000;
cin >> N;
rep(i, N) {
int a;
cin >> a;
mini = min(mini, a);
maxi = max(ma... | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N, mini = 2000, maxi = -1;
cin >> N;
rep(i, N) {
int a;
cin >> a;
mini = min(mini, a);
maxi = max(ma... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,363,914 | 1,363,915 | u895536055 | cpp |
p03694 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
signed main() {
int a;
vector<int> b(a);
rep(i, a) cin... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
signed main() {
int a;
cin >> a;
vector<int> b(a);
r... | [] | 1,363,925 | 1,363,926 | u341447450 | cpp |
p03694 | #include <bits/stdc++.h>
#define REPI(i, n) for (int i = 0; i < n; i++)
#define REPJ(j, n) for (int j = 0; j < n; j++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int maximum = 1e9, minimum = 0;
REPI(i, n) {
int x;
cin >> x;
maximum = max(maxi... | #include <bits/stdc++.h>
#define REPI(i, n) for (int i = 0; i < n; i++)
#define REPJ(j, n) for (int j = 0; j < n; j++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int maximum = 0, minimum = 1e9;
REPI(i, n) {
int x;
cin >> x;
maximum = max(maxi... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,363,929 | 1,363,930 | u505466816 | cpp |
p03694 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define REPC(i, x) for (int i{0}; i <= (int)(x); i++)
#define RR... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define REPC(i, x) for (int i{0}; i <= (int)(x); i++)
#define RR... | [] | 1,363,931 | 1,363,932 | u815659544 | cpp |
p03694 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, a[1100];
for (int i = 0; i <... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, a[1100];
cin >> N;
for (int... | [] | 1,363,933 | 1,363,934 | u591914971 | 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;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[n];
sort(v.begin(), v.end());
cout << v[n - 1] - v[0] << 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;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
cout << v[n - 1] - v[0] << endl;
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,363,935 | 1,363,936 | u319179101 | cpp |
p03694 | typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int min1 = 0;
int max1 = 0;
rep(i, N) {
int x;
cin >> x;
;
max1 = max(x, max1);
min1 = min(x, min1);
}
cout << max1 - min1 << endl;
} | typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int min1 = 10000000;
int max1 = 0;
rep(i, N) {
int x;
cin >> x;
;
max1 = max(x, max1);
min1 = min(x, min1);
}
cout << max1 - min1 << endl;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,363,937 | 1,363,938 | u438592861 | cpp |
p03694 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <new>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, ans;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
ans = A[N - 1] - A... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <new>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, ans;
cin >> N;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
ans = ... | [] | 1,363,939 | 1,363,940 | u441865202 | cpp |
p03694 | #include <cstdio>
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
int main() {
int no_of_houses;
scanf("%d", &no_of_houses);
int min_house = 100, max_house = 1;
while (no_of_houses--) {
int distance;
scanf("%d", &distance);
min_house = min(min_house, distance);
max_house ... | #include <cstdio>
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
int main() {
int no_of_houses;
scanf("%d", &no_of_houses);
int min_house = 1000, max_house = 0;
while (no_of_houses--) {
int distance;
scanf("%d", &distance);
min_house = min(min_house, distance);
max_house... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,363,941 | 1,363,942 | u927253988 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, min = 1001, max = -1;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min) {
min = a;
} else if (a > max) {
max = a;
}
}
printf("%d", max - min);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, min = 1001, max = -1;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a < min) {
min = a;
}
if (a > max) {
max = a;
}
}
printf("%d", max - min);
return 0;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,363,943 | 1,363,944 | u933503143 | cpp |
p03694 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
cin >> N;
int a[110];
rep(i, N) cin >> a[i];
sort(a, a + N);
cout << a[N] - a[0] << endl;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int N;
cin >> N;
int a[110];
rep(i, N) cin >> a[i];
sort(a, a + N);
cout << a[N - 1] - a[0] << endl;
} | [
"expression.operation.binary.add"
] | 1,363,947 | 1,363,948 | u281384315 | cpp |
p03694 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int N;
cin >> N;
int a[N];
REP(i, N) { cin >> a[N]; }
sort(a, a + N);
cout << a[N - 1] - a[0];
} | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int N;
cin >> N;
int a[N];
REP(i, N) { cin >> a[i]; }
sort(a, a + N);
cout << a[N - 1] - a[0];
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,363,955 | 1,363,956 | u244712228 | cpp |
p03694 | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int N, house[1005], i, ans;
ans = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> house[i];
}
sort(house, house + N, greater<int>());
cout << house[0] - house[N] << endl;
} | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int N, house[1005], i, ans;
ans = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> house[i];
}
sort(house, house + N, greater<int>());
cout << house[0] - house[N - 1] << endl;
} | [
"expression.operation.binary.add"
] | 1,363,972 | 1,363,973 | u451625046 | cpp |
p03694 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b = 0, s = 100000;
int n;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b = 0, s = 100000;
int n;
cin >> n;
for (int i = 0; i <... | [] | 1,363,978 | 1,363,979 | u247996218 | cpp |
p03694 | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int i, a[100] = {};
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
int Max = 0, Min = 1000;
for (i = 0; i < N - 1; i++) {
if (Max <= a[i]) {
Max = a[i];
}
if (a[i] <= Min) {
Min = a[i];
}
}
if (N == 1) {
Max ... | #include <stdio.h>
int main() {
int N;
scanf("%d", &N);
int i, a[100] = {};
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
int Max = 0, Min = 1000;
for (i = 0; i < N; i++) {
if (Max <= a[i]) {
Max = a[i];
}
if (a[i] <= Min) {
Min = a[i];
}
}
if (N == 1) {
Max = a[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,363,987 | 1,363,988 | u811528179 | cpp |
p03694 | // abc064_b Traveling AtCoDeer Problem
#include <bits/stdc++.h>
using namespace std;
namespace {
int a[110];
}
int main() {
int i;
int N;
cin >> N;
for (i = 1; i <= N; i++)
cin >> a[i];
sort(a, a + N);
cout << a[N - 1] - a[0] << endl;
return 0;
}
| // abc064_b Traveling AtCoDeer Problem
#include <bits/stdc++.h>
using namespace std;
namespace {
int a[110];
}
int main() {
int i;
int N;
cin >> N;
for (i = 0; i < N; i++)
cin >> a[i];
sort(a, a + N);
cout << a[N - 1] - a[0] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,363,996 | 1,363,997 | u197246729 | cpp |
p03694 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include... |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,363,999 | 1,364,000 | u558671021 | cpp |
p03694 | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb pus... | #ifdef LOCAL
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb pus... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,364,003 | 1,364,004 | u528744583 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int ma = 0;
int mi = 1001;
for (int i = 0; i < a; i++) {
int b[100];
cin >> b[i];
int ma = max(ma, b[i]);
int mi = min(mi, b[i]);
}
cout << ma - mi << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int ma = 0;
int mi = 1001;
for (int i = 0; i < a; i++) {
int b[100];
cin >> b[i];
ma = max(ma, b[i]);
mi = min(mi, b[i]);
}
cout << ma - mi << endl;
}
| [] | 1,364,005 | 1,364,006 | u686352452 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, mi = -1, ma = 100000;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
if (mi > a)
mi = a;
if (ma < a)
ma = a;
}
cout << ma - mi << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, ma = -1, mi = 100000;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
if (mi > a)
mi = a;
if (ma < a)
ma = a;
}
cout << ma - mi << endl;
} | [
"variable_declaration.name.change",
"identifier.change"
] | 1,364,009 | 1,364,010 | u314988220 | cpp |
p03694 | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int amin = 1000, amax = 0, a;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a > amax)
amax = a;
else if (a < amin)
amin = a;
}
printf("%d", amax - amin);
} | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int amin = 1000, amax = 0, a;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a > amax)
amax = a;
if (a < amin)
amin = a;
}
printf("%d", amax - amin);
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,364,011 | 1,364,012 | u717659249 | cpp |
p03694 | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = INT_MAX;
int max = INT_MIN;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < min)
min = a;
else if (max < a)
max = a;
}
cout << max - min << endl;
return 0;
} | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int min = INT_MAX;
int max = INT_MIN;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < min)
min = a;
if (max < a)
max = a;
}
cout << max - min << endl;
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,364,013 | 1,364,014 | u692797455 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ma = 10000, mi = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
ma = min(ma, a);
mi = max(mi, a);
}
cout << ma - mi << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ma = 0, mi = 10000;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
ma = max(ma, a);
mi = min(mi, a);
}
cout << ma - mi << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,364,023 | 1,364,024 | u572077985 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ma = 10000, mi = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
ma = max(ma, a);
mi = min(mi, a);
}
cout << ma - mi << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ma = 0, mi = 10000;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
ma = max(ma, a);
mi = min(mi, a);
}
cout << ma - mi << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,364,025 | 1,364,024 | u572077985 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num[N];
for (int i = 0; i < N; i++) {
cin >> num[i];
}
int mi = 10000, ma = 0;
for (int k = 0; k < N; k++) {
mi = min(mi, num[k]);
ma = max(ma, num[k]);
}
cout << ma << mi << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num[N];
for (int i = 0; i < N; i++) {
cin >> num[i];
}
int mi = 10000, ma = 0;
for (int k = 0; k < N; k++) {
mi = min(mi, num[k]);
ma = max(ma, num[k]);
}
cout << ma - mi << endl;
return 0;
}
| [
"io.output.change"
] | 1,364,030 | 1,364,031 | u833295869 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num[N];
for (int i = 0; i < N; i++) {
cin >> num[i];
}
int mi = 0, ma = 0;
for (int k = 0; k < N; k++) {
mi = min(mi, num[k]);
ma = max(ma, num[k]);
}
cout << ma - mi << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num[N];
for (int i = 0; i < N; i++) {
cin >> num[i];
}
int mi = 10000, ma = 0;
for (int k = 0; k < N; k++) {
mi = min(mi, num[k]);
ma = max(ma, num[k]);
}
cout << ma - mi << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 1,364,032 | 1,364,031 | u833295869 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a[110];
cin >> N;
for (int i = 0; i < N; i++)
cin >> a[i];
sort(a, a + N);
cout << a[99] - a[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a[110];
cin >> N;
for (int i = 0; i < N; i++)
cin >> a[i];
sort(a, a + N);
cout << a[N - 1] - a[0] << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,364,039 | 1,364,040 | u235155157 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
cout << a[n] - a[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
cout << a[n - 1] - a[0] << endl;
}
| [
"expression.operation.binary.add"
] | 1,364,043 | 1,364,044 | u728522370 | cpp |
p03694 | #include <iostream>
using namespace std;
int a, m = 1e3, M;
main() {
cin >> a;
for (; cin >> a; m = m < a ? m : a)
M = M < a ? a : M;
cout << M - a << endl;
} | #include <iostream>
using namespace std;
int a, m = 1e3, M;
main() {
cin >> a;
for (; cin >> a; m = m < a ? m : a)
M = M < a ? a : M;
cout << M - m << endl;
} | [
"identifier.change",
"io.output.change"
] | 1,364,045 | 1,364,046 | u657913472 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
#define rp(i, n) for (int i = 0; i < n; i++)
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define lrp(i, n) for (long long i = 0; i < n; i++)
#define lrep(i, m, n) for (long long i = m; i <= n; i++)
#define ll long long
#define sort(a) sort(a.begin(), a.end())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, n) for (int i = 0; i < n; i++)
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define lrp(i, n) for (long long i = 0; i < n; i++)
#define lrep(i, m, n) for (long long i = m; i <= n; i++)
#define ll long long
#define sort(a) sort(a.begin(), a.end())
#define ... | [
"variable_declaration.type.primitive.change"
] | 1,364,047 | 1,364,048 | u050138914 | cpp |
p03694 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main() {
ll n;
cin >> ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int main() {
ll n;
cin >> ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,364,049 | 1,364,050 | u780950519 | cpp |
p03694 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main(void) {
int N;
std::cin >> N;
std::vector<int> a(N);
for (int i = 0; i < N; ++i) {
std::cin >> a[i];
}
std::sort(a.begin(), a.end());
std::cout << a.end() - a.begin() << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main(void) {
int N;
std::cin >> N;
std::vector<int> a(N);
for (int i = 0; i < N; ++i) {
std::cin >> a[i];
}
std::sort(a.begin(), a.end());
std::cout << a.back() - a.front() << std::endl;
return 0;
} | [
"call.function.change",
"expression.operation.binary.change"
] | 1,364,051 | 1,364,052 | u012984696 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[n];
sort(arr, arr + n);
cout << arr[n - 1] - arr[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr, arr + n);
cout << arr[n - 1] - arr[0] << endl;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,364,063 | 1,364,064 | u288781044 | cpp |
p03694 | #include <cstdio>
int main(int argc, char const *argv[]) {
int min = 100;
int max = 1;
int tmp;
int N;
scanf("%d", &N);
for (size_t i = 0; i < N; i++) {
if (i == N - 1) {
scanf("%d\n", &tmp);
} else {
scanf("%d ", &tmp);
}
if (tmp < min) {
min = tmp;
}
if (tmp > ma... | #include <cstdio>
int main(int argc, char const *argv[]) {
int min = 1000;
int max = 0;
int tmp;
int N;
scanf("%d", &N);
for (size_t i = 0; i < N; i++) {
if (i == N - 1) {
scanf("%d\n", &tmp);
} else {
scanf("%d ", &tmp);
}
if (tmp < min) {
min = tmp;
}
if (tmp > m... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,364,070 | 1,364,071 | u167254084 | cpp |
p03694 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int t = N - 1;
int a[t];
for (int c = 0; c < N; c++) {
cin >> a[c];
}
sort(a, a + t);
cout << a[t] - a[0] << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int t = N - 1;
int a[t];
for (int c = 0; c < N; c++) {
cin >> a[c];
}
sort(a, a + N);
cout << a[t] - a[0] << "\n";
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,364,074 | 1,364,075 | u114154184 | cpp |
p03694 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int tmp = 0;
int max = 0, min = 1001;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (min >= tmp)
min = tmp;
else if (max <= tmp)
max = tmp;
}
cout << max - min << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int tmp = 0;
int max = 0, min = 1001;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (min >= tmp)
min = tmp;
if (max <= tmp)
max = tmp;
}
cout << max - min << endl;
return 0;
} | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,364,078 | 1,364,079 | u416511777 | cpp |
p03694 | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define SORTR(v, n) sort(v, v + n, greater<int>());
// #define int long long // %d=>%lld
#define pb push_back
#define INF 100000000
using namespace std;
type... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define SORTR(v, n) sort(v, v + n, greater<int>());
// #define int long long // %d=>%lld
#define pb push_back
#define INF 100000000
using namespace std;
type... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,364,084 | 1,364,085 | u334829320 | cpp |
p03694 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a = 114514, b = -1, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
a = min(a, c);
b = max(a, b);
}
cout << b - a << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a = 114514, b = -1, c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
a = min(a, c);
b = max(b, c);
}
cout << b - a << endl;
return 0;
} | [
"call.arguments.change",
"call.arguments.add"
] | 1,364,092 | 1,364,093 | u924885571 | cpp |
p03694 | #include <algorithm>
#include <deque>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using lli = long long int;
using ulli = unsigned long long int;
//#define EVEL 1
#ifndef EVEL
#define dbug(X) std::cout << #X << ":" << X << " ";
#define dbugf(s) std::cout << s << " "... | #include <algorithm>
#include <deque>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using lli = long long int;
using ulli = unsigned long long int;
//#define EVEL 1
#ifndef EVEL
#define dbug(X) std::cout << #X << ":" << X << " ";
#define dbugf(s) std::cout << s << " "... | [
"expression.operation.binary.add"
] | 1,364,101 | 1,364,102 | u032455837 | cpp |
p03694 | #include <iostream>
#include <stdio.h>
#define INF 0x3f3f3f3f
using namespace std;
int main() {
int n;
cin >> n;
int maxx = INF, minn = -1;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
maxx = max(maxx, a);
minn = max(minn, a);
}
cout << maxx - minn << endl;
} | #include <iostream>
#include <stdio.h>
#define INF 0x3f3f3f3f
using namespace std;
int main() {
int n;
cin >> n;
int maxx = -1, minn = INF;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
maxx = max(maxx, a);
minn = min(minn, a);
}
cout << maxx - minn << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.replace.add",
"literal.replace.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,364,103 | 1,364,104 | u545934296 | cpp |
p03694 | #include <iostream>
int main() {
int num;
scanf("%d", &num);
int iPos;
int min = 1000;
int max = 0;
for (int i = 0; i < num; i++) {
scanf("%d", &iPos);
if (iPos < min)
min = iPos;
else if (iPos > max)
max = iPos;
}
std::cout << max - min;
return 0;
} | #include <iostream>
int main() {
int num;
scanf("%d", &num);
int iPos;
int min = 1024;
int max = -1;
for (int i = 0; i < num; i++) {
scanf("%d", &iPos);
if (iPos < min)
min = iPos;
if (iPos > max)
max = iPos;
}
std::cout << max - min;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,364,109 | 1,364,110 | u938396154 | cpp |
p03694 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
cin >> n;
int house[n];
int min = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> house[i];
if (i == 0) {
min = house[0];
max = house[0];
} else {
if (min > house[0])
min = house[0];
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
cin >> n;
int house[n];
int min = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> house[i];
if (i == 0) {
min = house[0];
max = house[0];
} else {
if (min > house[i])
min = house[i];
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,364,139 | 1,364,140 | u670544038 | cpp |
p03694 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n, m, l, k;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> k;
m = max(m, k);
l = min(l, k);
}
cout << m - l << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n, m = 0, l = 1000, k;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> k;
m = max(m, k);
l = min(l, k);
}
cout << m - l << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 1,364,141 | 1,364,142 | u069315118 | cpp |
p03694 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, a[1000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
N = a[N] - a[0];
cout << N << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, a[1000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
N = a[N - 1] - a[0];
cout << N << endl;
} | [
"assignment.change"
] | 1,364,148 | 1,364,149 | u076814124 | cpp |
p03694 | #include "bits/stdc++.h"
//#include<bits/stdc++.h>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a) for (int i = 0; i < a; i++)
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<int, PI> V;
typedef vector<int> VE;
const ll mod = 100... | #include "bits/stdc++.h"
//#include<bits/stdc++.h>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a) for (int i = 0; i < a; i++)
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<int, PI> V;
typedef vector<int> VE;
const ll mod = 100... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,364,152 | 1,364,153 | u009275459 | cpp |
p03694 | #include <iostream>
using namespace std;
int main() {
int N, a;
int mina = 1000;
int maxa = 0;
for (int n = 0; n != N; ++n) {
cin >> a;
if (a < mina)
mina = a;
if (a > maxa)
maxa = a;
}
cout << maxa - mina << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, a;
cin >> N;
int mina = 1000;
int maxa = 0;
for (int n = 0; n != N; ++n) {
cin >> a;
if (a < mina)
mina = a;
if (a > maxa)
maxa = a;
}
cout << maxa - mina << endl;
return 0;
} | [] | 1,364,160 | 1,364,161 | u277971517 | cpp |
p03694 | #include <bits/stdc++.h>
using namespace std;
#define opt \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define lli lo... | #include <bits/stdc++.h>
using namespace std;
#define opt \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define lli lo... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,364,170 | 1,364,171 | u736906167 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, x = 0;
cin >> a >> b >> c;
x = 100 * a + 10 * b + c;
if (x % 4 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, x = 0;
cin >> a >> b >> c;
x = 100 * a + 10 * b + c;
if (x % 4 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,364,172 | 1,364,173 | u394919721 | cpp |
p03693 |
#include <cstdio>
int main() {
int r, g, b, x;
scanf("%d %d %d", &r, &g, &b);
x = r * 100 + g * 10 + b;
if (x % 4 == 0)
printf("Yes\n");
else
printf("No");
}
|
#include <cstdio>
int main() {
int r, g, b, x;
scanf("%d %d %d", &r, &g, &b);
x = r * 100 + g * 10 + b;
if (x % 4 == 0)
printf("YES\n");
else
printf("NO");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,364,180 | 1,364,181 | u308494653 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
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 main() {
int r, g, b;
cin >> r >> g >> b;
if ((100 * r + 10 * g + b) % 4) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,364,184 | 1,364,185 | u277971517 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
g = g * 10 + b;
cout << (g ? "NO" : "YES") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
g = g * 10 + b;
cout << (g % 4 ? "NO" : "YES") << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 1,364,186 | 1,364,187 | u711746266 | cpp |
p03693 | #include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "math.h"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "utility"
using namespace std;
const long long int... | #include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "math.h"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "utility"
using namespace std;
const long long int... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,364,190 | 1,364,191 | u468700753 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << ((a * 100 + b * 10 + c) % 4 ? "No" : "Yes") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << ((a * 100 + b * 10 + c) % 4 ? "NO" : "YES") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,364,196 | 1,364,197 | u933245049 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
r *= 100;
g *= 10;
int ans = r + g + b;
if (ans % 4 == 0) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
r *= 100;
g *= 10;
int ans = r + g + b;
if (ans % 4 == 0) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,364,198 | 1,364,199 | u908087877 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int num = 100 * r + 10 * g + b;
cout << (num % 4 == 0 ? "yes" : "no") << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int r, g, b;
cin >> r >> g >> b;
int num = 100 * r + 10 * g + b;
cout << (num % 4 == 0 ? "YES" : "NO") << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,364,205 | 1,364,206 | u497285470 | cpp |
p03693 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a * 100 + b * 10 + c % 4)
printf("YES\n");
else
printf("NO\n");
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if ((a * 100 + b * 10 + c) % 4)
printf("NO\n");
else
printf("YES\n");
return 0;
} | [
"control_flow.branch.if.condition.change",
"call.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.add"
] | 1,364,207 | 1,364,208 | u414134756 | cpp |
p03693 | #include <iostream>
using namespace std;
int main() {
int r, g, b;
while (cin >> r >> g >> b) {
int i = r * 100 + g * 10 + b;
if (i % 4 == 0) {
cout << "YSE" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int r, g, b;
while (cin >> r >> g >> b) {
int i = r * 100 + g * 10 + b;
if (i % 4 == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,364,211 | 1,364,212 | u332115007 | cpp |
p03693 | #include <iostream>
int main(void) {
int r = 0;
int g = 0;
int b = 0;
std::cin >> r >> g >> b;
if (((r * 100) + (g * 10) + b) % 4 == 0) {
std::cout << "Yes";
} else
std::cout << "No";
return 0;
} | #include <iostream>
int main(void) {
int r = 0;
int g = 0;
int b = 0;
std::cin >> r >> g >> b;
if (((r * 100) + (g * 10) + b) % 4 == 0) {
std::cout << "YES";
} else
std::cout << "NO";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,364,219 | 1,364,220 | u491749590 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (a * 100 + b * 10 + c % 4) {
puts("NO");
} else {
puts("YES");
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if ((a * 100 + b * 10 + c) % 4) {
puts("NO");
} else {
puts("YES");
}
} | [
"control_flow.branch.if.condition.change"
] | 1,364,223 | 1,364,224 | u264988903 | cpp |
p03693 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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 <algorithm>
#include <iostream>
#include <string>
#include <vector>
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,364,227 | 1,364,228 | u340980616 | cpp |
p03693 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <sys/time.h>
#include <utility>
#include <vector>
using namespace std;
void solve(int r, int g, int b) {
int num = 100 * r + 10 * g + b;
if (num % 4 == 0) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <sys/time.h>
#include <utility>
#include <vector>
using namespace std;
void solve(int r, int g, int b) {
int num = 100 * r + 10 * g + b;
if (num % 4 == 0) {
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" ... | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 1,364,237 | 1,364,238 | u462434199 | cpp |
p03693 | #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 <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #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 <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [
"literal.string.change",
"io.output.change"
] | 1,364,241 | 1,364,242 | u318334550 | cpp |
p03693 | #include <stdio.h>
int main() {
int red, green, blue;
scanf("%d%d%d", &red, &green, &blue);
if ((100 * red + 10 * green + blue) % 4 == 0)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| #include <stdio.h>
int main() {
int red, green, blue;
scanf("%d%d%d", &red, &green, &blue);
if ((100 * red + 10 * green + blue) % 4 == 0)
printf("YES\n");
else
printf("NO\n");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,364,243 | 1,364,244 | u519182891 | cpp |
p03693 | #include <bits/stdc++.h>
using namespace std;
long long int A, B;
int main() {
scanf("%lld%lld%lld", &A, &A, &B);
puts(((A * 2 + B) & 3) ? "No" : "Yes");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long int A, B;
int main() {
scanf("%lld%lld%lld", &A, &A, &B);
puts(((A * 2 + B) & 3) ? "NO" : "YES");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,364,257 | 1,364,258 | u462437857 | cpp |
p03693 | #define _CRT_SECURE_NO_DEPRECATE
#pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include... | #define _CRT_SECURE_NO_DEPRECATE
#pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include... | [
"literal.number.change",
"expression.operation.binary.change"
] | 1,364,259 | 1,364,260 | u419859762 | cpp |
p03695 | #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];
}
int rate[9] = {0};
for (int i = 0; i < N; i++) {
if (a[i] > 3600)
a[i] = 3599;
rate[a[i] / 400]++;
}
int ans = 0;
for (int i = 0; i < 8; i... | #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];
}
int rate[9] = {0};
for (int i = 0; i < N; i++) {
if (a[i] > 3600)
a[i] = 3599;
rate[a[i] / 400]++;
}
int ans = 0;
for (int i = 0; i < 8; i... | [
"call.remove",
"call.arguments.change"
] | 1,364,266 | 1,364,267 | u605685616 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int n, i, j, a, b, c, m, M, r;
int main() {
cin >> n;
vector<int> col(8, 0);
for (; i < n; i++) {
cin >> r;
if (r < 400)
col[0]++;
else if (r < 800)
col[1]++;
else if (r < 1200)
col[2]++;
else if (r < 1600)
col[3]++;
els... | #include <bits/stdc++.h>
using namespace std;
int n, i, j, a, b, c, m, M, r;
int main() {
cin >> n;
vector<int> col(8, 0);
for (; i < n; i++) {
cin >> r;
if (r < 400)
col[0]++;
else if (r < 800)
col[1]++;
else if (r < 1200)
col[2]++;
else if (r < 1600)
col[3]++;
els... | [
"call.remove",
"call.arguments.change"
] | 1,364,268 | 1,364,269 | u303621502 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define FOR(i, start, end) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define FOR(i, start, end) ... | [
"call.remove",
"call.arguments.change"
] | 1,364,276 | 1,364,277 | u548649937 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.