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>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array) / sizeof(array[0]))
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
using Field = vector<vector<int>>;
template <class T> inline bool chmin(T &a, T b) {
... | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array) / sizeof(array[0]))
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
using Field = vector<vector<int>>;
template <class T> inline bool chmin(T &a, T b) {
... | [
"assignment.change"
] | 873,179 | 873,180 | u527105447 | cpp |
p03061 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() { cout << '\n'; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
cout << first << ' ';
print(rest...);
}
... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() { cout << '\n'; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
cout << first << ' ';
print(rest...);
}
... | [] | 873,181 | 873,182 | u736788838 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
in... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
in... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"assignment.change",
"control_flow.loop.for.initializer.change"
] | 873,189 | 873,190 | u115454768 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> v... | [
"expression.operation.binary.add"
] | 873,206 | 873,207 | u852449189 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, a[101010];
int l[101010], r[101010];
int main() {
cin >> n;
rep(i, n) cin >> a[i];
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = __gcd(l[i - 1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, a[101010];
int l[101010], r[101010];
int main() {
cin >> n;
rep(i, n) cin >> a[i];
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = __gcd(l[i - 1]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,212 | 873,213 | u389007679 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, a[101010], b[101010], c[101010];
int main() {
cin >> n;
rep(i, n) { cin >> a[i]; }
rep(i, n) { b[i] = c[i] = 0; }
b[0] = a[0];
c[n - 1] = a[n - 1];
for (int i = 1; i < n; i++... | //デバッグ消し忘れ再提出
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, a[101010], b[101010], c[101010];
int main() {
cin >> n;
rep(i, n) { cin >> a[i]; }
rep(i, n) { b[i] = c[i] = 0; }
b[0] = a[0];
c[n - 1] = a[n - 1];
for (int i =... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,214 | 873,215 | u389007679 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 873,216 | 873,217 | u110044127 | cpp |
p03061 | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include ... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 873,224 | 873,225 | u590927341 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO \
ios_base::... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO \
ios_base::... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,234 | 873,235 | u305141544 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO \
ios_base::... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO \
ios_base::... | [
"call.arguments.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,237 | 873,235 | u305141544 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
#define ALL(x) (x).begin(), (x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; // 10^18
const int inINF = 1000000000; // 10^9
const ll MOD = 1000000007; // 10^9+7
cons... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
#define ALL(x) (x).begin(), (x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; // 10^18
const int inINF = 1000000000; // 10^9
const ll MOD = 1000000007; // 10^9+7
cons... | [
"variable_declaration.type.change",
"assignment.change",
"expression.operation.binary.remove"
] | 873,244 | 873,245 | u478462004 | cpp |
p03061 | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | [
"assignment.value.change",
"identifier.change"
] | 873,246 | 873,247 | u145483532 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,256 | 873,257 | u965730380 | cpp |
p03061 | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
int n;
cin... | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
int n;
cin... | [
"expression.operation.binary.add"
] | 873,264 | 873,265 | u931071094 | cpp |
p03061 | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
int n;
cin... | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
int n;
cin... | [
"call.arguments.add"
] | 873,266 | 873,265 | u931071094 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 2, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> b(n + 1, 0);
b[1] = a[1];
for (int j = 2; j <= n; j++) {
b[j] = __gcd(b[j - 1], a[j]);
}
vector<int> c(n + 1, 0);
c[n] = a[n];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 2, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> b(n + 2, 0);
b[1] = a[1];
for (int j = 2; j <= n; j++) {
b[j] = __gcd(b[j - 1], a[j]);
}
vector<int> c(n + 2, 0);
c[n] = a[n];
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change"
] | 873,267 | 873,268 | u931071094 | cpp |
p03061 | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef pair<int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 1e9 + 7; // 786433;//998244353;
const double Pi = acos(-1);
const int ... | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef pair<int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 1e9 + 7; // 786433;//998244353;
const double Pi = acos(-1);
const int ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,269 | 873,270 | u960469574 | cpp |
p03061 | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int GCD(int x, int y) { return x ? GCD(y % x, x) : y; }
int main(int argc, const char *argv[]) {
int N;
cin >> N;
vector<int> A(N);
for (int i... | #include <algorithm> // sort
#include <iostream>
#include <map> // pair
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int GCD(int x, int y) { return x ? GCD(y % x, x) : y; }
int main(int argc, const char *argv[]) {
int N;
cin >> N;
vector<int> A(N);
for (int i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,271 | 873,272 | u221285045 | 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() {
int n;
int a[100005];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int l[100005] = {}, r[100005] = {};
for (int i = 0; i < n - 1; i++) {
... | #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() {
int n;
int a[100005];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int l[100005] = {}, r[100005] = {};
for (int i = 0; i < n - 1; i++) {
... | [
"identifier.change",
"io.output.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,282 | 873,279 | u876558178 | 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, max = 1;
cin >> N;
vector<int> A(N, 0), L(N, 0), R(N, 0), gcds(N, 0); // L[i]はA[0]からA[i]までの最大公約数、R[i]はA[i]からA[N
// - 1]までの最... | #include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int N, max = 1;
cin >> N;
vector<int> A(N, 0), L(N, 0), R(N, 0), gcds(N, 0); // L[i]はA[0]からA[i]までの最大公約数、R[i]はA[i]からA[N
// - 1]までの最... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,287 | 873,288 | u164385976 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for (int(i) = (n); (i) < (m); ++(i))
// constexpr int INF = 1e9;
constexpr ll INF = 1LL << 61;
constexpr ll mod = 1e9 + 7... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for (int(i) = (n); (i) < (m); ++(i))
// constexpr int INF = 1e9;
constexpr ll INF = 1LL << 61;
constexpr ll mod = 1e9 + 7... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,297 | 873,298 | u174434198 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
ll N;
int main() {
cin >> N;
vector<ll> v(N);
rep(i, N) cin >> v[i];
vector<ll> sum_l(N + 1);
sum_l[0] = v[0];
rep(i, N) { sum_l[i + 1] += __gcd(sum_l[i], v[i])... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
ll N;
int main() {
cin >> N;
vector<ll> v(N);
rep(i, N) cin >> v[i];
vector<ll> sum_l(N + 1);
sum_l[0] = v[0];
rep(i, N) { sum_l[i + 1] += __gcd(sum_l[i], v[i])... | [
"expression.operation.binary.remove"
] | 873,308 | 873,309 | u455366471 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) {
if (b)
return gcd(b, a % b);
return a;
}
int main() {
int n;
cin >> n;
vector<int> v(n);... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) {
if (b)
return gcd(b, a % b);
return a;
}
int main() {
int n;
cin >> n;
vector<int> v(n);... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change",
"expression.operation.binary.remove"
] | 873,310 | 873,311 | u657208344 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int igcd(int a, int b) {
if (a < 0)
a = b;
if (b < 0)
b = a;
if (b == 0)
return a;
return igcd(b, a % b);
}
int main() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int igcd(int a, int b) {
if (a < 0)
a = b;
if (b < 0)
b = a;
if (b == 0)
return a;
return igcd(b, a % b);
}
int main() ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,316 | 873,317 | u672995180 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &i : a)
cin >> i;
vector<int> b(n), c(n);
b.at(0) = a.at(0);
for (int i = 1; i < n; i++) {
b.at(i) = __gcd(b.at(i - 1), a.at(i));
}
c.at(n - ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &i : a)
cin >> i;
vector<int> b(n), c(n);
b.at(0) = a.at(0);
for (int i = 1; i < n; i++) {
b.at(i) = __gcd(b.at(i - 1), a.at(i));
}
c.at(n - ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,320 | 873,321 | u168860135 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long i, long long j) {
//ユークリッドの互除法で最大公約数を求める
// 2変数の場合
if (i < j) {
swap(i, j);
}
while (i % j != 0) {
int r;
r = i % j;
if (r == 0) {
return j;
} else {
i = j;
j = r;
}
}
return j;
}
long lon... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long i, long long j) {
//ユークリッドの互除法で最大公約数を求める
// 2変数の場合
if (i < j) {
swap(i, j);
}
while (i % j != 0) {
int r;
r = i % j;
if (r == 0) {
return j;
} else {
i = j;
j = r;
}
}
return j;
}
long lon... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 873,326 | 873,327 | u229596090 | cpp |
p03061 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, b % a); }
int Gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
assert(a != 0 && b != 0);
return gcd(a, b);
}
class SegmentTree {
publi... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int Gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
assert(a != 0 && b != 0);
return gcd(a, b);
}
class SegmentTree {
publi... | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 873,332 | 873,333 | u505122009 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 873,349 | 873,350 | u767543103 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
vector<ll> a(n + 1), lt(n + 1), rt(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
lt[1] = a[1];
rt[n] = a[n];
for (int i = 2; i <= n; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<ll> a(n + 1), lt(n + 1), rt(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
lt[1] = a[1];
rt[n] = a[n];
for (int i = 2; i <... | [] | 873,371 | 873,372 | u929156598 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t = 0;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> l(n);
vector<int> r(n);
l[0] = v[0];
r[n - 1] = v[n - 1];
for (int i = 1; i <= n - 1; i++)
l[i] = __gc... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t = 0;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> l(n);
vector<int> r(n);
l[0] = v[0];
r[n - 1] = v[n - 1];
for (int i = 1; i <= n - 1; i++)
l[i] = __gc... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,373 | 873,374 | u668974816 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t = 0;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> l(n);
vector<int> r(n);
l[0] = v[0];
r[n - 1] = v[n - 1];
for (int i = 1; i <= n - 1; i++)
l[i] = __gc... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, t = 0;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> l(n);
vector<int> r(n);
l[0] = v[0];
r[n - 1] = v[n - 1];
for (int i = 1; i <= n - 1; i++)
l[i] = __gc... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,375 | 873,374 | u668974816 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i]... | [
"expression.operation.binary.add"
] | 873,376 | 873,377 | u459930111 | 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)
#define int long long
#define vec(a, n) vector<int>(a)((n));
#define Vec(a, n) vector<string>(a)((n));
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
#define Twovec(a, n, m... | #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)
#define int long long
#define vec(a, n) vector<int>(a)((n));
#define Vec(a, n) vector<string>(a)((n));
#define twovec(a, n, m) vector<vector<int>> a(n, vector<int>(m, 0));
#define Twovec(a, n, m... | [
"literal.number.change",
"call.arguments.change"
] | 873,378 | 873,379 | u607741489 | cpp |
p03061 | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | [
"call.add",
"call.arguments.change"
] | 873,387 | 873,388 | u554988565 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | [
"call.add",
"function.return_value.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,391 | 873,392 | u328811800 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
using ll = long long;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pll = pair<long long, long lo... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
using ll = long long;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using pll = pair<long long, long lo... | [
"expression.operation.binary.add"
] | 873,393 | 873,394 | u190580703 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
int tmp;
int r;
if (x > y) {
tmp = x;
x = y;
y = tmp;
}
r = y % x;
while (r != 0) {
y = x;
x = r;
r = y % x;
}
return x;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
int tmp;
int r;
if (x > y) {
tmp = x;
x = y;
y = tmp;
}
r = y % x;
while (r != 0) {
y = x;
x = r;
r = y % x;
}
return x;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> ... | [
"literal.number.change",
"variable_access.subscript.index.change"
] | 873,397 | 873,398 | u983681697 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#defi... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#defi... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 873,409 | 873,410 | u203197031 | cpp |
p03061 | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b... | [
"assignment.change"
] | 873,411 | 873,412 | u879674287 | cpp |
p03061 | #include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <numeric>
using namespace std;
int main() {
long long counter1, counter2;
counter1 = 0;
counter2 = 0;
long long counter3 = 0;
long long N;
cin >> N;
vector<long long> a(N);
vector<long long> b(N + 1);
vector<long long> c(N + 1);
... | #include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <numeric>
using namespace std;
int main() {
long long counter1, counter2;
counter1 = 0;
counter2 = 0;
long long counter3 = 0;
long long N;
cin >> N;
vector<long long> a(N);
vector<long long> b(N + 1);
vector<long long> c(N + 1);
... | [] | 873,419 | 873,420 | u722640678 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
if (r == 0) {
return b;
} else {
return gcd(b, r);
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.a... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
if (r == 0) {
return b;
} else {
return gcd(b, r);
}
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.a... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,421 | 873,422 | u788717734 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
ll A[100010];
ll Agcd[100010][2];
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
ll r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
me... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
ll A[100010];
ll Agcd[100010][2];
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
ll r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
me... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,428 | 873,429 | u280802329 | cpp |
p03061 | #include <bits/stdc++.h>
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);
for (int i = 0; i < N; i++) {
left[i + 1] = gcd(le... | #include <bits/stdc++.h>
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);
for (int i = 0; i < N; i++) {
left[i + 1] = gcd(le... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 873,435 | 873,436 | u538808095 | cpp |
p03061 | #include <bits/stdc++.h>
#include <cstring>
#include <limits.h>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#include <cstring>
#include <limits.h>
#include <stdio.h>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast \
ios_base::sync_with_stdio(false); ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 873,439 | 873,440 | u962242502 | cpp |
p03061 | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,445 | 873,446 | u955627293 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
int gcm(int a, int b);
int main() {
int a;
cin >> a;
vint A(a);
rep(i, a) cin >> A[i];
vint... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
int gcm(int a, int b);
int main() {
int a;
cin >> a;
vint A(a);
rep(i, a) cin >> A[i];
vint... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 873,447 | 873,448 | u613960672 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep (i, n) for (int i = 0; i < (n); i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const int mod = 1e9 + 7;
int main() {
int l[100005], r[100005], a[100005];
int n;
cin >> n;
fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep (i, n) for (int i = 0; i < (n); i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const int mod = 1e9 + 7;
int main() {
int l[100005], r[100005], a[100005];
int n;
cin >> n;
fo... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 873,449 | 873,450 | u853580735 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define ... | [
"assignment.change"
] | 873,455 | 873,456 | u284045566 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, m = 0;
cin >> n;
int ara[n];
for (i = 0; i < n; i++) {
cin >> ara[i];
}
int dp[n], dp1[n];
dp[0] = ara[0];
for (i = 1; i < n; i++) {
dp[i] = __gcd(dp[i - 1], ara[i]);
}
dp1[n - 1] = ara[n - 1];
for (i = n - 2; i >= 0; i--... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, m = 0;
cin >> n;
int ara[n];
for (i = 0; i < n; i++) {
cin >> ara[i];
}
int dp[n], dp1[n];
dp[0] = ara[0];
for (i = 1; i < n; i++) {
dp[i] = __gcd(dp[i - 1], ara[i]);
}
dp1[n - 1] = ara[n - 1];
for (i = n - 2; i >= 0; i--... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,457 | 873,458 | u455696572 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> z(n);
for (int i = 0; i < n; i++) {
cin >> z.at(i);
}
int y;
vector<int> x;
for (int i = 1; i < sqrt(z.at(0)); i++) {
if (z.at(0) % i == 0) {
x.push_back(i);
x.push_back(z.at(0) / i);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> z(n);
for (int i = 0; i < n; i++) {
cin >> z.at(i);
}
int y;
vector<int> x;
for (int i = 1; i < sqrt(z.at(0)) + 1; i++) {
if (z.at(0) % i == 0) {
x.push_back(i);
x.push_back(z.at(0) / i);
}
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 873,462 | 873,463 | u577774192 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> A(N), L(N), R(N);
for (int i = 0; i < N; i++)
cin >> A[i];
L[0] = A[0];
R[N - 1] = A[N - 1];
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> A(N), L(N), R(N);
for (int i = 0; i < N; i++)
cin >> A[i];
L[0] = A[0];
R[N - 1] = A[N - 1];
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,468 | 873,469 | u868132236 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
int gcd(int a, int b) { return (b ? gcd(b, a % b) : a); }
int m... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
int gcd(int a, int b) { return (b ? gcd(b, a % b) : a); }
int m... | [
"expression.operation.binary.remove"
] | 873,470 | 873,471 | u737491054 | cpp |
p03061 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i, n) for (i = 0; i < n; i++)
#define f1(i, n) for (i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define upp(v, val) upper_bound(v.begin(), v.end(), val)
#define lower... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i, n) for (i = 0; i < n; i++)
#define f1(i, n) for (i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define upp(v, val) upper_bound(v.begin(), v.end(), val)
#define lower... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 873,472 | 873,473 | u097326875 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll i, j, k;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> left(n + 1), right(n + 1);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll i, j, k;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> left(n + 1), right(n + 1);
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change",
"expression.operation.binary.remove"
] | 873,476 | 873,477 | u582588783 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll i, j, k;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> left(n + 1), right(n + 1);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll i, j, k;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> left(n + 1), right(n + 1);
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,479 | 873,477 | u582588783 | cpp |
p03061 | #ifdef BODY
int solve(lint n, std::vector<lint> a) {
vector<lint> s(n), t(n);
s[0] = a[0], t[n - 1] = a[n - 1];
rep(n - 1) s[i + 1] = gcd(s[i], a[i + 1]);
per(n - 1) t[i] = gcd(t[i + 1], a[i]);
lint ans = max(t[1], s[n - 1]);
rep(i, 1, n - 1) { chmax(ans, gcd(s[i - 1], t[i + 1])); }
out(ans);
return 0;... | #ifdef BODY
int solve(lint n, std::vector<lint> a) {
vector<lint> s(n), t(n);
s[0] = a[0], t[n - 1] = a[n - 1];
rep(n - 1) s[i + 1] = gcd(s[i], a[i + 1]);
per(n - 1) t[i] = gcd(t[i + 1], a[i]);
lint ans = max(t[1], s[n - 2]);
rep(i, 1, n - 1) { chmax(ans, gcd(s[i - 1], t[i + 1])); }
out(ans);
return 0;... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,489 | 873,490 | u675296835 | cpp |
p03061 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
int gcd(int a, int b) {
if (min(a, b) == 0)
return max(a, b);
if (a... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
int gcd(int a, int b) {
if (min(a, b) == 0)
return max(a, b);
if (a... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,491 | 873,492 | u263000123 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
ll n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll right[n - 1] = {0}, left[n - 1] = {0};
right[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int main() {
ll n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll right[n - 1] = {0}, left[n - 1] = {0};
right[... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 873,495 | 873,496 | u294721290 | cpp |
p03061 | #include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
template <class T, class F> struct segment_tree {
std::vector<T> data;
int n;
F f;
T identity;
segment_tree() {}
segment_tree(int sz, T ide, F _f) : f(_f), identity(ide) {
n = 1;
while (n < sz)
n <<= 1;
... | #include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
template <class T, class F> struct segment_tree {
std::vector<T> data;
int n;
F f;
T identity;
segment_tree() {}
segment_tree(int sz, T ide, F _f) : f(_f), identity(ide) {
n = 1;
while (n < sz)
n <<= 1;
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change"
] | 873,497 | 873,498 | u423624748 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_n = 1e6;
ll a[max_n];
int n;
ll reft[max_n], right[max_n];
ll gcd(ll s1, ll s2) {
if (s2 == 0)
return s1;
return gcd(s2, s1 % s2);
}
void solve() {
vector<ll> left(n + 1, 0), right(n + 1, 0);
for (int i = 0; i < n; i++)
le... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_n = 1e6;
ll a[max_n];
int n;
ll reft[max_n], right[max_n];
ll gcd(ll s1, ll s2) {
if (s2 == 0)
return s1;
return gcd(s2, s1 % s2);
}
void solve() {
vector<ll> left(n + 1, 0), right(n + 1, 0);
for (int i = 0; i < n; i++)
le... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 873,509 | 873,510 | u363005934 | cpp |
p03061 | // https://atcoder.jp/contests/abc125/tasks/abc125_c
#include "algorithm"
#include "functional"
#include "iostream"
#include "numeric"
#include "queue"
#include "set"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define repf(i, from, to) for (ll i = from; i < (to); ++i)
using namespace std;
typed... | // https://atcoder.jp/contests/abc125/tasks/abc125_c
#include "algorithm"
#include "functional"
#include "iostream"
#include "numeric"
#include "queue"
#include "set"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define repf(i, from, to) for (ll i = from; i < (to); ++i)
using namespace std;
typed... | [
"call.add"
] | 873,513 | 873,514 | u751468134 | cpp |
p03061 | #include "bits/stdc++.h"
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
// sort(a, a + N, greater<int>()) // descend
// sort(a, a+N) // ascend
int main() {
ll n;
cin >> n;
ll a[1100... | #include "bits/stdc++.h"
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
// sort(a, a + N, greater<int>()) // descend
// sort(a, a+N) // ascend
int main() {
ll n;
cin >> n;
ll a[1100... | [
"expression.operation.binary.remove"
] | 873,519 | 873,520 | u499009346 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,534 | 873,535 | u601256797 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,536 | 873,535 | u601256797 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,534 | 873,537 | u601256797 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 998244353;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,536 | 873,537 | u601256797 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <stack>
#include <string>
using namespace std;
int gcd(int a, int b) {
int g = max(a, b);
int l = min(a, b);
int r = g % l;
if (r == 0) {
return l;
} else {
return gcd(l, r);
}
}
int main() {
int N;
int A[100000]... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <stack>
#include <string>
using namespace std;
int gcd(int a, int b) {
int g = max(a, b);
int l = min(a, b);
int r = g % l;
if (r == 0) {
return l;
} else {
return gcd(l, r);
}
}
int main() {
int N;
int A[100000]... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,538 | 873,539 | u601256797 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | [
"call.function.change",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,542 | 873,543 | u196953553 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | [
"call.function.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,544 | 873,543 | u196953553 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | [
"call.function.change",
"call.arguments.change",
"assignment.change"
] | 873,545 | 873,543 | u196953553 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | [
"call.function.change",
"call.arguments.change"
] | 873,546 | 873,543 | u196953553 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | [
"call.function.change",
"call.arguments.change",
"assignment.change"
] | 873,547 | 873,543 | u196953553 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y);
signed main() {
int n, a, left[100002], right[100002], ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
left[i + 1] = a;
right[i + 1] = a;
}
left[0] = right[0] = left[n + 1] = right[n + 1];
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y);
signed main() {
int n, a, left[100002], right[100002], ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
left[i + 1] = a;
right[i + 1] = a;
}
left[0] = right[0] = left[n + 1] = right[n + 1] = 0;
for (int i = 0; i < n;... | [
"assignment.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,552 | 873,551 | u899084195 | cpp |
p03061 | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | [
"function.parameters.parameter.add",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 873,554 | 873,555 | u600244905 | cpp |
p03061 | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 873,554 | 873,556 | u600244905 | cpp |
p03061 | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
l... | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
l... | [
"expression.operation.binary.remove"
] | 873,563 | 873,564 | u006576567 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,567 | 873,568 | u043443359 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,569 | 873,568 | u043443359 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int x, int y) {
int r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
int main() {
int n;
cin >> n;
int a[n], s[n], t[n];
for (int i = 0; i < n; i++)
cin >> a[i];
s[0] = a[0];
for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int gcd(int x, int y) {
int r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
int main() {
int n;
cin >> n;
int a[n], s[n], t[n];
for (int i = 0; i < n; i++)
cin >> a[i];
s[0] = a[0];
for... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,570 | 873,571 | u633967774 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pll = pair<ll, ll>;
using vll = vector<ll>;
#define endl "\n"
#define space " "
#define TLE_na_ho \
ios_base::sync_with_stdio(false); \... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pll = pair<ll, ll>;
using vll = vector<ll>;
#define endl "\n"
#define space " "
#define TLE_na_ho \
ios_base::sync_with_stdio(false); \... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,578 | 873,579 | u910695244 | cpp |
p03061 | #include <bits/stdc++.h>
#include <math.h>
#define MAX_N 100100
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
int r = a % b;
return gcd(b, r);
}
int main() {
int n;
cin >> n;
vector<int> a(n), right_gcd(n), left_gcd(n);
for (int i = 0; i < n; i++)
cin >> a[i];
// gcd wit... | #include <bits/stdc++.h>
#include <math.h>
#define MAX_N 100100
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
int r = a % b;
return gcd(b, r);
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1), right_gcd(n + 1), left_gcd(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
... | [
"assignment.change"
] | 873,580 | 873,581 | u194908943 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
... | [
"expression.operation.binary.remove"
] | 873,582 | 873,583 | u006717664 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <memory>
#include <stdio.h>
#include <string>
#include <vector>
void swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
}
int gcd(int a, int b) {
if (a < b)
swap(&a, &b);
if (b < 1)
return -1;
if (a % b == 0)
return... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <memory>
#include <stdio.h>
#include <string>
#include <vector>
void swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
}
int gcd(int a, int b) {
if (a < b)
swap(&a, &b);
if (b < 1)
return -1;
if (a % b == 0)
return... | [
"assignment.change"
] | 873,584 | 873,585 | u389834932 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long m, long long n) { return n != 0 ? gcd(n, m % n) : m; }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
vector<int>... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long m, long long n) { return n != 0 ? gcd(n, m % n) : m; }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
vector<int>... | [
"identifier.change",
"call.function.change"
] | 873,586 | 873,587 | u540491484 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long m, long long n) { return n != 0 ? gcd(n, m % n) : m; }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
vector<int>... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long m, long long n) { return n != 0 ? gcd(n, m % n) : m; }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
vector<int>... | [
"call.add"
] | 873,588 | 873,587 | u540491484 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long m, long long n) { return n != 0 ? gcd(n, m % n) : m; }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << gcd(a[0], a[1]) << endl;
return 0;
}
vector<int>... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long m, long long n) { return n != 0 ? gcd(n, m % n) : m; }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
vector<int>... | [
"identifier.change",
"call.function.change",
"io.output.change",
"call.add"
] | 873,589 | 873,587 | u540491484 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long gcd(long a, long b) {
long v0 = a, v1 = b, v2 = a % b;
while (v2 != 0) {
v0 = v1;
v1 = v2;
v2 = v0 % v1;
}
return v1;
}
int main() {
int N;
cin >> N;
vector<long> A;
long tmp;
for (int i = 0; i < N; ++i)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long gcd(long a, long b) {
long v0 = a, v1 = b, v2 = a % b;
while (v2 != 0) {
v0 = v1;
v1 = v2;
v2 = v0 % v1;
}
return v1;
}
int main() {
int N;
cin >> N;
vector<long> A;
long tmp;
for (int i = 0; i < N; ++i)... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 873,590 | 873,591 | u860546679 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p = 0;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
sort(data.begin(), data.end());
for (long long i = data.at(0); i > 0; i--) {
int c = 0;
for (int j = 0; j < n; j++) {
if (data.at(j)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p = 0;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
sort(data.begin(), data.end());
for (long long i = data.at(1); i > 0; i--) {
int c = 0;
for (int j = 0; j < n; j++) {
if (data.at(j)... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 873,592 | 873,593 | u634967948 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
// ll mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
// ll mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n)... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,595 | 873,596 | u596311864 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld = long double;
using vin = vector<int>;
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld = long double;
using vin = vector<int>;
... | [
"expression.operation.binary.add"
] | 873,599 | 873,600 | u531461815 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
struct edge {
ll to;
ll cost;
};
using graph = vector<vector<edge>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
struct edge {
ll to;
ll cost;
};
using graph = vector<vector<edge>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"assignment.change"
] | 873,601 | 873,602 | u449123607 | cpp |
p03061 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
// int input........
template <typename T> inline void readline(T &n) {
n = 0;
int f = 1;
register int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; is... | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
// int input........
template <typename T> inline void readline(T &n) {
n = 0;
int f = 1;
register int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; is... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,608 | 873,609 | u526278960 | cpp |
p03061 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
// int input........
template <typename T> inline void readline(T &n) {
n = 0;
int f = 1;
register int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; is... | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
// int input........
template <typename T> inline void readline(T &n) {
n = 0;
int f = 1;
register int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; is... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 873,610 | 873,611 | u526278960 | cpp |
p03061 | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB pus... | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB pus... | [
"identifier.change",
"call.arguments.change"
] | 873,612 | 873,613 | u455371217 | cpp |
p03061 | #include <bits/stdc++.h>
long long gcd(long long a, long long b) {
while (a && b) {
if (a > b)
a = a % b;
else
b = b % a;
}
return a + b;
}
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; i++)
std::cin >> a[i];
std::vector<int> l(n + 1), r(n + ... | #include <bits/stdc++.h>
long long gcd(long long a, long long b) {
while (a && b) {
if (a > b)
a = a % b;
else
b = b % a;
}
return a + b;
}
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; i++)
std::cin >> a[i];
std::vector<int> l(n + 1), r(n + ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,618 | 873,619 | u543584809 | cpp |
p03061 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb... | [
"identifier.change",
"call.arguments.change"
] | 873,620 | 873,621 | u608773191 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
struct SegmentTree {
int n;
vector<int> v;
SegmentTree(int size, int *a) {
n = 1;
while (n < size)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
struct SegmentTree {
int n;
vector<int> v;
SegmentTree(int size, int *a) {
n = 1;
while (n < size)
... | [
"assignment.change"
] | 873,638 | 873,639 | u075775814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
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];
rep(i, n) cin >> a[i];
int l[n], r[n];
l[0] = r[0] = 0;
rep(i,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
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];
rep(i, n) cin >> a[i];
int l[n], r[n];
l[0] = r[n - 1] = 0;
re... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"assignment.change"
] | 873,640 | 873,641 | u075775814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int INF = 1001001001;
ll gcd(ll a, ll b) {
if (a == INF)
return b;
if (b == INF)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int INF = 1001001001;
ll gcd(ll a, ll b) {
if (a == INF)
return b;
if (b == INF)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin... | [
"variable_declaration.type.change"
] | 873,642 | 873,643 | u075775814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int INF = 1001001001;
ll gcd(ll a, ll b) {
if (a == INF)
return b;
if (b == INF)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int INF = 1001001001;
ll gcd(ll a, ll b) {
if (a == INF)
return b;
if (b == INF)
return a;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 873,644 | 873,643 | u075775814 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.