problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll lgcds[N];
ll rgcds[N];
lgcds[0] = rgcds[N - 2] = A[N - 1];
lgcds[1] = rgcds[N - 1] = A[0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll lgcds[N];
ll rgcds[N];
lgcds[0] = rgcds[N - 2] = A[N - 1];
lgcds[1] = rgcds[N - 1] = A[0... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,620 | 874,621 | u009579822 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll lgcds[N];
ll rgcds[N];
lgcds[0] = rgcds[N - 2] = A[N - 1];
lgcds[1] = rgcds[N - 1] = A[0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll lgcds[N];
ll rgcds[N];
lgcds[0] = rgcds[N - 2] = A[N - 1];
lgcds[1] = rgcds[N - 1] = A[0... | [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,622 | 874,621 | u009579822 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n];
int pre[n] = {0},... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n];
int pre[n] = {0},... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,623 | 874,624 | u961487195 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp mak... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp mak... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change",
"call.arguments.change"
] | 874,627 | 874,628 | u582464343 | cpp |
p03061 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
long gcd(long i, long j) {
long counter;
if (i == 0)
counter = j;
if (j == 0)
counter = i;
if (i != 0 && j != 0) {
if (i > j)
swap(i, j);
long r = j % i;
while (r != 0) {
j = i;
i = r;
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
long gcd(long i, long j) {
long counter;
if (i == 0)
counter = j;
if (j == 0)
counter = i;
if (i != 0 && j != 0) {
if (i > j)
swap(i, j);
long r = j % i;
while (r != 0) {
j = i;
i = r;
... | [] | 874,632 | 874,633 | u774910314 | cpp |
p03061 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
long gcd(long i, long j) {
long counter = i;
if (i == 0)
counter = j;
// if(j == 0)counter = i;
if (i != 0 && j != 0) {
if (i > j)
swap(i, j);
long r = j % i;
while (r != 0) {
j = i;
i = r;
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
long gcd(long i, long j) {
long counter = i;
if (i == 0)
counter = j;
// if(j == 0)counter = i;
if (i != 0 && j != 0) {
if (i > j)
swap(i, j);
long r = j % i;
while (r != 0) {
j = i;
i = r;
... | [] | 874,634 | 874,635 | u774910314 | cpp |
p03061 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int gcd(int x, int y) { return !x && !y ? gcd(y % x, x) : x + y; }
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a)
cin >> x;
vecto... | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int gcd(int x, int y) { return x && y ? gcd(y % x, x) : x + y; }
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a)
cin >> x;
vector<... | [
"expression.operation.unary.logical.remove",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,644 | 874,645 | u633757735 | cpp |
p03061 | // AtCoder abc152-C
#include <algorithm>
#include <cstdio>
unsigned int getGCD(unsigned int a, unsigned int b) {
if (a < b)
std::swap(a, b);
while (b != 0) {
unsigned int mod = a % b;
a = b;
b = mod;
}
return a;
}
unsigned int getPowerOf2(unsigned int min) {
unsigned int value = 1;
whil... | // AtCoder abc152-C
#include <algorithm>
#include <cstdio>
unsigned int getGCD(unsigned int a, unsigned int b) {
if (a < b)
std::swap(a, b);
while (b != 0) {
unsigned int mod = a % b;
a = b;
b = mod;
}
return a;
}
unsigned int getPowerOf2(unsigned int min) {
unsigned int value = 1;
whil... | [
"identifier.change",
"call.arguments.change"
] | 874,650 | 874,651 | u045928390 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (a != 0) {
return gcd(b % a, a);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> left_sum(N), right_su... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (a != 0) {
return gcd(b % a, a);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> left_sum(N), right_su... | [
"expression.operation.binary.remove",
"assignment.change"
] | 874,652 | 874,653 | u934246119 | cpp |
p03061 | #include <iostream>
#include <vector>
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<int> left(N + 1, 0), right(N + 1, 0);
// left累積GCD
for (int i = 0; i < N; ++i) {
l... | #include <iostream>
#include <vector>
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<int> left(N + 1, 0), right(N + 1, 0);
// left累積GCD
for (int i = 0; i < N; ++i) {
l... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,654 | 874,655 | u477694598 | cpp |
p03061 | #include <iostream>
#define endl '\n'
#include <algorithm>
using namespace std;
const int MAXN = 1e5 + 200;
int L[MAXN], R[MAXN], A[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
cin >> A[0];
L[0] = A[0];
for (int i = 1; i < N; ++i) {
cin >> A[i];
L[i... | #include <iostream>
#define endl '\n'
#include <algorithm>
using namespace std;
const int MAXN = 1e5 + 200;
int L[MAXN], R[MAXN], A[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
cin >> A[0];
L[0] = A[0];
for (int i = 1; i < N; ++i) {
cin >> A[i];
L[i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,656 | 874,657 | u985469162 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a == 0) {
return b;
}
if (b == 0) {
return a;
}
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int ans = 0, N;
cin >> N;
ve... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a == 0) {
return b;
}
if (b == 0) {
return a;
}
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int ans = 0, N;
cin >> N;
ve... | [
"assignment.change"
] | 874,660 | 874,659 | u982721500 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100010;
int a[maxn], dpl[maxn], dpr[maxn];
int main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
dpl[0] = a[0];
dpr[n - 1] = a[n - 1];
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100010;
int a[maxn], dpl[maxn], dpr[maxn];
int main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
dpl[0] = a[0];
dpr[n - 1] = a[n - 1];
fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,663 | 874,664 | u209067041 | cpp |
p03061 | #include <iostream>
using namespace std;
template <class T> inline int gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int l[n + 1], r[n + 1];
l[0] = 0;
r[n] = 0;
for (int i = 0; i < n; i++) {
l[i + 1]... | #include <iostream>
using namespace std;
template <class T> inline int gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int l[n + 1], r[n + 1];
l[0] = 0;
r[n] = 0;
for (int i = 0; i < n; i++) {
l[i + 1]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,667 | 874,668 | u093744128 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n, MAX = 0;
cin >> n;
vector<int> a(n), l(n), r(n);
a[0] = 0;
l[0] = 0;
r[n + 1] = 0;
for (int i = 1; i <... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n, MAX = 0;
cin >> n;
vector<int> a(n + 2), l(n + 2), r(n + 2);
a[0] = 0;
l[0] = 0;
r[n + 1] = 0;
for (in... | [
"assignment.change"
] | 874,676 | 874,677 | u382176401 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
int v[n];
for (auto i = 0; i < n; i++)
cin >> v[i];
int l[n], r[n];
for (auto i = 0; i < n; i++) {
if (i == 0) {
l[i] = 0;
r[i] = ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
int v[n];
for (auto i = 0; i < n; i++)
cin >> v[i];
int l[n], r[n];
for (auto i = 0; i < n; i++) {
if (i == 0) {
l[i] = 0;
r[i] = ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,684 | 874,685 | u377032133 | cpp |
p03061 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | [
"assignment.variable.change",
"identifier.change"
] | 874,686 | 874,687 | u216772548 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
long long c = max(a, b);
long long d = min(a, b);
long long e = c % d;
if (e == 0)
return d;
else {
return gcd(d, e);
}
}
int main() {
int N;
cin >> N;
vector<long long> A(N);
vector<long long> x(N);
... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
long long c = max(a, b);
long long d = min(a, b);
long long e = c % d;
if (e == 0)
return d;
else {
return gcd(d, e);
}
}
int main() {
int N;
cin >> N;
vector<long long> A(N);
vector<long long> x(N);
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,694 | 874,695 | u664207511 | cpp |
p03061 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,698 | 874,699 | u768152935 | cpp |
p03061 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,700 | 874,699 | u768152935 | cpp |
p03061 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 874,701 | 874,699 | u768152935 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
vector<int> l(n), r(n);
for (int i = 0; i < n; i++)
l[i + 1] = gcd(a[i]... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
vector<int> l(n), r(n);
for (int i = 0; i < n - 1; i++)
l[i + 1] = gcd(... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,704 | 874,705 | u627434558 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], ... | [] | 874,706 | 874,707 | u627434558 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], ... | [] | 874,708 | 874,707 | u627434558 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,709 | 874,710 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,711 | 874,710 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 874,712 | 874,710 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,709 | 874,713 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,711 | 874,713 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 874,712 | 874,713 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,716 | 874,717 | u773916255 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,718 | 874,717 | u773916255 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mod 1e9 + 7
#define ll long long int
#define epsilon 1e-7
ll min(ll x, ll y) {
if (x < y)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mod 1e9 + 7
#define ll long long int
#define epsilon 1e-7
ll min(ll x, ll y) {
if (x < y)... | [] | 874,721 | 874,722 | u436045956 | cpp |
p03061 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(w... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(w... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,732 | 874,733 | u369212307 | cpp |
p03061 | #include <bits/stdc++.h>
#define lli unsigned long long int
#define ll long long int
#define PI acos(-1.0)
#define UNIQUE(V) (V).erase(unique(ALL(V), (V).end()) //vector/string etc must need to be sorted
#define timesave \
ios_base::sync_with_s... | #include <bits/stdc++.h>
#define lli unsigned long long int
#define ll long long int
#define PI acos(-1.0)
#define UNIQUE(V) (V).erase(unique(ALL(V), (V).end()) //vector/string etc must need to be sorted
#define timesave \
ios_base::sync_with_s... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,746 | 874,747 | u842407954 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) { return b == 0 ? a : GCD(b, a % b); }
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = GCD(l[i - 1], a[i]);
}
r[n - 1] = a[... | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) { return b == 0 ? a : GCD(b, a % b); }
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = GCD(l[i - 1], a[i]);
}
r[n - 1] = a[... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,748 | 874,749 | u521455622 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b != 0) {
int t = a % b;
a = b;
b = t;
}
return a;
}
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = ... | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b != 0) {
int t = a % b;
a = b;
b = t;
}
return a;
}
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,750 | 874,751 | u283246948 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b != 0) {
int t = a % b;
a = b;
b = t;
}
return a;
}
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = ... | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b != 0) {
int t = a % b;
a = b;
b = t;
}
return a;
}
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 874,752 | 874,751 | u283246948 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
ll N, A[100005], S1[100005], S2[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
S1[0] = A[0];
for (ll i = 1; i < N; i++) {
S1[i] = __... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
ll N, A[100005], S1[100005], S2[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
S1[0] = A[0];
for (ll i = 1; i < N; i++) {
S1[i] = __... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,760 | 874,761 | u061157803 | cpp |
p03061 | #include <bits/stdc++.h>
#define _ << ' ' <<
using namespace std;
using vi = vector<int>;
using ll = long long;
void view(const vector<int> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
int gcd(int m, int n) { return !n ? m : gcd(n, m % n); }
int main() {
int i, j;
int n;
cin >> n;
vi... | #include <bits/stdc++.h>
#define _ << ' ' <<
using namespace std;
using vi = vector<int>;
using ll = long long;
void view(const vector<int> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
int gcd(int m, int n) { return !n ? m : gcd(n, m % n); }
int main() {
int i, j;
ll n;
cin >> n;
vi ... | [
"variable_declaration.type.change",
"assignment.change"
] | 874,764 | 874,765 | u542612766 | cpp |
p03061 | #include <bits/stdc++.h>
#define _ << ' ' <<
using namespace std;
using vi = vector<int>;
using ll = long long;
void view(const vector<int> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
int gcd(int m, int n) { return !n ? m : gcd(n, m % n); }
int main() {
int i, j;
int n;
cin >> n;
vi... | #include <bits/stdc++.h>
#define _ << ' ' <<
using namespace std;
using vi = vector<int>;
using ll = long long;
void view(const vector<int> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
int gcd(int m, int n) { return !n ? m : gcd(n, m % n); }
int main() {
int i, j;
ll n;
cin >> n;
vi ... | [
"variable_declaration.type.change",
"assignment.change"
] | 874,766 | 874,765 | u542612766 | cpp |
p03061 | /*..............................................*\
Author:Kishor Kumar Paroi
Dept:CSE-1703053
email.kishor.josephite@gmail.com
RUET,BANGLADESH
\*---------------------------*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include... | /*..............................................*\
Author:Kishor Kumar Paroi
Dept:CSE-1703053
email.kishor.josephite@gmail.com
RUET,BANGLADESH
\*---------------------------*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include... | [] | 874,767 | 874,768 | u031686335 | cpp |
p03061 | /*..............................................*\
Author:Kishor Kumar Paroi
Dept:CSE-1703053
email.kishor.josephite@gmail.com
RUET,BANGLADESH
\*---------------------------*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include... | /*..............................................*\
Author:Kishor Kumar Paroi
Dept:CSE-1703053
email.kishor.josephite@gmail.com
RUET,BANGLADESH
\*---------------------------*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,769 | 874,768 | u031686335 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y % x == 0)
return x;
else
return gcd(y % x, x);
}
int main() {
int n, m, k;
m = 0;
cin >> n;
vector<int> li(n), l(n + 1, 0), r(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> li[i];
for (int i = 0; i < n; i++) {
l... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
else
return gcd(y % x, x);
}
int main() {
int n, m, k;
m = 0;
cin >> n;
vector<int> li(n), l(n + 1, 0), r(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> li[i];
for (int i = 0; i < n; i++) {
l.at(... | [
"expression.operation.binary.remove",
"identifier.change",
"function.return_value.change"
] | 874,772 | 874,773 | u618107373 | cpp |
p03061 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#d... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#d... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 874,774 | 874,775 | u625729943 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove",
"assignment.change"
] | 874,781 | 874,782 | u032789819 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 874,783 | 874,782 | u032789819 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n + 1];
int l[n + 2], r[n + 2];
for (i = 1; i <= n; i++)
cin >> a[i];
l[0] = 0;
r[n + 1] = 0;
for (i = 1; i <= n; i++)
l[i] = __gcd(l[i - 1], a[i]);
for (i = n; i >= 1; i--)
r[i] = __gcd(r[i + 1], a[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n + 1];
int l[n + 2], r[n + 2];
for (i = 1; i <= n; i++)
cin >> a[i];
l[0] = 0;
r[n + 1] = 0;
for (i = 1; i <= n; i++)
l[i] = __gcd(l[i - 1], a[i]);
for (i = n; i >= 1; i--)
r[i] = __gcd(r[i + 1], a[i]);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,786 | 874,787 | u228402731 | cpp |
p03061 | #include <bits/stdc++.h>
#define f(a, n) for (ll i = a; i < n; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define all(v) v.begin(), v.end()
using namespace std;
const ll mod = (1e+9) + 7;
const ll size = 2e5 + 9;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
... | #include <bits/stdc++.h>
#define f(a, n) for (ll i = a; i < n; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define all(v) v.begin(), v.end()
using namespace std;
const ll mod = (1e+9) + 7;
const ll size = 2e5 + 9;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,788 | 874,789 | u865644664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { //整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_ba... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { //整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_ba... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,790 | 874,791 | u317711717 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { //整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_ba... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { //整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_ba... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,790 | 874,792 | u317711717 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
ll N, m = 1;
cin >> N;
vector<ll> A(N);
vector<ll> forward(N), back(N), ans(N);
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
ll N, m = 1;
cin >> N;
vector<ll> A(N);
vector<ll> forward(N), back(N), ans(N);
for (int i = 0; i < ... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,803 | 874,804 | u889812821 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
ll N, m = 1;
cin >> N;
vector<ll> A(N);
vector<ll> forward(N), back(N), ans(N);
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
ll N, m = 1;
cin >> N;
vector<ll> A(N);
vector<ll> forward(N), back(N), ans(N);
for (int i = 0; i < ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.change"
] | 874,805 | 874,804 | u889812821 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#incl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,826 | 874,827 | u783861517 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b)
return gcd(b, a);
int r = a % b;
if (r == 0)
return b;
return gcd(b, r);
}
int main(void) {
int N;
cin >> N;
vector<int> A(N), left(N - 1), right... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b)
return gcd(b, a);
int r = a % b;
if (r == 0)
return b;
return gcd(b, r);
}
int main(void) {
int N;
cin >> N;
vector<int> A(N), left(N - 1), right... | [
"expression.operation.binary.remove"
] | 874,828 | 874,829 | u330913290 | cpp |
p03061 | /*input
15
1 2 1 1 3 2 2 2 3 3 3 1 1 2 2
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define pb push_back
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
i... | /*input
15
1 2 1 1 3 2 2 2 3 3 3 1 1 2 2
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define pb push_back
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,832 | 874,833 | u186304815 | cpp |
p03061 | // ABC125 A -
#include <bits/stdc++.h>
using namespace std;
int64_t calc_gdc(int64_t a, int64_t b) {
if (a < b) {
swap(a, b);
}
int64_t r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int64_t n;
#if LOCAL & 1
std::ifstream in("input.txt");
std::cin.rdbuf... | // ABC125 A -
#include <bits/stdc++.h>
using namespace std;
int64_t calc_gdc(int64_t a, int64_t b) {
if (a < b) {
swap(a, b);
}
int64_t r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int64_t n;
#if LOCAL & 0
std::ifstream in("input.txt");
std::cin.rdbuf... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 874,836 | 874,837 | u182321487 | cpp |
p03061 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define c(P) cout << P << "\n"
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define c(P) cout << P << "\n"
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,854 | 874,855 | u305721160 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 100000;
ll gcd(ll u, ll v);
ll pref[MAXN];
ll suff[MAXN];
int main() {
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> arr(N);
for (int i = 0; i < N; ++i) {
cin >> ar... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 100000;
ll gcd(ll u, ll v);
ll pref[MAXN];
ll suff[MAXN];
int main() {
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> arr(N);
for (int i = 0; i < N; ++i) {
cin >> ar... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,856 | 874,857 | u826794194 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i < (n); i++)
#define REP2(i, d, n) for (int i = (d); i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= ... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i < (n); i++)
#define REP2(i, d, n) for (int i = (d); i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= ... | [
"call.add"
] | 874,866 | 874,867 | u250996767 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push... | [
"identifier.change",
"call.arguments.change"
] | 874,870 | 874,871 | u414444658 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int N;
vll A;
ll left_cum[100001], right_cum[100001];
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
left_cum[0] = A[0];
right_cum[N - 1] = A[N - 1];
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int N;
vll A;
ll left_cum[100001], right_cum[100001];
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
left_cum[0] = A[0];
right_cum[N - 1] = A[N - 1];
for (int i ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,893 | 874,894 | u826487371 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int N;
vll A;
ll left_cum[100001], right_cum[100001];
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
left_cum[0] = A[0];
right_cum[N - 1] = A[N - 1];
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int N;
vll A;
ll left_cum[100001], right_cum[100001];
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
left_cum[0] = A[0];
right_cum[N - 1] = A[N - 1];
for (int i ... | [
"assignment.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,895 | 874,894 | u826487371 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<int, int> ii;
int main() {
int N;
cin >> N;
vll A;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
vll LG(N), RG(N);
LG[0] = A... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<int, int> ii;
int main() {
int N;
cin >> N;
vll A;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
vll LG(N), RG(N);
LG[0] = A[0];
RG[N - 1] = A[... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,896 | 874,897 | u826487371 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
int A[N];
int L[N];
int R[N];
int ans = 0;
L[0] = R[N + 1] = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = 1; i <= N... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
int A[N];
int L[N];
int R[N];
int ans = 0;
L[0] = R[N + 1] = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = 1; i <= N... | [
"assignment.change"
] | 874,898 | 874,899 | u845882023 | cpp |
p03061 | #include <bits/stdc++.h>
#define w cout
#define e endl
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1] = {}, pre[n + 1] = {}, suff[n + 1] = {};
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = 1; i <= n; i++) {
pre[i] = __gcd(pre[i - 1], arr[i]);
suff[n - i + 1] ... | #include <bits/stdc++.h>
#define w cout
#define e endl
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 10] = {}, pre[n + 10] = {}, suff[n + 10] = {};
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = 1; i <= n; i++) {
pre[i] = __gcd(pre[i - 1], arr[i]);
suff[n - i +... | [
"literal.number.change",
"expression.operation.binary.change"
] | 874,905 | 874,906 | u566755496 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define INF 1 << 30
#define MIN_INF (-1)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define INF 1 << 30
#define MIN_INF (-1)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
... | [
"assignment.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,911 | 874,912 | u426057057 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> left(n + 1);
vector<int> right(n + 1);
left[0] = 0;
right[n] = 0;
int ans = 0;
for (int i = 1; i <= n; i++)
left[i] = __gcd(left[i - 1], arr[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> left(n + 1);
vector<int> right(n + 1);
left[0] = 0;
right[n] = 0;
int ans = 0;
for (int i = 1; i <= n; i++)
left[i] = __gcd(left[i - 1], arr[... | [
"assignment.change"
] | 874,922 | 874,923 | u253225079 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,926 | 874,927 | u030992242 | cpp |
p03061 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1;... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1;... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,928 | 874,929 | u696415377 | cpp |
p03061 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1;... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1;... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,930 | 874,929 | u696415377 | cpp |
p03061 | #include <iostream>
using namespace std;
int foward[100000] = {};
int backward[100000] = {};
int n = 0;
int gcd(int a, int b) {
if (a == b || b == 0)
return a;
return gcd(b, a % b);
}
int gcd_without(int i) {
if (i == 0)
return backward[n - 2];
else if (i == n - 1)
return foward[n - 2];
return... | #include <iostream>
using namespace std;
int foward[100000] = {};
int backward[100000] = {};
int n = 0;
int gcd(int a, int b) {
if (a == b || b == 0)
return a;
return gcd(b, a % b);
}
int gcd_without(int i) {
if (i == 0)
return backward[n - 2];
else if (i == n - 1)
return foward[n - 2];
return... | [
"expression.operation.binary.add"
] | 874,931 | 874,932 | u347503894 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long> a(n), l(n + 1), r(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
l[0] = 0;
r[n + 1] = 0;
for... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long> a(n), l(n + 1), r(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
l[0] = 0;
r[n] = 0;
for (in... | [
"expression.operation.binary.remove"
] | 874,938 | 874,937 | u265608204 | cpp |
p03061 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,943 | 874,944 | u221758210 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> front(N - 1), back(N - 1);
int gcdf = A[0];
for (int i = 0; i < front.size(); i++) {
gcdf = __gcd(gcdf, A[i]);
front[i] = gcdf;
}
rever... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> front(N - 1), back(N - 1);
int gcdf = A[0];
for (int i = 0; i < front.size(); i++) {
gcdf = __gcd(gcdf, A[i]);
front[i] = gcdf;
}
rever... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,955 | 874,956 | u987594251 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
set<int> a, b;
int n, x, k, i, ans = 1;
cin >> n;
for (i = 0; i < n; i++) {
b.clear();
swap(a, b);
cin >> x;
for (set<int>::iterator it = b.begin(... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
set<int> a, b;
int n, x, k = 0, i, ans = 1;
cin >> n;
for (i = 0; i < n; i++) {
b.clear();
swap(a, b);
cin >> x;
for (set<int>::iterator it = b.be... | [
"variable_declaration.value.change"
] | 874,957 | 874,958 | u038054933 | cpp |
p03061 | // template version 1.8
// varibable settings {{{
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
#define int long long
const int INF = 1e18;
const int MOD = 1e9 + 7;
#define infile "../test/sample-1.in"
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
#define fi first
#define se second
// }}}
... | // template version 1.8
// varibable settings {{{
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
#define int long long
const int INF = 1e18;
const int MOD = 1e9 + 7;
#define infile "../test/sample-1.in"
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
#define fi first
#define se second
// }}}
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,980 | 874,981 | u314057689 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, i, j, min = (ll)1e9, min2;
cin >> n;
vector<ll> a(n), l(n), r(n), b(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (i = 0; i < n; i++) {
if (i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, i, j, min = (ll)1e9, min2;
cin >> n;
vector<ll> a(n), l(n), r(n), b(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (i = 0; i < n; i++) {
if (i ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,982 | 874,983 | u061912210 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int N;
int A[500001];
int R[500001];
int L[500001];
int ans = 0;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
cin >> N;
for (int n = 0; n < N; n++) {
cin >> A[n];
}
L... | #include <bits/stdc++.h>
using namespace std;
int N;
int A[500001];
int R[500001];
int L[500001];
int ans = 0;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
cin >> N;
for (int n = 0; n < N; n++) {
cin >> A[n];
}
L... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,984 | 874,985 | u608297208 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int N;
int A[500001];
int R[500001];
int L[500001];
int ans = 0;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
cin >> N;
for (int n = 0; n < N; n++) {
cin >> A[n];
}
L... | #include <bits/stdc++.h>
using namespace std;
int N;
int A[500001];
int R[500001];
int L[500001];
int ans = 0;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
cin >> N;
for (int n = 0; n < N; n++) {
cin >> A[n];
}
L... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,986 | 874,985 | u608297208 | cpp |
p03061 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <regex>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ull = unsigned long long;
using ll = long long;
ull gcd(ull a, ull b) { ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <regex>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ull = unsigned long long;
using ll = long long;
ull gcd(ull a, ull b) { ... | [
"assignment.variable.change",
"identifier.change"
] | 874,995 | 874,996 | u101264341 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a < b)
return gcd(b, a);
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<int64_t> t(n);
f... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a < b)
return gcd(b, a);
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<int64_t> t(n);
f... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,997 | 874,998 | u672765904 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n;
cin >> n;
vector<ll> a(n), f(n), b(n), d(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n;
cin >> n;
vector<ll> a(n), f(n), b(n), d(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 875,007 | 875,008 | u456333842 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
#define iINF (1 << 30)
#define INF (1LL << 59)
#define forn(i) for (int i = 0; i < n;... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
#define iINF (1 << 30)
#define INF (1LL << 59)
#define forn(i) for (int i = 0; i < n;... | [
"call.arguments.change",
"call.arguments.add"
] | 875,009 | 875,010 | u120190063 | cpp |
p03061 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef U_L_LONG
typedef unsigned long long U_L_LONG;
#endif
#ifndef L_LONG
typedef long long L_LONG;
#endif
#ifndef LL_ABS
#define LL_ABS(x) (((((x) < 0) ? ((x) * (-1)) : (x))))
#e... |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef U_L_LONG
typedef unsigned long long U_L_LONG;
#endif
#ifndef L_LONG
typedef long long L_LONG;
#endif
#ifndef LL_ABS
#define LL_ABS(x) (((((x) < 0) ? ((x) * (-1)) : (x))))
#e... | [
"expression.operation.binary.remove"
] | 875,023 | 875,024 | u887675488 | cpp |
p03061 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main(int argc, ch... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main(int argc, ch... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,025 | 875,026 | u729166490 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = max(1, min(A.at(0),
A.at(N - 1))); // Mを小さくしていっていくつ割り切るか調べる
while (true) {
int count = 0; // MがAをいくつ割り切れないか数える
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = max(A.at(0), A.at(N - 1)); // Mを小さくしていっていくつ割り切るか調べる
while (true) {
int count = 0; // MがAをいくつ割り切れないか数える
for (int i = 0; i < N; i++) {
... | [
"call.arguments.change"
] | 875,027 | 875,028 | u668650380 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = min(A.at(0), A.at(N - 1)); // Mを小さくしていっていくつ割り切るか調べる
while (true) {
int count = 0; // MがAをいくつ割り切れないか数える
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = max(A.at(0), A.at(N - 1)); // Mを小さくしていっていくつ割り切るか調べる
while (true) {
int count = 0; // MがAをいくつ割り切れないか数える
for (int i = 0; i < N; i++) {
... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 875,029 | 875,028 | u668650380 | cpp |
p03061 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
int N, A[101010], ans, Al[101010], Ar[101010];
int i, j;
int gcd(int a, int... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
int N, A[101010], ans, Al[101010], Ar[101010];
int i, j;
int gcd(int a, int... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 875,032 | 875,033 | u259396003 | cpp |
p03061 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long LL;
typedef unsigned long UL;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >... | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long LL;
typedef unsigned long UL;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change"
] | 875,041 | 875,040 | u549268855 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100001];
int b[100001];
int b1[100001];
int sum;
int ans = 0;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
memset(b, 0, sizeof(b));
memset(b1, 0, sizeof(b1));
b[1] = a[1];
b1[n] = a[n];
for (int i = 2... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100001];
int b[100001];
int b1[100001];
int ans = 0;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
memset(b, 0, sizeof(b));
memset(b1, 0, sizeof(b1));
b[1] = a[1];
b1[n] = a[n];
for (int i = 2; i <= n;... | [
"variable_declaration.remove",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 875,044 | 875,045 | u433665020 | cpp |
p03061 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int gcd(int a, int b) {
int M = std::max(a, b);
int m = std::min(a, b);
if (m == 0) {
return M;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<int> v;
int a;
vector<int> g;
for (int i = 0; i <... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int gcd(int a, int b) {
int M = std::max(a, b);
int m = std::min(a, b);
if (m == 0) {
return M;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<int> v;
int a;
vector<int> g;
for (int i = 0; i <... | [
"identifier.change"
] | 875,046 | 875,047 | u713830790 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int m, int n) {
if (n > m)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> f(n), b(n)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int m, int n) {
if (n > m)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> f(n), b(n)... | [
"assignment.variable.change",
"identifier.change"
] | 875,050 | 875,051 | u809153881 | cpp |
p03061 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbe... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbe... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 875,052 | 875,053 | u039805629 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF =... | [
"assignment.value.change",
"identifier.change"
] | 875,066 | 875,067 | u913836622 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
//#include <numeric>
using namespace std;
int gcd(int a, int b) {
while (b != 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main(void) {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if... | #include <algorithm>
#include <iostream>
#include <vector>
//#include <numeric>
using namespace std;
int gcd(int a, int b) {
while (b != 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main(void) {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 875,081 | 875,082 | u464397170 | cpp |
p03061 | #include <algorithm>
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
int buf = a;
a = b;
b = buf;
}
return a == 0 ? b : gcd(a, b % a);
}
int main() {
int n;
scanf("%d", &n);
int front[n + 1], back[n + 1], a[n];
for (int i = 0; i < n; i++)
scanf("%d", a + i);
... | #include <algorithm>
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
int buf = a;
a = b;
b = buf;
}
return a == 0 ? b : gcd(a, b % a);
}
int main() {
int n;
scanf("%d", &n);
int front[n + 1], back[n + 1], a[n];
for (int i = 0; i < n; i++)
scanf("%d", a + i);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 875,083 | 875,084 | u956758464 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,087 | 875,088 | u227379863 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#include <queue>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1e9)
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#include <queue>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1e9)
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 875,099 | 875,100 | u185294445 | cpp |
p03061 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int gcd(int a, int b) { return (b ? gcd(b, a % b) : a); }
int main() {
int n;
cin >> n;
int a[100005];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int g_l[100005], g_r[100005];
int g = a[0];
for (int i = 0; i < n; i++) {
g =... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int gcd(int a, int b) { return (b ? gcd(b, a % b) : a); }
int main() {
int n;
cin >> n;
int a[100005];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int g_l[100005], g_r[100005];
int g = a[0];
for (int i = 0; i < n; i++) {
g =... | [
"assignment.change"
] | 875,104 | 875,105 | u620735210 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.