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;
break;
}
x = (i % 2019 * j % 2019) % 2019;
if (min > x) {
min = x;
}
x = 0;
}
}
cout << min << endl;
return 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;
break;
}
x = (i % 2019 * j % 2019) % 2019;
if (min > x) {
min = x;
}
x = 0;
}
}
cout << min << endl;
return 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 ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < n; j++) {
for (size_t k = 0; k < n; k++) {
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind {
public:
vector<ll> Parent;
UnionFind(ll N) { Parent = vector<ll>(N, -1); }
ll find(ll A) {
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A) { return -Parent[find(A)]; }
bool Union(ll A, ll B) {
A = find(A);
B = find(B);
if (A == B) {
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
ll half = powMod(a, p / 2);
return mulMod(half, half);
} else {
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
void solve(long long L, long long R) {
ll ans = INT16_MAX;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
} else {
for (ll i = L; i <= R; i++) {
for (ll j = L; j <= R; j++) {
if (i < j) {
ans = min((i % MOD) * (j % MOD), ans);
} else {
continue;
}
}
}
cout << ans << endl;
}
}
int main() {
long long L;
scanf("%lld", &L);
long long R;
scanf("%lld", &R);
solve(L, R);
return 0;
}
| #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 ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < n; j++) {
for (size_t k = 0; k < n; k++) {
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind {
public:
vector<ll> Parent;
UnionFind(ll N) { Parent = vector<ll>(N, -1); }
ll find(ll A) {
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A) { return -Parent[find(A)]; }
bool Union(ll A, ll B) {
A = find(A);
B = find(B);
if (A == B) {
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
ll half = powMod(a, p / 2);
return mulMod(half, half);
} else {
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
void solve(long long L, long long R) {
ll ans = INT16_MAX;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
} else {
for (ll i = L; i <= R; i++) {
for (ll j = L; j <= R; j++) {
if (i < j) {
ans = min((i * j) % MOD, ans);
} else {
continue;
}
}
}
cout << ans << endl;
}
}
int main() {
long long L;
scanf("%lld", &L);
long long R;
scanf("%lld", &R);
solve(L, R);
return 0;
}
| [
"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 ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < n; j++) {
for (size_t k = 0; k < n; k++) {
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind {
public:
vector<ll> Parent;
UnionFind(ll N) { Parent = vector<ll>(N, -1); }
ll find(ll A) {
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A) { return -Parent[find(A)]; }
bool Union(ll A, ll B) {
A = find(A);
B = find(B);
if (A == B) {
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
ll half = powMod(a, p / 2);
return mulMod(half, half);
} else {
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
void solve(long long L, long long R) {
ll ans = INT16_MAX;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
} else {
for (ll i = L; i <= R; i++) {
for (ll j = L; j <= R; j++) {
if (i < j) {
ans = min((i % MOD) * (j % MOD), ans);
} else {
continue;
}
}
}
cout << ans << endl;
}
}
int main() {
long long L;
scanf("%lld", &L);
long long R;
scanf("%lld", &R);
solve(L, R);
return 0;
}
| #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 ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < n; j++) {
for (size_t k = 0; k < n; k++) {
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind {
public:
vector<ll> Parent;
UnionFind(ll N) { Parent = vector<ll>(N, -1); }
ll find(ll A) {
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A) { return -Parent[find(A)]; }
bool Union(ll A, ll B) {
A = find(A);
B = find(B);
if (A == B) {
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
ll half = powMod(a, p / 2);
return mulMod(half, half);
} else {
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
void solve(long long L, long long R) {
ll ans = INT16_MAX;
if (R - L + 1 >= 2019) {
cout << 0 << endl;
} else {
for (ll i = L; i <= R; i++) {
for (ll j = L; j <= R; j++) {
if (i < j) {
ans = min(((i % MOD) * (j % MOD)) % MOD, ans);
} else {
continue;
}
}
}
cout << ans << endl;
}
}
int main() {
long long L;
scanf("%lld", &L);
long long R;
scanf("%lld", &R);
solve(L, R);
return 0;
}
| [
"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 << ans << endl;
return 0;
} | #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;
}
}
}
cout << ans << 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) * (j % MOD) % MOD);
if (ans == 0) {
printf("0\n");
return;
}
}
}
printf("%d\n", ans);
}
int main() {
int L, R;
cin >> L >> R;
solve(L, R);
return 0;
} | #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) * (j % MOD) % MOD);
if (ans == 0) {
printf("%d\n", ans);
return;
}
}
}
printf("%d\n", ans);
}
int main() {
int L, R;
cin >> L >> R;
solve(L, R);
return 0;
} | [
"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 % MOD) * (j % MOD);
tmp %= MOD;
ans = min(ans, tmp);
if (ans == 0) {
printf("%lld\n", ans);
return;
}
}
}
printf("%lld\n", ans);
}
int main() {
int L, R;
cin >> L >> R;
solve(L, R);
return 0;
} | #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 % MOD) * (j % MOD);
tmp %= MOD;
ans = min(ans, tmp);
if (ans == 0) {
printf("%lld\n", ans);
return;
}
}
}
printf("%lld\n", ans);
}
int main() {
int L, R;
cin >> L >> R;
solve(L, R);
return 0;
} | [
"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 % 2019) * (j % 2019), a);
}
}
cout << a << endl;
}
} | #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 * j) % 2019, a);
}
}
cout << a << endl;
}
} | [
"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 (int j = i + 1; j <= r; j++) {
ans = min(ans, (i % mo) * (j % mo));
}
}
cout << ans << endl;
}
return 0;
} | #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 (int j = i + 1; j <= r; j++) {
ans = min(ans, (i % mo) * (j % mo) % mo);
}
}
cout << ans << endl;
}
return 0;
} | [
"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 >> r;
long long cnd, cur_cnds_size;
bool is_terminate = false;
int cnt = 0;
set<int> candidate_set;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
cnd = ((i % 2019) * (j % 2019) % 2019);
candidate_set.insert(cnd);
cnt++;
if (cnt >= 2018) {
is_terminate = true;
break;
}
}
if (is_terminate)
break;
}
cout << *candidate_set.begin() << endl;
return 0;
}
| #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 >> r;
long long cnd, cur_cnds_size;
bool is_terminate = false;
int cnt = 0;
set<int> candidate_set;
for (int i = l; i < r; i++) {
for (int j = i + 1; j <= r; j++) {
cnd = ((i % 2019) * (j % 2019) % 2019);
candidate_set.insert(cnd);
cnt++;
if (cnt >= 100000) {
is_terminate = true;
break;
}
}
if (is_terminate)
break;
}
cout << *candidate_set.begin() << endl;
return 0;
}
| [
"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;
}
cout << min1;
} | #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;
}
cout << min1;
} | [
"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;
}
cout << min1;
}
| #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;
}
cout << min1;
} | [
"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; j <= r; j++) {
ans = min(ans, i * j % mod);
}
}
cout << ans << endl;
return 0;
}
| #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; j <= r; j++) {
ans = min(ans, i * j % mod);
}
}
cout << ans << endl;
return 0;
}
| [
"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 <= r; j++) {
ans = min((i % 2019) * (j % 2019), ans);
}
}
cout << ans << endl;
}
} | #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 <= r; j++) {
ans = min(((i % 2019) * (j % 2019)) % 2019, ans);
}
}
cout << ans << endl;
}
} | [
"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 std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
ll l, r;
int main() {
cin >> l >> r;
ll ans = 2020;
r = min(r, l + 2019);
for (ll i = l; i <= min(r, l + 2019); i++) {
for (ll j = i + 1; j <= min(r, l + 2019); j++) {
ll tmp = (i % 2019) * (j % 2019);
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
} | #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 std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
ll l, r;
int main() {
cin >> l >> r;
ll ans = 2020;
r = min(r, l + 2019);
for (ll i = l; i <= min(r, l + 2019); i++) {
for (ll j = i + 1; j <= min(r, l + 2019); j++) {
ll tmp = (i * j) % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [] | 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 std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
ll l, r;
int main() {
cin >> l >> r;
ll ans = 2020;
r = min(r, l + 2019);
for (ll i = l; i <= min(r, l + 2019); i++) {
for (ll j = i + 1; j <= min(r, l + 2019); j++) {
ll tmp = (i % 2019) * (j % 2019);
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
} | #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 std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
ll l, r;
int main() {
cin >> l >> r;
ll ans = 2020;
r = min(r, l + 2019);
for (ll i = l; i <= min(r, l + 2019); i++) {
for (ll j = i + 1; j <= min(r, l + 2019); j++) {
ll tmp = (i % 2019) * (j % 2019) % 2019;
ans = min(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"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) memcpy(b, a, sizeof(b))
#define P(s) cout << (s) << endl
#define P2(a, b) cout << (a) << " " << (b) << endl
#define V2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll mod = 2019;
int main() {
ll L, R, tmp;
cin >> L >> R;
ll ans = INF;
for (ll i = L; i <= R; i++) {
for (ll j = L + 1; j <= R; j++) {
tmp = ((i % mod) * (j % mod)) % mod;
if (tmp == 0) {
ans = 0;
goto LABEL;
}
ans = min(ans, tmp);
}
}
LABEL:
cout << ans << endl;
} | #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) memcpy(b, a, sizeof(b))
#define P(s) cout << (s) << endl
#define P2(a, b) cout << (a) << " " << (b) << endl
#define V2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll mod = 2019;
int main() {
ll L, R, tmp;
cin >> L >> R;
ll ans = INF;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
tmp = ((i % mod) * (j % mod)) % mod;
if (tmp == 0) {
ans = 0;
goto LABEL;
}
ans = min(ans, tmp);
}
}
LABEL:
cout << ans << endl;
} | [
"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) memcpy(b, a, sizeof(b))
#define P(s) cout << (s) << endl
#define P2(a, b) cout << (a) << " " << (b) << endl
#define V2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll mod = 2019;
int main() {
ll L, R, tmp;
cin >> L >> R;
ll ans = INF;
for (ll i = L; i <= R; i++) {
for (ll j = L + 1; j <= R; j++) {
tmp = (i % mod) * (j % mod) % mod;
if (tmp == 0) {
ans = 0;
goto LABEL;
}
ans = min(ans, tmp);
}
}
LABEL:
cout << ans << endl;
} | #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) memcpy(b, a, sizeof(b))
#define P(s) cout << (s) << endl
#define P2(a, b) cout << (a) << " " << (b) << endl
#define V2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
ll mod = 2019;
int main() {
ll L, R, tmp;
cin >> L >> R;
ll ans = INF;
for (ll i = L; i <= R; i++) {
for (ll j = i + 1; j <= R; j++) {
tmp = ((i % mod) * (j % mod)) % mod;
if (tmp == 0) {
ans = 0;
goto LABEL;
}
ans = min(ans, tmp);
}
}
LABEL:
cout << ans << endl;
} | [
"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) for (int i = m; i < n; i++)
const int MOD{int(1e9 + 7)}; // int 1000000007
const int inf{int(1e9)}; // inf = 1000000000 // 1e9 はdouble型
using namespace std;
typedef long long ll;
// 最大公約数（ユークリッドの互除法）
int GCD(int x, int y) {
if (x > y) {
swap(x, y);
}
int r = y % x;
while (r != 0) {
y = x;
x = r;
r = y % x;
}
return x;
}
// 最小公倍数
int LCM(int x, int y) {
ll gcd = GCD(x, y);
return x * y / gcd;
}
// 素数判定(素数ならtrue,合成数ならfalse)
bool IsPrime(int num) {
if (num < 2)
return false; // 0,1
else if (num == 2)
return true; // 2
else if (num % 2 == 0)
return false; // 偶数
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false; // 割り切れたら素数ではない
}
return true; // 全部通ったら素数
}
// pairをsecond基準で昇順sort
// sort(vector_name.begin(),vector_name.end(),compare_by_b);
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second)
return a.second < b.second;
else
return a.first < b.first;
}
// 桁数を返す：unsigned(-の値をとらない)
unsigned Digit(unsigned num) { return log10(num) + 1; }
// ----------------------------------------------------------------
int main(void) {
ll L, R;
cin >> L >> R;
ll h = R - L;
if (h >= 2019) {
cout << 0 << endl;
} else {
ll tmp = inf;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
tmp = min(tmp, (i % 2019) * (j % 2019));
if (tmp == 0)
break;
}
}
cout << tmp << endl;
}
return 0;
}
| //#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) for (int i = m; i < n; i++)
const int MOD{int(1e9 + 7)}; // int 1000000007
const int inf{int(1e9)}; // inf = 1000000000 // 1e9 はdouble型
using namespace std;
typedef long long ll;
// 最大公約数（ユークリッドの互除法）
int GCD(int x, int y) {
if (x > y) {
swap(x, y);
}
int r = y % x;
while (r != 0) {
y = x;
x = r;
r = y % x;
}
return x;
}
// 最小公倍数
int LCM(int x, int y) {
ll gcd = GCD(x, y);
return x * y / gcd;
}
// 素数判定(素数ならtrue,合成数ならfalse)
bool IsPrime(int num) {
if (num < 2)
return false; // 0,1
else if (num == 2)
return true; // 2
else if (num % 2 == 0)
return false; // 偶数
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false; // 割り切れたら素数ではない
}
return true; // 全部通ったら素数
}
// pairをsecond基準で昇順sort
// sort(vector_name.begin(),vector_name.end(),compare_by_b);
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second)
return a.second < b.second;
else
return a.first < b.first;
}
// 桁数を返す：unsigned(-の値をとらない)
unsigned Digit(unsigned num) { return log10(num) + 1; }
// ----------------------------------------------------------------
int main(void) {
ll L, R;
cin >> L >> R;
ll h = R - L;
if (h >= 2019) {
cout << 0 << endl;
} else {
ll tmp = inf;
for (ll i = L; i < R; i++) {
for (ll j = i + 1; j <= R; j++) {
tmp = min(tmp, (i % 2019) * (j % 2019) % 2019);
if (tmp == 0)
break;
}
}
cout << tmp << endl;
}
return 0;
}
| [
"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_element(v.begin(), v.end());
} else {
ans = 0;
}
cout << ans;
return 0;
} | #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_element(v.begin(), v.end());
} else {
ans = 0;
}
cout << ans;
return 0;
} | [
"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); \
cout.tie(0);
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define gc getchar_unlocked
typedef long long ll;
typedef long double ld;
const double PI = acos(-1.0);
const int mod = 1000000007;
int main() {
FASTIO
ll l, r, ans;
cin >> l >> r;
if (r - l > 2020)
ans = 0;
else {
ans = 2019;
for (ll i = l; i <= r; i++)
for (ll j = l + 1; j < r; j++)
ans = min(ans, (i * j) % 2019);
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define gc getchar_unlocked
typedef long long ll;
typedef long double ld;
const double PI = acos(-1.0);
const int mod = 1000000007;
int main() {
FASTIO
ll l, r, ans;
cin >> l >> r;
if (r - l > 2020)
ans = 0;
else {
ans = 2019;
for (ll i = l; i < r; i++)
for (ll j = i + 1; j <= r; j++)
ans = min(ans, (i * j) % 2019);
}
cout << ans;
return 0;
}
| [
"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 = min(ans, i * j % 2019);
}
}
}
cout << ans;
return 0;
} | #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(ans, i * j % 2019);
}
}
}
cout << ans;
return 0;
} | [
"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 UINT = unsigned long long;
unsigned gcd(unsigned a, unsigned b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
const UINT mod = 1000000007;
UINT PowMod(UINT x, UINT y) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % mod;
} else if (y % 2 == 0) {
auto tmp = PowMod(x, y / 2);
return tmp * tmp % mod;
} else {
auto tmp = PowMod(x, y / 2);
return (tmp * tmp % mod) * x % mod;
}
}
UINT getModInv(UINT N) { return PowMod(N, mod - 2); }
struct uf {
vector<INT> p;
uf(INT n) : p(n) {
for (size_t i = 0; i < n; i++) {
p[i] = i;
}
}
INT rt(INT n) { return p[n] == n ? n : p[n] = rt(p[n]); }
void un(INT n, INT m) { p[rt(n)] = p[rt(m)]; }
bool eq(INT n, INT m) { return rt(n) == rt(m); }
};
int main() {
INT n;
cin >> n;
vector<INT> a(n), x(n);
INT sum_i = 0, inv = 1;
for (size_t i = 0; i < n; i++) {
cin >> a[i];
sum_i += a[i] * inv;
inv *= -1;
}
x[0] = sum_i / 2;
cout << x[0] << ' ';
for (size_t i = 1; i < n; i++) {
x[i] = a[i - 1] - x[i - 1];
cout << x[i] * 2;
if (x[i] != n - 1) {
cout << ' ';
}
}
return 0;
}
| #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 UINT = unsigned long long;
unsigned gcd(unsigned a, unsigned b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
const UINT mod = 1000000007;
UINT PowMod(UINT x, UINT y) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % mod;
} else if (y % 2 == 0) {
auto tmp = PowMod(x, y / 2);
return tmp * tmp % mod;
} else {
auto tmp = PowMod(x, y / 2);
return (tmp * tmp % mod) * x % mod;
}
}
UINT getModInv(UINT N) { return PowMod(N, mod - 2); }
struct uf {
vector<INT> p;
uf(INT n) : p(n) {
for (size_t i = 0; i < n; i++) {
p[i] = i;
}
}
INT rt(INT n) { return p[n] == n ? n : p[n] = rt(p[n]); }
void un(INT n, INT m) { p[rt(n)] = p[rt(m)]; }
bool eq(INT n, INT m) { return rt(n) == rt(m); }
};
int main() {
INT n;
cin >> n;
vector<INT> a(n), x(n);
INT sum_i = 0, inv = 1;
for (size_t i = 0; i < n; i++) {
cin >> a[i];
sum_i += a[i] * inv;
inv *= -1;
}
x[0] = sum_i / 2;
cout << x[0] * 2 << ' ';
for (size_t i = 1; i < n; i++) {
x[i] = a[i - 1] - x[i - 1];
cout << x[i] * 2;
if (x[i] != n - 1) {
cout << ' ';
}
}
return 0;
}
| [
"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 = pair<int, long>;
using pll = pair<long, long>;
using vc = vector<char>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, t) for (int i = s; i < t; i++)
#define RNG(i, s, t, u) for (int i = s; i < t; i += u)
#define MOD 1000000007
#define all(vec) vec.begin(), vec.end()
int main() {
int n;
cin >> n;
vl a(n);
long sum = 0;
rep(i, n) {
cin >> a.at(i);
sum += a.at(i);
}
long sub = 0;
RNG(i, 1, n, 2) { sub += a.at(i); }
vl d(n);
d.at(0) = sum - sub * 2;
REP(i, 1, n) { d.at(i) = 2 * a.at(i) - d.at(i - 1); }
rep(i, n) cout << d.at(i) << " ";
cout << endl;
} | #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 = pair<int, long>;
using pll = pair<long, long>;
using vc = vector<char>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, t) for (int i = s; i < t; i++)
#define RNG(i, s, t, u) for (int i = s; i < t; i += u)
#define MOD 1000000007
#define all(vec) vec.begin(), vec.end()
int main() {
int n;
cin >> n;
vl a(n);
long sum = 0;
rep(i, n) {
cin >> a.at(i);
sum += a.at(i);
}
long sub = 0;
RNG(i, 1, n, 2) { sub += a.at(i); }
vl d(n);
d.at(0) = sum - sub * 2;
REP(i, 1, n) { d.at(i) = 2 * a.at(i - 1) - d.at(i - 1); }
rep(i, n) cout << d.at(i) << " ";
cout << endl;
} | [
"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 = pair<int, long>;
using pll = pair<long, long>;
using vc = vector<char>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, t) for (int i = s; i < t; i++)
#define RNG(i, s, t, u) for (int i = s; i < t; i += u)
#define MOD 1000000007
#define all(vec) vec.begin(), vec.end()
int main() {
int n;
cin >> n;
vl a(n);
long sum = 0;
rep(i, n) {
cin >> a.at(i);
sum += a.at(i);
}
long sub = 0;
RNG(i, 2, n, 2) { sub += a.at(i); }
vl d(n);
d.at(0) = sum - sub * 2;
REP(i, 1, n) { d.at(i) = 2 * a.at(i) - d.at(i - 1); }
rep(i, n) cout << d.at(i) << " ";
cout << endl;
} | #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 = pair<int, long>;
using pll = pair<long, long>;
using vc = vector<char>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, t) for (int i = s; i < t; i++)
#define RNG(i, s, t, u) for (int i = s; i < t; i += u)
#define MOD 1000000007
#define all(vec) vec.begin(), vec.end()
int main() {
int n;
cin >> n;
vl a(n);
long sum = 0;
rep(i, n) {
cin >> a.at(i);
sum += a.at(i);
}
long sub = 0;
RNG(i, 1, n, 2) { sub += a.at(i); }
vl d(n);
d.at(0) = sum - sub * 2;
REP(i, 1, n) { d.at(i) = 2 * a.at(i - 1) - d.at(i - 1); }
rep(i, n) cout << d.at(i) << " ";
cout << endl;
} | [
"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) \
for (ll i = 0; i < n; i++) \
cout << a[i] << ' '
#define inf 100000000000
#define loop(i, n) for (ll i = 0; i < n; i++)
#define graph vector<vector<ll>>
#define P pair<ll, ll>
using namespace std;
int main() {
int N, diff;
cin >> N;
vector<int> A(N + 1), M(N + 1);
loop(i, N) { cin >> A[i + 1]; }
A[0] = A[N];
M[1] = 0;
for (int i = 2; i <= N; i++) {
M[i] = A[i - 1] * 2 - M[i - 1];
}
diff = (A[N] * 2 - (M[N] + M[1])) / 2;
loop(i, N - 1) {
cout << M[i + 1] + diff << " ";
diff *= -1;
}
cout << M[N] + diff << endl;
} | #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) \
for (ll i = 0; i < n; i++) \
cout << a[i] << ' '
#define inf 100000000000
#define loop(i, n) for (ll i = 0; i < n; i++)
#define graph vector<vector<ll>>
#define P pair<ll, ll>
using namespace std;
int main() {
int N, diff;
cin >> N;
vector<ll> A(N + 1), M(N + 1);
loop(i, N) { cin >> A[i + 1]; }
A[0] = A[N];
M[1] = 0;
for (int i = 2; i <= N; i++) {
M[i] = A[i - 1] * 2 - M[i - 1];
}
diff = (A[N] * 2 - (M[N] + M[1])) / 2;
loop(i, N - 1) {
cout << M[i + 1] + diff << " ";
diff *= -1;
}
cout << M[N] + diff << endl;
} | [] | 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) \
for (ll i = 0; i < n; i++) \
cout << a[i] << ' '
#define inf 100000000000
#define loop(i, n) for (ll i = 0; i < n; i++)
#define graph vector<vector<ll>>
#define P pair<ll, ll>
using namespace std;
int main() {
int N, diff;
cin >> N;
vector<int> A(N + 1), M(N + 1);
loop(i, N) { cin >> A[i + 1]; }
A[0] = A[N];
M[1] = 0;
for (int i = 2; i <= N; i++) {
M[i] = A[i - 1] * 2 - M[i - 1];
}
diff = (A[N] - (M[N] + M[1]) / 2) / 2;
loop(i, N - 1) {
cout << M[i + 1] + diff << " ";
diff *= -1;
}
cout << M[N] + diff << endl;
} | #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) \
for (ll i = 0; i < n; i++) \
cout << a[i] << ' '
#define inf 100000000000
#define loop(i, n) for (ll i = 0; i < n; i++)
#define graph vector<vector<ll>>
#define P pair<ll, ll>
using namespace std;
int main() {
int N, diff;
cin >> N;
vector<ll> A(N + 1), M(N + 1);
loop(i, N) { cin >> A[i + 1]; }
A[0] = A[N];
M[1] = 0;
for (int i = 2; i <= N; i++) {
M[i] = A[i - 1] * 2 - M[i - 1];
}
diff = (A[N] * 2 - (M[N] + M[1])) / 2;
loop(i, N - 1) {
cout << M[i + 1] + diff << " ";
diff *= -1;
}
cout << M[N] + diff << endl;
} | [
"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;
typedef vector<int> VI;
typedef pair<int, int> pii;
const int MD = 1e9 + 7;
typedef vector<ll> VL;
void dbg() { cerr << "\n"; }
template <typename T, typename... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
VI a(n);
rep(i, n) cin >> a[i];
VI t(n + 1, 0);
rep(i, n) t[i + 1] = 2 * a[i] - t[i];
t[0] = t[n] / 2;
rep(i, n) t[i + 1] = 2 * a[i] - t[i];
rep(i, n) cout << t[i] << " ";
cout << endl;
return 0;
}
| #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;
typedef vector<int> VI;
typedef pair<int, int> pii;
const int MD = 1e9 + 7;
typedef vector<ll> VL;
void dbg() { cerr << "\n"; }
template <typename T, typename... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
VL a(n);
rep(i, n) cin >> a[i];
VL t(n + 1, 0);
rep(i, n) t[i + 1] = 2 * a[i] - t[i];
t[0] = t[n] / 2;
rep(i, n) t[i + 1] = 2 * a[i] - t[i];
rep(i, n) cout << t[i] << " ";
cout << endl;
return 0;
}
| [
"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)
const int INF = 2000000000; // 2e9
const int large_P = 1000000007; // 1e9 + 7
//繰り返し2乗法
// N^aの、Mで割った余りを求める。
ll my_pow(ll N, ll a, ll M) {
ll tempo;
if (a == 0) {
return 1;
} else {
if (a % 2 == 0) {
tempo = my_pow(N, a / 2, M);
return (tempo * tempo) % M;
} else {
tempo = my_pow(N, a - 1, M);
return (tempo * N) % M;
}
}
}
// N_C_a を M で割った余り
ll my_combination(ll N, ll a, ll M) {
ll answer = 1;
rep(i, a) {
answer *= (N - i);
answer %= M;
}
rep(i, a) {
answer *= my_pow(i + 1, M - 2, M);
answer %= M;
}
return answer;
}
ll my_gcd(ll &a, ll &b) {
if (b == 0)
return a;
ll temp = a % b;
return my_gcd(b, temp);
}
// base を底としたときの、n の i桁目を、v.at(i) に入れる。(桁数は n
// に応じて自動で設定する。)
void ll_to_vector(int base, long long n, vector<int> &v) {
long long tempo = n;
long long tempo2 = n;
// ll n_digit = floor(log10(n) / log10(base)) + 1; //
// 桁の計算を1行で。ただ誤差があるのでよくない。
int n_digit = 1;
while (tempo2 >= 10) {
tempo2 /= 10;
n_digit++;
}
v.assign(n_digit, 0);
// ll n_digit = v.size(); // v のサイズをそのままにする場合。
for (int i = 0; i < n_digit; i++) {
v.at(i) = tempo / pow(base, n_digit - 1 - i);
tempo -= v.at(i) * pow(base, n_digit - 1 - i);
}
}
int char_to_int(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
//エラトステネスの篩で、prime で ないところに false を入れる。
// true で初期化された vector を代入する必要がある。
void prime_judge(vector<bool> &prime_or_not) {
prime_or_not.at(0) = false;
prime_or_not.at(1) = false;
ll n = prime_or_not.size() - 1;
ll region = (ll)sqrt(n) + 1;
for (ll i = 2; i <= n / 2; i++) {
prime_or_not.at(2 * i) = false;
}
for (ll i2 = 1; i2 < n / 2; i2++) {
ll i = 2 * i2 + 1; //ここからは奇数のみ探索
if (i < region && prime_or_not.at(i)) {
ll j = i * i;
while (j < n + 1) {
prime_or_not.at(j) = false;
j += 2 * i;
}
}
}
};
map<ll, ll> divide_to_prime(int target) {
map<ll, ll> res;
// sqrt(target) まで調べる。
ll upper_lim = ceil(sqrt(target));
vector<bool> prime_or_not(upper_lim + 1, true);
if (upper_lim < 20)
prime_or_not.assign(25, true);
prime_judge(prime_or_not);
ll tempo = target;
rep(i, (upper_lim + 1)) {
if (prime_or_not.at(i)) {
while (tempo % i == 0) {
tempo /= i;
res[i]++;
}
}
}
if (tempo != 1)
res[tempo]++; // sqrt(target) より大きな素因数は高々1つしかない。
return res;
}
void BFS_labyrinth(queue<pair<int, int>> &que, vector<vector<int>> &dist,
int &area) {
int n = dist.size();
int m = dist.at(0).size();
while (!que.empty()) {
int temp_i, temp_j;
pair<int, int> tempo = que.front();
que.pop();
temp_i = tempo.first;
temp_j = tempo.second;
// cout << temp_i << " " << temp_j << endl;
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (temp_i + i < 0 || n <= temp_i + i)
continue; //範囲外
if (temp_j + j < 0 || m <= temp_j + j)
continue; //範囲外
if (i == 0 && j == 0)
continue; //動いていない
if (i * j != 0)
continue; //右上など
if (dist.at(temp_i + i).at(temp_j + j) != -1)
continue; //行けない領域に、既に INF
//などが代入されている場合はこの条件だけで ok
dist.at(temp_i + i).at(temp_j + j) = dist.at(temp_i).at(temp_j) + 1;
que.push(make_pair(temp_i + i, temp_j + j));
}
}
//何か所も領域がある場合だけ必要
if (que.empty()) {
rep(i, n) {
rep(j, m) {
if (dist.at(i).at(j) == -1) {
que.push(make_pair(i, j));
dist.at(i).at(j) = 0;
area++;
break;
}
}
if (!que.empty())
break;
}
}
}
}
signed main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A.at(i);
vector<int> rain(N);
int r0 = 0;
rep(i, N) {
if (i % 2 == 0)
r0 += 2 * A.at(i);
else
r0 -= 2 * A.at(i);
}
r0 /= 2;
rain.at(0) = r0;
int M = N - 1;
rep(i, M) { rain.at(i + 1) = 2 * A.at(i) - rain.at(i); }
rep(i, N) { cout << rain.at(i) << " "; }
cout << endl;
} | #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)
const int INF = 2000000000; // 2e9
const int large_P = 1000000007; // 1e9 + 7
//繰り返し2乗法
// N^aの、Mで割った余りを求める。
ll my_pow(ll N, ll a, ll M) {
ll tempo;
if (a == 0) {
return 1;
} else {
if (a % 2 == 0) {
tempo = my_pow(N, a / 2, M);
return (tempo * tempo) % M;
} else {
tempo = my_pow(N, a - 1, M);
return (tempo * N) % M;
}
}
}
// N_C_a を M で割った余り
ll my_combination(ll N, ll a, ll M) {
ll answer = 1;
rep(i, a) {
answer *= (N - i);
answer %= M;
}
rep(i, a) {
answer *= my_pow(i + 1, M - 2, M);
answer %= M;
}
return answer;
}
ll my_gcd(ll &a, ll &b) {
if (b == 0)
return a;
ll temp = a % b;
return my_gcd(b, temp);
}
// base を底としたときの、n の i桁目を、v.at(i) に入れる。(桁数は n
// に応じて自動で設定する。)
void ll_to_vector(int base, long long n, vector<int> &v) {
long long tempo = n;
long long tempo2 = n;
// ll n_digit = floor(log10(n) / log10(base)) + 1; //
// 桁の計算を1行で。ただ誤差があるのでよくない。
int n_digit = 1;
while (tempo2 >= 10) {
tempo2 /= 10;
n_digit++;
}
v.assign(n_digit, 0);
// ll n_digit = v.size(); // v のサイズをそのままにする場合。
for (int i = 0; i < n_digit; i++) {
v.at(i) = tempo / pow(base, n_digit - 1 - i);
tempo -= v.at(i) * pow(base, n_digit - 1 - i);
}
}
int char_to_int(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
//エラトステネスの篩で、prime で ないところに false を入れる。
// true で初期化された vector を代入する必要がある。
void prime_judge(vector<bool> &prime_or_not) {
prime_or_not.at(0) = false;
prime_or_not.at(1) = false;
ll n = prime_or_not.size() - 1;
ll region = (ll)sqrt(n) + 1;
for (ll i = 2; i <= n / 2; i++) {
prime_or_not.at(2 * i) = false;
}
for (ll i2 = 1; i2 < n / 2; i2++) {
ll i = 2 * i2 + 1; //ここからは奇数のみ探索
if (i < region && prime_or_not.at(i)) {
ll j = i * i;
while (j < n + 1) {
prime_or_not.at(j) = false;
j += 2 * i;
}
}
}
};
map<ll, ll> divide_to_prime(int target) {
map<ll, ll> res;
// sqrt(target) まで調べる。
ll upper_lim = ceil(sqrt(target));
vector<bool> prime_or_not(upper_lim + 1, true);
if (upper_lim < 20)
prime_or_not.assign(25, true);
prime_judge(prime_or_not);
ll tempo = target;
rep(i, (upper_lim + 1)) {
if (prime_or_not.at(i)) {
while (tempo % i == 0) {
tempo /= i;
res[i]++;
}
}
}
if (tempo != 1)
res[tempo]++; // sqrt(target) より大きな素因数は高々1つしかない。
return res;
}
void BFS_labyrinth(queue<pair<int, int>> &que, vector<vector<int>> &dist,
int &area) {
int n = dist.size();
int m = dist.at(0).size();
while (!que.empty()) {
int temp_i, temp_j;
pair<int, int> tempo = que.front();
que.pop();
temp_i = tempo.first;
temp_j = tempo.second;
// cout << temp_i << " " << temp_j << endl;
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (temp_i + i < 0 || n <= temp_i + i)
continue; //範囲外
if (temp_j + j < 0 || m <= temp_j + j)
continue; //範囲外
if (i == 0 && j == 0)
continue; //動いていない
if (i * j != 0)
continue; //右上など
if (dist.at(temp_i + i).at(temp_j + j) != -1)
continue; //行けない領域に、既に INF
//などが代入されている場合はこの条件だけで ok
dist.at(temp_i + i).at(temp_j + j) = dist.at(temp_i).at(temp_j) + 1;
que.push(make_pair(temp_i + i, temp_j + j));
}
}
//何か所も領域がある場合だけ必要
if (que.empty()) {
rep(i, n) {
rep(j, m) {
if (dist.at(i).at(j) == -1) {
que.push(make_pair(i, j));
dist.at(i).at(j) = 0;
area++;
break;
}
}
if (!que.empty())
break;
}
}
}
}
signed main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A.at(i);
vector<int> rain(N);
int r0 = 0;
rep(i, N) {
if (i % 2 == 0)
r0 += 2 * A.at(i);
else
r0 -= 2 * A.at(i);
}
r0 /= 2;
rain.at(0) = r0;
int M = N - 1;
rep(i, M) { rain.at(i + 1) = 2 * A.at(i) - rain.at(i); }
rep(i, N) { cout << rain.at(i) << " "; }
cout << endl;
} | [] | 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); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
vll ans(n);
rep(i, n) {
if (i % 2 == 1) {
ans[0] += a[i];
} else {
ans[0] -= a[i];
}
}
for (int i = 1; i < n; i++) {
ans[i] = (a[i - 1] - ans[i - 1] / 2) * 2;
}
rep(i, n) { cout << ans[i] << " "; }
} | #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); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
vll ans(n);
rep(i, n) {
if (i % 2 == 0) {
ans[0] += a[i];
} else {
ans[0] -= a[i];
}
}
for (int i = 1; i < n; i++) {
ans[i] = (a[i - 1] - ans[i - 1] / 2) * 2;
}
rep(i, n) { cout << ans[i] << " "; }
} | [
"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) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i], A[i] *= 2;
// 最初はx0 = 0 とした場合のx0の値,
// x1,x2...とoffset指す値は変わり、最終的にxn-1を指す
int offset = 0;
REP(i, N) offset = A[i] - offset;
// x0 = kとすると 2An-1 = xn-1 + x0、 offsetを考えると、 xn-1 = k+offset, x0
// = k, 2k + offset = 2An-1
int x0 = offset / 2;
vector<int> x(N);
x[0] = x0;
FOR(i, 1, N) x[i] = A[i - 1] - x[i - 1];
REP(i, N - 1) cout << x[i] << " ";
cout << x[N - 1] << endl;
return 0;
}
| #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) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
REP(i, N) cin >> A[i], A[i] *= 2;
// 最初はx0 = 0 とした場合のx0の値,
// x1,x2...とoffset指す値は変わり、最終的にxn-1を指す
ll offset = 0;
REP(i, N) offset = A[i] - offset;
// x0 = kとすると 2An-1 = xn-1 + x0、 offsetを考えると、 xn-1 = k+offset, x0
// = k, 2k + offset = 2An-1
int x0 = offset / 2;
vector<ll> x(N);
x[0] = x0;
FOR(i, 1, N) x[i] = A[i - 1] - x[i - 1];
REP(i, N - 1) cout << x[i] << " ";
cout << x[N - 1] << endl;
return 0;
}
| [
"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<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
signed main() {
int N;
cin >> N;
vi ans(N), A(N);
int memo = 0;
rep(i, 0, N) cin >> A[i];
REP(i, 2, N) {
int K = N - i;
memo = A[K] - memo;
}
memo = A[N - 1] - memo;
ans[N - 1] = memo;
REP(i, 2, N) {
int K = N - i;
ans[K] = A[K] - ans[K + 1];
}
rep(i, 0, N) cout << A[i] * 2 << " ";
cout << endl;
}
| #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<int, int>
#define priq priority_queue<int>
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (int)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (int)(key)))
signed main() {
int N;
cin >> N;
vi ans(N), A(N);
int memo = 0;
rep(i, 0, N) cin >> A[i];
REP(i, 2, N) {
int K = N - i;
memo = A[K] - memo;
}
memo = A[N - 1] - memo;
ans[N - 1] = memo / 2;
REP(i, 2, N) {
int K = N - i;
ans[K] = A[K] - ans[K + 1];
}
rep(i, 0, N) cout << ans[i] * 2 << " ";
cout << endl;
}
| [
"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);
ans[0] = x / 2;
rep(i, N - 1) { ans[i + 1] = A[i] - ans[i]; }
rep(i, N) { ans[i] *= 2; }
rep(i, N) printf("%d%c", ans[i], i == N - 1 ? "\n" : " ");
return 0;
} | #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);
ans[0] = x / 2;
rep(i, N - 1) { ans[i + 1] = A[i] - ans[i]; }
rep(i, N) { ans[i] *= 2; }
rep(i, N) printf("%d%c", ans[i], i == N - 1 ? '\n' : ' ');
return 0;
} | [
"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++) {
b.at(i) = 2 * a.at(i) - b.at(i - 1);
}
for (int i = 0; i < n; i++) {
cout << b.at(i) << " ";
}
cout << endl;
} | #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++) {
b.at(i) = 2 * a.at(i - 1) - b.at(i - 1);
}
for (int i = 0; i < n; i++) {
cout << b.at(i) << " ";
}
cout << endl;
} | [
"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 = false;
} else {
ans.at(0) -= A.at(i);
flag = true;
}
}
for (ll i = 1; i < n; i++) {
ans.at(i) = 2 * (A.at(i - 1) - ans.at(i - 1));
}
for (ll i = 0; i < n; i++) {
cout << ans.at(i) << ' ';
}
cout << endl;
} | #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 = false;
} else {
ans.at(0) -= A.at(i);
flag = true;
}
}
for (ll i = 1; i < n; i++) {
ans.at(i) = 2 * (A.at(i - 1) - ans.at(i - 1) / 2);
}
for (ll i = 0; i < n; i++) {
cout << ans.at(i) << ' ';
}
cout << endl;
} | [
"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 <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int n;
long long s02, s;
cin >> n;
vector<long long> a(n);
vector<long long> p(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i % 2 == 0) {
s02 += a.at(i);
} else {
s += a.at(i);
}
}
p.at(0) = (s02 - s) / 2;
for (int i = 1; i < n; i++) {
p.at(i) = a.at(i - 1) - p.at(i - 1);
}
for (int i = 0; i < n - 1; i++) {
cout << p.at(i) * 2 << " ";
}
cout << p.at(n - 1) * 2 << endl;
} | #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 <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int n;
long long s02 = 0, s = 0;
cin >> n;
vector<long long> a(n);
vector<long long> p(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i % 2 == 0) {
s02 += a.at(i);
} else {
s += a.at(i);
}
}
p.at(0) = (s02 - s) / 2;
for (int i = 1; i < n; i++) {
p.at(i) = a.at(i - 1) - p.at(i - 1);
}
for (int i = 0; i < n - 1; i++) {
cout << p.at(i) * 2 << " ";
}
cout << p.at(n - 1) * 2 << endl;
} | [
"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();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
int main() {
int N;
cin >> N;
vll A(N + 1), X(N + 1);
ll sum = 0, sum2 = 0;
rep(i, N) {
cin >> A[i + 1];
sum += A[i + 1];
if ((i + 1) % 2 == 0) {
sum2 += A[i + 1];
}
}
X[0] = sum - 2 * sum2;
cout << X[0] << " ";
rep(i, N) {
X[i + 1] = 2 * A[i] - X[i];
cout << X[i + 1] << " ";
}
cout << endl;
return 0;
} | #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();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
int main() {
int N;
cin >> N;
vll A(N + 1), X(N + 1);
ll sum = 0, sum2 = 0;
rep(i, N) {
cin >> A[i + 1];
sum += A[i + 1];
if ((i + 1) % 2 == 0) {
sum2 += A[i + 1];
}
}
X[1] = sum - 2 * sum2;
cout << X[1] << " ";
rep2(i, 1, N) {
X[i + 1] = 2 * A[i] - X[i];
cout << X[i + 1] << " ";
}
cout << endl;
return 0;
} | [
"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;
rep(i, n - 1) { ans[i + 1] = a[i] - ans[i]; }
rep(i, n) ans[i] *= 2;
rep(i, n) printf("%d%c", ans[i], i == n - 1 ? '\n' : ' ');
return 0;
}
| #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] = x2 / 2;
rep(i, n - 1) { ans[i + 1] = a[i] - ans[i]; }
rep(i, n) ans[i] *= 2;
rep(i, n) printf("%d%c", ans[i], i == n - 1 ? '\n' : ' ');
return 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);
cout << fixed << setprecision(15);
}
} __init;
int main() {
int N;
cin >> N;
vector<ll> A(N);
ll sum = 0;
vector<ll> X(N);
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
sum += a;
A[i] = a;
}
for (int i = 1; i < N - 1; i += 2) {
sum -= 2 * A[i];
}
X[0] = sum;
for (int i = 1; i < N; i++) {
X[i] = 2 * A[i] - X[i];
}
for (int i = 0; i < N; i++) {
cout << X[i] << ' ';
}
} | #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);
cout << fixed << setprecision(15);
}
} __init;
int main() {
int N;
cin >> N;
vector<ll> A(N);
ll sum = 0;
vector<ll> X(N);
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
sum += a;
A[i] = a;
}
for (int i = 1; i < N - 1; i += 2) {
sum -= 2 * A[i];
}
X[0] = sum;
for (int i = 1; i < N; i++) {
X[i] = 2 * A[i - 1] - X[i - 1];
}
for (int i = 0; i < N; i++) {
cout << X[i] << ' ';
}
} | [
"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 (int i = 1; i < N; i++) {
R[i] = 2 * A[i - 1] - R[i - 1];
}
for (int i = 0; i < N; i++)
cout << R[i] << " ";
cout << endl;
}
| #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[n-1]
R[0] = (d + 2 * A[N - 1]) / 2;
for (int i = 1; i < N; i++) {
R[i] = 2 * A[i - 1] - R[i - 1];
}
for (int i = 0; i < N; i++)
cout << R[i] << " ";
cout << endl;
}
| [
"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) {
if (i % 2)
x2 = -a[i];
else
x2 += a[i];
}
vector<int> ans(N);
ans[0] = x2 / 2;
rep(i, N - 1) { ans[i + 1] = a[i] - ans[i]; }
rep(i, N) ans[i] *= 2;
rep(i, N) printf("%d%c", ans[i], i == N - 1 ? '\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) {
if (i % 2)
x2 -= a[i];
else
x2 += a[i];
}
vector<int> ans(N);
ans[0] = x2 / 2;
rep(i, N - 1) { ans[i + 1] = a[i] - ans[i]; }
rep(i, N) ans[i] *= 2;
rep(i, N) printf("%d%c", ans[i], i == N - 1 ? '\n' : ' ');
return 0;
}
| [
"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 - 1] - ans[i - 1];
cout << " " << ans[i];
}
cout << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
long long sum = 0;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
sum += A[i];
}
solve(N, sum, std::move(A));
return 0;
}
| #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] = 2 * A[i - 1] - ans[i - 1];
cout << " " << ans[i];
}
cout << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
long long sum = 0;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
sum += A[i];
}
solve(N, sum, std::move(A));
return 0;
}
| [
"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 i = 1; i < n - 1; ++i) {
dn = a.at(i) - dn;
}
dn /= 2;
dam.at(0) = a.at(n - 1) - dn;
dam.at(n - 1) = dn;
for (int i = 1; i < n - 1; ++i) {
dam.at(i) = a.at(i - 1) - dam.at(i - 1);
}
rep(i, n) {
cout << dam.at(i);
if (i < n - 1)
cout << ' ';
}
cout << endl;
return 0;
} | #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 = 1; i < n - 1; ++i) {
dn = a.at(i) - dn;
}
dn /= 2;
dam.at(0) = a.at(n - 1) - dn;
dam.at(n - 1) = dn;
for (int i = 1; i < n - 1; ++i) {
dam.at(i) = a.at(i - 1) - dam.at(i - 1);
}
rep(i, n) {
cout << dam.at(i);
if (i < n - 1)
cout << ' ';
}
cout << endl;
return 0;
} | [
"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;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> b(n, 0);
rep(i, n) {
if (i % 2 == 0)
b[0] += a[i];
else
b[0] -= a[i];
}
rep(i, n - 1) { b[i + 1] = 2 * a[i] - b[i]; }
rep(i, n) {
if (i != 0)
cout << " ";
else
cout << b[i];
}
cout << endl;
} | #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;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> b(n, 0);
rep(i, n) {
if (i % 2 == 0)
b[0] += a[i];
else
b[0] -= a[i];
}
rep(i, n - 1) { b[i + 1] = 2 * a[i] - b[i]; }
rep(i, n) {
if (i != 0)
cout << " ";
cout << b[i];
}
cout << endl;
} | [
"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 + 2) {
m1 += 2 * a[i];
}
m1 -= total;
vector<int> ans(n);
ans[0] = m1;
for (int i = 1; i < n; i++) {
ans[i] = 2 * (a[i - 1] - ans[i - 1] / 2);
}
rep(i, n) printf("%d%c", ans[i], i == n - 1 ? '\n' : ' ');
return 0;
}
| #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 = i + 2) {
m1 += 2 * a[i];
}
m1 -= total;
vector<int> ans(n);
ans[0] = m1;
for (int i = 1; i < n; i++) {
ans[i] = 2 * (a[i - 1] - ans[i - 1] / 2);
}
rep(i, n) printf("%d%c", ans[i], i == n - 1 ? '\n' : ' ');
return 0;
}
| [
"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, ll> PLL;
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define LEN(x) (sizeof(x) / sizeof(*(x)))
// ll gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
// ll lcm(long a, long b) { return a * b / gcd(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n), b(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[0] = 0;
for (int j = 1; j < n; j++) {
b[j] = a[j - 1] * 2 - b[j - 1];
}
int t1 = (a[n - 1] * 2);
int t2 = (b[0] + b[n - 1]);
b[0] = (t1 - t2) / 2;
for (int j = 1; j < n; j++) {
b[j] = a[j - 1] * 2 - b[j - 1];
}
for (int i = 0; i < n; i++) {
cout << b[i];
if (i < n - 1) {
cout << " ";
}
}
cout << endl;
return 0;
} | // 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, ll> PLL;
#define INF (1e9)
#define INFL (1e18)
#define MOD (1000000007)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define LEN(x) (sizeof(x) / sizeof(*(x)))
// ll gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
// ll lcm(long a, long b) { return a * b / gcd(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n), b(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[0] = 0;
for (int j = 1; j < n; j++) {
b[j] = a[j - 1] * 2 - b[j - 1];
}
ll t1 = (a[n - 1] * 2);
ll t2 = (b[0] + b[n - 1]);
b[0] = (t1 - t2) / 2;
for (int j = 1; j < n; j++) {
b[j] = a[j - 1] * 2 - b[j - 1];
}
for (int i = 0; i < n; i++) {
cout << b[i];
if (i < n - 1) {
cout << " ";
}
}
cout << endl;
return 0;
} | [
"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(i, n) {
int x;
cin >> x;
a.push_back(x);
}
int ans = 0;
rep(i, n) { ans = 2 * a[i] - ans; }
ans /= 2;
cout << ans << " ";
rep(i, n - 1) {
ans = 2 * a[i] - ans;
cout << ans << " ";
}
cout << endl;
return 0;
} | #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;
vector<ll> a;
rep(i, n) {
ll x;
cin >> x;
// sum += x;
a.push_back(x);
}
ll ans = 0;
rep(i, n) { ans = 2 * a[i] - ans; }
ans /= 2;
cout << ans << " ";
rep(i, n - 1) {
ans = 2 * a[i] - ans;
cout << ans << " ";
}
cout << endl;
return 0;
} | [
"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];
a[0] = 0;
b[0] = 0;
for (int i = 0; i < N; i++) {
if (i == 0)
a[M] = v[N - 1] - v[0];
else if (i == N - 1)
break;
else if (i % 2 == 1)
a[i / 2 + 1] = a[i / 2] + v[i] - v[i - 1];
else if (i % 2 == 0)
b[i / 2] = b[i / 2 - 1] + v[i] - v[i - 1];
}
btr = -(v[N - 1] - v[N - 2] - v[0] - b[M - 1]) / 2;
atr = v[0] - btr;
for (int i = 0; i < M + 1; i++) {
if (i < M) {
cout << 2 * (atr + a[i]) << " " << 2 * (btr + b[i]) << " ";
} else
cout << 2 * (atr + a[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];
a[0] = 0;
b[0] = 0;
for (int i = 0; i < N; i++) {
if (i == 0)
a[M] = v[N - 1] - v[0];
else if (i == N - 1)
break;
else if (i % 2 == 1)
a[i / 2 + 1] = a[i / 2] + v[i] - v[i - 1];
else if (i % 2 == 0)
b[i / 2] = b[i / 2 - 1] + v[i] - v[i - 1];
}
btr = -(v[N - 1] - v[N - 2] - v[0] + b[M - 1]) / 2;
atr = v[0] - btr;
for (int i = 0; i < M + 1; i++) {
if (i < M) {
cout << 2 * (atr + a[i]) << " " << 2 * (btr + b[i]) << " ";
} else
cout << 2 * (atr + a[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); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
vector<pair<long long, long long>> prime_factorize(long long p); // 素因数分解
// class
// ------------------------------------------------
class Combi {
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
map<long long, map<long long, long long>> memo;
long long n_num;
long long k_num;
};
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) int((a).size())
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (long long(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
// code
// ------------------------------------------------
int main() {
ll n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) { sum += a[i]; }
ll sum2 = 0;
for (ll i = 1; i < n; i = i + 2) {
sum2 += a[i];
}
vll x(n);
x[0] = sum - sum2 * 2;
rep(i, n) { x[i + 1] = 2 * a[i] - x[i]; }
rep(i, n) {
if (i == 0)
cout << x[i];
else
cout << " " << x[i];
}
cout << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
int getDigit(int n) {
int i = 1;
while (1) {
n = n / 10;
if (n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi() {
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k) {
ll ret;
if (memo[n][k] != 0) {
ret = memo[n][k];
} else if (n == k || k == 0) {
memo[n][k] = 1;
ret = 1;
} else {
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
long long Combi::nPk_modp(long long n, long long k, long long p) {
ll ans = 1;
for (long long i = k; i <= n; i++) {
ans = (ans * i) % p;
}
return ans;
};
vector<pair<long long, long long>> prime_factorize(long long p) {
vector<pair<long long, long long>> ret;
for (long long x = 2; x * x <= p; ++x) {
if (p % x != 0)
continue;
long long num = 0;
while (p % x == 0) {
num++;
p /= x;
}
ret.push_back(make_pair(x, num));
}
if (p != 1)
ret.push_back(make_pair(p, 1));
return ret;
} | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
vector<pair<long long, long long>> prime_factorize(long long p); // 素因数分解
// class
// ------------------------------------------------
class Combi {
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
map<long long, map<long long, long long>> memo;
long long n_num;
long long k_num;
};
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) int((a).size())
#define rep(i, n) for (long long(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (long long(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
// code
// ------------------------------------------------
int main() {
ll n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) { sum += a[i]; }
ll sum2 = 0;
for (ll i = 1; i < n; i = i + 2) {
sum2 += a[i];
}
vll x(n + 1);
x[0] = sum - sum2 * 2;
rep(i, n) { x[i + 1] = 2 * a[i] - x[i]; }
rep(i, n) {
if (i == 0)
cout << x[i];
else
cout << " " << x[i];
}
cout << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
int getDigit(int n) {
int i = 1;
while (1) {
n = n / 10;
if (n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi() {
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k) {
ll ret;
if (memo[n][k] != 0) {
ret = memo[n][k];
} else if (n == k || k == 0) {
memo[n][k] = 1;
ret = 1;
} else {
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
long long Combi::nPk_modp(long long n, long long k, long long p) {
ll ans = 1;
for (long long i = k; i <= n; i++) {
ans = (ans * i) % p;
}
return ans;
};
vector<pair<long long, long long>> prime_factorize(long long p) {
vector<pair<long long, long long>> ret;
for (long long x = 2; x * x <= p; ++x) {
if (p % x != 0)
continue;
long long num = 0;
while (p % x == 0) {
num++;
p /= x;
}
ret.push_back(make_pair(x, num));
}
if (p != 1)
ret.push_back(make_pair(p, 1));
return ret;
} | [
"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;
}
for (i = 0; i < N; i++) {
cout << ans[i] << " ";
}
return 0;
} | #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;
}
for (i = 0; i < N; i++) {
cout << ans[i] << " ";
}
return 0;
} | [
"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];
}
int m[n] = {};
int ans[n] = {};
for (int j = 0; j < n; j++) {
m[j] = 1 - 2 * (j % 2);
}
for (int j = 0; j < n; j++) {
ans[0] += m[j] * a[j];
}
for (int i = 1; i < n - 1; i++) {
ans[i] = a[i] * 2 - ans[i - 1];
}
ans[n - 1] = a[n - 1] * 2 - ans[0];
for (int i = 0; i < n; i++) {
cout << ans[i] << " ";
}
return 0;
} | #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];
}
int m[n] = {};
int ans[n] = {};
for (int j = 0; j < n; j++) {
m[j] = 1 - 2 * (j % 2);
}
for (int j = 0; j < n; j++) {
ans[0] += m[j] * a[j];
}
for (int i = 1; i < n - 1; i++) {
ans[i] = a[i - 1] * 2 - ans[i - 1];
}
ans[n - 1] = a[n - 1] * 2 - ans[0];
for (int i = 0; i < n; i++) {
cout << ans[i] << " ";
}
return 0;
} | [
"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)
#define NIL -1
using namespace std;
typedef long long ll;
typedef long long int lli;
static const int MOD = 10000007;
static const int MAX = 100005;
int n;
vector<int> S;
int main() {
cin >> n;
int A[n];
int S = 0;
rep(i, n) {
cin >> A[i];
S += A[i];
}
int B[n];
int init = 0;
rep(i, n / 2) { init += A[i * 2]; }
B[0] = S - 2 * (init);
REP(i, 1, n) { B[i] = 2 * A[i - 1] - B[i - 1]; }
rep(i, n) cout << B[i] << " ";
cout << endl;
}
| #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)
#define NIL -1
using namespace std;
typedef long long ll;
typedef long long int lli;
static const int MOD = 10000007;
static const int MAX = 100005;
int n;
vector<int> S;
int main() {
cin >> n;
int A[n];
int S = 0;
rep(i, n) {
cin >> A[i];
S += A[i];
}
int B[n];
int init = 0;
rep(i, n / 2) { init += A[(i * 2 + 1)]; }
B[0] = S - 2 * (init);
REP(i, 1, n) { B[i] = 2 * A[i - 1] - B[i - 1]; }
rep(i, n) cout << B[i] << " ";
cout << endl;
}
| [] | 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++) {
cin >> a[i];
s += a[i];
}
vector<int> diff(n + 1, 0);
int d;
for (int i = 2; i <= n; i++) {
if (i == n) {
d = (a[n] - a[n - 1]) * 2 + diff[n - 1];
} else {
diff[i + 1] = (a[i] - a[i - 1]) * 2 + diff[i - 1];
}
}
for (int i = 2; i <= n - 1; i += 2) {
diff[i] -= d;
}
int tmpS = 0;
for (auto &di : diff) {
tmpS += di;
}
int add = (s - tmpS) / n;
for (int i = 1; i <= n; i++) {
cout << diff[i] + add << " ";
}
return 0;
}
| #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++) {
cin >> a[i];
s += a[i];
}
vector<ll> diff(n + 1, 0);
ll d;
for (int i = 2; i <= n; i++) {
if (i == n) {
d = (a[n] - a[n - 1]) * 2 + diff[n - 1];
} else {
diff[i + 1] = (a[i] - a[i - 1]) * 2 + diff[i - 1];
}
}
for (int i = 2; i <= n - 1; i += 2) {
diff[i] -= d;
}
ll tmpS = 0;
for (auto &di : diff) {
tmpS += di;
}
ll add = (s - tmpS) / n;
for (int i = 1; i <= n; i++) {
cout << diff[i] + add << " ";
}
return 0;
}
| [
"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 = 0; i < n; i++)
cout << r[i] << " ";
return 0;
}
| #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 i = 0; i < n; i++)
cout << r[i] << " ";
return 0;
}
| [
"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.at(0) << " ";
for (int i = 1; i < n; i++) {
rain.at(i) = 2 * a.at(i - 1) - rain.at(i - 1);
cout << rain.at(i) << " ";
}
} | #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 << rain.at(0) << " ";
for (int i = 1; i < n; i++) {
rain.at(i) = 2 * a.at(i - 1) - rain.at(i - 1);
cout << rain.at(i) << " ";
}
} | [
"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::pair<int, int>
#define pli std::pair<ll, int>
#define pil std::pair<int, ll>
#define psi std::pair<string, int>
#define pll std::pair<ll, ll>
#define pci std::pair<char, int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define pb push_back
#define vll std::vector<ll>
#define vpi std::vector<std::pair<int, int>>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vvpil std::vector<std::vector<std::pair<int, ll>>>
#define vlpii std::vector<std::list<pii>>
#define vlpil std::vector<std::list<pil>>
#define li std::list<int>
#define lpil std::list<pil>
#define Endl printf("\n")
#define vli vector<list<int>>
#define vvll vector<vector<ll>>
#define mp make_pair
#define x first
#define y second
#define ull uint64_t
#define ma 100000000
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll INF = 10000000000000;
const ll mod = 1e9 + 7;
using namespace std;
void add(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
ll Pow(ll a, ll b) {
if (b == 0)
return 1;
ll c = Pow(a, b / 2);
if (b % 2)
return (a * ((c * c) % mod)) % mod;
return (c * c) % mod;
}
// check modulo
int main() {
IOS;
cout.precision(30);
int n;
cin >> n;
vll a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vll x(n);
ll sum = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
sum += a[i];
else
sum -= a[i];
}
x[0] = sum / 2;
for (int i = 1; i < n; i++) {
x[i] = a[i - 1] - x[i - 1];
}
for (int i = 0; i < n; i++)
cout << x[i] << " ";
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pii std::pair<int, int>
#define pli std::pair<ll, int>
#define pil std::pair<int, ll>
#define psi std::pair<string, int>
#define pll std::pair<ll, ll>
#define pci std::pair<char, int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define pb push_back
#define vll std::vector<ll>
#define vpi std::vector<std::pair<int, int>>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vvpil std::vector<std::vector<std::pair<int, ll>>>
#define vlpii std::vector<std::list<pii>>
#define vlpil std::vector<std::list<pil>>
#define li std::list<int>
#define lpil std::list<pil>
#define Endl printf("\n")
#define vli vector<list<int>>
#define vvll vector<vector<ll>>
#define mp make_pair
#define x first
#define y second
#define ull uint64_t
#define ma 100000000
#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll INF = 10000000000000;
const ll mod = 1e9 + 7;
using namespace std;
void add(ll &a, ll b) {
a += b;
if (a >= mod)
a -= mod;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
ll Pow(ll a, ll b) {
if (b == 0)
return 1;
ll c = Pow(a, b / 2);
if (b % 2)
return (a * ((c * c) % mod)) % mod;
return (c * c) % mod;
}
// check modulo
int main() {
IOS;
cout.precision(30);
int n;
cin >> n;
vll a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vll x(n);
ll sum = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
sum += 2 * a[i];
else
sum -= 2 * a[i];
}
x[0] = sum / 2;
for (int i = 1; i < n; i++) {
x[i] = 2 * a[i - 1] - x[i - 1];
}
for (int i = 0; i < n; i++)
cout << x[i] << " ";
cout << endl;
return 0;
}
| [
"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.at(i);
}
}
dam.at(0) = a / 2;
for (int i = 1; i < n; i++) {
dam.at(i) = cont.at(i) - dam.at(i - 1);
}
rep(i, n) { cout << dam.at(i) << " "; }
} | #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.at(i);
}
}
// b
dam.at(0) = a / 2;
for (int i = 1; i < n; i++) {
dam.at(i) = cont.at(i - 1) - dam.at(i - 1);
}
rep(i, n) { cout << 2 * dam.at(i) << " "; }
} | [
"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(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
const int INF = (int)1e9;
const LL INFL = (LL)1e18;
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
REP(i, n) a[i] *= 2;
int y = 0;
REP(i, n) { y = a[i] - y; }
int x = y / 2;
REP(i, n) {
cout << x << " \n"[i == n - 1];
x = a[i] - x;
}
} | #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(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
const int INF = (int)1e9;
const LL INFL = (LL)1e18;
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<LL> a(n);
REP(i, n) cin >> a[i];
REP(i, n) a[i] *= 2;
LL y = 0;
REP(i, n) { y = a[i] - y; }
LL x = y / 2;
REP(i, n) {
cout << x << " \n"[i == n - 1];
x = a[i] - x;
}
} | [
"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 * o;
// 1~n-1までを求めたい。
for (int i = 1; i < n; i++) {
x[i] = 2 * a[i - 1] - x[i - 1];
}
for (int g : x) {
cout << g << " ";
}
} | #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] = sum - 2 * o;
// 1~n-1までを求めたい。
for (int i = 1; i < n; i++) {
x[i] = 2 * a[i - 1] - x[i - 1];
}
for (int g : x) {
cout << g << " ";
}
} | [
"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) {
cin >> a[i];
if (i % 2 != 0) {
o += a[i];
}
sum += a[i];
}
x[0] = sum - 2 * o;
// 1~n-1までを求めたい。
for (int i = 1; i < n; i++) {
x[i] = 2 * a[i - 1] - x[i - 1];
}
for (int g : x) {
cout << g << " ";
}
}
| #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] = sum - 2 * o;
// 1~n-1までを求めたい。
for (int i = 1; i < n; i++) {
x[i] = 2 * a[i - 1] - x[i - 1];
}
for (int g : x) {
cout << g << " ";
}
} | [
"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);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll sum = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
sum += A[i];
} else {
sum -= A[i];
}
}
ll p = sum / 2;
cout << p << " ";
for (int i = 1; i < N; i++) {
cout << 2 * (A[i - 1] - p) << " ";
p = A[i - 1] - p;
}
} | #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);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll sum = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
sum += A[i];
} else {
sum -= A[i];
}
}
ll p = sum / 2;
cout << 2 * p << " ";
for (int i = 1; i < N; i++) {
cout << 2 * (A[i - 1] - p) << " ";
p = A[i - 1] - p;
}
} | [
"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 + 1] - X[0];
X[0] = (A[N - 1] - X[0]) / 2;
rep(i, N - 1) X[i + 1] = A[i] - X[i];
rep(i, N) cout << X[i] * 2;
} | #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 + 1] - X[0];
X[0] = (A[N - 1] - X[0]) / 2;
rep(i, N - 1) X[i + 1] = A[i] - X[i];
rep(i, N) cout << X[i] * 2 << " ";
} | [
"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;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
vl b(n);
rep(i, n) {
if (i % 2 == 0) {
b[0] += a[i];
} else {
b[0] -= a[i];
}
}
rep(i, n) { b[i + 1] = 2 * a[i] - b[i]; }
rep(i, n) { cout << b[i] << " "; }
cout << endl;
re0;
} | #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;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
vl b(n);
rep(i, n) {
if (i % 2 == 0) {
b[0] += a[i];
} else {
b[0] -= a[i];
}
}
rep(i, n - 1) { b[i + 1] = 2 * a[i] - b[i]; }
rep(i, n) { cout << b[i] << " "; }
cout << endl;
re0;
} | [
"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;
rep(i, N) {
if (i == 0) {
cout << x << " ";
} else if (i == N - 1) {
x = 2 * A[i - 1] - x;
cout << x << endl;
} else {
x = 2 * A[i - 1] - x;
cout << x << " ";
}
}
} | #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;
rep(i, N) {
if (i == 0) {
cout << x << " ";
} else if (i == N - 1) {
x = 2 * A[i - 1] - x;
cout << x << endl;
} else {
x = 2 * A[i - 1] - x;
cout << x << " ";
}
}
}
| [
"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) % n] - a[(i - 2) % n]) * 2;
sum_ans += ans[i % n];
}
for (int i = 0; i < n; i++) {
ans[i] += (sum_a - sum_ans) / n;
cout << ans[i] << " ";
}
cout << endl;
} | #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 - 1) % n] - a[(i - 2) % n]) * 2;
sum_ans += ans[i % n];
}
for (int i = 0; i < n; i++) {
ans[i] += (sum_a - sum_ans) / n;
cout << ans[i] << " ";
}
cout << endl;
} | [
"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++) {
if (i == 1)
cout << b[i];
else
cout << " " << b[i];
}
return 0;
} | #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++) {
if (i == 1)
cout << b[i];
else
cout << " " << b[i];
}
return 0;
} | [
"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++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
long long int x = 0;
for (int i = 0; i < n; i++) {
if (i % 2)
x -= p[i];
else
x = p[i];
}
vector<int> t(n);
t[0] = x / 2;
for (int i = 0; i < n - 1; i++) {
t[i + 1] = p[i] - t[i];
}
for (int i = 0; i < n; i++)
t[i] *= 2;
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << t[i];
}
cout << endl;
return 0;
} | #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++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
long long int x = 0;
for (int i = 0; i < n; i++) {
if (i % 2)
x -= p[i];
else
x += p[i];
}
vector<int> t(n);
t[0] = x / 2;
for (int i = 0; i < n - 1; i++) {
t[i + 1] = p[i] - t[i];
}
for (int i = 0; i < n; i++)
t[i] *= 2;
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << t[i];
}
cout << endl;
return 0;
} | [
"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++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
long long int x = 0;
for (int i = 0; i < n; i++) {
if (i % 2)
x += p[i];
else
x -= p[i];
}
vector<int> t(n);
t[0] = x / 2;
for (int i = 0; i < n - 1; i++) {
t[i + 1] = p[i] - t[i];
}
for (int i = 0; i < n; i++)
t[i] /= 2;
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << t[i];
}
cout << endl;
return 0;
} | #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++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> p(n);
for (int i = 0; i < n; i++)
cin >> p[i];
long long int x = 0;
for (int i = 0; i < n; i++) {
if (i % 2)
x -= p[i];
else
x += p[i];
}
vector<int> t(n);
t[0] = x / 2;
for (int i = 0; i < n - 1; i++) {
t[i + 1] = p[i] - t[i];
}
for (int i = 0; i < n; i++)
t[i] *= 2;
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << t[i];
}
cout << endl;
return 0;
} | [
"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(i, 0, N) { cin >> A[i]; }
sum = accumulate(A.begin(), A.end(), 0);
sum /= 2;
for (ll j = 0; j < N; j += 2) {
if (j >= N) {
continue;
}
B[0] += A[j];
}
for (ll j = 0 - 1; j >= 0; j -= 2) {
if (j < 0) {
continue;
}
B[0] += A[j];
}
B[0] = 2 * (B[0] - sum);
rep(i, 0, N - 2) { B[i + 1] = (2 * A[i] - B[i]); }
B[N - 1] = (2 * A[N - 2] - B[0]);
rep(i, 0, N) { cout << B[i] << ' '; }
cout << ' ' << endl;
return 0;
} | #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(i, 0, N) { cin >> A[i]; }
sum = accumulate(A.begin(), A.end(), 0);
sum /= 2;
for (ll j = 0; j < N; j += 2) {
if (j >= N) {
continue;
}
B[0] += A[j];
}
for (ll j = 0 - 1; j >= 0; j -= 2) {
if (j < 0) {
continue;
}
B[0] += A[j];
}
B[0] = 2 * (B[0] - sum);
rep(i, 0, N - 2) { B[i + 1] = (2 * A[i] - B[i]); }
B[N - 1] = (2 * A[N - 2] - B[N - 2]);
rep(i, 0, N) { cout << B[i] << ' '; }
cout << ' ' << endl;
return 0;
} | [
"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 = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int lcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return d * e / f;
}
int gcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return f;
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
signed main() {
int a;
cin >> a;
vector<int> b(a), c(a, 0);
fo(i, a) cin >> b[i];
for (int i = 0; i < 2 * a; i += 2)
c[(i + 2) % a] = c[i % a] + (b[(i + 1) % a] - b[i % a]) * 2;
fo(i, a) {
cout << c[i] + (b[0] * 2 - c[0] - c[1]) / 2;
if (i != a - 1)
cout << ' ';
else
cout << endl;
}
} | #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 = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int lcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return d * e / f;
}
int gcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return f;
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
signed main() {
int a;
cin >> a;
vector<int> b(a), c(a, 0);
fo(i, a) cin >> b[i];
for (int i = 0; i < 2 * a; i += 2)
c[(i + 2) % a] = c[i % a] + (b[(i + 1) % a] - b[i % a]) * 2;
fo(i, a) {
cout << c[i] + (b[0] * 2 - c[0] - c[1]) / 2;
if (i != a - 1)
cout << ' ';
else
cout << endl;
}
} | [] | 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] = x;
for (int i = 0; i < N - 1; i++) {
ans[i + 1] = A[i] - ans[i];
}
for (int i = 0; i < N; i++) {
ans[i] *= 2;
}
for (int i = 0; i < N; i++) {
if (i != N - 1) {
cout << ans << " ";
} else {
cout << ans << endl;
}
}
return 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] = x;
for (int i = 0; i < N - 1; i++) {
ans[i + 1] = A[i] - ans[i];
}
for (int i = 0; i < N; i++) {
ans[i] *= 2;
}
for (int i = 0; i < N; i++) {
if (i != N - 1) {
cout << ans[i] << " ";
} else {
cout << ans[i] << endl;
}
}
return 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)-1; a >= (int)c; --a)
#define gcd(a, b) __gcd(a, b)
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define uint unsigned int
#define MOD 100000007
#define MAXN 200005
#define MAXH 4
#define MAXM 100
#define INF 1LL << 61
#define ll long long
#define ull unsigned long long
#define RNG rng mt19937(time(NULL))
#define udist(a, b) uniform_int_distribution<uint32_t> distribution(a, b)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gmax(a, b) a = max(a, b)
#define gmin(a, b) a = min(a, b)
#define whatis(x) cerr << #x << " is " << x << endl;
#define mat vector<vector<T>>
#define T long long
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define cld complex<long double>
using namespace std;
int main() {
fast_io();
int n;
cin >> n;
vector<int> a(n), b(n);
int t = 0;
cu(i, 0, n) {
cin >> a[i];
t += 2 * (i & 1 ? -a[i] : a[i]);
}
b[0] = t / 2;
cu(i, 1, n) b[i] = 2 * a[i - 1] - b[i - 1];
cu(i, 0, n) cout << b[i] << ' ';
cout << '\n';
}
| #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)-1; a >= (int)c; --a)
#define gcd(a, b) __gcd(a, b)
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define uint unsigned int
#define MOD 100000007
#define MAXN 200005
#define MAXH 4
#define MAXM 100
#define INF 1LL << 61
#define ll long long
#define ull unsigned long long
#define RNG rng mt19937(time(NULL))
#define udist(a, b) uniform_int_distribution<uint32_t> distribution(a, b)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define gmax(a, b) a = max(a, b)
#define gmin(a, b) a = min(a, b)
#define whatis(x) cerr << #x << " is " << x << endl;
#define mat vector<vector<T>>
#define T long long
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define cld complex<long double>
using namespace std;
int main() {
fast_io();
int n;
cin >> n;
vector<ll> a(n), b(n);
ll t = 0;
cu(i, 0, n) {
cin >> a[i];
t += 2 * (i & 1 ? -a[i] : a[i]);
}
b[0] = t / 2;
cu(i, 1, n) b[i] = 2 * a[i - 1] - b[i - 1];
cu(i, 0, n) cout << b[i] << ' ';
cout << '\n';
}
| [
"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 = 2 * A[j] - sub;
}
X[0] = sub / 2;
}
X[i] = 2 * A[i - 1] - X[i - 1];
}
for (int i = 0; i < N; i++) {
cout << X[i] << " ";
}
cout << endl;
}
| #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 = 2 * A[j] - sub;
}
X[0] = sub / 2;
} else {
X[i] = 2 * A[i - 1] - X[i - 1];
}
}
for (int i = 0; i < N; i++) {
cout << X[i] << " ";
}
cout << endl;
}
| [
"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[i];
}
M[0] = w / 2;
for (int i = 1; i < N; i++) {
M[i] = A[i - 1] - M[i - 1];
}
for (int i = 0; i < N; i++) {
cout << M[i] << " ";
}
cout << endl;
return 0;
} | #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 -= A[i];
}
M[0] = w / 2;
for (int i = 1; i < N; i++) {
M[i] = A[i - 1] - M[i - 1];
}
for (int i = 0; i < N; i++) {
cout << M[i] << " ";
}
cout << endl;
return 0;
}
| [
"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;
rep(i, n) { ans += x[i] * y[i]; }
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll a[n], ans[n];
rep(i, n) cin >> a[i];
/*
vector<ll> tmp(n*n);
rep(i, n){
rep(j, n){
if (j%2 == 1) tmp[i*n + j]=-1;
else tmp[i*n + j] = 1;
}
}
rep(i, n){
ans[i] = dot(n, a, vector<ll>(tmp.begin()+ n*n - n - i,
tmp.begin()+n*n - i));
}*/
int tmp = 0;
rep(i, n) tmp = a[i] - tmp;
ans[0] = tmp / 2;
for (int i = 1; i < n - 1; i++) {
ans[i] = a[i] - ans[i - 1];
}
ans[n - 1] = a[n - 1] - ans[0];
rep(i, n) cout << 2 * ans[i] << " ";
COUT("");
return 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;
rep(i, n) { ans += x[i] * y[i]; }
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll a[n], ans[n];
rep(i, n) cin >> a[i];
/*
vector<ll> tmp(n*n);
rep(i, n){
rep(j, n){
if (j%2 == 1) tmp[i*n + j]=-1;
else tmp[i*n + j] = 1;
}
}
rep(i, n){
ans[i] = dot(n, a, vector<ll>(tmp.begin()+ n*n - n - i,
tmp.begin()+n*n - i));
}*/
int tmp = 0;
rep(i, n) tmp = a[i] - tmp;
ans[0] = tmp / 2;
for (int i = 1; i < n - 1; i++) {
ans[i] = a[i - 1] - ans[i - 1];
}
ans[n - 1] = a[n - 1] - ans[0];
rep(i, n) cout << 2 * ans[i] << " ";
COUT("");
return 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;
if (i % 2 == 1) {
sum += m[max(i - 2, (long long)0)];
sum += m[n - 1] - m[i - 1];
} else {
sum += m[i - 2];
sum += m[n] - m[i - 1];
}
sum *= 2;
cout << s - sum << " ";
}
}
| #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;
if (i % 2 == 1) {
sum += m[max(i - 2, (long long)0)];
sum += m[n - 1] - m[i - 1];
} else {
sum += m[i - 2];
sum += m[n] - m[i - 1];
}
sum *= 2;
cout << s - sum << " ";
}
}
| [
"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 >> a[i];
int x = 0;
used[0] = true;
while (!used[(x + 2) % n]) {
used[(x + 2) % n] = true;
d[(x + 2) % n] = (a[(x + 1) % n] - a[x]) * 2 + d[x];
(x += 2) %= n;
}
ll sum = 0;
rep(i, n) { sum += d[i]; }
ll sum2 = accumulate(a, a + n, 0);
ll add = (sum2 - sum) / n;
rep(i, n) { cout << d[i] + add << ' '; }
cout << endl;
} | #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 >> a[i];
int x = 0;
used[0] = true;
while (!used[(x + 2) % n]) {
used[(x + 2) % n] = true;
d[(x + 2) % n] = (a[(x + 1) % n] - a[x]) * 2 + d[x];
(x += 2) %= n;
}
ll sum = 0;
rep(i, n) { sum += d[i]; }
ll sum2 = accumulate(a, a + n, 0LL);
ll add = (sum2 - sum) / n;
rep(i, n) { cout << d[i] + add << ' '; }
cout << endl;
} | [
"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 += a[i] * 2, pd = 1;
else
sum -= a[i] * 2, pd = 0;
}
ans = (sum + a[i] * 2) / 2;
printf("%d ", ans);
for (i = 1; i < n; i++) {
printf("%d ", a[i] * 2 - ans);
ans = a[i] * 2 - ans;
}
} | #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++) {
if (!pd)
sum += a[i] * 2, pd = 1;
else
sum -= a[i] * 2, pd = 0;
}
ans = (sum + a[i] * 2) / 2;
printf("%d ", ans);
for (i = 1; i < n; i++) {
printf("%d ", a[i] * 2 - ans);
ans = a[i] * 2 - ans;
}
} | [
"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 {
return a.first < b.first;
}
}
int main() {
int n;
cin >> n;
vector<ll> v(n);
ll a = 0;
ll goukei = 0;
rep(i, n) {
cin >> v[i];
goukei += v[i];
if (i % 2 == 1) {
a += v[i];
}
}
vector<ll> ans(n);
ans[0] = goukei - (a * 2);
cout << ans[0] << " ";
for (int i = 1; i < n; i++) {
ans[i] = 2 * v[i] - ans[i - 1];
cout << ans[i] << " ";
}
}
| #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 {
return a.first < b.first;
}
}
int main() {
int n;
cin >> n;
vector<ll> v(n);
ll a = 0;
ll goukei = 0;
rep(i, n) {
cin >> v[i];
goukei += v[i];
if (i % 2 == 1) {
a += v[i];
}
}
vector<ll> ans(n);
ans[0] = goukei - (a * 2);
cout << ans[0] << " ";
for (int i = 1; i < n; i++) {
ans[i] = 2 * v[i - 1] - ans[i - 1];
cout << ans[i] << " ";
}
}
| [
"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[in + 1] = 2 * a[in] - b[in];
}
for (int in = 0; in < n; in++) {
cout << b[in];
}
return 0;
} | #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[in + 1] = 2 * a[in] - b[in];
}
for (int in = 0; in < n; in++) {
cout << b[in] << " ";
}
return 0;
} | [
"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[in + 1] = 2 * a[in] - b[in];
}
for (int in = 0; in < n; in++) {
cout << b[in];
}
return 0;
}
| #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[in + 1] = 2 * a[in] - b[in];
}
for (int in = 0; in < n; in++) {
cout << b[in] << " ";
}
return 0;
} | [
"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;
for (int i = 0; i < N - 1; i++) {
tmp = 2 * a[i] - tmp;
}
vector<int> m(N);
m[0] = (2 * a[N - 1] - tmp) / 2;
for (int i = 0; i < N - 1; i++) {
m[i + 1] = 2 * a[i] - m[i];
}
for (int i = 0; i < N; i++) {
cout << m[i] << " ";
}
} | #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;
for (int i = 0; i < N - 1; i++) {
tmp = 2 * a[i] - tmp;
}
vector<ll> m(N);
m[0] = (2 * a[N - 1] - tmp) / 2;
for (int i = 0; i < N - 1; i++) {
m[i + 1] = 2 * a[i] - m[i];
}
for (int i = 0; i < N; i++) {
cout << m[i] << " ";
}
} | [
"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[0] /= 2;
for (int i = 0; i < N; i++) {
mountain[i] = A[i - 1] - mountain[i - 1];
}
for (int i = 0; i < N; i++) {
mountain[i] *= 2;
}
for (int i = 0; i < N - 1; i++) {
cout << mountain[i] << " ";
}
cout << mountain[N - 1] << endl;
return 0;
} | #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[0] /= 2;
for (int i = 1; i < N; i++) {
mountain[i] = A[i - 1] - mountain[i - 1];
}
for (int i = 0; i < N; i++) {
mountain[i] *= 2;
}
for (int i = 0; i < N - 1; i++) {
cout << mountain[i] << " ";
}
cout << mountain[N - 1] << endl;
return 0;
} | [
"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>
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// #define mp make_pair
//#define endl '\n'
int main() {
int n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
ll s = 0;
rep(i, n) { s += a[i]; }
vl x(n);
x[0] = s;
rep1(i, n - 1) {
x[0] -= 2 * a[i];
i++;
}
rep1(i, n) { x[i] = 2 * a[i - 1] - x[i - 1]; }
rep(i, n - 1) { cout << x[i] << " "; }
cout << x[n - 1] << endl;
return 0;
} | #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>
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// #define mp make_pair
//#define endl '\n'
int main() {
int n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
ll s = 0;
rep(i, n) { s += a[i]; }
vl x(n);
x[0] = s;
rep1(i, n - 2) {
x[0] -= 2 * a[i];
i++;
}
rep1(i, n - 1) { x[i] = 2 * a[i - 1] - x[i - 1]; }
rep(i, n - 1) { cout << x[i] << " "; }
cout << x[n - 1] << endl;
return 0;
} | [
"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] -= v[i];
}
}
for (int i = 1; i < N; i++) {
ans[i] = (v[i - 1] - ans[i - 1] / 2) * 2;
}
for (int i = 0; i < N; i++) {
cout << ans[i] << ' ';
}
cout << endl;
return 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] -= v[i];
}
}
for (int i = 1; i < N; i++) {
ans[i] = (v[i - 1] - ans[i - 1] / 2) * 2;
}
for (int i = 0; i < N; i++) {
cout << ans[i] << ' ';
}
cout << endl;
return 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_back
#define mp make_pair
#define pm(first, second) pb(mp(first, second))
#define SPACE " "
#define fpf first.first
#define fps first.second
#define spf second.first
#define sps second.second
#define all(X) (X).begin(), (X).end()
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int tmp = 0;
for (int i = 0; i < N; i++) {
tmp = (A[i] - tmp / 2) * 2;
}
tmp /= 2;
for (int i = 0; i < N; i++) {
cout << tmp;
if (i == N - 1) {
cout << endl;
break;
}
cout << " ";
tmp = A[i] - tmp / 2;
tmp *= 2;
}
return 0;
} | #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_back
#define mp make_pair
#define pm(first, second) pb(mp(first, second))
#define SPACE " "
#define fpf first.first
#define fps first.second
#define spf second.first
#define sps second.second
#define all(X) (X).begin(), (X).end()
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll tmp = 0;
for (int i = 0; i < N; i++) {
tmp = (A[i] - tmp / 2) * 2;
}
tmp /= 2;
for (int i = 0; i < N; i++) {
cout << tmp;
if (i == N - 1) {
cout << endl;
break;
}
cout << " ";
tmp = A[i] - tmp / 2;
tmp *= 2;
}
return 0;
}
| [
"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[0] = sum;
for (int i = 1; i < N; i--) {
x[i] = A[i - 1] * 2 - x[i - 1];
}
for (int i = 0; i < N - 1; i++) {
cout << x[i] << " ";
}
cout << x[N - 1] << endl;
}
| #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[0] = sum;
for (int i = 1; i < N; i++) {
x[i] = A[i - 1] * 2 - x[i - 1];
}
for (int i = 0; i < N - 1; i++) {
cout << x[i] << " ";
}
cout << x[N - 1] << endl;
}
| [] | 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][1] - a[i / 2][1] + a[i / 2][0]) * 2 << " ";
} else {
cout << sum - (a[n / 2 + 1][0] - a[i / 2 + 1][0] + a[i / 2][1]) * 2
<< " ";
}
}
cout << endl;
} | #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 - (a[n / 2][1] - a[i / 2][1] + a[i / 2][0]) * 2 << " ";
} else {
cout << sum - (a[n / 2 + 1][0] - a[i / 2 + 1][0] + a[i / 2][1]) * 2
<< " ";
}
}
cout << endl;
} | [
"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;
cin >> n;
a.resize(n);
b.resize(n);
sum = 0;
sum2 = 0;
for (ii = 0; ii < n; ii++) {
cin >> a[ii];
sum += a[ii];
}
b[0] = 0;
for (ii = 1; ii <= n; ii++) {
if (ii != n) {
b[ii] = 2 * a[ii - 1] - b[ii - 1];
} else {
b[ii] = 2 * a[ii] - b[0];
}
sum2 += b[ii - 1];
}
b[0] = sum - sum2;
// cout << "sum:" << sum << "sum2:" << sum2 << endl;
for (ii = 1; ii <= n; ii++) {
if (ii != n) {
b[ii] = 2 * a[ii - 1] - b[ii - 1];
} else {
b[ii] = 2 * a[ii] - b[0];
}
sum2 += b[ii];
}
for (ii = 0; ii < n; ii++) {
cout << b[ii] << " ";
}
cout << endl;
return 0;
}
| #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;
cin >> n;
a.resize(n + 1);
b.resize(n + 1);
sum = 0;
sum2 = 0;
for (ii = 0; ii < n; ii++) {
cin >> a[ii];
sum += a[ii];
}
b[0] = 0;
for (ii = 1; ii <= n; ii++) {
if (ii != n) {
b[ii] = 2 * a[ii - 1] - b[ii - 1];
} else {
b[ii] = 2 * a[ii] - b[0];
}
sum2 += b[ii - 1];
}
b[0] = sum - sum2;
// cout << "sum:" << sum << "sum2:" << sum2 << endl;
for (ii = 1; ii <= n; ii++) {
if (ii != n) {
b[ii] = 2 * a[ii - 1] - b[ii - 1];
} else {
b[ii] = 2 * a[ii] - b[0];
}
sum2 += b[ii];
}
for (ii = 0; ii < n; ii++) {
cout << b[ii] << " ";
}
cout << endl;
return 0;
}
| [
"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) \
cerr << #arr << "(l" << __LINE__ << ") : "; \
for (auto x : arr) \
cerr << x << " "; \
cerr << endl;
int main() {
ll N;
cin >> N;
ll A[N];
rep(i, N) cin >> A[i];
ll sumall = 0;
ll odd[N / 2 + 1] = {};
ll even[N / 2] = {};
rep(i, N) sumall += A[i];
sumall /= 2;
odd[0] = A[0];
even[0] = A[1];
rep(i, N / 2) odd[i + 1] = odd[i] + A[(i + 1) * 2];
rep(i, N / 2 - 1) even[i + 1] = even[i] + A[(i + 1) * 2 + 1];
ll ans[N];
rep(i, N) {
if (i == 0)
ans[i] = (sumall - even[N / 2 - 1]) * 2;
else if (i == 1)
ans[i] = (sumall - odd[N / 2] + odd[0]) * 2;
else if (i % 2)
ans[i] = (sumall - even[i / 2 - 1] - odd[N / 2] + odd[i / 2 + 1]) * 2;
else
ans[i] =
(sumall - odd[i / 2 - 1] - even[N / 2 - 1] + even[i / 2 - 1]) * 2;
}
rep(i, N) cout << ans[i] << (i == N - 1 ? '\n' : ' ');
return 0;
}
| #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) \
cerr << #arr << "(l" << __LINE__ << ") : "; \
for (auto x : arr) \
cerr << x << " "; \
cerr << endl;
int main() {
ll N;
cin >> N;
ll A[N];
rep(i, N) cin >> A[i];
ll sumall = 0;
ll odd[N / 2 + 1] = {};
ll even[N / 2] = {};
rep(i, N) sumall += A[i];
sumall /= 2;
odd[0] = A[0];
even[0] = A[1];
rep(i, N / 2) odd[i + 1] = odd[i] + A[(i + 1) * 2];
rep(i, N / 2 - 1) even[i + 1] = even[i] + A[(i + 1) * 2 + 1];
ll ans[N];
rep(i, N) {
if (i == 0)
ans[i] = (sumall - even[N / 2 - 1]) * 2;
else if (i == 1)
ans[i] = (sumall - odd[N / 2] + odd[0]) * 2;
else if (i % 2)
ans[i] = (sumall - even[i / 2 - 1] - odd[N / 2] + odd[i / 2]) * 2;
else
ans[i] =
(sumall - odd[i / 2 - 1] - even[N / 2 - 1] + even[i / 2 - 1]) * 2;
}
rep(i, N) cout << ans[i] << (i == N - 1 ? '\n' : ' ');
return 0;
}
| [
"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 = long long;
int main() {
int n;
cin >> n;
int a[114514];
int b[114514];
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
int k = 0;
b[0] = 0;
for (int i = 0; i < n - 1; i++) {
k = (k + 2) % n;
b[k] = b[(k - 2 + n) % n] + (a[(k - 1 + n) % n] - a[(k - 2 + n) % n]) * 2;
}
int l = 0;
for (int i = 0; i < n; i++)
l += b[i];
int w[114514];
w[0] = (s - l) / n;
for (int i = 1; i < n; i++) {
w[i] = a[i - 1] * 2 - w[i - 1];
}
for (int i = 0; i < n; i++)
cout << w[i] << " ";
cout << endl;
return 0;
}
| #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 = pair<int, int>;
using ll = long long;
signed main() {
int n;
cin >> n;
int a[114514];
int b[114514];
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
int k = 0;
b[0] = 0;
for (int i = 0; i < n - 1; i++) {
k = (k + 2) % n;
b[k] = b[(k - 2 + n) % n] + (a[(k - 1 + n) % n] - a[(k - 2 + n) % n]) * 2;
}
int l = 0;
for (int i = 0; i < n; i++)
l += b[i];
int w[114514];
w[0] = (s - l) / n;
for (int i = 1; i < n; i++) {
w[i] = a[i - 1] * 2 - w[i - 1];
}
for (int i = 0; i < n; i++)
cout << w[i] << " ";
cout << endl;
return 0;
}
| [
"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 << "___" << endl
using namespace std;
// char buf[10000000], *p1 = buf, *p2 = buf;
#define Getchar() \
getchar() // p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 10000000, stdin), p1
// == p2) ? EOF : *p1++
template <typename T> void in(T &r) {
static char c;
r = 0;
while (c = Getchar(), c < 48)
;
do
r = (r << 1) + (r << 3) + (c ^ 48);
while (c = Getchar(), c > 47);
}
const int mn = 100005;
int n, val[mn], ans[mn];
bool mark[mn];
int get(int v) {
if (v == 0)
v = n;
if (v > n)
v -= n;
return v;
}
int main() {
in(n);
rep(q, 1, n) in(val[q]);
int now = 1;
while (1) {
if (mark[now])
break;
mark[now] = 1;
int lt = now;
now += 2;
while (now > n)
now -= n;
ans[now] = ans[lt] + (val[get(lt + 1)] - val[lt]) * 2;
}
int x = (val[1] * 2 - ans[2]) >> 1;
rep(q, 1, n) ans[q] += x, printf("%d ", ans[q]);
return 0;
} | #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 << "___" << endl
using namespace std;
// char buf[10000000], *p1 = buf, *p2 = buf;
#define Getchar() \
getchar() // p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 10000000, stdin), p1
// == p2) ? EOF : *p1++
template <typename T> void in(T &r) {
static char c;
r = 0;
while (c = Getchar(), c < 48)
;
do
r = (r << 1) + (r << 3) + (c ^ 48);
while (c = Getchar(), c > 47);
}
const int mn = 100005;
long long n, val[mn], ans[mn];
bool mark[mn];
int get(int v) {
if (v == 0)
v = n;
if (v > n)
v -= n;
return v;
}
int main() {
in(n);
rep(q, 1, n) in(val[q]);
int now = 1;
while (1) {
if (mark[now])
break;
mark[now] = 1;
int lt = now;
now += 2;
while (now > n)
now -= n;
ans[now] = ans[lt] + (val[get(lt + 1)] - val[lt]) * 2;
}
long long x = (val[1] * 2 - ans[2]) >> 1;
rep(q, 1, n) ans[q] += x, printf("%lld ", ans[q]);
return 0;
} | [
"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];
tmp[0] = 0;
REP(i, n) { tmp[i + 1] = 2 * a[i] - tmp[i]; }
int ans[n];
ans[0] = tmp[n] / 2;
REP(i, n) {
cout << ans[i] << " ";
ans[i + 1] = 2 * a[i] - ans[i];
}
} | #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] = 0;
REP(i, n) { tmp[i + 1] = 2 * a[i] - tmp[i]; }
ll ans[n];
ans[0] = tmp[n] / 2;
REP(i, n) {
cout << ans[i] << " ";
ans[i + 1] = 2 * a[i] - ans[i];
}
} | [
"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 < N; i++) {
cin >> A[i];
A[i] <<= 1;
x += (i % 2 == 0 ? A[i] : -A[i]);
}
x /= 2;
int B[N];
B[0] = x;
cout << x;
for (int i = 1; i < N; i++) {
B[i] = A[i - 1] - B[i - 1];
cout << " " << B[i];
}
cout << endl;
return 0;
}
| #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; i++) {
cin >> A[i];
A[i] <<= 1;
x += (i % 2 == 0 ? A[i] : -A[i]);
}
x /= 2;
ll B[N];
B[0] = x;
cout << x;
for (int i = 1; i < N; i++) {
B[i] = A[i - 1] - B[i - 1];
cout << " " << B[i];
}
cout << endl;
return 0;
}
| [
"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];
else
t += b[i];
}
ans.push_back(t / 2);
for (int i = n - 1; i >= 1; --i)
ans.push_back(b[i] - ans.back());
for (int i = ans.size() - 1; i >= 0; --i) {
printf("%d", ans[i]);
if (i)
putchar(' ');
}
return 0;
}
| #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];
else
t += b[i];
}
ans.push_back(t / 2);
for (int i = n - 1; i >= 1; --i)
ans.push_back(b[i] - ans.back());
for (int i = ans.size() - 1; i >= 0; --i) {
printf("%lld", ans[i]);
if (i)
putchar(' ');
}
return 0;
}
| [
"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[1];
cout << M[0] << " " << M[1];
for (int i = 2; i < N; i++) {
M[i] = 2 * A[i] - M[i - 1];
cout << " " << M[i];
}
cout << endl;
return 0;
}
| #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[1];
cout << M[0] << " " << M[1];
for (int i = 2; i < N; i++) {
M[i] = 2 * A[i - 1] - M[i - 1];
cout << " " << M[i];
}
cout << endl;
return 0;
}
| [
"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[1];
cout << M[0] << " " << M[1];
for (int i = 2; i < N; i++) {
M[i] = 2 * A[i] - M[i];
cout << " " << M[i];
}
cout << endl;
return 0;
}
| #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[1];
cout << M[0] << " " << M[1];
for (int i = 2; i < N; i++) {
M[i] = 2 * A[i - 1] - M[i - 1];
cout << " " << M[i];
}
cout << endl;
return 0;
}
| [
"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, int> Paint;
bool Pairsecond(const Paint &pf, Paint &ps) { // sortCompare
return pf.second < ps.second;
}
#define anyfill(n, s) setw(n) << setfill(s)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define MAX 1000000000
#define MOD 1000000007
/*
確認ポイント
to_string() はC++11以降の実装;
cout<< (char)数値 //数値にあった文字に置き換えられる
cout<< (double)int型/(2など)//小数になる
length(),size()に括弧をつけ忘れてないか;
sort()が使える型//vector,string...
大文字小文字間違えてないか
cout << fixed << 小数計算//正しい小数表記になる(基本6桁)(e記法回避にも使える)
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
sqrt(数値型)でrootが取れる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
*/
int main() {
int n;
cin >> n;
long long a[n];
long long sm = 0;
for (int i = 0; n > i; i++) {
cin >> a[i];
sm += a[i]; // 1,2...n-1,n
}
int tmp = 0;
int ans;
for (int i = 0; n > i; i++) {
if (i == 0) {
for (int j = 2; n > j; j += 2) {
tmp += a[j - 1] * 2;
}
cout << sm - tmp << " ";
ans = sm - tmp;
} else {
ans = a[i - 1] * 2 - ans;
cout << ans;
if (i + 1 != n)
cout << " ";
}
}
cout << endl;
}
| // 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, int> Paint;
bool Pairsecond(const Paint &pf, Paint &ps) { // sortCompare
return pf.second < ps.second;
}
#define anyfill(n, s) setw(n) << setfill(s)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define MAX 1000000000
#define MOD 1000000007
/*
確認ポイント
to_string() はC++11以降の実装;
cout<< (char)数値 //数値にあった文字に置き換えられる
cout<< (double)int型/(2など)//小数になる
length(),size()に括弧をつけ忘れてないか;
sort()が使える型//vector,string...
大文字小文字間違えてないか
cout << fixed << 小数計算//正しい小数表記になる(基本6桁)(e記法回避にも使える)
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
sqrt(数値型)でrootが取れる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
*/
int main() {
long long n;
cin >> n;
long long a[n];
long long sm = 0;
for (int i = 0; n > i; i++) {
cin >> a[i];
sm += a[i]; // 1,2...n-1,n
}
long long tmp = 0;
long long ans;
for (int i = 0; n > i; i++) {
if (i == 0) {
for (int j = 2; n > j; j += 2) {
tmp += a[j - 1] * 2;
}
cout << sm - tmp << " ";
ans = sm - tmp;
} else {
ans = a[i - 1] * 2 - ans;
cout << ans;
if (i + 1 != n)
cout << " ";
}
}
cout << endl;
}
| [
"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 long int ll;
ll mod = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll n, d, a, b;
cin >> n;
ll arr[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (i % 2 == 1) {
sum -= arr[i];
} else
sum += arr[i];
}
cout << sum << " ";
for (int i = 0; i < n; i++) {
sum = (2 * arr[i]) - sum;
cout << sum << " ";
}
} | #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 long int ll;
ll mod = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
ll n, d, a, b;
cin >> n;
ll arr[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (i % 2 == 1) {
sum -= arr[i];
} else
sum += arr[i];
}
cout << sum << " ";
for (int i = 0; i < n - 1; i++) {
sum = (2 * arr[i]) - sum;
cout << sum << " ";
}
}
| [
"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.