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 9
values |
|---|---|---|---|---|---|---|---|
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int L, r, i, j;
cin >> L >> r;
int x = 0;
int min = 2020;
for (i = L; i <= r; i++) {
if (i % 2019 == 0) {
min = 0;
break;
}
for (j = L + 1; j <= r; j++) {
if (j % 2019 == 0) {
min = 0;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int L, r, i, j;
cin >> L >> r;
int x = 0;
int min = 2020;
for (i = L; i <= r; i++) {
if (i % 2019 == 0) {
min = 0;
break;
}
for (j = i + 1; j <= r; j++) {
if (j % 2019 == 0) {
min = 0;
... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,822 | 791,821 | u199184624 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 2019;
const ll nmax = 8;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 2019;
const ll nmax = 8;
const ... | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 791,828 | 791,826 | u228295160 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 2019;
const ll nmax = 8;
const ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 2019;
const ll nmax = 8;
const ... | [
"call.arguments.change",
"assignment.change"
] | 791,828 | 791,830 | u228295160 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
int ans;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
ans = min(ans, (int)(i * j % 2019));
if (ans == 0) {
cout << 0 << endl;
return 0;
}
}
}
cout ... | #include <iostream>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
int ans = 2019;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
ans = min(ans, (int)(i * j % 2019));
if (ans == 0) {
cout << 0 << endl;
return 0;
}
}
}
... | [
"variable_declaration.value.change"
] | 791,831 | 791,832 | u355911860 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
const int MOD = 2019;
void solve(int L, int R) {
int ans = 2019;
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++) {
ans = min(ans, (i % MOD) *... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
const int MOD = 2019;
void solve(int L, int R) {
int ans = 2019;
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
ans = min(ans, (i % MOD) *... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 791,835 | 791,836 | u910756197 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
const int MOD = 2019;
void solve(int L, int R) {
long long ans = 2019;
for (int i = L; i <= R; i++) {
for (int j = L + 1; j <= R; j++) {
long long tmp = (i %... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
const int MOD = 2019;
void solve(int L, int R) {
long long ans = 2019;
for (int i = L; i <= R; i++) {
for (int j = i + 1; j <= R; j++) {
long long tmp = (i %... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,837 | 791,838 | u910756197 | cpp |
p02983 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
} else {
ll a = 2018 * 2017;
for (ll i = l; i <= r - 1; i++) {
for (ll j = l + 1; j <= r; j++) {
a = min((i... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
return 0;
} else {
ll a = 2018 * 2017;
for (ll i = l; i <= r - 1; i++) {
for (ll j = l + 1; j <= r; j++) {
a = min((i... | [
"call.arguments.change"
] | 791,845 | 791,846 | u056123277 | cpp |
p02983 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
#define int long long
using namespace std;
const int mo = 2019;
main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
int ans = 2019;
for (int i = l; i < r; i++) {
for (i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
#define int long long
using namespace std;
const int mo = 2019;
main() {
int l, r;
cin >> l >> r;
if (r - l >= 2019) {
cout << 0 << endl;
} else {
int ans = 2019;
for (int i = l; i < r; i++) {
for (i... | [
"assignment.change"
] | 791,849 | 791,850 | u468811760 | cpp |
p02983 | #include <algorithm>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int mod(int a, int b) {
int r = a % b;
return r < 0 ? r + b : r;
}
int main() {
long long l, r;
cin >> l >> ... | #include <algorithm>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int mod(int a, int b) {
int r = a % b;
return r < 0 ? r + b : r;
}
int main() {
long long l, r;
cin >> l >> ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 791,858 | 791,859 | u886790158 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long a, b, min1(999999999);
cin >> a >> b;
for (long long i = a; i < b; i++) {
for (long long j = i + 1; j <= b; j++) {
if ((i * j) % 2019 < min1)
min1 = (i * j) % 2019;
if (min1)
break;
}
if (min1)
break;
}... | #include <iostream>
using namespace std;
int main() {
long long a, b, min1(999999999);
cin >> a >> b;
for (long long i = a; i < b; i++) {
for (long long j = i + 1; j <= b; j++) {
if ((i * j) % 2019 < min1)
min1 = (i * j) % 2019;
if (!min1)
break;
}
if (!min1)
break;
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 791,871 | 791,872 | u734207808 | cpp |
p02983 | #include <iostream>
using namespace std;
int main() {
long long a, b, min1(999999999);
cin >> a >> b;
for (long long i = a; i < b; i++) {
for (long long j = i + 1; j <= b; j++) {
if ((i * j) % 2019 < min1)
min1 = (i * j) % 2019;
if (min1)
break;
}
if (min1)
break;
}... | #include <iostream>
using namespace std;
int main() {
long long a, b, min1(999999999);
cin >> a >> b;
for (long long i = a; i < b; i++) {
for (long long j = i + 1; j <= b; j++) {
if ((i * j) % 2019 < min1)
min1 = (i * j) % 2019;
if (!min1)
break;
}
if (!min1)
break;
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 791,873 | 791,872 | u734207808 | cpp |
p02983 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 2019;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + mod * 3);
long long ans = mod;
for (long long i = l; i <= r; i++) {
for (long long j = l + 1;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 2019;
int main() {
int l, r;
cin >> l >> r;
r = min(r, l + mod * 3);
long long ans = mod;
for (long long i = l; i <= r; i++) {
for (long long j = i + 1;... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,887 | 791,888 | u590241855 | cpp |
p02983 | #include <iostream>
using namespace std;
#define min(x, y) (x < y ? x : y)
int main(void) {
int l, r;
int ans = 10000000;
cin >> l >> r;
if (r - l >= 2018 || l % 2019 >= r % 2019 || r % 2019 == 0 || l % 2019 == 0)
cout << 0 << endl;
else {
for (int i = l; i < r; i++) {
for (int j = i + 1; j <... | #include <iostream>
using namespace std;
#define min(x, y) (x < y ? x : y)
int main(void) {
int l, r;
int ans = 10000000;
cin >> l >> r;
if (r - l >= 2018 || l % 2019 >= r % 2019 || r % 2019 == 0 || l % 2019 == 0)
cout << 0 << endl;
else {
for (int i = l; i < r; i++) {
for (int j = i + 1; j <... | [
"call.arguments.change",
"assignment.change"
] | 791,894 | 791,895 | u650918644 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | [] | 791,899 | 791,900 | u255001744 | cpp |
p02983 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define intMAX 1000000000
using namespace s... | [
"assignment.change"
] | 791,899 | 791,901 | u255001744 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int l, r, ans = 2019;
int main() {
scanf("%d%d", &l, &r);
if (r - l > 2020)
ans = 0;
else {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i % 1029) * (j % 1029) % 1029);
}
}
}
printf("%d", ans);
} | #include <bits/stdc++.h>
using namespace std;
int l, r, ans = 2019;
int main() {
scanf("%d%d", &l, &r);
if (r - l > 2020)
ans = 0;
else {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
}
printf("%d", ans);
} | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 791,902 | 791,903 | u448523542 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int l, r, ans = 2019;
int main() {
scanf("%d%d", &l, &r);
if (r - l > 2020)
ans = 0;
else {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, i % 1029 * (j % 1029) % 1029);
}
}
}
printf("%d", ans);
} | #include <bits/stdc++.h>
using namespace std;
int l, r, ans = 2019;
int main() {
scanf("%d%d", &l, &r);
if (r - l > 2020)
ans = 0;
else {
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
ans = min(ans, (i % 2019) * (j % 2019) % 2019);
}
}
}
printf("%d", ans);
} | [
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.number.change"
] | 791,904 | 791,903 | u448523542 | cpp |
p02983 | #include "bits/stdc++.h"
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
#define RREP(i, n, N) for (ll i = (N - 1); i >= (n); i--)
#define LREP(lst, itr) for (auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a) <= (n) && (n) < (b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a, b) memcp... | #include "bits/stdc++.h"
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
#define RREP(i, n, N) for (ll i = (N - 1); i >= (n); i--)
#define LREP(lst, itr) for (auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a) <= (n) && (n) < (b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a, b) memcp... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,907 | 791,908 | u379951749 | cpp |
p02983 | #include "bits/stdc++.h"
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
#define RREP(i, n, N) for (ll i = (N - 1); i >= (n); i--)
#define LREP(lst, itr) for (auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a) <= (n) && (n) < (b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a, b) memcp... | #include "bits/stdc++.h"
#define REP(i, n, N) for (ll i = (n); i < (N); i++)
#define RREP(i, n, N) for (ll i = (N - 1); i >= (n); i--)
#define LREP(lst, itr) for (auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a) <= (n) && (n) < (b))
#define ALL(v) (v).begin(), (v).end()
#define MCP(a, b) memcp... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,909 | 791,908 | u379951749 | cpp |
p02983 | //#include<bits/stdc++.h> // 全てのヘッダーファイルをinclude
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility> // wrap,pair
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR (i, n) for (int i = n; i > 0; i--)
#define FOR(i, m, n) ... | //#include<bits/stdc++.h> // 全てのヘッダーファイルをinclude
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility> // wrap,pair
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR (i, n) for (int i = n; i > 0; i--)
#define FOR(i, m, n) ... | [
"assignment.change"
] | 791,910 | 791,911 | u121243942 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
int main() {
long int l, r;
cin >> l >> r;
long long int ans;
vector<int> v;
if (r - l < 2019) {
for (long long int i = l; i < r - 1; i++) {
for (long long int j = i + 1; j < r; j++) {
v.push_back((i * j) % 2019);
}
}
ans = *min_el... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int l, r;
cin >> l >> r;
long long int ans;
vector<int> v;
if (r - l < 2019) {
for (long long int i = l; i <= r - 1; i++) {
for (long long int j = i + 1; j <= r; j++) {
v.push_back((i * j) % 2019);
}
}
ans = *min_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 791,931 | 791,932 | u144474330 | cpp |
p02983 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
c... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
c... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 791,943 | 791,944 | u350201286 | cpp |
p02983 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
ll l, r, ans = 10'000'000'000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> l >> r;
if (r - l >= 2019)
ans = 0;
else {
for (ll i = l; i <= r; i++) {
for (ll j = i + 1; j <= r + 1; j++) {
ans = mi... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
ll l, r, ans = 10'000'000'000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> l >> r;
if (r - l + 1 >= 2019)
ans = 0;
else {
for (ll i = l; i < r; i++) {
for (ll j = i + 1; j <= r; j++) {
ans = min... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 791,954 | 791,955 | u870610226 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UI... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UI... | [
"expression.operation.binary.add"
] | 791,964 | 791,965 | u275797573 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | [
"assignment.change"
] | 791,972 | 791,973 | u184335045 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 791,974 | 791,973 | u184335045 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
fo... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
fo... | [] | 791,987 | 791,988 | u071036035 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
fo... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
fo... | [
"assignment.change",
"expression.operation.binary.remove"
] | 791,989 | 791,988 | u071036035 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef int64_t ll;
t... | [
"variable_declaration.type.change"
] | 792,019 | 792,020 | u714564133 | cpp |
p02984 | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
//#include <intrin.h> //AtCoder (gcc)
//上ではこれがあると動かない。__popcnt用のincludeファイル。
using namespace std;
typedef long long ll;
typedef long double ld;
//#define int long long
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define sqrt(d) pow((long double)(d), 0.50)
co... | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
//#include <intrin.h> //AtCoder (gcc)
//上ではこれがあると動かない。__popcnt用のincludeファイル。
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define sqrt(d) pow((long double)(d), 0.50)
cons... | [] | 792,026 | 792,027 | u373908456 | cpp |
p02984 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 792,040 | 792,041 | u103850114 | cpp |
p02984 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) ... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> bool chmin(T &a, const T &b) ... | [
"variable_declaration.type.change"
] | 792,049 | 792,050 | u492030100 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"assignment.change",
"identifier.change",
"expression.operation.binary.change"
] | 792,051 | 792,052 | u347057617 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll x = 0;
rep(i, N) {
if (i % 2) {
x -= A[i];
} else {
x += A[i];
}
}
vector<ll> ans(N);
an... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll x = 0;
rep(i, N) {
if (i % 2) {
x -= A[i];
} else {
x += A[i];
}
}
vector<ll> ans(N);
an... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 792,060 | 792,061 | u131625544 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i % 2 == 0) {
ans += a.at(i);
} else {
ans -= a.at(i);
}
}
b.at(0) = ans;
for (int i = 1; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i % 2 == 0) {
ans += a.at(i);
} else {
ans -= a.at(i);
}
}
b.at(0) = ans;
for (int i = 1; i < n; i++) {
... | [
"assignment.change"
] | 792,062 | 792,063 | u442754977 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> A(n);
for (ll i = 0; i < n; i++) {
cin >> A.at(i);
}
vector<ll> ans(n);
bool flag = true;
ans.at(0) = 0;
for (ll i = 0; i < n; i++) {
if (flag) {
ans.at(0) += A.at(i);
flag ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> A(n);
for (ll i = 0; i < n; i++) {
cin >> A.at(i);
}
vector<ll> ans(n);
bool flag = true;
ans.at(0) = 0;
for (ll i = 0; i < n; i++) {
if (flag) {
ans.at(0) += A.at(i);
flag ... | [
"assignment.change"
] | 792,068 | 792,069 | u091552241 | cpp |
p02984 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | [
"variable_declaration.value.change"
] | 792,070 | 792,071 | u121106629 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"io.output.change",
"call.arguments.add"
] | 792,074 | 792,075 | u987913144 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll x2 = 0;
rep(i, n) {
if (i % 2)
x2 -= a[i];
else
x2 += a[i];
}
vector<int> ans(n);
ans[0] = x2 / 2;
re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll x2 = 0;
rep(i, n) {
if (i % 2)
x2 -= a[i];
else
x2 += a[i];
}
vector<int> ans(n);
ans[0] = ... | [] | 792,079 | 792,080 | u526630579 | cpp |
p02984 | #include "bits/stdc++.h"
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using namespace std;
using ull = unsigned long long;
using ll = long long;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
struct __INIT {
__INIT() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
... | #include "bits/stdc++.h"
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using namespace std;
using ull = unsigned long long;
using ll = long long;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
struct __INIT {
__INIT() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
... | [
"assignment.change"
] | 792,081 | 792,082 | u102067593 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<long> R(N);
int e = N / 2;
long d;
for (int i = 0; i < e; i++) {
d += 2 * A[2 * i];
d -= 2 * A[2 * i + 1];
}
R[0] = (d + A[N - 1]) / 2;
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<long> R(N);
int e = N / 2;
long d = 0;
for (int i = 0; i < e; i++) {
d += 2 * A[2 * i];
d -= 2 * A[2 * i + 1];
}
// d=R[0]-R[N-1] R[0]+R[N-1]=2A[... | [
"variable_declaration.value.change",
"assignment.change"
] | 792,089 | 792,090 | u089578476 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
ll x2 = 0;
rep(i, N) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
ll x2 = 0;
rep(i, N) {... | [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 792,091 | 792,092 | u976045502 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long sum, std::vector<long long> A) {
long double ans[N] = {0};
long long tmp = 0;
for (int i = 1; i <= N - 1; i += 2) {
tmp += A[i];
}
ans[0] = sum - 2 * tmp;
cout << ans[0];
for (int i = 1; i < N; i++) {
ans[i] = 2 * A[i... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long sum, std::vector<long long> A) {
long long ans[N] = {0};
long long tmp = 0;
for (long long i = 1; i <= N - 1; i += 2) {
tmp += A[i];
}
ans[0] = sum - 2 * tmp;
cout << ans[0];
for (long long i = 1; i < N; i++) {
ans[i]... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.widen.change"
] | 792,101 | 792,102 | u329399746 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> a.at(i);
a.at(i) *= 2;
}
vector<int> dam(n);
int dn = a.at(0) - a.at(n - 1);
for (int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a.at(i);
a.at(i) *= 2;
}
vector<ll> dam(n);
ll dn = a.at(0) - a.at(n - 1);
for (int i ... | [
"variable_declaration.type.change"
] | 792,105 | 792,106 | u171336585 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
c... | [
"control_flow.branch.else.remove"
] | 792,113 | 792,114 | u280175105 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll total;
ll m1;
total = accumulate(a.begin(), a.end(), 0);
for (int i = 0; i < n; i = i +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll total;
ll m1 = 0;
total = accumulate(a.begin(), a.end(), 0);
for (int i = 0; i < n; i =... | [
"variable_declaration.value.change"
] | 792,123 | 792,124 | u600402037 | cpp |
p02984 | // https://atcoder.jp/contests/abc133/tasks/abc133_d
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | // https://atcoder.jp/contests/abc133/tasks/abc133_d
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | [
"variable_declaration.type.change"
] | 792,125 | 792,126 | u858107870 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a;
rep... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int n;
// ll sum=0;
cin >> n;
vecto... | [
"variable_declaration.type.change"
] | 792,133 | 792,134 | u398221039 | cpp |
p02984 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int N, M, atr, btr;
cin >> N;
M = N / 2;
vector<ll> v(N), a(M + 1), b(M);
for (int i = 0; i < N; i++)
cin >> v[i];
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int N, M, atr, btr;
cin >> N;
M = N / 2;
vector<ll> v(N), a(M + 1), b(M);
for (int i = 0; i < N; i++)
cin >> v[i];
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 792,160 | 792,161 | u841856382 | cpp |
p02984 | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | [
"assignment.change"
] | 792,166 | 792,167 | u610897920 | cpp |
p02984 | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N;
cin >> N;
ll a[N];
ll i;
ll ans[N];
ans[0] = 0;
ll tmp = -1;
for (i = 0; i < N; i++) {
cin >> a[i];
ans[0] += tmp * a[i];
tmp *= -1;
}
for (i = 0; i < N - 1; i++) {
ans[i + 1] = (a[i] - ans[i] / 2) * 2;
... | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N;
cin >> N;
ll a[N];
ll i;
ll ans[N];
ans[0] = 0;
ll tmp = 1;
for (i = 0; i < N; i++) {
cin >> a[i];
ans[0] += tmp * a[i];
tmp *= -1;
}
for (i = 0; i < N - 1; i++) {
ans[i + 1] = (a[i] - ans[i] / 2) * 2;
... | [
"expression.operation.unary.arithmetic.remove"
] | 792,187 | 792,188 | u770161743 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
... | [
"assignment.change"
] | 792,189 | 792,190 | u947304300 | cpp |
p02984 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#de... | [] | 792,191 | 792,192 | u833515223 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n + 1);
int s = 0;
for (int i = 1; i <= n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n + 1);
ll s = 0;
for (int i = 1; i <= n; i++) {
... | [
"variable_declaration.type.change"
] | 792,197 | 792,198 | u007567244 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> r(n, 0);
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
r[0] += (i & 1 ? -a[i] : a[i]);
}
for (int i = 0; i < n; i++) {
r[i + 1] = 2 * (a[i] - r[i] / 2);
}
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> r(n, 0);
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
r[0] += (i & 1 ? -a[i] : a[i]);
}
for (int i = 0; i < n - 1; i++) {
r[i + 1] = 2 * (a[i] - r[i] / 2);
}
for (int ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 792,201 | 792,202 | u145166057 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n), rain(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
int s = 0;
for (int i = 0; i < n; i++)
s += a.at(2 * i + 1);
rain.at(0) = sum - 2 * s;
cout << rain.a... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n), rain(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
sum += a.at(i);
}
int s = 0;
for (int i = 0; 2 * i + 1 < n; i++)
s += a.at(2 * i + 1);
rain.at(0) = sum - 2 * s;
cout... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 792,208 | 792,209 | u090084494 | cpp |
p02984 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std:... | [
"assignment.change"
] | 792,216 | 792,217 | u752814744 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> cont(n);
vector<int64_t> dam(n);
rep(i, n) { cin >> cont.at(i); }
int a = 0;
rep(i, n) {
if (i % 2 == 0) {
a += cont.at(i);
} else {
a -= cont... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> cont(n);
vector<int64_t> dam(n);
rep(i, n) { cin >> cont.at(i); }
int a = 0;
rep(i, n) {
if (i % 2 == 0) {
a += cont.at(i);
} else {
a -= cont... | [
"assignment.change"
] | 792,218 | 792,219 | u408053928 | cpp |
p02984 | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
template <typename T> vector<T> make_v(... | #include <bits/stdc++.h>
//#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
template <typename T> vector<T> make_v(... | [
"variable_declaration.type.change"
] | 792,224 | 792,225 | u544732702 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
ll o;
vector<ll> x(n);
rep(i, n) {
cin >> a[i];
if (i % 2 != 0) {
o += a[i];
}
sum += a[i];
}
x[0] = sum - 2 ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n = 0;
cin >> n;
vector<ll> a(n);
ll sum = 0;
ll o = 0;
vector<ll> x(n);
rep(i, n) {
cin >> a[i];
if (i % 2 != 0) {
o += a[i];
}
sum += a[i];
}
x[0] = ... | [
"variable_declaration.value.change"
] | 792,246 | 792,247 | u910028046 | cpp |
p02984 | //今回は漸化式が見えているので、それを上手く使った実装を行う。
//この問題ではa[0]とa[n-1]に関係があるので、漸化式を解き難い
// →無理やりa[0]を求めることが可能→漸化式を立てられる。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
ll o;
vector<ll> x(n);
rep(i, n)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n = 0;
cin >> n;
vector<ll> a(n);
ll sum = 0;
ll o = 0;
vector<ll> x(n);
rep(i, n) {
cin >> a[i];
if (i % 2 != 0) {
o += a[i];
}
sum += a[i];
}
x[0] = ... | [
"variable_declaration.value.change"
] | 792,248 | 792,247 | u910028046 | cpp |
p02984 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
vll A(N);
fo... | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main() {
ll N;
cin >> N;
vll A(N);
fo... | [
"expression.operation.binary.add"
] | 792,251 | 792,252 | u558667782 | cpp |
p02984 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 1; i <= n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int A[100010];
int sum = 0;
rep(i, N) { cin >> A[i]; }
int X[100010];
X[0] = A[0];
rep(i, N - 2) X[0] = A[i ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 1; i <= n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int A[100010];
int sum = 0;
rep(i, N) { cin >> A[i]; }
int X[100010];
X[0] = A[0];
rep(i, N - 2) X[0] = A[i ... | [
"expression.operation.binary.add"
] | 792,257 | 792,258 | u582357587 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | [
"expression.operation.binary.add"
] | 792,264 | 792,265 | u828388155 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
int x2 = 0;
rep(i, N) {
if (i % 2 == 0)
x2 += 2 * A[i];
else
x2 -= 2 * A[i];
}
int x = x2 / 2;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll x2 = 0;
rep(i, N) {
if (i % 2 == 0)
x2 += 2 * A[i];
else
x2 -= 2 * A[i];
}
ll x = x2 / 2;
... | [
"variable_declaration.type.change"
] | 792,282 | 792,283 | u945359338 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum_a = 0, sum_ans = 0;
cin >> n;
vector<long> a(n);
vector<long> ans(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum_a += a[i];
}
ans[0] = 0;
for (int i = 2; i < n * 2; i += 2) {
ans[i % n] = ans[(i - 2) % n] + (a[(i - 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, sum_a = 0, sum_ans = 0;
cin >> n;
vector<long> a(n);
vector<long> ans(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
sum_a += a[i];
}
ans[0] = 0;
for (int i = 2; i < n * 2; i += 2) {
ans[i % n] = ans[(i - 2) % n] + (a[(i - ... | [
"variable_declaration.type.primitive.change"
] | 792,286 | 792,287 | u966257731 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
long long n, a[100005], b[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i != 1)
b[1] += a[i];
else
b[1] -= a[i];
}
for (int i = 2; i <= n; i++)
b[i] = 2 * a[i - 1] - b[i - 1];
for (int i = 1; i <= n; i+... | #include <bits/stdc++.h>
using namespace std;
long long n, a[100005], b[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i & 1)
b[1] += a[i];
else
b[1] -= a[i];
}
for (int i = 2; i <= n; i++)
b[i] = 2 * a[i - 1] - b[i - 1];
for (int i = 1; i <= n; i++... | [
"control_flow.branch.if.condition.change"
] | 792,296 | 792,297 | u469639111 | cpp |
p02984 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | [
"assignment.value.change"
] | 792,302 | 792,303 | u098844816 | cpp |
p02984 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
//#include<bits/stdc++... | [
"expression.operator.change"
] | 792,304 | 792,303 | u098844816 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
ll N, sum = 0;
cin >> N;
vector<int> A(N), B(N, 0);
rep... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
ll N, sum = 0;
cin >> N;
vector<int> A(N), B(N, 0);
rep... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 792,305 | 792,306 | u924297957 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = ... | [] | 792,307 | 792,308 | u322177979 | cpp |
p02984 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int x = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 1) {
x -= A[i];
} else {
x += A[i];
}
}
x /= 2;
int ans[N];
ans[0] ... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int x = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 1) {
x -= A[i];
} else {
x += A[i];
}
}
x /= 2;
int ans[N];
ans[0] ... | [] | 792,315 | 792,316 | u289709148 | cpp |
p02984 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a < (int)c; ++a)
#define cd(a, b, c) for (int a = (b... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a < (int)c; ++a)
#define cd(a, b, c) for (int a = (b... | [
"variable_declaration.type.change"
] | 792,332 | 792,333 | u730731139 | cpp |
p02984 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> A(N);
vector<ll> X(N);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
if (i == 0) {
ll sub = 2 * A[N - 1];
for (int j = N - 2; j >= 0; j--) {
sub = ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> A(N);
vector<ll> X(N);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
if (i == 0) {
ll sub = 2 * A[N - 1];
for (int j = N - 2; j >= 0; j--) {
sub = ... | [
"control_flow.branch.else.add"
] | 792,342 | 792,343 | u211361761 | cpp |
p02984 | #include <iostream>
using namespace std;
int A[100000];
int M[100000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
A[i] = 2 * A[i];
}
int w = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0)
w += A[i];
else
w -= A... | #include <iostream>
using namespace std;
long A[100000];
long M[100000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
A[i] = 2 * A[i];
}
long w = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0)
w += A[i];
else
w -... | [
"variable_declaration.type.primitive.change"
] | 792,348 | 792,349 | u522200796 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i > 0; i--)
#define FOR(i, j, n) for (int i = j; i < n; i++)
#define COUT(n) cout << n << "\n"
typedef long long ll;
const int INF = 1e9;
ll dot(ll n, ll *x, vector<ll> y) {
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i > 0; i--)
#define FOR(i, j, n) for (int i = j; i < n; i++)
#define COUT(n) cout << n << "\n"
typedef long long ll;
const int INF = 1e9;
ll dot(ll n, ll *x, vector<ll> y) {
ll ans = 0;
... | [
"assignment.change"
] | 792,354 | 792,355 | u481293569 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, a[100001], s, sum, m[100001];
int main() {
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++)
s += a[i];
m[1] = a[i];
for (i = 2; i <= n; i++)
m[i] = m[i - 2] + a[i];
for (i = 1; i <= n; i++) {
sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
long long i, j, n, a[100001], s, sum, m[100001];
int main() {
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++)
s += a[i];
m[1] = a[1];
for (i = 2; i <= n; i++)
m[i] = m[i - 2] + a[i];
for (i = 1; i <= n; i++) {
sum = 0;
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 792,395 | 792,396 | u788285838 | cpp |
p02984 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int a[200000];
ll d[200000];
bool used[200000];
int main() {
int n;
cin >> n;
rep(i, n) cin ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll a[200000];
ll d[200000];
bool used[200000];
int main() {
int n;
cin >> n;
rep(i, n) cin >... | [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 792,397 | 792,398 | u781091740 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int n;
int a[3000303];
int ans;
int main() {
int i, j, k;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
int sum = 0, pd = 0;
for (i = 1; i < n; i++) {
if (!pd)
sum ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define int long long
using namespace std;
int n;
int a[3000303];
int ans;
signed main() {
int i, j, k;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
int sum = 0, pd = 0;
for (i = 1; i < n; i++) ... | [
"variable_declaration.type.primitive.change"
] | 792,407 | 792,408 | u437187732 | cpp |
p02984 | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long ll;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
retu... | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long ll;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
retu... | [
"assignment.change"
] | 792,414 | 792,415 | u118875091 | cpp |
p02984 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int in = 0; in < n; in++) {
cin >> a[in];
}
int b[n];
b[0] = a[0];
for (int in = 0; in < n / 2; in++) {
b[0] -= a[2 * in + 1] - a[2 * in + 2];
}
for (int in = 0; in < n - 1; in++) {
b... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int in = 0; in < n; in++) {
cin >> a[in];
}
int b[n];
b[0] = a[0];
for (int in = 0; in < n / 2; in++) {
b[0] -= a[2 * in + 1] - a[2 * in + 2];
}
for (int in = 0; in < n - 1; in++) {
b... | [
"io.output.change"
] | 792,433 | 792,434 | u981957299 | cpp |
p02984 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int in = 0; in < n; in++) {
cin >> a[in];
}
int b[n];
b[0] = a[0];
for (int in = 0; in < n / 2; in++) {
b[0] -= a[2 * in + 1] - a[2 * in + 2];
}
for (int in = 0; in < n - 1; in++) {
b... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int in = 0; in < n; in++) {
cin >> a[in];
}
int b[n];
b[0] = a[0];
for (int in = 0; in < n / 2; in++) {
b[0] -= a[2 * in + 1] - a[2 * in + 2];
}
for (int in = 0; in < n - 1; in++) {
b... | [
"io.output.change"
] | 792,435 | 792,434 | u981957299 | cpp |
p02984 | #include <bits/stdc++.h>
#define ll long long
#define BUF 1e5
#define INF 1 << 30
constexpr ll mod = 1e9 + 7;
using namespace std;
ll A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;
int main() {
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
int tmp = 0;
... | #include <bits/stdc++.h>
#define ll long long
#define BUF 1e5
#define INF 1 << 30
constexpr ll mod = 1e9 + 7;
using namespace std;
ll A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;
int main() {
cin >> N;
vector<ll> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
ll tmp = 0;
fo... | [
"variable_declaration.type.change"
] | 792,438 | 792,439 | u030090262 | cpp |
p02984 | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, k = 1;
cin >> N;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> mountain(N, 0);
for (int i = 0; i < N; i++) {
mountain[0] += k * A[i];
k *= (-1);
}
mountain... | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, k = 1;
cin >> N;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> mountain(N, 0);
for (int i = 0; i < N; i++) {
mountain[0] += k * A[i];
k *= (-1);
}
mountain... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 792,450 | 792,451 | u703503553 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#def... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 792,468 | 792,469 | u948618130 | cpp |
p02984 | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> v(N, 0);
vector<long long> ans(N, -1);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
ans[0] += v[i];
} else {
ans[0] -... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> v(N, 0);
vector<long long> ans(N, 0);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
ans[0] += v[i];
} else {
ans[0] -=... | [
"literal.number.change",
"call.arguments.change"
] | 792,486 | 792,487 | u652609504 | cpp |
p02984 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_b... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_b... | [
"variable_declaration.type.change"
] | 792,492 | 792,493 | u285598935 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> x(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int64_t sum = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
sum += A[i];
} else {
sum -= A[i];
}
}
x[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> x(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int64_t sum = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
sum += A[i];
} else {
sum -= A[i];
}
}
x[... | [] | 792,494 | 792,495 | u731032776 | cpp |
p02984 | #include <iostream>
using namespace std;
int a[200000][2];
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n; i++) {
int b;
cin >> b;
sum += b;
a[i / 2 + 1][i % 2] = a[i / 2][i % 2] + b;
}
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
cout << sum - (a[n / 2][... | #include <iostream>
using namespace std;
long long a[200000][2];
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n; i++) {
long long b;
cin >> b;
sum += b;
a[i / 2 + 1][i % 2] = a[i / 2][i % 2] + b;
}
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
cout << sum ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 792,500 | 792,501 | u300590099 | cpp |
p02984 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
ll n, ii, sum, sum2;
vector<ll> a, b;
c... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
ll n, ii, sum, sum2;
vector<ll> a, b;
c... | [
"expression.operation.binary.add"
] | 792,504 | 792,505 | u146847434 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
// debug
#define debug(arr) \... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
// debug
#define debug(arr) \... | [
"expression.operation.binary.remove"
] | 792,524 | 792,525 | u336721073 | cpp |
p02984 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 1000000007
using P = pair<int, int>;
using ll ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 1000000007
#define int long long
using P = pai... | [
"variable_declaration.type.primitive.change"
] | 792,527 | 792,528 | u033620890 | cpp |
p02984 | #include <bits/stdc++.h>
//#pragma GCC target("avx,avx2,sse4.2")
#define re register
#define rep(q, a, b) for (re int q = a, q##_end_ = b; q <= q##_end_; ++q)
#define dep(q, a, b) for (re int q = a, q##_end_ = b; q >= q##_end_; --q)
#define mem(a, b) memset(a, b, sizeof a)
#define debug(a) cerr << #a << ' ' << a << "__... | #include <bits/stdc++.h>
//#pragma GCC target("avx,avx2,sse4.2")
#define re register
#define rep(q, a, b) for (re int q = a, q##_end_ = b; q <= q##_end_; ++q)
#define dep(q, a, b) for (re int q = a, q##_end_ = b; q >= q##_end_; --q)
#define mem(a, b) memset(a, b, sizeof a)
#define debug(a) cerr << #a << ' ' << a << "__... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 792,529 | 792,530 | u063024444 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
int a[n];
REP(i, n) cin >> a[i];
int tmp[n + 1];
tm... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
ll n;
cin >> n;
ll a[n];
REP(i, n) cin >> a[i];
ll tmp[n + 1];
tmp[0... | [
"variable_declaration.type.change"
] | 792,546 | 792,547 | u366398972 | cpp |
p02984 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
int A[N];
int x = 0;
for (int i = 0; i <... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
ll A[N];
ll x = 0;
for (int i = 0; i < N... | [
"variable_declaration.type.change"
] | 792,552 | 792,553 | u890169362 | cpp |
p02984 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100000 + 5;
int b[maxn];
vector<int> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
scanf("%d", b + i);
b[i] *= 2;
}
int t = b[n];
for (int i = 1; i < n; ++i) {
if (i & 1)
t -= b[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100000 + 5;
ll b[maxn];
vector<ll> ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
scanf("%lld", b + i);
b[i] *= 2;
}
ll t = b[n];
for (int i = 1; i < n; ++i) {
if (i & 1)
t -= b[i];
... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 792,558 | 792,559 | u455472057 | cpp |
p02984 | #include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int M[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
M[1] = A[0];
for (int i = 1; i < N; i++) {
if (i % 2 == 0) {
M[1] -= A[i];
} else {
M[1] += A[i];
}
}
M[0] = 2 * A[0] - M... | #include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int M[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
M[1] = A[0];
for (int i = 1; i < N; i++) {
if (i % 2 == 0) {
M[1] -= A[i];
} else {
M[1] += A[i];
}
}
M[0] = 2 * A[0] - M... | [
"assignment.change"
] | 792,564 | 792,565 | u561443723 | cpp |
p02984 | #include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int M[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
M[1] = A[0];
for (int i = 1; i < N; i++) {
if (i % 2 == 0) {
M[1] -= A[i];
} else {
M[1] += A[i];
}
}
M[0] = 2 * A[0] - M... | #include <iostream>
using namespace std;
int main() {
int N;
int A[100000];
int M[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
M[1] = A[0];
for (int i = 1; i < N; i++) {
if (i % 2 == 0) {
M[1] -= A[i];
} else {
M[1] += A[i];
}
}
M[0] = 2 * A[0] - M... | [
"assignment.change"
] | 792,566 | 792,565 | u561443723 | cpp |
p02984 | // luckYrat written
// Twitter: @luckYrat_
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <map>
#include <set>
#include <stack>
#include <vector>
// god(強すぎるので使用禁止！！！！！！！)
//#include <tourist>
using namespace std;
typedef pair<int,... | // luckYrat written
// Twitter: @luckYrat_
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <map>
#include <set>
#include <stack>
#include <vector>
// god(強すぎるので使用禁止！！！！！！！)
//#include <tourist>
using namespace std;
typedef pair<int,... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 792,569 | 792,570 | u466161487 | cpp |
p02984 | #include <bits/stdc++.h>
#define endl '\n'
#define mp make_pair
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
typedef long lon... | #include <bits/stdc++.h>
#define endl '\n'
#define mp make_pair
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
typedef long lon... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 792,573 | 792,574 | u377622126 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.