problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
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) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> l(n), r(n);
l[0] = a[0];
r[0] = a[n - 1];
rep(i, n) {
l[i + 1] = __gcd(l[i], a[i + 1]);
r[i + 1] = __gcd(r[i], a[(n - 1) - (i + 1)]);
}
vector<ll> ans(n);
ans[0] = r[n - 2];
ans[n - 1] = l[n - 2];
for (int i = 1; i < n - 1; ++i) {
ans[i] = __gcd(l[i - 1], r[n - 3 - (i - 1)]);
}
ll ret = 0;
rep(i, n) { ret = max(ret, ans[i]); }
cout << ret << endl;
}
| #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) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> l(n + 1), r(n + 1);
l[0] = a[0];
r[0] = a[n - 1];
rep(i, n) {
l[i + 1] = __gcd(l[i], a[i + 1]);
r[i + 1] = __gcd(r[i], a[(n - 1) - (i + 1)]);
}
vector<ll> ans(n);
ans[0] = r[n - 2];
ans[n - 1] = l[n - 2];
for (int i = 1; i < n - 1; ++i) {
ans[i] = __gcd(l[i - 1], r[n - 3 - (i - 1)]);
}
ll ret = 0;
rep(i, n) { ret = max(ret, ans[i]); }
cout << ret << endl;
}
| [
"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...);
}
//------------------------- Libraries -------------------------//
template <class Monoid> struct SegTree {
using Func = function<Monoid(Monoid, Monoid)>;
const Func F;
const Monoid UNITY;
int SIZE_R;
vector<Monoid> dat;
SegTree(int n, const Func f, const Monoid &unity) : F(f), UNITY(unity) {
init(n);
}
void init(int n) {
SIZE_R = 1;
while (SIZE_R < n)
SIZE_R *= 2;
dat.assign(SIZE_R * 2, UNITY);
}
/* set, a is 0-indexed */
void set(int a, const Monoid &v) { dat[a + SIZE_R] = v; }
void build() {
for (int k = SIZE_R - 1; k > 0; --k)
dat[k] = F(dat[k * 2], dat[k * 2 + 1]);
}
/* update a, a is 0-indexed */
void update(int a, const Monoid &v) {
int k = a + SIZE_R;
dat[k] = v;
while (k >>= 1)
dat[k] = F(dat[k * 2], dat[k * 2 + 1]);
}
/* get [a, b), a and b are 0-indexed */
Monoid get(int a, int b) {
Monoid vleft = UNITY, vright = UNITY;
for (int left = a + SIZE_R, right = b + SIZE_R; left < right;
left >>= 1, right >>= 1) {
if (left & 1)
vleft = F(vleft, dat[left++]);
if (right & 1)
vright = F(dat[--right], vright);
}
return F(vleft, vright);
}
inline Monoid operator[](int a) { return dat[a + SIZE_R]; }
/* debug */
void print() {
for (int i = 0; i < SIZE_R; ++i) {
cout << (*this)[i];
if (i != SIZE_R - 1)
cout << ",";
}
cout << endl;
}
};
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
//--------------------------- Solve ---------------------------//
void solve() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
auto f = [](int a, int b) { return gcd(a, b); };
SegTree<int> seg(N, f, A[N - 1]);
for (int i = 0; i < N; i++) {
seg.set(i, A[i]);
}
seg.build();
int ans = 1;
for (int i = 0; i < N; i++) {
int tmp = gcd(seg.get(0, i), seg.get(i + 1, N));
ans = max(ans, tmp);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
solve();
return 0;
} | //#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...);
}
//------------------------- Libraries -------------------------//
template <class Monoid> struct SegTree {
using Func = function<Monoid(Monoid, Monoid)>;
const Func F;
const Monoid UNITY;
int SIZE_R;
vector<Monoid> dat;
SegTree(int n, const Func f, const Monoid &unity) : F(f), UNITY(unity) {
init(n);
}
void init(int n) {
SIZE_R = 1;
while (SIZE_R < n)
SIZE_R *= 2;
dat.assign(SIZE_R * 2, UNITY);
}
/* set, a is 0-indexed */
void set(int a, const Monoid &v) { dat[a + SIZE_R] = v; }
void build() {
for (int k = SIZE_R - 1; k > 0; --k)
dat[k] = F(dat[k * 2], dat[k * 2 + 1]);
}
/* update a, a is 0-indexed */
void update(int a, const Monoid &v) {
int k = a + SIZE_R;
dat[k] = v;
while (k >>= 1)
dat[k] = F(dat[k * 2], dat[k * 2 + 1]);
}
/* get [a, b), a and b are 0-indexed */
Monoid get(int a, int b) {
Monoid vleft = UNITY, vright = UNITY;
for (int left = a + SIZE_R, right = b + SIZE_R; left < right;
left >>= 1, right >>= 1) {
if (left & 1)
vleft = F(vleft, dat[left++]);
if (right & 1)
vright = F(dat[--right], vright);
}
return F(vleft, vright);
}
inline Monoid operator[](int a) { return dat[a + SIZE_R]; }
/* debug */
void print() {
for (int i = 0; i < SIZE_R; ++i) {
cout << (*this)[i];
if (i != SIZE_R - 1)
cout << ",";
}
cout << endl;
}
};
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
//--------------------------- Solve ---------------------------//
void solve() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
auto f = [](int a, int b) { return gcd(a, b); };
SegTree<int> seg(N, f, 0);
for (int i = 0; i < N; i++) {
seg.set(i, A[i]);
}
seg.build();
int ans = 1;
for (int i = 0; i < N; i++) {
int tmp = gcd(seg.get(0, i), seg.get(i + 1, N));
ans = max(ans, tmp);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
solve();
return 0;
} | [] | 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);
}
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
vector<ll> left(N), right(N);
left[0] = A[0], right[0] = A[N - 1];
rep(i, N - 1) { left[i + 1] = GCD(A[i + 1], left[i]); }
for (int i = N; i > 0; i--) {
right[i - 1] = GCD(A[i - 1], right[i]);
}
ll res = 0;
res = max(right[1], left[N - 2]);
for (int i = 1; i < N - 1; i++) {
res = max(res, GCD(left[i - 1], right[i + 1]));
}
cout << res << endl;
} | #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);
}
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
vector<ll> left(N), right(N);
left[0] = A[0], right[N - 1] = A[N - 1];
rep(i, N - 1) { left[i + 1] = GCD(A[i + 1], left[i]); }
for (int i = N - 1; i > 0; i--) {
right[i - 1] = GCD(A[i - 1], right[i]);
}
ll res = 0;
res = max(right[1], left[N - 2]);
for (int i = 1; i < N - 1; i++) {
res = max(res, GCD(left[i - 1], right[i + 1]));
}
cout << res << endl;
} | [
"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>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>>
spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint; //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; //大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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; } //最小公倍数
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
//-----------------------------------------
vector<long long> factor_array(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) {
res.push_back(n / i);
}
}
}
sort(res.begin(), res.end());
return res;
}
//-----------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::chrono::system_clock::time_point start, end;
start = std::chrono::system_clock::now();
ll n;
cin >> n;
vll a(n);
REP(i, n) { cin >> a[i]; }
vll k = factor_array(a[0]);
vll g = factor_array(a[1]);
REP(i, SZ(g)) { k.PB(g[i]); }
sort(ALL(k));
ll ans = -1;
ll m = SZ(k);
REP(i, m) {
// cout << k[i] <<endl;
ll tmp = 0;
REP(j, n) {
if (a[j] % k[m - 1 - i] == 0) {
tmp++;
}
}
if (tmp >= n - 1) {
cout << k[i];
return 0;
}
}
end = std::chrono::system_clock::now();
auto elapsed =
std::chrono::duration_cast<std::chrono::milliseconds>(end - start)
.count();
// std::cout << elapsed <<"ms"<< std::endl;
return 0;
}
| #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>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<int, vector<int>, greater<int>>
spqint; //小さい順に取り出し
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; //小さい順に取り出し
typedef priority_queue<int, vector<int>, less<int>> bpqint; //大きい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; //大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); i++)
#define FI first
#define SE second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define TS to_string
#define BS binary_search
#define LB lower_bound
#define UB upper_bound
#define NP next_permutation
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) (ll) x.size()
#define SP(x) setprecision((ll)x)
int INF = 1e9;
int NIL = -1;
ll MOD = 1000000007;
ll LINF = 1e18;
double EPS = 1e-9;
double PI = M_PI;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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; } //最小公倍数
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
//-----------------------------------------
vector<long long> factor_array(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) {
res.push_back(n / i);
}
}
}
sort(res.begin(), res.end());
return res;
}
//-----------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::chrono::system_clock::time_point start, end;
start = std::chrono::system_clock::now();
ll n;
cin >> n;
vll a(n);
REP(i, n) { cin >> a[i]; }
vll k = factor_array(a[0]);
vll g = factor_array(a[1]);
REP(i, SZ(g)) { k.PB(g[i]); }
sort(ALL(k));
ll ans = -1;
ll m = SZ(k);
REP(i, m) {
// cout << k[i] <<endl;
ll tmp = 0;
REP(j, n) {
if (a[j] % k[m - 1 - i] == 0) {
tmp++;
}
}
if (tmp >= n - 1) {
cout << k[m - 1 - i];
return 0;
}
}
end = std::chrono::system_clock::now();
auto elapsed =
std::chrono::duration_cast<std::chrono::milliseconds>(end - start)
.count();
// std::cout << elapsed <<"ms"<< std::endl;
return 0;
}
| [
"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], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int res = 0;
res = max(r[n - 2], l[1]);
for (int i = 1; i < n - 1; i++) {
res = max(res, __gcd(l[i - 1], r[i + 1]));
}
cout << res << endl;
return 0;
} | #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], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int res = 0;
res = max(l[n - 2], r[1]);
for (int i = 1; i < n - 1; i++) {
res = max(res, __gcd(l[i - 1], r[i + 1]));
}
cout << res << endl;
return 0;
} | [
"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++) {
b[i] = __gcd(b[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; i--) {
c[i] = __gcd(c[i + 1], a[i]);
}
// rep(i, n) cerr << b[i] <<" ";cerr << endl;
// rep(i, n) cerr << c[i] << " "; cerr << endl;
int res = 0;
for (int i = 1; i < n - 1; i++) {
int tmp = __gcd(b[i - 1], c[i + 1]);
res = max(tmp, res);
}
res = max(b[1], res);
res = max(c[n - 2], res);
cout << res << endl;
return 0;
}
| //デバッグ消し忘れ再提出
#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++) {
b[i] = __gcd(b[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; i--) {
c[i] = __gcd(c[i + 1], a[i]);
}
// rep(i, n) cerr << b[i] <<" ";cerr << endl;
// rep(i, n) cerr << c[i] << " "; cerr << endl;
int res = 0;
for (int i = 1; i < n - 1; i++) {
int tmp = __gcd(b[i - 1], c[i + 1]);
res = max(tmp, res);
}
res = max(b[n - 2], res);
res = max(c[1], res);
cout << res << endl;
return 0;
}
| [
"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_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
const long long MOD = 1e9 + 7;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> v(n), a(n + 1), b(n + 1);
rep(i, 0, n) cin >> v[i];
a[0] = 0, b[n] = 0;
a[1] = v[0], b[n - 1] = v[n - 1];
rep(i, 0, n - 1) {
a[i + 2] = __gcd(a[i + 1], v[i + 1]);
b[n - 2 - i] = __gcd(b[n - 1 - i], v[n - 1 - i - 1]);
}
// rep(i, 0, n + 1) cout << a[i] << " ";
// cout << endl;
// rep(i, 0, n + 1) cout << b[i] << " ";
ll ans = 0;
rep(i, 0, n - 1) {
if (a[i] == 0)
ans = max(ans, b[i + 1]);
if (b[i + 1] == 0)
ans = max(ans, a[i]);
else
ans = max(ans, __gcd(a[i], b[i + 1]));
}
cout << ans << endl;
}
| #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_set>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
const long long MOD = 1e9 + 7;
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> v(n), a(n + 1), b(n + 1);
rep(i, 0, n) cin >> v[i];
a[0] = 0, b[n] = 0;
a[1] = v[0], b[n - 1] = v[n - 1];
rep(i, 0, n - 1) {
a[i + 2] = __gcd(a[i + 1], v[i + 1]);
b[n - 2 - i] = __gcd(b[n - 1 - i], v[n - 1 - i - 1]);
}
// rep(i, 0, n + 1) cout << a[i] << " ";
// cout << endl;
// rep(i, 0, n + 1) cout << b[i] << " ";
ll ans = 0;
rep(i, 0, n + 1) {
if (a[i] == 0)
ans = max(ans, b[i + 1]);
else if (b[i + 1] == 0)
ans = max(ans, a[i]);
else
ans = max(ans, __gcd(a[i], b[i + 1]));
}
cout << ans << endl;
}
| [
"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 <iostream> // cout, endl, cin
#include <limits> //setprecision
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <utility> // pair, make_pair
#include <vector> // vector
//#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
//#include <unordered_set> //unordered_set
#include <bitset> // bitset
#include <cmath> //abs,,,
#include <deque> // deque
#include <math.h> //pow,,,
#include <stack> // stack
#define endl "\n";
// It is so troublesome that I include bits/stdc++.h !
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF = 100100100;
const long long MOD = 1000000007;
typedef pair<int, int> P;
// Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M) {
if (M == 0)
return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
//最下位ビット(*N)が1の時は単独でNをかける
if (M & 1)
res = (res * N) % MOD;
return res %= MOD;
}
int gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
cin >> N;
vector<int> retu(N);
for (int i = 0; i < N; i++)
cin >> retu.at(i);
vector<int> leftGCD(N + 1), rightGCD(N + 1);
int LEFTgcd = 0;
int RIGHTgcd = 0;
leftGCD.at(0) = 0;
rightGCD.at(N) = 0;
//左から1個ずつ試すが、左からと右からの累積gcdをとる
//左からLEFTgcdを増やしていく
for (int i = 1; i < N; i++) {
LEFTgcd = gcd(LEFTgcd, retu.at(i - 1));
leftGCD.at(i) = LEFTgcd;
}
//右からRIGHTgcdを増やしていく
for (int i = N - 1; i >= 0; i--) {
RIGHTgcd = gcd(RIGHTgcd, retu.at(i));
rightGCD.at(i) = RIGHTgcd;
}
int ans = 1;
// leftGCD.at(i)とrightGCD.at(i+2)のgcdの最大値が答え
/*for(int A : leftGCD) cout << A << " ";
cout << endl;
for(int B : rightGCD) cout << B << " ";
cout << endl;*/
for (int i = 0; i < N - 1; i++) {
ans = max(ans, gcd(leftGCD.at(i), rightGCD.at(i + 1)));
}
cout << ans << endl;
}
| /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* 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 <iostream> // cout, endl, cin
#include <limits> //setprecision
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <utility> // pair, make_pair
#include <vector> // vector
//#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
//#include <unordered_set> //unordered_set
#include <bitset> // bitset
#include <cmath> //abs,,,
#include <deque> // deque
#include <math.h> //pow,,,
#include <stack> // stack
#define endl "\n";
// It is so troublesome that I include bits/stdc++.h !
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF = 100100100;
const long long MOD = 1000000007;
typedef pair<int, int> P;
// Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M) {
if (M == 0)
return 1;
long long res = mod_pow((N * N) % MOD, M / 2);
//最下位ビット(*N)が1の時は単独でNをかける
if (M & 1)
res = (res * N) % MOD;
return res %= MOD;
}
int gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
cin >> N;
vector<int> retu(N);
for (int i = 0; i < N; i++)
cin >> retu.at(i);
vector<int> leftGCD(N + 1), rightGCD(N + 1);
int LEFTgcd = 0;
int RIGHTgcd = 0;
leftGCD.at(0) = 0;
rightGCD.at(N) = 0;
//左から1個ずつ試すが、左からと右からの累積gcdをとる
//左からLEFTgcdを増やしていく
for (int i = 1; i < N; i++) {
LEFTgcd = gcd(LEFTgcd, retu.at(i - 1));
leftGCD.at(i) = LEFTgcd;
}
//右からRIGHTgcdを増やしていく
for (int i = N - 1; i >= 0; i--) {
RIGHTgcd = gcd(RIGHTgcd, retu.at(i));
rightGCD.at(i) = RIGHTgcd;
}
int ans = 1;
// leftGCD.at(i)とrightGCD.at(i+2)のgcdの最大値が答え
/*for(int A : leftGCD) cout << A << " ";
cout << endl;
for(int B : rightGCD) cout << B << " ";
cout << endl;*/
for (int i = 0; i < N; i++) {
ans = max(ans, gcd(leftGCD.at(i), rightGCD.at(i + 1)));
}
cout << ans << endl;
}
| [
"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::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
ll n, x;
cin >> n;
vector<ll> v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> v[i];
}
vector<ll> f(n + 1, 0), l(n + 2, 0);
l[n + 1] = 0;
for (ll i = 1; i <= n; i++) {
f[i] = gcd(f[i - 1], v[i]);
}
for (ll i = n; i >= 1; i--) {
l[i] = gcd(l[i + 1], v[i]);
}
ll mn = 0;
for (ll i = 1; i < n; i++) {
mn = max(mn, gcd(f[i - 1], l[i + 1]));
}
cout << mn << endl;
}
| #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::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
ll n, x;
cin >> n;
vector<ll> v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> v[i];
}
vector<ll> f(n + 1, 0), l(n + 2, 0);
l[n + 1] = 0;
for (ll i = 1; i <= n; i++) {
f[i] = gcd(f[i - 1], v[i]);
}
for (ll i = n; i >= 1; i--) {
l[i] = gcd(l[i + 1], v[i]);
}
ll mn = 0;
for (ll i = 1; i <= n; i++) {
mn = max(mn, gcd(f[i - 1], l[i + 1]));
}
cout << mn << endl;
}
| [
"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::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
ll n, x;
cin >> n;
vector<ll> v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> v[i];
}
vector<ll> f(n + 1), l(n + 2);
l[n + 1] = 0;
for (ll i = 1; i <= n; i++) {
f[i] = gcd(f[i - 1], v[i]);
}
for (ll i = n; i >= 1; i--) {
l[i] = gcd(l[i + 1], v[i]);
}
ll mn = 0;
for (ll i = 1; i < n; i++) {
mn = max(mn, gcd(f[i - 1], l[i + 1]));
}
cout << mn << endl;
}
| #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::sync_with_stdio(false); \
cin.tie(NULL);
int main() {
ll n, x;
cin >> n;
vector<ll> v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> v[i];
}
vector<ll> f(n + 1, 0), l(n + 2, 0);
l[n + 1] = 0;
for (ll i = 1; i <= n; i++) {
f[i] = gcd(f[i - 1], v[i]);
}
for (ll i = n; i >= 1; i--) {
l[i] = gcd(l[i + 1], v[i]);
}
ll mn = 0;
for (ll i = 1; i <= n; i++) {
mn = max(mn, gcd(f[i - 1], l[i + 1]));
}
cout << mn << endl;
}
| [
"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
const ll MOD2 = 998244353;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<ll> F(N), B(N);
F[0] = A[0];
B[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
F[i] = __gcd(A[i], F[i - 1]);
}
for (int j = N - 2; j >= 0; j--) {
B[j] = __gcd(A[j], B[j + 1]);
}
ll ans;
ans = max(F[N - 2], B[1]);
for (int i = 1; i < N - 1; i++) {
ans = max(ans, __gcd(F[N - i - 2], B[i + 1]));
}
printf("%lld\n", ans);
}
| #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
const ll MOD2 = 998244353;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<ll> F(N), B(N);
F[0] = A[0];
B[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
F[i] = __gcd(A[i], F[i - 1]);
}
for (int j = N - 2; j >= 0; j--) {
B[j] = __gcd(A[j], B[j + 1]);
}
ll ans;
ans = max(F[N - 2], B[1]);
for (int i = 1; i < N - 1; i++) {
ans = max(ans, __gcd(F[N - i - 2], B[N - i]));
}
printf("%lld\n", ans);
}
| [
"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_with_stdio(false);
cout << fixed << setprecision(15);
}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using pll = pair<ll, ll>;
using mll = map<ll, ll>;
#define EACH(x, v) for (auto &x : v)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define REFOR(i, a, b) for (ll i = (ll)b - 1; i >= (ll)a; i--)
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REREP(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
const ll INF = 1LL << 60;
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x <= b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
template <typename T> void in1(T &s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void in2(T &s, T &t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void in3(T &s, T &t, T &u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void in4(T &s, T &t, T &u, T &v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void in5(T &s, T &t, T &u, T &v, T &w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
template <typename T> void outv(T s) {
REP(i, s.size()) { cout << s[i] << " "; }
cout << endl;
}
template <typename T> void out1(T s) {
REP(i, s.size()) { out(s[i]); }
}
template <typename T> void out2(T s, T t) {
REP(i, s.size()) { out(s[i], t[i]); }
}
template <typename T> void out3(T s, T t, T u) {
REP(i, s.size()) { out(s[i], t[i], u[i]); }
}
template <typename T> void out4(T s, T t, T u, T v) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i]); }
}
template <typename T> void out5(T s, T t, T u, T v, T w) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i], w[i]); }
}
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T> T allSum(vector<T> a) {
T ans = T();
EACH(it, a) ans += it;
return ans;
}
ll ceilDiv(ll a, ll b) { return (a + b - 1) / b; }
ld dist(pair<ld, ld> a, pair<ld, ld> b) {
return sqrt(abs(a.fi - b.fi) * abs(a.fi - b.fi) +
abs(a.se - b.se) * abs(a.se - b.se));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
class UnionFind {
public:
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> siz; // siz[i]:iのサイズ (例) siz[3] = 2 : 3のサイズが2
UnionFind(ll N) : par(N), siz(N, 1LL) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool unite(ll x, ll y) { // xとyの木を併合
x = root(x); // xの根をrx
y = root(y); // yの根をry
if (x == y)
return false; // xとyの根が同じ(=同じ木にある)時はそのまま
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] =
x; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
return true;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
class Dag {
public:
vvl g;
vl inCnt;
vl sorted;
bool sortedF = false;
Dag(ll N) : g(N), inCnt(N) {}
void input(ll x, ll y) {
g[x].pb(y);
inCnt[y]++;
}
bool tpSort() {
vl tmp = inCnt;
deque<ll> dq;
vl ans;
REP(i, g.size()) if (tmp[i] == 0) dq.pb(i);
while (dq.size() != 0) {
ll v = dq.front();
dq.pop_front();
ans.pb(v);
EACH(it, g[v]) {
tmp[it]--;
if (tmp[it] == 0)
dq.pb(it);
}
}
sorted.swap(ans);
sortedF = true;
return sorted.size() == g.size();
}
ll longest() {
if (sortedF == false)
tpSort();
vl dp(g.size(), 0);
ll res = 0;
EACH(it1, sorted) {
EACH(it2, g[it1]) { chmax(dp[it2], dp[it1] + 1); }
chmax(res, dp[it1]);
}
return res;
}
};
int main() {
init();
inl(n);
vl a(n);
in1(a);
vl l(n), r(n);
l[0] = a[0];
FOR(i, 1, n) { l[i] = gcd(l[i - 1], a[i]); }
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = gcd(r[i + 1], a[i]);
}
vl ans(n);
ans[0] = r[1];
ans[n - 1] = r[n - 2];
FOR(i, 1, n - 1) { ans[i] = gcd(l[i - 1], r[i + 1]); }
ll max = 0;
REP(i, n) { chmax(max, ans[i]); }
out(max);
return 0;
} | /*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_with_stdio(false);
cout << fixed << setprecision(15);
}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using pll = pair<ll, ll>;
using mll = map<ll, ll>;
#define EACH(x, v) for (auto &x : v)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define REFOR(i, a, b) for (ll i = (ll)b - 1; i >= (ll)a; i--)
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REREP(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
const ll INF = 1LL << 60;
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x <= b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
template <typename T> void in1(T &s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void in2(T &s, T &t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void in3(T &s, T &t, T &u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void in4(T &s, T &t, T &u, T &v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void in5(T &s, T &t, T &u, T &v, T &w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
template <typename T> void outv(T s) {
REP(i, s.size()) { cout << s[i] << " "; }
cout << endl;
}
template <typename T> void out1(T s) {
REP(i, s.size()) { out(s[i]); }
}
template <typename T> void out2(T s, T t) {
REP(i, s.size()) { out(s[i], t[i]); }
}
template <typename T> void out3(T s, T t, T u) {
REP(i, s.size()) { out(s[i], t[i], u[i]); }
}
template <typename T> void out4(T s, T t, T u, T v) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i]); }
}
template <typename T> void out5(T s, T t, T u, T v, T w) {
REP(i, s.size()) { out(s[i], t[i], u[i], v[i], w[i]); }
}
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T> T allSum(vector<T> a) {
T ans = T();
EACH(it, a) ans += it;
return ans;
}
ll ceilDiv(ll a, ll b) { return (a + b - 1) / b; }
ld dist(pair<ld, ld> a, pair<ld, ld> b) {
return sqrt(abs(a.fi - b.fi) * abs(a.fi - b.fi) +
abs(a.se - b.se) * abs(a.se - b.se));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
class UnionFind {
public:
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> siz; // siz[i]:iのサイズ (例) siz[3] = 2 : 3のサイズが2
UnionFind(ll N) : par(N), siz(N, 1LL) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool unite(ll x, ll y) { // xとyの木を併合
x = root(x); // xの根をrx
y = root(y); // yの根をry
if (x == y)
return false; // xとyの根が同じ(=同じ木にある)時はそのまま
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] =
x; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
return true;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
class Dag {
public:
vvl g;
vl inCnt;
vl sorted;
bool sortedF = false;
Dag(ll N) : g(N), inCnt(N) {}
void input(ll x, ll y) {
g[x].pb(y);
inCnt[y]++;
}
bool tpSort() {
vl tmp = inCnt;
deque<ll> dq;
vl ans;
REP(i, g.size()) if (tmp[i] == 0) dq.pb(i);
while (dq.size() != 0) {
ll v = dq.front();
dq.pop_front();
ans.pb(v);
EACH(it, g[v]) {
tmp[it]--;
if (tmp[it] == 0)
dq.pb(it);
}
}
sorted.swap(ans);
sortedF = true;
return sorted.size() == g.size();
}
ll longest() {
if (sortedF == false)
tpSort();
vl dp(g.size(), 0);
ll res = 0;
EACH(it1, sorted) {
EACH(it2, g[it1]) { chmax(dp[it2], dp[it1] + 1); }
chmax(res, dp[it1]);
}
return res;
}
};
int main() {
init();
inl(n);
vl a(n);
in1(a);
vl l(n), r(n);
l[0] = a[0];
FOR(i, 1, n) { l[i] = gcd(l[i - 1], a[i]); }
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = gcd(r[i + 1], a[i]);
}
vl ans(n);
ans[0] = r[1];
ans[n - 1] = l[n - 2];
FOR(i, 1, n - 1) { ans[i] = gcd(l[i - 1], r[i + 1]); }
ll max = 0;
REP(i, n) { chmax(max, ans[i]); }
out(max);
return 0;
} | [
"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;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
int gcd(int a, int b) {
if (b > a)
return gcd(b, a);
else if (b == 0)
return a;
else
return gcd(b, a % b);
}
int G1[100010], G2[100010];
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[100100];
rep(i, N) cin >> A[i];
G1[0] = A[0];
rep(i, N - 1) {
G1[i + 1] = gcd(G1[i], A[i + 1]);
// cout << G1[i] << " " << A[i + 1] << "->" << gcd(G1[i], A[i + 1]) << endl;
}
G2[N - 1] = A[N - 1];
RREP(i, N - 2, 0) { G2[i] = gcd(G2[i + 1], A[i]); }
int ans = G2[1];
// rep(i, N) cout << G1[i] << " " << G2[i] << endl;
rep(i, N - 2) { ans = max(ans, gcd(G1[i], G2[i + 2])); }
ans = max(ans, G1[N - 1]);
cout << ans << endl;
return 0;
}
| #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;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
int gcd(int a, int b) {
if (b > a)
return gcd(b, a);
else if (b == 0)
return a;
else
return gcd(b, a % b);
}
int G1[100010], G2[100010];
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[100100];
rep(i, N) cin >> A[i];
G1[0] = A[0];
rep(i, N - 1) {
G1[i + 1] = gcd(G1[i], A[i + 1]);
// cout << G1[i] << " " << A[i + 1] << "->" << gcd(G1[i], A[i + 1]) << endl;
}
G2[N - 1] = A[N - 1];
RREP(i, N - 2, 0) { G2[i] = gcd(G2[i + 1], A[i]); }
int ans = G2[1];
// rep(i, N) cout << G1[i] << " " << G2[i] << endl;
rep(i, N - 2) { ans = max(ans, gcd(G1[i], G2[i + 2])); }
ans = max(ans, G1[N - 2]);
cout << ans << endl;
return 0;
}
| [
"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 >> n;
vector<int> a(n + 2, 0), l(n + 2, 0), r(n + 2, 0);
rep2(i, 1, n + 1) cin >> a[i];
l[1] = a[1];
rep2(i, 2, n + 1) { l[i] = __gcd(l[i - 1], a[i]); }
r[n] = a[n];
for (int i = n - 1; i > 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int ans = 0;
rep2(i, 1, n) { ans = max(ans, __gcd(l[i - 1], r[i + 1])); }
cout << ans << endl;
}
| #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 >> n;
vector<int> a(n + 2, 0), l(n + 2, 0), r(n + 2, 0);
rep2(i, 1, n + 1) cin >> a[i];
l[1] = a[1];
rep2(i, 2, n + 1) { l[i] = __gcd(l[i - 1], a[i]); }
r[n] = a[n];
for (int i = n - 1; i > 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int ans = 0;
rep2(i, 1, n + 1) { ans = max(ans, __gcd(l[i - 1], r[i + 1])); }
cout << ans << endl;
}
| [
"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 >> n;
vector<int> a(n + 2, 0), l(n + 2, 0), r(n + 2, 0);
rep2(i, 1, n + 1) cin >> a[i];
l[1] = a[1];
rep2(i, 2, n + 1) { l[i] = __gcd(l[i - 1], a[i]); }
r[n] = a[n];
for (int i = n - 1; i > 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int ans = 0;
rep(i, n) { ans = max(ans, __gcd(l[i - 1], r[i + 1])); }
cout << ans << endl;
}
| #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 >> n;
vector<int> a(n + 2, 0), l(n + 2, 0), r(n + 2, 0);
rep2(i, 1, n + 1) cin >> a[i];
l[1] = a[1];
rep2(i, 2, n + 1) { l[i] = __gcd(l[i - 1], a[i]); }
r[n] = a[n];
for (int i = n - 1; i > 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int ans = 0;
rep2(i, 1, n + 1) { ans = max(ans, __gcd(l[i - 1], r[i + 1])); }
cout << ans << endl;
}
| [
"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];
for (int k = n - 1; k >= 1; k--) {
c[k] = __gcd(c[k + 1], a[k]);
}
int answer = 0;
for (int m = 0; m < n; m++) {
if (__gcd(b[m - 1], c[m + 1]) > answer) {
answer = __gcd(b[m - 1], c[m + 1]);
}
}
cout << answer << endl;
}
| #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];
for (int k = n - 1; k > 0; k--) {
c[k] = __gcd(c[k + 1], a[k]);
}
int answer = 0;
for (int m = 1; m <= n; m++) {
if (__gcd(b[m - 1], c[m + 1]) > answer) {
answer = __gcd(b[m - 1], c[m + 1]);
}
}
cout << answer << endl;
}
| [
"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 p = 510200;
void Fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n;
int a[100005];
vector<int> Div;
signed main() {
Fastio();
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = a[2];
for (int i = 3; i <= n; i++) {
ans = __gcd(ans, a[i]);
}
for (int i = 1; i <= sqrt(a[i]); i++) {
if (a[1] % i == 0) {
Div.eb(i);
Div.eb(a[1] / i);
}
}
for (auto x : Div) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] % x == 0) {
cnt++;
}
}
if (cnt >= n - 1) {
ans = max(ans, x);
}
}
cout << ans;
} | #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 p = 510200;
void Fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n;
int a[100005];
vector<int> Div;
signed main() {
Fastio();
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = a[2];
for (int i = 3; i <= n; i++) {
ans = __gcd(ans, a[i]);
}
for (int i = 1; i <= sqrt(a[1]); i++) {
if (a[1] % i == 0) {
Div.eb(i);
Div.eb(a[1] / i);
}
}
for (auto x : Div) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] % x == 0) {
cnt++;
}
}
if (cnt >= n - 1) {
ans = max(ans, x);
}
}
cout << ans;
} | [
"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 = 0; i < N; i++) {
cin >> A[i];
}
vector<int> stacked_GCD_from_Left(N, 0);
vector<int> stacked_GCD_from_Right(N, 0);
for (int i = 0; i < N; i++) {
if (i == 0) {
stacked_GCD_from_Left[i] = A[i];
} else {
stacked_GCD_from_Left[i] = GCD(stacked_GCD_from_Left[i - 1], A[i]);
}
}
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
stacked_GCD_from_Right[i] = A[i];
} else {
stacked_GCD_from_Right[i] = GCD(stacked_GCD_from_Left[i + 1], A[i]);
}
}
vector<int> one_changed_GCD(N, 0);
for (int i = 0; i < N; i++) {
if (i == 0) {
one_changed_GCD[i] = stacked_GCD_from_Right[i + 1];
} else if (i == N - 1) {
one_changed_GCD[i] = stacked_GCD_from_Left[i - 1];
} else {
one_changed_GCD[i] =
GCD(stacked_GCD_from_Left[i - 1], stacked_GCD_from_Right[i + 1]);
}
}
std::vector<int>::iterator iter =
std::max_element(one_changed_GCD.begin(), one_changed_GCD.end());
size_t index = std::distance(one_changed_GCD.begin(), iter);
cout << one_changed_GCD[index];
// int GCD_1 = 0;
// int GCD_2;
// for (int i = 0; i < N - 1; i++)
// {
// if (N == 2)
// {
// cout << max(A[0], A[1]);
// return 0;
// }
// GCD_1 = gcd<int, int>(A[0], A[1]);
// GCD_2 = gcd<int, int>(A[1], A[2]);
// }
return 0;
} | #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 = 0; i < N; i++) {
cin >> A[i];
}
vector<int> stacked_GCD_from_Left(N, 0);
vector<int> stacked_GCD_from_Right(N, 0);
for (int i = 0; i < N; i++) {
if (i == 0) {
stacked_GCD_from_Left[i] = A[i];
} else {
stacked_GCD_from_Left[i] = GCD(stacked_GCD_from_Left[i - 1], A[i]);
}
}
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1) {
stacked_GCD_from_Right[i] = A[i];
} else {
stacked_GCD_from_Right[i] = GCD(stacked_GCD_from_Right[i + 1], A[i]);
}
}
vector<int> one_changed_GCD(N, 0);
for (int i = 0; i < N; i++) {
if (i == 0) {
one_changed_GCD[i] = stacked_GCD_from_Right[i + 1];
} else if (i == N - 1) {
one_changed_GCD[i] = stacked_GCD_from_Left[i - 1];
} else {
one_changed_GCD[i] =
GCD(stacked_GCD_from_Left[i - 1], stacked_GCD_from_Right[i + 1]);
}
}
std::vector<int>::iterator iter =
std::max_element(one_changed_GCD.begin(), one_changed_GCD.end());
size_t index = std::distance(one_changed_GCD.begin(), iter);
cout << one_changed_GCD[index];
// int GCD_1 = 0;
// int GCD_2;
// for (int i = 0; i < N - 1; i++)
// {
// if (N == 2)
// {
// cout << max(A[0], A[1]);
// return 0;
// }
// GCD_1 = gcd<int, int>(A[0], A[1]);
// GCD_2 = gcd<int, int>(A[1], A[2]);
// }
return 0;
} | [
"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++) {
if (i == 0) {
l[i] = gcd(a[i], a[i + 1]);
} else
l[i] = gcd(l[i - 1], a[i + 1]);
}
reverse(a, a + n);
for (int i = 0; i < n - 1; i++) {
if (i == 0) {
r[i] = gcd(a[i], a[i + 1]);
} else
r[i] = gcd(r[i - 1], a[i + 1]);
}
reverse(r, r + n - 1);
reverse(a, a + n);
if (n == 2) {
cout << max(a[0], a[1]) << endl;
} else if (n == 3) {
cout << max(gcd(a[0], a[2]), max(r[0], l[1])) << endl;
} else {
int ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0)
ans = max(ans, r[1]);
else if (i == 1)
ans = max(ans, gcd(a[0], r[2]));
else if (i == n - 2)
ans = max(ans, gcd(a[n - 2], l[n - 2]));
else if (i == n - 1)
ans = max(ans, l[n - 2]);
else
ans = max(ans, gcd(l[i - 2], r[i + 1]));
}
cout << ans << endl;
}
return 0;
}
| #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++) {
if (i == 0) {
l[i] = gcd(a[i], a[i + 1]);
} else
l[i] = gcd(l[i - 1], a[i + 1]);
}
reverse(a, a + n);
for (int i = 0; i < n - 1; i++) {
if (i == 0) {
r[i] = gcd(a[i], a[i + 1]);
} else
r[i] = gcd(r[i - 1], a[i + 1]);
}
reverse(r, r + n - 1);
reverse(a, a + n);
if (n == 2) {
cout << max(a[0], a[1]) << endl;
} else if (n == 3) {
cout << max(gcd(a[0], a[2]), max(l[0], r[1])) << endl;
} else {
int ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0)
ans = max(ans, r[1]);
else if (i == 1)
ans = max(ans, gcd(a[0], r[2]));
else if (i == n - 2)
ans = max(ans, gcd(a[n - 1], l[i - 2]));
else if (i == n - 1)
ans = max(ans, l[i - 2]);
else
ans = max(ans, gcd(l[i - 2], r[i + 1]));
}
cout << ans << endl;
}
return 0;
}
| [
"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]までの最大公約数
for (int i = 0; i < N; i++)
cin >> A[i];
L[0] = A[0];
R[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
L[i] = gcd(L[i - 1], A[i]);
R[N - 1 - i] = gcd(R[N - i], A[N - 1 - i]);
}
gcds[0] = L[1];
gcds[N - 1] = R[N - 2];
for (int i = 1; i < N - 1; i++)
gcds[i] = gcd(R[i - 1], L[i + 1]);
for (int i = 0; i < N; i++) {
if (max < gcds[i])
max = gcds[i];
}
cout << max << endl;
return 0;
} | #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]までの最大公約数
for (int i = 0; i < N; i++)
cin >> A[i];
L[0] = A[0];
R[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
L[i] = gcd(L[i - 1], A[i]);
R[N - 1 - i] = gcd(R[N - i], A[N - 1 - i]);
}
gcds[0] = R[1];
gcds[N - 1] = L[N - 2];
for (int i = 1; i < N - 1; i++)
gcds[i] = gcd(L[i - 1], R[i + 1]);
for (int i = 0; i < N; i++) {
if (max < gcds[i])
max = gcds[i];
}
cout << max << endl;
return 0;
} | [
"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;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) { cin >> A[i]; }
vector<ll> G(N + 1), RG(N + 1);
G[0] = A[0];
FOR(i, 1, N) { G[i] = gcd(A[i], G[i - 1]); }
RG[N - 1] = A[N - 1];
REPR(i, N - 2) { RG[i] = gcd(A[i], RG[i + 1]); }
ll ans = max(G[N - 1], RG[1]);
FOR(i, 1, N - 1) { ans = max(ans, gcd(G[i - 1], RG[i + 1])); }
cout << ans << endl;
return 0;
}
| #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;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) { cin >> A[i]; }
vector<ll> G(N + 1), RG(N + 1);
G[0] = A[0];
FOR(i, 1, N) { G[i] = gcd(A[i], G[i - 1]); }
RG[N - 1] = A[N - 1];
REPR(i, N - 2) { RG[i] = gcd(A[i], RG[i + 1]); }
ll ans = max(G[N - 2], RG[1]);
FOR(i, 1, N - 1) { ans = max(ans, gcd(G[i - 1], RG[i + 1])); }
cout << ans << endl;
return 0;
}
| [
"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]); }
// for (int i = 0; i < sum_l.size(); i++) {
// cout << sum_l[i] << endl;
// }
vector<ll> sum_r(N + 1);
// 最後の要素
sum_r[N] = v[N - 1];
rep(i, N) {
sum_r[N - i - 1] += __gcd(sum_r[N - i], v[N - i - 1]);
// printf("i: %d, sum_r[i]: %d v: %d\n", i, sum_r[i], v[N - i - 1]);
}
// for (int i = 0; i < sum_r.size(); i++) {
// // printf("i: %d, sum_r[i]: %d\n", i, sum_r[i]);
// cout << sum_r[i] << endl;
// }
ll ans = 0;
rep(i, N) {
ll tmp = 0;
if (i == 0) {
// 左端の時
tmp = sum_r[i + 1];
} else if (i == N - 1) {
// 右端の時
tmp = sum_l[i];
} else {
ll left_gcd = sum_l[i + 1];
ll right_gcd = sum_r[i + 1];
tmp = __gcd(left_gcd, right_gcd);
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| #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]); }
// for (int i = 0; i < sum_l.size(); i++) {
// cout << sum_l[i] << endl;
// }
vector<ll> sum_r(N + 1);
// 最後の要素
sum_r[N] = v[N - 1];
rep(i, N) {
sum_r[N - i - 1] += __gcd(sum_r[N - i], v[N - i - 1]);
// printf("i: %d, sum_r[i]: %d v: %d\n", i, sum_r[i], v[N - i - 1]);
}
// for (int i = 0; i < sum_r.size(); i++) {
// // printf("i: %d, sum_r[i]: %d\n", i, sum_r[i]);
// cout << sum_r[i] << endl;
// }
ll ans = 0;
rep(i, N) {
ll tmp = 0;
if (i == 0) {
// 左端の時
tmp = sum_r[i + 1];
} else if (i == N - 1) {
// 右端の時
tmp = sum_l[i];
} else {
ll left_gcd = sum_l[i];
ll right_gcd = sum_r[i + 1];
tmp = __gcd(left_gcd, right_gcd);
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| [
"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);
rep(i, n) cin >> v[i];
vector<int> left(n + 1, 0);
vector<int> right(n + 1, 0);
for (int i = 1; i < n; i++) {
left[i] = gcd(left[i - 1], v[i]);
}
for (int i = n - 1; i >= 0; i--) {
right[i] = gcd(right[i + 1], v[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int l = left[i];
int r = right[i + 1];
ans = max(gcd(l, r), ans);
}
cout << ans << endl;
return 0;
} | #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);
rep(i, n) cin >> v[i];
vector<int> left(n + 1, 0);
vector<int> right(n + 1, 0);
for (int i = 0; i < n; i++) {
left[i + 1] = gcd(left[i], v[i]);
}
for (int i = n - 1; i >= 0; i--) {
right[i] = gcd(right[i + 1], v[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int l = left[i];
int r = right[i + 1];
ans = max(gcd(l, r), ans);
}
cout << ans << endl;
return 0;
} | [
"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() {
int n, ma = 0;
vector<int> v, r, l;
cin >> n;
v.resize(n);
l.resize(n);
r.resize(n);
rep(i, n) cin >> v[i];
l[0] = v[0];
rep(i, n - 1) l[i + 1] = igcd(l[i], v[i + 1]);
reverse(all(v));
r[0] = v[0];
rep(i, n - 1) r[i + 1] = igcd(r[i], v[i + 1]);
reverse(all(r));
ma = r[n - 2];
// cout<< r[n-2] <<endl;
ma = max(ma, l[n - 2]);
// cout<< l[n-2] <<endl;
rep(i, n - 2) {
ma = max(ma, igcd(l[i], r[i + 2]));
// cout<< gcd(l[i], r[i+2]) <<endl;
}
cout << ma << endl;
return 0;
} | #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() {
int n, ma = 0;
vector<int> v, r, l;
cin >> n;
v.resize(n);
l.resize(n);
r.resize(n);
/*if(n==2){
cin>> v[0] >> v[1];
cout<< max(v[0], v[1]) <<endl;
return 0;
}*/
rep(i, n) cin >> v[i];
l[0] = v[0];
rep(i, n - 1) l[i + 1] = igcd(l[i], v[i + 1]);
reverse(all(v));
r[0] = v[0];
rep(i, n - 1) r[i + 1] = igcd(r[i], v[i + 1]);
reverse(all(r));
ma = r[1];
// cout<< r[n-2] <<endl;
ma = max(ma, l[n - 2]);
// cout<< l[n-2] <<endl;
rep(i, n - 2) {
ma = max(ma, igcd(l[i], r[i + 2]));
// cout<< gcd(l[i], r[i+2]) <<endl;
}
cout << ma << endl;
return 0;
} | [
"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 - 1) = a.at(n - 1);
for (int i = n - 2; i >= 0; i--) {
c.at(i) = __gcd(c.at(i + 1), a.at(i));
}
int ans{1};
for (int i = 1; i < n - 1; i++) {
ans = max(ans, __gcd(b.at(i - 1), c.at(i + 1)));
}
ans = max(ans, b.at(n - 2));
ans = max(ans, c.at(n - 2));
cout << ans << endl;
}
| #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 - 1) = a.at(n - 1);
for (int i = n - 2; i >= 0; i--) {
c.at(i) = __gcd(c.at(i + 1), a.at(i));
}
int ans{1};
for (int i = 1; i < n - 1; i++) {
ans = max(ans, __gcd(b.at(i - 1), c.at(i + 1)));
}
ans = max(ans, b.at(n - 2));
ans = max(ans, c.at(1));
cout << ans << endl;
} | [
"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 long gcd(vector<long long> &a) {
//ユークリッドの互除法で最大公約数を求める
//多変数の場合
long long x = a[0];
long long y = a[1];
for (long long i = 1; i < (long long)a.size(); i++) {
y = a[i];
if (x < y) {
swap(x, y);
}
while (x % y != 0) {
long long r;
r = x % y;
if (r == 0) {
break;
} else {
x = y;
y = r;
}
}
x = y;
}
return y;
}
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> b(n + 1);
vector<long long> c(n + 1);
b[0] = a[0];
c[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
b[i] = gcd(b[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; i--) {
c[i] = gcd(c[i + 1], a[i]);
}
long long maxx = 0;
;
for (int i = 0; i < n; i++) {
if (n == 2) {
maxx = gcd(a[0], a[1]);
} else if (i == 0) {
maxx = max(maxx, c[1]);
} else if (i == n - 1) {
maxx = max(maxx, b[n - 2]);
} else if (i == 1 && i == n - 2) {
maxx = max(maxx, gcd(a[0], a[2]));
} else if (i == 1) {
maxx = max(maxx, gcd(a[0], c[i + 1]));
} else if (i == n - 2) {
maxx = max(maxx, gcd(b[i - 1], a[n - 1]));
} else {
maxx = max(maxx, gcd(b[i - 1], c[i + 1]));
}
}
cout << maxx << endl;
return 0;
} | #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 long gcd(vector<long long> &a) {
//ユークリッドの互除法で最大公約数を求める
//多変数の場合
long long x = a[0];
long long y = a[1];
for (long long i = 1; i < (long long)a.size(); i++) {
y = a[i];
if (x < y) {
swap(x, y);
}
while (x % y != 0) {
long long r;
r = x % y;
if (r == 0) {
break;
} else {
x = y;
y = r;
}
}
x = y;
}
return y;
}
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> b(n + 1);
vector<long long> c(n + 1);
b[0] = a[0];
c[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
b[i] = gcd(b[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; i--) {
c[i] = gcd(c[i + 1], a[i]);
}
long long maxx = 0;
;
for (int i = 0; i < n; i++) {
if (n == 2) {
maxx = max(a[0], a[1]);
} else if (i == 0) {
maxx = max(maxx, c[1]);
} else if (i == n - 1) {
maxx = max(maxx, b[n - 2]);
} else if (i == 1 && i == n - 2) {
maxx = max(maxx, gcd(a[0], a[2]));
} else if (i == 1) {
maxx = max(maxx, gcd(a[0], c[i + 1]));
} else if (i == n - 2) {
maxx = max(maxx, gcd(b[i - 1], a[n - 1]));
} else {
maxx = max(maxx, gcd(b[i - 1], c[i + 1]));
}
}
cout << maxx << endl;
return 0;
} | [
"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 {
public:
SegmentTree(int size) {
int two = 1;
while (two < size) {
two <<= 1;
}
v_.resize(two * 2 - 1);
}
void Add(int i, int v) {
int index = v_.size() / 2 + i;
while (true) {
v_[index] = v;
if (index == 0)
break;
v = Gcd(v, v_[index + index % 2 == 0 ? -1 : 1]);
index = (index - 1) / 2;
}
}
int Sum(int begin, int end) const {
return sum(begin, end, 0, (v_.size() + 1) / 2, 0);
}
int sum(int begin, int end, int cbegin, int cend, int index) const {
if (begin <= cbegin && cend <= end) {
return v_[index];
}
if (cend <= begin || end <= cbegin) {
return 0;
}
int cmid = (cbegin + cend) / 2;
return Gcd(sum(begin, end, cbegin, cmid, index * 2 + 1),
sum(begin, end, cmid, cend, index * 2 + 2));
}
std::vector<int> v_;
};
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
SegmentTree t(N);
REP(i, N) { t.Add(i, A[i]); }
int ans = 0;
REP(i, N) { ans = max(ans, Gcd(t.Sum(0, i), t.Sum(i + 1, N))); }
cout << ans << endl;
}
| #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 {
public:
SegmentTree(int size) {
int two = 1;
while (two < size) {
two <<= 1;
}
v_.resize(two * 2 - 1);
}
void Add(int i, int v) {
int index = v_.size() / 2 + i;
while (true) {
v_[index] = v;
if (index == 0)
break;
v = Gcd(v, v_[index + (index % 2 == 0 ? -1 : 1)]);
index = (index - 1) / 2;
}
}
int Sum(int begin, int end) const {
return sum(begin, end, 0, (v_.size() + 1) / 2, 0);
}
int sum(int begin, int end, int cbegin, int cend, int index) const {
if (begin <= cbegin && cend <= end) {
return v_[index];
}
if (cend <= begin || end <= cbegin) {
return 0;
}
int cmid = (cbegin + cend) / 2;
return Gcd(sum(begin, end, cbegin, cmid, index * 2 + 1),
sum(begin, end, cmid, cend, index * 2 + 2));
}
std::vector<int> v_;
};
int main() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
SegmentTree t(N);
REP(i, N) { t.Add(i, A[i]); }
int ans = 0;
REP(i, N) { ans = max(ans, Gcd(t.Sum(0, i), t.Sum(i + 1, N))); }
cout << ans << endl;
}
| [
"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>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
using edge = struct {
ll to;
ll cost;
};
using point = struct {
ll x;
ll y;
};
typedef string str;
typedef std::pair<ll, ll> pl;
typedef std::pair<ll, pl> pl3;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
typedef std::vector<point> vxy;
typedef std::vector<pl3> vpl3;
typedef std::priority_queue<ll> pq;
typedef std::priority_queue<ll, vl, greater<ll>>
pql; // priority queue taking from the lower value.
typedef std::vector<edge> gr;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979323846;
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a, b) cout << (a) << " " << (b) << endl
#define prl3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for (auto &(kv) : (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define rsort(a, n) sort(a, a + n, greater<>())
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
cout << fixed << setprecision(digits) << (num) << endl;
#define XOR(a, b) (a) ^ (b)
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#define bin_expression(n, dig) bitset<(dig)>(n)
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
rep(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
class UnionFind {
vl parents, set_size;
public:
UnionFind() {}
UnionFind(ll n) {
parents = set_size = vl(n);
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
x = root_find(x);
y = root_find(y);
if (x == y)
return;
if (set_size[x] < set_size[y]) {
parents[y] = x;
set_size[x] += set_size[y];
} else {
parents[x] = y;
set_size[y] += set_size[x];
}
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
};
/*
class LCA{
public:
ll N, logN;
vl depth, len;
gr tree[200005]; // global declaration later.
vector<vl> parents;
LCA(ll n){
N = n;
logN = 0;
while (N > (1LL << logN)) logN++;
depth = vl(N); len = vl(N);
parents = vector<vl>(logN, vl(N));
init(0, -1, 0, 0);
build();
}
void init(ll source, ll parent, ll d, ll l){
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent) continue;
init(target, source, d + 1, cost + l);
}
}
void build(){
rep(k, logN - 1) rep(n, N){
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0) parents[k + 1][n] = -1;
else parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v){
if (depth[u] > depth[v]) swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v) return u;
revrep(k, logN){
if (parents[k][u] != parents[k][v]){
u = parents[k][u]; v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v){
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
*/
struct BIT {
ll n;
vl dat;
BIT(ll n) : dat(n + 1), n(n){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll sum(ll i) {
ll s = 0;
while (i > 0) {
s += dat[i];
i -= i & -i;
}
return s;
}
ll sum(ll i, ll j) { return sum(j - 1) - sum(i - 1); }
void add(ll i, ll x) {
while (i <= n) {
dat[i] += x;
i += i & -i;
}
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll comb_memo[55][55];
ll pascal_triangle(ll n) {
comb_memo[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb_memo[i][j] += comb_memo[i - 1][j];
if (j > 0)
comb_memo[i][j] += comb_memo[i - 1][j - 1];
}
}
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
(numerator *= ll(n - i)) %= mod;
(denomenator *= modinv(i + 1, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
ll combination_memo(ll n, ll r, ll pre, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = ll(n - r + 1) % mod;
ll denomenator = modinv(r, mod) % mod;
ll val = (numerator * denomenator) % mod;
val *= pre;
return val % mod;
}
ll bin_search(ll key, ll A[], ll left, ll right) {
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end..
// In other words, A[right], not A[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (A[mid] == key)
return mid;
else if (A[mid] > key)
right = mid - 1;
else if (A[mid] < key)
left = mid + 1;
}
return -1;
}
/*
ll bin_search_temp(ll left, ll right, callable judge){
while(right > left){
// when seeking lower bound
ll mid = (right + left) / 2;
if (judge(mid)) right = mid;
else left = mid + 1;
// when seeking upper bound
ll mid = (right + left + 1) / 2;
if (judge(mid)) left = mid;
else right = mid - 1;
}
return right;
}
*/
ll lower_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] >= key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] < key && key <= A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] < key && key <= A[mid])
return mid;
else if (A[mid - 1] >= key)
right = mid - 1;
else if (A[mid] < key)
left = mid;
}
return -1; // all the elements < key
}
ll inf_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] > key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] <= key && key < A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] <= key && key < A[mid])
return mid;
else if (A[mid - 1] > key)
right = mid - 1;
else if (A[mid] <= key)
left = mid;
}
return -1; // all the elements <= key
}
ll upper_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] <= key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] <= key && key < A[right])
return right - 1;
else
return -1;
}
if (A[mid] <= key && key < A[mid + 1])
return mid;
else if (A[mid] > key)
right = mid;
else if (A[mid + 1] <= key)
left = mid + 1;
}
return -1; // all the elements > key
}
ll sup_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] < key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] < key && key <= A[right])
return right - 1;
else
return -1;
}
if (A[mid] < key && key <= A[mid + 1])
return mid;
else if (A[mid] >= key)
right = mid;
else if (A[mid + 1] < key)
left = mid + 1;
}
return -1; // all the elements >= key
}
ll bin_search_vector(ll key, vl v, ll left, ll right) {
// return the index idx where v[idx] = key.
// v[left] is start and v[right] is end..
// In other words, v[right], not v[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (v[mid] == key)
return mid;
else if (v[mid] > key)
right = mid - 1;
else if (v[mid] < key)
left = mid + 1;
}
return -1;
}
ll lower_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] < key <= v[N]
// N == -1 if all the elements < key
return lower_bound(all(v), key) - v.begin();
}
ll inf_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] <= key < v[N] <= key + 1
// N == -1 if all the elements <= key
return lower_bound(all(v), key + 1) - v.begin();
}
ll upper_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key < v[N + 1]
// N == -1 if all the elements > key
return upper_bound(all(v), key) - v.begin() - 1;
}
ll sup_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key - 1 < key <= v[N + 1]
// N == -1 if all the elements >= key
return upper_bound(all(v), key - 1) - v.begin() - 1;
}
ll fact(ll n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll bool_sum(ll a1, ll a2) {
if (a1 == 1 || a2 == 1)
return 1;
return 0;
}
mll prime_decomposition(ll n) {
ll i = 2;
mll table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
ll char_to_idx(char c) {
ll idx = 0;
Forchar(cc, 'a', 'z') {
if (c == cc)
return idx;
else
idx++;
}
}
bool is_cross(ll x1, ll y1, ll x2, ll y2, ll x3, ll y3, ll x4, ll y4) {
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
ll next_combination(ll sub) {
/*
ll n, k; ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
*/
ll x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
/*
const ll N_VERTEX = 310;
ll a, b, t;
ll dist[N_VERTEX][N_VERTEX];
void warshall_floyd(ll n){
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] +
dist[k][j]);
}
int main(void){
in2(n, m);
rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(i, m){
in3(a, b, t);
a--; b--;
dist[a][b] = t;
dist[b][a] = t;
}
warshall_floyd(n);
}
const ll N_VERTEX = 310;
gr graph[N_VERTEX];
ll dist[N_VERTEX], a, b, t, n, m;
void dijkstra(ll start, ll n) {
priority_queue<pl, vector<pl>, greater<pl>> edge_costs;
fill(dist, dist + n, INF);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
pl edge_cost = edge_costs.top();
edge_costs.pop();
ll idx = edge_cost.second;
ll cost = edge_cost.first;
if (dist[idx] < cost) continue;
rep(i, graph[idx].size()){
edge e = graph[idx][i];
if (dist[e.to] > dist[idx] + e.cost){
dist[e.to] = dist[idx] + e.cost;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
int main(void){
in2(n, m);
rep(i, m){
in3(a, b, t);
a--; b--;
G[a].pb({b, t});
G[b].pb({a, t});
}
dijkstra(0, n);
}
# ABC061D
bool bellman_ford(ll start, ll n, ll goal){
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal
!= -1) fill(dist, dist + n, INF); dist[start] = 0; rep(i, n) rep(v, n) rep(k,
graph[v].size()){ edge e = graph[v][k]; if (dist[e.to] > dist[v] + e.cost){
dist[e.to] = dist[v] + e.cost;
if (i == n - 1 && (e.to == goal || goal == -1)) return false;
}
}
return true;
}
*/
/*
# 1. The usage of map pair
map<pl, ll> cnt;
cnt[{i, j}] = 0;
items(kv, cnt){
prl2(kv.first, kv.second);
}
# 2. The usage of next_permutation and combination (factorial search)
ll a[8];
rep(i, 8) a[i] = i;
sort(a, a + 8);
do{
}while(next_permutation(a, a+n));
// here, combination
ll n, r;
ll i1, i2, ..., ir;
For(i1, n - r, n) For(i2, n - r - 1, i1) ... For(ir, n - 2 * r + 1, irr){
process;}
# 3. bit search
ll n;
in1(n);
const ll base = 3;
ll upper = power_normal(base, n);
rep(i, upper){
ll tmp = i;
rep(j, n){
rep(k, base) if (tmp % base == k) prl(k);
tmp /= base;
}
}
# 4. imos method
// used when we would like to count the number which
// shows how many times the numbers between l and r belongs to smt.
// This method is composed of three process.
ll n, m, s[MAX_M], l, r;
in2(n, m);
rep(i, m) s[i] = 0;
// 1st step
rep(i, n){
in3(l, r, c);
l--; r--; // if l starts from 1.
s[l] += c; s[r + 1] -= c;
}
// 2nd step
rep(i, m - 1) s[i + 1] += s[i];
// 3rd step: judgement...
#5. shakutori method (syakutori)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0; ll r = 0;
while (l < n){
r = max(r, l);
if (l == r) r++;
while(r < n && cond) r++;
answer += r - l; l++;
}
prl(answer);
#6. priority queue
pq q;
ll answer = 0;
ll v;
rep(i, n) q.push(a[i]);
rep(i, m){
v = q.top(); q.pop(); // get the top value and dump the value from queue
v /= 2; q.push(v); // add the new value
}
while(!q.empty()){
answer += q.top();
q.pop();
}
#7. The shortest path between the k-th edge and another edge (Tree)
ll depth[MAX_N];
gr tree[MAX_N];
void path(ll source, ll parent, ll all_cost){
depth[source] = all_cost;
items(e, tree[source]){
if (e.to == parent) continue;
dfs(e.to, source, all_cost + e.cost);
}
}
ll n, k, a, b, c;
in2(n, k);
rep(i, n - 1){
in3(a, b, c);
a--; b--;
tree[a].pb({b, c});
tree[b].pb({a, c});
}
k--;
dfs(k, -1, 0);
#10. Visiting Subtree using recurrent function (ABC138D)
gr tree[MAX_N];
ll c[MAX_N];
bool visited[MAX_N];
void dfs(ll source, ll parent, ll val){
visited[source] = true;
c[source] += val;
rep(i, tree[source].size()){
rep(i, m){ll res = n % match[i].e1;}
ll vertex = tree[source][i].to;
if (vertex == parent) continue;
dfs(vertex, source, c[source]);
}
}
#11. bfs ABC146D, ABC007C
1. first create a tree.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
queue<pl> q;
void bfs(ll source, ll parents){
ll n_edge = G[source].size();
if (parents != -1) dist[source] = min(dist[source], dist[parents] + 1);
if (visited[source]) return;
visited[source] = true;
rep(idx, n_edge){
ll target = G[source][idx].to;
if (target == parents) continue;
q.push(mp(target, source));
}
}
q.push(mp(sg.e1, -1));
while(!q.empty()){
pl source = q.front(); q.pop();
bfs(source.e1, source.e2);
}
#12. grid to distance matrix (dx, dy)
ll w, h;
ll pos_to_idx(ll x, ll y){
return y * w + x;
}
pl idx_to_pos(ll idx){
return mp(idx % w, idx / w);
}
int main(void){
in2(h, w);
rep(y, h){
in1(s);
rep(x, w){
if (s[x] == '#') wall[x][y] = true;
else wall[x][y] = false;
}
}
rep(i1, h * w)rep(i2, h * w) dist[i1][i2] = INF * (i1 != i2);
rep(x, w)rep(y, h){
ll idx1 = pos_to_idx(x, y); ll idx2;
if (wall[x][y]) continue;
if (x != 0 && !wall[x - 1][y]){
idx2 = pos_to_idx(x - 1, y);
// if warshall floyd
dist[idx1][idx2] = 1;
// if dijkstra
// graph[idx1].pb({idx2, 1});
}
if (x != w - 1 && !wall[x + 1][y]){
idx2 = pos_to_idx(x + 1, y);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != 0 && !wall[x][y - 1]){
idx2 = pos_to_idx(x, y - 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != h - 1 && !wall[x][y + 1]){
idx2 = pos_to_idx(x, y + 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
}
}
*/
/*
# the operators regarding bit
& (AND), | (OR), ^ (XOR)
- (REVERSE), >> (SMALLER SHIFT)
<< (BIGGER SHIFT)
x1: 0000 0001 0010 0101 0110 0111
x2: xxxx 0001 0011 0100 0101 1000
x1 & x2: 0000 0001 0010 0100 0100 0000
x: 1001 1010 1100 1011 1101 1111
x & - x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
x << y is x * 2 ** y
x >> y is rep(i, y) x = x // 2
Let S be a bit sequence and i be a non-negative integer
S & (1 << i) -> if true, i in S
S | (1 << i) -> S union {i}
S & -(1 << i) -> S - {i}
__builtin_popcount(S) -> the number of elements in S
S = 0 -> S is an empty set
S = (1 << n) - 1 -> S includes all the elements up to the n-th
#Conditional Operator
condition ? true : false;
#iterator
type declaration: auto
value reference: *itr
increment: itr++
decrement: itr--
substitution of value: *itr = smt
*/
const ll MAX_N = 100005;
bool okay = false;
ll answer = 0;
ll n, a[MAX_N];
ll L[MAX_N], R[MAX_N];
void solve() {
rep(i, n) in1(a[i]);
L[1] = a[0];
R[1] = a[n - 1];
For(i, 1, n) {
L[i + 1] = gcd(L[i], a[i]);
R[i + 1] = gcd(R[i], a[n - i - 1]);
}
L[0] = R[n - 1];
R[0] = L[n - 1];
rep(i, n) answer = max(gcd(L[i - 1], R[n - i]), answer);
prl(answer);
// check negative MOD
// check index flow
// check overwrite of the input variables
}
int main(void) {
in1(n);
// assert(n <= 100);
solve();
return 0;
}
| #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>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
using edge = struct {
ll to;
ll cost;
};
using point = struct {
ll x;
ll y;
};
typedef string str;
typedef std::pair<ll, ll> pl;
typedef std::pair<ll, pl> pl3;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
typedef std::vector<point> vxy;
typedef std::vector<pl3> vpl3;
typedef std::priority_queue<ll> pq;
typedef std::priority_queue<ll, vl, greater<ll>>
pql; // priority queue taking from the lower value.
typedef std::vector<edge> gr;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979323846;
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a, b) cout << (a) << " " << (b) << endl
#define prl3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for (auto &(kv) : (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define rsort(a, n) sort(a, a + n, greater<>())
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
cout << fixed << setprecision(digits) << (num) << endl;
#define XOR(a, b) (a) ^ (b)
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#define bin_expression(n, dig) bitset<(dig)>(n)
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
rep(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
class UnionFind {
vl parents, set_size;
public:
UnionFind() {}
UnionFind(ll n) {
parents = set_size = vl(n);
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
x = root_find(x);
y = root_find(y);
if (x == y)
return;
if (set_size[x] < set_size[y]) {
parents[y] = x;
set_size[x] += set_size[y];
} else {
parents[x] = y;
set_size[y] += set_size[x];
}
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
};
/*
class LCA{
public:
ll N, logN;
vl depth, len;
gr tree[200005]; // global declaration later.
vector<vl> parents;
LCA(ll n){
N = n;
logN = 0;
while (N > (1LL << logN)) logN++;
depth = vl(N); len = vl(N);
parents = vector<vl>(logN, vl(N));
init(0, -1, 0, 0);
build();
}
void init(ll source, ll parent, ll d, ll l){
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent) continue;
init(target, source, d + 1, cost + l);
}
}
void build(){
rep(k, logN - 1) rep(n, N){
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0) parents[k + 1][n] = -1;
else parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v){
if (depth[u] > depth[v]) swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v) return u;
revrep(k, logN){
if (parents[k][u] != parents[k][v]){
u = parents[k][u]; v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v){
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
*/
struct BIT {
ll n;
vl dat;
BIT(ll n) : dat(n + 1), n(n){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll sum(ll i) {
ll s = 0;
while (i > 0) {
s += dat[i];
i -= i & -i;
}
return s;
}
ll sum(ll i, ll j) { return sum(j - 1) - sum(i - 1); }
void add(ll i, ll x) {
while (i <= n) {
dat[i] += x;
i += i & -i;
}
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll comb_memo[55][55];
ll pascal_triangle(ll n) {
comb_memo[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb_memo[i][j] += comb_memo[i - 1][j];
if (j > 0)
comb_memo[i][j] += comb_memo[i - 1][j - 1];
}
}
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
(numerator *= ll(n - i)) %= mod;
(denomenator *= modinv(i + 1, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
ll combination_memo(ll n, ll r, ll pre, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = ll(n - r + 1) % mod;
ll denomenator = modinv(r, mod) % mod;
ll val = (numerator * denomenator) % mod;
val *= pre;
return val % mod;
}
ll bin_search(ll key, ll A[], ll left, ll right) {
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end..
// In other words, A[right], not A[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (A[mid] == key)
return mid;
else if (A[mid] > key)
right = mid - 1;
else if (A[mid] < key)
left = mid + 1;
}
return -1;
}
/*
ll bin_search_temp(ll left, ll right, callable judge){
while(right > left){
// when seeking lower bound
ll mid = (right + left) / 2;
if (judge(mid)) right = mid;
else left = mid + 1;
// when seeking upper bound
ll mid = (right + left + 1) / 2;
if (judge(mid)) left = mid;
else right = mid - 1;
}
return right;
}
*/
ll lower_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] >= key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] < key && key <= A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] < key && key <= A[mid])
return mid;
else if (A[mid - 1] >= key)
right = mid - 1;
else if (A[mid] < key)
left = mid;
}
return -1; // all the elements < key
}
ll inf_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] > key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] <= key && key < A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] <= key && key < A[mid])
return mid;
else if (A[mid - 1] > key)
right = mid - 1;
else if (A[mid] <= key)
left = mid;
}
return -1; // all the elements <= key
}
ll upper_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] <= key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] <= key && key < A[right])
return right - 1;
else
return -1;
}
if (A[mid] <= key && key < A[mid + 1])
return mid;
else if (A[mid] > key)
right = mid;
else if (A[mid + 1] <= key)
left = mid + 1;
}
return -1; // all the elements > key
}
ll sup_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] < key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] < key && key <= A[right])
return right - 1;
else
return -1;
}
if (A[mid] < key && key <= A[mid + 1])
return mid;
else if (A[mid] >= key)
right = mid;
else if (A[mid + 1] < key)
left = mid + 1;
}
return -1; // all the elements >= key
}
ll bin_search_vector(ll key, vl v, ll left, ll right) {
// return the index idx where v[idx] = key.
// v[left] is start and v[right] is end..
// In other words, v[right], not v[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (v[mid] == key)
return mid;
else if (v[mid] > key)
right = mid - 1;
else if (v[mid] < key)
left = mid + 1;
}
return -1;
}
ll lower_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] < key <= v[N]
// N == -1 if all the elements < key
return lower_bound(all(v), key) - v.begin();
}
ll inf_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] <= key < v[N] <= key + 1
// N == -1 if all the elements <= key
return lower_bound(all(v), key + 1) - v.begin();
}
ll upper_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key < v[N + 1]
// N == -1 if all the elements > key
return upper_bound(all(v), key) - v.begin() - 1;
}
ll sup_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key - 1 < key <= v[N + 1]
// N == -1 if all the elements >= key
return upper_bound(all(v), key - 1) - v.begin() - 1;
}
ll fact(ll n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll bool_sum(ll a1, ll a2) {
if (a1 == 1 || a2 == 1)
return 1;
return 0;
}
mll prime_decomposition(ll n) {
ll i = 2;
mll table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
ll char_to_idx(char c) {
ll idx = 0;
Forchar(cc, 'a', 'z') {
if (c == cc)
return idx;
else
idx++;
}
}
bool is_cross(ll x1, ll y1, ll x2, ll y2, ll x3, ll y3, ll x4, ll y4) {
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
ll next_combination(ll sub) {
/*
ll n, k; ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
*/
ll x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
/*
const ll N_VERTEX = 310;
ll a, b, t;
ll dist[N_VERTEX][N_VERTEX];
void warshall_floyd(ll n){
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] +
dist[k][j]);
}
int main(void){
in2(n, m);
rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(i, m){
in3(a, b, t);
a--; b--;
dist[a][b] = t;
dist[b][a] = t;
}
warshall_floyd(n);
}
const ll N_VERTEX = 310;
gr graph[N_VERTEX];
ll dist[N_VERTEX], a, b, t, n, m;
void dijkstra(ll start, ll n) {
priority_queue<pl, vector<pl>, greater<pl>> edge_costs;
fill(dist, dist + n, INF);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
pl edge_cost = edge_costs.top();
edge_costs.pop();
ll idx = edge_cost.second;
ll cost = edge_cost.first;
if (dist[idx] < cost) continue;
rep(i, graph[idx].size()){
edge e = graph[idx][i];
if (dist[e.to] > dist[idx] + e.cost){
dist[e.to] = dist[idx] + e.cost;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
int main(void){
in2(n, m);
rep(i, m){
in3(a, b, t);
a--; b--;
G[a].pb({b, t});
G[b].pb({a, t});
}
dijkstra(0, n);
}
# ABC061D
bool bellman_ford(ll start, ll n, ll goal){
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal
!= -1) fill(dist, dist + n, INF); dist[start] = 0; rep(i, n) rep(v, n) rep(k,
graph[v].size()){ edge e = graph[v][k]; if (dist[e.to] > dist[v] + e.cost){
dist[e.to] = dist[v] + e.cost;
if (i == n - 1 && (e.to == goal || goal == -1)) return false;
}
}
return true;
}
*/
/*
# 1. The usage of map pair
map<pl, ll> cnt;
cnt[{i, j}] = 0;
items(kv, cnt){
prl2(kv.first, kv.second);
}
# 2. The usage of next_permutation and combination (factorial search)
ll a[8];
rep(i, 8) a[i] = i;
sort(a, a + 8);
do{
}while(next_permutation(a, a+n));
// here, combination
ll n, r;
ll i1, i2, ..., ir;
For(i1, n - r, n) For(i2, n - r - 1, i1) ... For(ir, n - 2 * r + 1, irr){
process;}
# 3. bit search
ll n;
in1(n);
const ll base = 3;
ll upper = power_normal(base, n);
rep(i, upper){
ll tmp = i;
rep(j, n){
rep(k, base) if (tmp % base == k) prl(k);
tmp /= base;
}
}
# 4. imos method
// used when we would like to count the number which
// shows how many times the numbers between l and r belongs to smt.
// This method is composed of three process.
ll n, m, s[MAX_M], l, r;
in2(n, m);
rep(i, m) s[i] = 0;
// 1st step
rep(i, n){
in3(l, r, c);
l--; r--; // if l starts from 1.
s[l] += c; s[r + 1] -= c;
}
// 2nd step
rep(i, m - 1) s[i + 1] += s[i];
// 3rd step: judgement...
#5. shakutori method (syakutori)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0; ll r = 0;
while (l < n){
r = max(r, l);
if (l == r) r++;
while(r < n && cond) r++;
answer += r - l; l++;
}
prl(answer);
#6. priority queue
pq q;
ll answer = 0;
ll v;
rep(i, n) q.push(a[i]);
rep(i, m){
v = q.top(); q.pop(); // get the top value and dump the value from queue
v /= 2; q.push(v); // add the new value
}
while(!q.empty()){
answer += q.top();
q.pop();
}
#7. The shortest path between the k-th edge and another edge (Tree)
ll depth[MAX_N];
gr tree[MAX_N];
void path(ll source, ll parent, ll all_cost){
depth[source] = all_cost;
items(e, tree[source]){
if (e.to == parent) continue;
dfs(e.to, source, all_cost + e.cost);
}
}
ll n, k, a, b, c;
in2(n, k);
rep(i, n - 1){
in3(a, b, c);
a--; b--;
tree[a].pb({b, c});
tree[b].pb({a, c});
}
k--;
dfs(k, -1, 0);
#10. Visiting Subtree using recurrent function (ABC138D)
gr tree[MAX_N];
ll c[MAX_N];
bool visited[MAX_N];
void dfs(ll source, ll parent, ll val){
visited[source] = true;
c[source] += val;
rep(i, tree[source].size()){
rep(i, m){ll res = n % match[i].e1;}
ll vertex = tree[source][i].to;
if (vertex == parent) continue;
dfs(vertex, source, c[source]);
}
}
#11. bfs ABC146D, ABC007C
1. first create a tree.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
queue<pl> q;
void bfs(ll source, ll parents){
ll n_edge = G[source].size();
if (parents != -1) dist[source] = min(dist[source], dist[parents] + 1);
if (visited[source]) return;
visited[source] = true;
rep(idx, n_edge){
ll target = G[source][idx].to;
if (target == parents) continue;
q.push(mp(target, source));
}
}
q.push(mp(sg.e1, -1));
while(!q.empty()){
pl source = q.front(); q.pop();
bfs(source.e1, source.e2);
}
#12. grid to distance matrix (dx, dy)
ll w, h;
ll pos_to_idx(ll x, ll y){
return y * w + x;
}
pl idx_to_pos(ll idx){
return mp(idx % w, idx / w);
}
int main(void){
in2(h, w);
rep(y, h){
in1(s);
rep(x, w){
if (s[x] == '#') wall[x][y] = true;
else wall[x][y] = false;
}
}
rep(i1, h * w)rep(i2, h * w) dist[i1][i2] = INF * (i1 != i2);
rep(x, w)rep(y, h){
ll idx1 = pos_to_idx(x, y); ll idx2;
if (wall[x][y]) continue;
if (x != 0 && !wall[x - 1][y]){
idx2 = pos_to_idx(x - 1, y);
// if warshall floyd
dist[idx1][idx2] = 1;
// if dijkstra
// graph[idx1].pb({idx2, 1});
}
if (x != w - 1 && !wall[x + 1][y]){
idx2 = pos_to_idx(x + 1, y);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != 0 && !wall[x][y - 1]){
idx2 = pos_to_idx(x, y - 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != h - 1 && !wall[x][y + 1]){
idx2 = pos_to_idx(x, y + 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
}
}
*/
/*
# the operators regarding bit
& (AND), | (OR), ^ (XOR)
- (REVERSE), >> (SMALLER SHIFT)
<< (BIGGER SHIFT)
x1: 0000 0001 0010 0101 0110 0111
x2: xxxx 0001 0011 0100 0101 1000
x1 & x2: 0000 0001 0010 0100 0100 0000
x: 1001 1010 1100 1011 1101 1111
x & - x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
x << y is x * 2 ** y
x >> y is rep(i, y) x = x // 2
Let S be a bit sequence and i be a non-negative integer
S & (1 << i) -> if true, i in S
S | (1 << i) -> S union {i}
S & -(1 << i) -> S - {i}
__builtin_popcount(S) -> the number of elements in S
S = 0 -> S is an empty set
S = (1 << n) - 1 -> S includes all the elements up to the n-th
#Conditional Operator
condition ? true : false;
#iterator
type declaration: auto
value reference: *itr
increment: itr++
decrement: itr--
substitution of value: *itr = smt
*/
const ll MAX_N = 100005;
bool okay = false;
ll answer = 0;
ll n, a[MAX_N];
ll L[MAX_N], R[MAX_N];
void solve() {
rep(i, n) in1(a[i]);
L[1] = a[0];
R[1] = a[n - 1];
For(i, 1, n) {
L[i + 1] = gcd(L[i], a[i]);
R[i + 1] = gcd(R[i], a[n - i - 1]);
}
L[0] = R[n - 1];
R[0] = L[n - 1];
rep(i, n) answer = max(gcd(L[i], R[n - i - 1]), answer);
prl(answer);
// check negative MOD
// check index flow
// check overwrite of the input variables
}
int main(void) {
in1(n);
// assert(n <= 100);
solve();
return 0;
}
| [
"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++)
lt[i] = __gcd(a[i], lt[i - 1]);
for (int i = n - 1; i > 0; i--)
rt[i] = __gcd(a[i], rt[i + 1]);
ll ans = max(rt[2], lt[n - 1]);
for (int i = 1; i < n; i++) {
ans = max(ans, __gcd(lt[i - 1], rt[i + 1]));
}
cout << ans << '\n';
}
| #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 <= n; i++)
lt[i] = __gcd(a[i], lt[i - 1]);
for (int i = n - 1; i > 0; i--)
rt[i] = __gcd(a[i], rt[i + 1]);
ll ans = max(rt[2], lt[n - 1]);
for (int i = 1; i < n; i++) {
ans = max(ans, __gcd(lt[i - 1], rt[i + 1]));
}
cout << ans << '\n';
}
| [] | 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] = __gcd(l[i - 1], v[i]);
for (int i = n - 2; i >= 0; i--)
r[i] = __gcd(r[i + 1], v[i]);
for (int i = 0; i <= n - 3; i++)
t = max(t, __gcd(l[i], r[i + 2]));
t = max(t, l[n - 1]);
t = max(t, r[0]);
cout << t;
} | #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] = __gcd(l[i - 1], v[i]);
for (int i = n - 2; i >= 0; i--)
r[i] = __gcd(r[i + 1], v[i]);
for (int i = 0; i <= n - 3; i++)
t = max(t, __gcd(l[i], r[i + 2]));
t = max(t, l[n - 2]);
t = max(t, r[1]);
cout << t;
} | [
"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] = __gcd(l[i - 1], v[i]);
for (int i = n - 2; i >= 0; i--)
r[i] = __gcd(r[i + 1], v[i]);
for (int i = 0; i <= n - 3; i++)
t = max(t, __gcd(l[i], r[i + 2]));
t = max(t, l[n - 1]);
t = max(t, r[1]);
cout << t;
} | #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] = __gcd(l[i - 1], v[i]);
for (int i = n - 2; i >= 0; i--)
r[i] = __gcd(r[i + 1], v[i]);
for (int i = 0; i <= n - 3; i++)
t = max(t, __gcd(l[i], r[i + 2]));
t = max(t, l[n - 2]);
t = max(t, r[1]);
cout << t;
} | [
"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];
vector<ll> forward(n);
forward[0] = a[0];
rep(i, n) { forward[i + 1] = gcd(a[i + 1], forward[i]); }
vector<ll> backward(n);
backward[n - 1] = a[n - 1];
rep(i, n) { backward[n - i - 2] = gcd(a[n - i - 2], backward[n - i - 1]); }
ll ans = 0;
rep(i, n - 2) {
ll tmp = gcd(forward[i], backward[i + 2]);
ans = max(ans, tmp);
}
ans = max(ans, forward[n - 2]);
ans = max(ans, backward[1]);
cout << ans << endl;
return 0;
} | #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];
vector<ll> forward(n);
forward[0] = a[0];
rep(i, n - 1) { forward[i + 1] = gcd(a[i + 1], forward[i]); }
vector<ll> backward(n);
backward[n - 1] = a[n - 1];
rep(i, n - 1) {
backward[n - i - 2] = gcd(a[n - i - 2], backward[n - i - 1]);
}
ll ans = 0;
rep(i, n - 2) {
ll tmp = gcd(forward[i], backward[i + 2]);
ans = max(ans, tmp);
}
ans = max(ans, forward[n - 2]);
ans = max(ans, backward[1]);
cout << ans << endl;
return 0;
} | [
"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) vector<vector<double>> a(n, vector<double>(m, 0));
#define P pair<int, int>
#define All(a) (a).begin(), (a).end()
#define Sort(a) sort(All(a));
#define Reverse(a) reverse(All(a));
#define PQ(n) priority_queue<P, vector<P>, greater<P>>(n)
#define pq(n) priority_queue<int>(n)
#define print(a) cout << (a) << endl
#define printD(a) cout << setprecision(15) << (a) << endl;
using namespace std;
int max_int = 1000000007;
void Debug(auto a);
int nibul(auto a, auto b);
int nibuu(auto a, auto b);
void input(vector<auto> &a, int n);
double PI = 3.14159265358979;
int n;
int gcd(int u, int v) {
int r;
while (0 != v) {
r = u % v;
u = v;
v = r;
}
return u;
}
signed main() {
cin >> n;
vec(a, n);
input(a, n);
vec(x, n);
vec(y, n);
x[0] = a[0];
FOR(i, 1, n) { x[i] = gcd(x[i - 1], a[i]); }
y[n - 1] = a[n - 1];
for (int i = n - 2; i > 0; i--) {
y[i] = gcd(y[i + 1], a[i]);
}
int ans = max(x[n - 2], y[1]);
FOR(i, 2, n - 1) { ans = max(ans, gcd(x[i - 1], y[i + 1])); }
print(ans);
return 0;
}
void Debug(auto a) {
cout << "{ ";
for (auto b : a) {
cout << b << " ";
}
cout << "}" << endl;
}
// key以上の初めてのitr
int nibul(auto a, auto b) { return lower_bound(All(a), b) - a.begin(); }
// key以下の最後のitr
int nibuu(auto a, auto b) { return upper_bound(All(a), b) - a.begin() - 1; }
void input(vector<auto> &a, int n) {
REP(i, n) { cin >> a[i]; }
}
| #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) vector<vector<double>> a(n, vector<double>(m, 0));
#define P pair<int, int>
#define All(a) (a).begin(), (a).end()
#define Sort(a) sort(All(a));
#define Reverse(a) reverse(All(a));
#define PQ(n) priority_queue<P, vector<P>, greater<P>>(n)
#define pq(n) priority_queue<int>(n)
#define print(a) cout << (a) << endl
#define printD(a) cout << setprecision(15) << (a) << endl;
using namespace std;
int max_int = 1000000007;
void Debug(auto a);
int nibul(auto a, auto b);
int nibuu(auto a, auto b);
void input(vector<auto> &a, int n);
double PI = 3.14159265358979;
int n;
int gcd(int u, int v) {
int r;
while (0 != v) {
r = u % v;
u = v;
v = r;
}
return u;
}
signed main() {
cin >> n;
vec(a, n);
input(a, n);
vec(x, n);
vec(y, n);
x[0] = a[0];
FOR(i, 1, n) { x[i] = gcd(x[i - 1], a[i]); }
y[n - 1] = a[n - 1];
for (int i = n - 2; i > 0; i--) {
y[i] = gcd(y[i + 1], a[i]);
}
int ans = max(x[n - 2], y[1]);
FOR(i, 1, n - 1) { ans = max(ans, gcd(x[i - 1], y[i + 1])); }
print(ans);
return 0;
}
void Debug(auto a) {
cout << "{ ";
for (auto b : a) {
cout << b << " ";
}
cout << "}" << endl;
}
// key以上の初めてのitr
int nibul(auto a, auto b) { return lower_bound(All(a), b) - a.begin(); }
// key以下の最後のitr
int nibuu(auto a, auto b) { return upper_bound(All(a), b) - a.begin() - 1; }
void input(vector<auto> &a, int n) {
REP(i, n) { cin >> a[i]; }
}
| [
"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;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll arr[100000];
ll _left[100000];
ll _right[100000];
int main() {
cin >> N;
rep(i, N) { cin >> arr[i]; }
_left[0] = arr[0];
_right[N - 1] = arr[N - 1];
rep(i, N - 1) {
_left[i + 1] = gcd(_left[i], arr[i + 1]);
_right[N - i - 2] = gcd(_right[N - i - 1], arr[N - i - 2]);
}
ll maxv = _right[1];
rep(i, N - 2) { maxv = max(maxv, gcd(_left[i], _right[i + 2])); }
maxv = _left[N - 2];
cout << maxv;
}
| #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;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll arr[100000];
ll _left[100000];
ll _right[100000];
int main() {
cin >> N;
rep(i, N) { cin >> arr[i]; }
_left[0] = arr[0];
_right[N - 1] = arr[N - 1];
rep(i, N - 1) {
_left[i + 1] = gcd(_left[i], arr[i + 1]);
_right[N - i - 2] = gcd(_right[N - i - 1], arr[N - i - 2]);
}
ll maxv = _right[1];
rep(i, N - 2) { maxv = max(maxv, gcd(_left[i], _right[i + 2])); }
maxv = max(maxv, _left[N - 2]);
cout << maxv;
}
| [
"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 = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct edge {
ll to, cost;
};
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return (b, a % b);
}
}
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
ll ans = 0;
vl LG(n), RG(n);
LG[0] = a[0];
RG[n - 1] = a[n - 1];
FOR(i, 1, n - 2) {
LG[i] = gcd(LG[i - 1], a[i]);
RG[n - 1 - i] = gcd(a[n - 1 - i], RG[n - i]);
}
rep(i, n) {
if (i == 0) {
ans = max(ans, RG[1]);
} else if (i == n - 1) {
ans = max(ans, LG[n - 2]);
} else {
ll z = gcd(LG[i - 1], RG[i + 1]);
ans = max(ans, z);
}
}
cout << ans << endl;
} | #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 = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct edge {
ll to, cost;
};
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
ll ans = 0;
vl LG(n), RG(n);
LG[0] = a[0];
RG[n - 1] = a[n - 1];
FOR(i, 1, n - 1) {
LG[i] = gcd(LG[i - 1], a[i]);
RG[n - 1 - i] = gcd(a[n - 1 - i], RG[n - i]);
}
rep(i, n) {
if (i == 0) {
ans = max(ans, RG[1]);
} else if (i == n - 1) {
ans = max(ans, LG[n - 2]);
} else {
ll z = gcd(LG[i - 1], RG[i + 1]);
ans = max(ans, z);
}
}
cout << ans << endl;
} | [
"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 long>;
#define cY cout << "Yes" << endl
#define cN cout << "No" << endl
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
//最大最小の入れ替え
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//約数列挙
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
}
//コンビネーション
ll nCr(ll n, ll r) {
ll ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans * i;
}
for (int i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
//素因数分解
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
//切り上げの割り算は(a + b - 1) / bでできる
//時間を意識しろ
//コードテストちゃんとして
//画面とにらめっこするな書け
// WA出すたびにABCは五億円払え
//わからない問題はとばせ
//躊躇なくぐぐれ
//ここから
int main() {
ll N;
cin >> N;
vl A(N);
rep(i, N) cin >> A.at(i);
vl rGCD(N);
vl lGCD(N);
rep(i, N) {
if (i == 0) {
lGCD.at(0) = A.at(0);
rGCD.at(N - 1) = A.at(N - 1);
} else {
lGCD.at(i) = __gcd(A.at(i), lGCD.at(i - 1));
rGCD.at(N - 1 - i) = __gcd(A.at(N - 1 - i), rGCD.at(N - i));
}
}
ll Ans;
rep(i, N) {
if (i == 0) {
Ans = rGCD.at(1);
} else if (i == N - 1) {
chmax(Ans, lGCD.at(i));
} else {
ll x = __gcd(lGCD.at(i - 1), rGCD.at(i + 1));
chmax(Ans, x);
}
}
cout << Ans << endl;
}
| #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 long>;
#define cY cout << "Yes" << endl
#define cN cout << "No" << endl
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
//最大最小の入れ替え
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//約数列挙
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end()); // 昇順に並べる
return ret;
}
//コンビネーション
ll nCr(ll n, ll r) {
ll ans = 1;
for (int i = n; i > n - r; --i) {
ans = ans * i;
}
for (int i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
//素因数分解
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
//切り上げの割り算は(a + b - 1) / bでできる
//時間を意識しろ
//コードテストちゃんとして
//画面とにらめっこするな書け
// WA出すたびにABCは五億円払え
//わからない問題はとばせ
//躊躇なくぐぐれ
//ここから
int main() {
ll N;
cin >> N;
vl A(N);
rep(i, N) cin >> A.at(i);
vl rGCD(N);
vl lGCD(N);
rep(i, N) {
if (i == 0) {
lGCD.at(0) = A.at(0);
rGCD.at(N - 1) = A.at(N - 1);
} else {
lGCD.at(i) = __gcd(A.at(i), lGCD.at(i - 1));
rGCD.at(N - 1 - i) = __gcd(A.at(N - 1 - i), rGCD.at(N - i));
}
}
ll Ans;
rep(i, N) {
if (i == 0) {
Ans = rGCD.at(1);
} else if (i == N - 1) {
chmax(Ans, lGCD.at(i - 1));
} else {
ll x = __gcd(lGCD.at(i - 1), rGCD.at(i + 1));
chmax(Ans, x);
}
}
cout << Ans << endl;
}
| [
"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 >> a[i];
sort(a, a + n);
int MIN = a[0];
int GCD = gcd(a[0], a[1]);
for (int i = 2; i < n; i++)
GCD = gcd(GCD, a[i]);
int flag = 0;
int ans;
for (int i = MIN / GCD; i > 0; i--) {
flag = 0;
for (int j = 0; j < n; j++) {
if (a[j] % (i * GCD) != 0)
flag++;
if (flag > 1)
break;
}
if (flag < 2) {
ans = GCD * i;
break;
}
}
cout << ans << endl;
} | #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 >> a[i];
sort(a, a + n);
int MIN = a[1];
int GCD = gcd(a[0], a[1]);
for (int i = 2; i < n; i++)
GCD = gcd(GCD, a[i]);
int flag = 0;
int ans;
for (int i = MIN / GCD; i > 0; i--) {
flag = 0;
for (int j = 0; j < n; j++) {
if (a[j] % (i * GCD) != 0)
flag++;
if (flag > 1)
break;
}
if (flag < 2) {
ans = GCD * i;
break;
}
}
cout << ans << endl;
} | [
"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()
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define int long long
const long long INF = 1e18;
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long>> vpll;
typedef vector<pair<int, int>> vpii;
#define FORR(x, arr) for (auto &x : arr)
/*
bool isprime(int x){
for(int i = 2;i*i<=x;i++){
if(x%i == 0)return false;
}
return x!=1;
}
int gcd(int a, int b)
{
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a-b, b);
return gcd(a, b-a);
}
void dfs(int x,int y){
if(x == n+1){
int tmp = 0;
FOR(i,0,k){
if(tmp1[mortyy[i]]-tmp1[morty[i]] ==
mortyyy[i])tmp+=mortyyyy[i];
}
rick = max(rick,tmp);
return ;
}
int i;
for(i = y;i<=n1;i++){
tmp1[x] = i;
dfs(x+1,i);
}
}
*/
int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a - b, b);
return gcd(a, b - a);
}
// 3111111111111111111111111111111
void solve() {
ini(n);
vi morty;
FOR(i, 0, n) {
ini(x);
morty.push_back(x);
}
vi ll;
vi rr;
int tmp = morty[0];
FOR(i, 0, n) {
tmp = gcd(tmp, morty[i]);
ll.push_back(tmp);
}
tmp = morty[n - 1];
for (int i = n - 1; i >= 0; i--) {
tmp = gcd(tmp, morty[i]);
rr.push_back(tmp);
}
reverse(all(rr));
// for(auto x:ll){cout<<x<<" ";}
// out();
// for(auto x:rr){cout<<x<<" ";}
// out();
int rick = 0;
FOR(i, 1, n - 1) { rick = max(rick, gcd(ll[i - 1], rr[i + 1])); }
rick = max(rick, rr[1]);
rick = max(rick, ll[n - 2]);
out(rick);
}
int32_t main() {
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
solve();
return 0;
} | #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()
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define int long long
const long long INF = 1e18;
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long>> vpll;
typedef vector<pair<int, int>> vpii;
#define FORR(x, arr) for (auto &x : arr)
/*
bool isprime(int x){
for(int i = 2;i*i<=x;i++){
if(x%i == 0)return false;
}
return x!=1;
}
int gcd(int a, int b)
{
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a-b, b);
return gcd(a, b-a);
}
void dfs(int x,int y){
if(x == n+1){
int tmp = 0;
FOR(i,0,k){
if(tmp1[mortyy[i]]-tmp1[morty[i]] ==
mortyyy[i])tmp+=mortyyyy[i];
}
rick = max(rick,tmp);
return ;
}
int i;
for(i = y;i<=n1;i++){
tmp1[x] = i;
dfs(x+1,i);
}
}
*/
int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a - b, b);
return gcd(a, b - a);
}
// 3111111111111111111111111111111
void solve() {
ini(n);
vi morty;
FOR(i, 0, n) {
ini(x);
morty.push_back(x);
}
vi ll;
vi rr;
int tmp = morty[0];
FOR(i, 0, n) {
tmp = __gcd(tmp, morty[i]);
ll.push_back(tmp);
}
tmp = morty[n - 1];
for (int i = n - 1; i >= 0; i--) {
tmp = __gcd(tmp, morty[i]);
rr.push_back(tmp);
}
reverse(all(rr));
// for(auto x:ll){cout<<x<<" ";}
// out();
// for(auto x:rr){cout<<x<<" ";}
// out();
int rick = 0;
FOR(i, 1, n - 1) { rick = max(rick, __gcd(ll[i - 1], rr[i + 1])); }
rick = max(rick, rr[1]);
rick = max(rick, ll[n - 2]);
out(rick);
}
int32_t main() {
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
oneforall oneforall oneforall oneforall oneforall oneforall oneforall
solve();
return 0;
} | [
"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); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
const ll INF = 1LL << 60;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
int lgcd[N];
int rgcd[N];
rep(i, N) {
if (i == 0) {
lgcd[i] = A[i];
rgcd[N - 1 - i] = A[N - 1 - i];
continue;
}
lgcd[i] = gcd(A[i], lgcd[i - 1]);
rgcd[i] = gcd(A[N - 1 - i], rgcd[N - 1 - i + 1]);
}
int ans = 0;
rep(i, N) {
if (i == 0) {
ans = max(ans, rgcd[i + 1]);
continue;
}
if (i == N - 1) {
ans = max(ans, lgcd[i - 1]);
continue;
}
ans = max(gcd(lgcd[i - 1], rgcd[i + 1]), ans);
}
cout << ans << endl;
} | // #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); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
const ll INF = 1LL << 60;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
int lgcd[N];
int rgcd[N];
rep(i, N) {
if (i == 0) {
lgcd[i] = A[i];
rgcd[N - 1 - i] = A[N - 1 - i];
continue;
}
lgcd[i] = gcd(A[i], lgcd[i - 1]);
rgcd[N - 1 - i] = gcd(A[N - 1 - i], rgcd[N - 1 - i + 1]);
}
int ans = 0;
rep(i, N) {
if (i == 0) {
ans = max(ans, rgcd[i + 1]);
continue;
}
if (i == N - 1) {
ans = max(ans, lgcd[i - 1]);
continue;
}
ans = max(gcd(lgcd[i - 1], rgcd[i + 1]), ans);
}
cout << ans << endl;
} | [
"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);
vector<long long> d(N);
b.at(0) = 0;
c.at(N - 1) = 0;
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
b.at(i + 1) = __gcd(b.at(i), a.at(i));
}
for (int i = N - 1; i >= 0; i--) {
c.at(i) = __gcd(c.at(i + 1), a.at(i));
}
for (int i = 0; i < N; i++) {
counter1 = max(__gcd(b.at(i), c.at(i + 1)), counter1);
cout << counter1 << endl;
}
}
| #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);
vector<long long> d(N);
b.at(0) = 0;
c.at(N - 1) = 0;
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
b.at(i + 1) = __gcd(b.at(i), a.at(i));
}
for (int i = N - 1; i >= 0; i--) {
c.at(i) = __gcd(c.at(i + 1), a.at(i));
}
for (int i = 0; i < N; i++) {
counter1 = max(__gcd(b.at(i), c.at(i + 1)), counter1);
}
cout << counter1 << endl;
}
| [] | 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.at(i);
}
vector<int> left(n);
vector<int> right(n);
left.at(0) = a.at(0);
right.at(n - 1) = a.at(n - 1);
for (int i = 1; i < n - 1; i++) {
left.at(i) = gcd(a.at(i), left.at(i - 1));
}
for (int i = n - 2; i > 0; i--) {
right.at(i) = gcd(a.at(i), right.at(i + 1));
}
int max_gcd = right.at(1);
for (int i = 1; i < n - 1; i++) {
max_gcd = max(max_gcd, gcd(left.at(i - 1), right.at(i + 1)));
}
max_gcd = max(max_gcd, left.at(n - 1));
cout << max_gcd << endl;
return 0;
}
| #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.at(i);
}
vector<int> left(n);
vector<int> right(n);
left.at(0) = a.at(0);
right.at(n - 1) = a.at(n - 1);
for (int i = 1; i < n - 1; i++) {
left.at(i) = gcd(a.at(i), left.at(i - 1));
}
for (int i = n - 2; i > 0; i--) {
right.at(i) = gcd(a.at(i), right.at(i + 1));
}
int max_gcd = right.at(1);
for (int i = 1; i < n - 1; i++) {
max_gcd = max(max_gcd, gcd(left.at(i - 1), right.at(i + 1)));
}
max_gcd = max(max_gcd, left.at(n - 2));
cout << max_gcd << endl;
return 0;
}
| [
"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];
}
memset(Agcd, 0, sizeof(Agcd));
Agcd[0][0] = A[0];
Agcd[N - 1][1] = A[N - 1];
for (int i = 0; i < N - 1; i++) {
Agcd[i + 1][0] = gcd(Agcd[i][0], A[i + 1]);
Agcd[N - 2 - i][1] = gcd(Agcd[N - 1 - i][1], A[N - 2 - i]);
}
ll gcdmax = 0;
for (int i = 0; i < N; i++) {
ll gcdtmp;
if (i == 0)
gcdtmp = Agcd[1][1];
else if (i == N - 1)
gcdtmp = Agcd[N - 1][0];
else
gcdtmp = gcd(Agcd[i - 1][0], Agcd[i + 1][1]);
gcdmax = max(gcdmax, gcdtmp);
}
cout << gcdmax << endl;
return 0;
} | #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];
}
memset(Agcd, 0, sizeof(Agcd));
Agcd[0][0] = A[0];
Agcd[N - 1][1] = A[N - 1];
for (int i = 0; i < N - 1; i++) {
Agcd[i + 1][0] = gcd(Agcd[i][0], A[i + 1]);
Agcd[N - 2 - i][1] = gcd(Agcd[N - 1 - i][1], A[N - 2 - i]);
}
ll gcdmax = 0;
for (int i = 0; i < N; i++) {
ll gcdtmp;
if (i == 0)
gcdtmp = Agcd[1][1];
else if (i == N - 1)
gcdtmp = Agcd[N - 2][0];
else
gcdtmp = gcd(Agcd[i - 1][0], Agcd[i + 1][1]);
gcdmax = max(gcdmax, gcdtmp);
}
cout << gcdmax << endl;
return 0;
} | [
"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(left[i], A[i]);
}
for (int i = N - 1; i >= 0; i--) {
right[i] = gcd(right[i + 1], A[i]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
int x = gcd(left[i], right[i + 1]);
if (ans > x) {
ans = x;
}
}
cout << ans << endl;
} | #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(left[i], A[i]);
}
for (int i = N - 1; i >= 0; i--) {
right[i] = gcd(right[i + 1], A[i]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
int x = gcd(left[i], right[i + 1]);
if (ans < x) {
ans = x;
}
}
cout << ans << endl;
} | [
"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); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define fi first
#define se second
#define rsz(a, n) a.resize(n)
#define test(t) \
ll t; \
cin >> t; \
while (t--)
#define forn(i, e) for (int i = 0; i < e; i++)
#define forsn(i, s, e) for (int i = s; i < e; i++)
#define rforn(i, s) for (int i = s; i >= 0; i--)
#define rforsn(i, s, e) for (int i = s; i >= e; i--)
#define fillv(a, k) memset(a, k, sizeof(a))
#define leadzero(a) __builtin_clz(a) // count leading zeros
#define trailzero(a) __builtin_ctz(a) // count trailing zeros
#define bitcount(a) __builtin_popcount(a) // count set bits (add ll)
#define ln cout << "\n"
// #define sp cout<<" "
#define spaceprint(a, i, s, n) \
{ \
forsn(i, s, n) { \
cout << a[i]; \
sp; \
} \
}
#define lineprint(a, i, s, n) \
{ \
forsn(i, s, n) { \
cout << a[i]; \
ln; \
} \
}
#define maxe(a) *max_element(a.begin(), a.end())
#define maxi(a) max_element(a.begin(), a.end()) - a.begin()
#define mine(a) *min_element(a.begin(), a.end())
#define mini(a) min_element(a.begin(), a.end()) - a.begin()
#define all(c) c.begin(), c.end()
#define trav(container, it) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element) \
(find(all(container), element) != \
container.end()) // check the presence of element
// copy(from_begin, from_end, to_begin); copy function
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll, ll> p64;
typedef pair<int, int> p32;
typedef pair<int, p32> p96;
typedef vector<ll> v64;
typedef vector<string> vs;
typedef vector<int> v32;
typedef vector<v32> vv32;
typedef vector<v64> vv64;
typedef vector<p32> vp32;
typedef vector<p64> vp64;
typedef vector<vp32> vvp32;
typedef map<int, int> m32;
typedef map<ll, ll> m64;
const int LIM = 1e5 + 5, MOD = 1e9;
#define sumv(v) accumulate(all(v), ll(0))
#define productv(v) accumulate(all(v), ll(1), multiplies<ll>())
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll mod = 998244353;
ll fastpowMOD(ll a, ll p, ll MOD) {
if (p == 0)
return 1;
ll z = fastpowMOD(a, p / 2, MOD);
z = (z * z) % MOD;
if (p % 2)
z = (z * a) % MOD;
return z;
}
int main() {
fast;
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll l[n];
ll r[n];
l[0] = a[0];
r[n - 1] = a[n - 1];
for (ll i = 2; i < n; i++)
l[i] = __gcd(l[i - 1], a[i]);
for (ll i = n - 2; i >= 0; i--)
r[i] = __gcd(r[i + 1], a[i]);
ll ma = 1;
for (ll i = 0; i < n; i++) {
if (i == 0) {
ma = max(ma, r[i + 1]);
} else if (i == n - 1) {
ma = max(ma, l[i - 1]);
} else {
ma = max(ma, __gcd(l[i - 1], r[i + 1]));
}
}
cout << ma;
}
| #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); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define fi first
#define se second
#define rsz(a, n) a.resize(n)
#define test(t) \
ll t; \
cin >> t; \
while (t--)
#define forn(i, e) for (int i = 0; i < e; i++)
#define forsn(i, s, e) for (int i = s; i < e; i++)
#define rforn(i, s) for (int i = s; i >= 0; i--)
#define rforsn(i, s, e) for (int i = s; i >= e; i--)
#define fillv(a, k) memset(a, k, sizeof(a))
#define leadzero(a) __builtin_clz(a) // count leading zeros
#define trailzero(a) __builtin_ctz(a) // count trailing zeros
#define bitcount(a) __builtin_popcount(a) // count set bits (add ll)
#define ln cout << "\n"
// #define sp cout<<" "
#define spaceprint(a, i, s, n) \
{ \
forsn(i, s, n) { \
cout << a[i]; \
sp; \
} \
}
#define lineprint(a, i, s, n) \
{ \
forsn(i, s, n) { \
cout << a[i]; \
ln; \
} \
}
#define maxe(a) *max_element(a.begin(), a.end())
#define maxi(a) max_element(a.begin(), a.end()) - a.begin()
#define mine(a) *min_element(a.begin(), a.end())
#define mini(a) min_element(a.begin(), a.end()) - a.begin()
#define all(c) c.begin(), c.end()
#define trav(container, it) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element) \
(find(all(container), element) != \
container.end()) // check the presence of element
// copy(from_begin, from_end, to_begin); copy function
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll, ll> p64;
typedef pair<int, int> p32;
typedef pair<int, p32> p96;
typedef vector<ll> v64;
typedef vector<string> vs;
typedef vector<int> v32;
typedef vector<v32> vv32;
typedef vector<v64> vv64;
typedef vector<p32> vp32;
typedef vector<p64> vp64;
typedef vector<vp32> vvp32;
typedef map<int, int> m32;
typedef map<ll, ll> m64;
const int LIM = 1e5 + 5, MOD = 1e9;
#define sumv(v) accumulate(all(v), ll(0))
#define productv(v) accumulate(all(v), ll(1), multiplies<ll>())
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll mod = 998244353;
ll fastpowMOD(ll a, ll p, ll MOD) {
if (p == 0)
return 1;
ll z = fastpowMOD(a, p / 2, MOD);
z = (z * z) % MOD;
if (p % 2)
z = (z * a) % MOD;
return z;
}
int main() {
fast;
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll l[n];
ll r[n];
l[0] = a[0];
r[n - 1] = a[n - 1];
for (ll i = 1; i < n; i++)
l[i] = __gcd(l[i - 1], a[i]);
for (ll i = n - 2; i >= 0; i--)
r[i] = __gcd(r[i + 1], a[i]);
ll ma = 1;
for (ll i = 0; i < n; i++) {
if (i == 0) {
ma = max(ma, r[i + 1]);
} else if (i == n - 1) {
ma = max(ma, l[i - 1]);
} else {
ma = max(ma, __gcd(l[i - 1], r[i + 1]));
}
}
cout << ma;
}
| [
"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 vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n);
rep(i, 0, n) { cin >> a[i]; }
vi L(n);
L[0] = a[0];
rep(i, 1, n) { L[i] = gcd(L[i - 1], a[i]); }
vi R(n);
R[n - 1] = a[n - 1];
rrep(i, 0, n - 1) { R[i] = gcd(R[i + 1], a[i]); }
int ans = 0;
rep(i, 0, n) {
if (i == 0) {
ans = max(ans, L[1]);
} else if (i == n - 1) {
ans = max(ans, R[n - 2]);
} else {
ans = max(ans, gcd(L[i - 1], R[i + 1]));
}
}
cout << ans << endl;
return 0;
} | #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 vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n);
rep(i, 0, n) { cin >> a[i]; }
vi L(n);
L[0] = a[0];
rep(i, 1, n) { L[i] = gcd(L[i - 1], a[i]); }
vi R(n);
R[n - 1] = a[n - 1];
rrep(i, 0, n - 1) { R[i] = gcd(R[i + 1], a[i]); }
int ans = 0;
rep(i, 0, n) {
if (i == 0) {
ans = max(ans, R[1]);
} else if (i == n - 1) {
ans = max(ans, L[n - 2]);
} else {
ans = max(ans, gcd(L[i - 1], R[i + 1]));
}
}
cout << ans << endl;
return 0;
} | [
"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 L(a - 1);
L[0] = A[0];
rep(i, a - 1) L[i + 1] = gcm(L[i], A[i + 1]);
// rep(i,a) cout << L[i] << endl;
// cout << "A" << endl;
vint R(a - 1);
R[a - 1] = A[a - 1];
for (int i = a - 2; i >= 0; i--)
R[i] = gcm(R[i + 1], A[i]);
// rep(i,a) cout << R[i] << endl;
// cout << "B" << endl;
int ans = 1;
rep(i, a) {
if (i == 0)
ans = max(ans, R[1]);
else if (i == a - 1)
ans = max(ans, L[1]);
else
ans = max(ans, gcm(L[i - 1], R[i + 1]));
// cout << ans << endl;
}
cout << ans << endl;
}
int gcm(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcm(a % b, b);
} | #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 L(a - 1);
L[0] = A[0];
rep(i, a - 1) L[i + 1] = gcm(L[i], A[i + 1]);
// rep(i,a) cout << L[i] << endl;
// cout << "A" << endl;
vint R(a - 1);
R[a - 1] = A[a - 1];
for (int i = a - 2; i >= 0; i--)
R[i] = gcm(R[i + 1], A[i]);
// rep(i,a) cout << R[i] << endl;
// cout << "B" << endl;
int ans = 1;
rep(i, a) {
if (i == 0)
ans = max(ans, R[1]);
else if (i == a - 1)
ans = max(ans, L[a - 2]);
else
ans = max(ans, gcm(L[i - 1], R[i + 1]));
// cout << ans << endl;
}
cout << ans << endl;
}
int gcm(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcm(a % b, b);
} | [
"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;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
l[i] = __gcd(a[i], l[i - 1]);
for (int i = n; i <= 1; i--)
r[i] = __gcd(a[i], r[i + 1]);
int res = 0;
for (int i = 1; i <= n; i++) {
int gcd = __gcd(l[i - 1], r[i + 1]);
res = max(res, gcd);
}
cout << res << endl;
return 0;
} | #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;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
l[i] = __gcd(a[i], l[i - 1]);
for (int i = n; i >= 1; i--)
r[i] = __gcd(a[i], r[i + 1]);
int res = 0;
for (int i = 1; i <= n; i++) {
int gcd = __gcd(l[i - 1], r[i + 1]);
res = max(res, gcd);
}
cout << res << endl;
return 0;
} | [
"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 mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
const ll MAX = 510000;
const ll MOD = 1000000007;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) cin >> a[i];
vector<ll> right(N);
vector<ll> left(N);
left[0] = a[0];
right[N - 2] = a[N - 1];
repn(i, N) { left[i] = gcd(left[i - 1], a[i]); }
for (ll i = N - 3; i >= 0; i--) {
right[i] = gcd(right[i + 1], a[i + 1]);
}
ll ans = 1;
ans = max(left[N - 2], right[0]);
rep(i, N) { ans = max(ans, gcd(left[i], right[i + 1])); }
cout << ans << endl;
}
| #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 mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
const ll MAX = 510000;
const ll MOD = 1000000007;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) cin >> a[i];
vector<ll> right(N + 2);
vector<ll> left(N + 2);
left[0] = a[0];
right[N - 2] = a[N - 1];
repn(i, N) { left[i] = gcd(left[i - 1], a[i]); }
for (ll i = N - 3; i >= 0; i--) {
right[i] = gcd(right[i + 1], a[i + 1]);
}
ll ans = 1;
ans = max(left[N - 2], right[0]);
rep(i, N) { ans = max(ans, gcd(left[i], right[i + 1])); }
cout << ans << endl;
}
| [
"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--) {
dp1[i] = __gcd(dp1[i + 1], ara[i]);
}
m = max(m, dp1[1]);
m = max(m, dp[n - 1]);
for (i = 1; i < n - 1; i++) {
m = max(__gcd(dp[i - 1], dp1[i + 1]), m);
}
cout << m << endl;
return 0;
} | #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--) {
dp1[i] = __gcd(dp1[i + 1], ara[i]);
}
/*if(n==2){
cout<<max(ara[0],ara[1])<<endl;
return 0;
}*/
m = max(m, dp1[1]);
m = max(m, dp[n - 2]);
for (i = 1; i < n - 1; i++) {
m = max(__gcd(dp[i - 1], dp1[i + 1]), m);
}
cout << m << endl;
return 0;
} | [
"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);
}
}
sort(x.begin(), x.end());
for (int i = 0; i < x.size(); i++) {
int d = 0;
for (int j = 0; j < n; j++) {
if (z.at(j) % x.at(i) != 0)
d++;
}
if (d < 2)
y = x.at(i);
}
int f = z.at(1);
for (int i = 2; i < n; i++) {
f = __gcd(f, z.at(i));
}
cout << max(f, y) << endl;
} | #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);
}
}
sort(x.begin(), x.end());
for (int i = 0; i < x.size(); i++) {
int d = 0;
for (int j = 0; j < n; j++) {
if (z.at(j) % x.at(i) != 0)
d++;
}
if (d < 2)
y = x.at(i);
}
int f = z.at(1);
for (int i = 2; i < n; i++) {
f = __gcd(f, z.at(i));
}
cout << max(f, y) << endl;
} | [
"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];
for (int i = 1; i < N; i++) {
L[i] = gcd(L[i - 1], A[i]);
R[N - i - 1] = gcd(R[N - i], A[N - i - 1]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
int GCD;
if (i == 0)
GCD = R[1];
else if (i == N - 1)
GCD = L[N - 1];
else
GCD = gcd(L[i - 1], R[i + 1]);
ans = max(GCD, ans);
}
cout << ans << endl;
} | #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];
for (int i = 1; i < N; i++) {
L[i] = gcd(L[i - 1], A[i]);
R[N - i - 1] = gcd(R[N - i], A[N - i - 1]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
int GCD;
if (i == 0)
GCD = R[1];
else if (i == N - 1)
GCD = L[N - 2];
else
GCD = gcd(L[i - 1], R[i + 1]);
ans = max(GCD, ans);
}
cout << ans << endl;
} | [
"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 main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> r(n), l(n);
int s = a[0], t = a[n - 1];
l[0] = 0;
l[1] = s;
r[n - 1] = 0;
r[n - 2] = t;
rep(i, n - 2) {
s = gcd(s, a[i + 1]);
t = gcd(t, a[n - 2 - i]);
l[i + 2] = s;
r[n - 3 - i] = t;
}
int ans = 0;
rep(i, n - 1) {
int x = gcd(l[i], r[i]);
ans = max(ans, x);
}
cout << ans << endl;
return 0;
} | #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 main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> r(n), l(n);
int s = a[0], t = a[n - 1];
l[0] = 0;
l[1] = s;
r[n - 1] = 0;
r[n - 2] = t;
rep(i, n - 2) {
s = gcd(s, a[i + 1]);
t = gcd(t, a[n - 2 - i]);
l[i + 2] = s;
r[n - 3 - i] = t;
}
int ans = 0;
rep(i, n) {
int x = gcd(l[i], r[i]);
ans = max(ans, x);
}
cout << ans << endl;
return 0;
} | [
"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(v, val) lower_bound(v.begin(), v.end(), val)
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define dbg(x) cout << #x << " = " << x << endl
#define dbg2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define dbg3(x, y, z) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl
#define dbg4(x, y, z, q) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << ", " << #q << " = " << q << endl
#define jaldi_chal() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define S second
#define F first
#define fm(it, m) for (it = m.begin(); it != m.end(); it++)
#define ct_set(n) __builtin_popcount(n) // count no of set bits
#define INF 0x3f3f3f3f
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265 // acosl(-1)
#define precision cout << setprecision(15)
#define print_arr(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
#define print_vec(v) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << " ";
// vec.erase(std::remove(vec.begin(), vec.end(), val), vec.end());
using namespace std;
// v.resize(unique(v.begin(), v.end()) - v.begin()); // for unique elements in
// sorted vector fflush(stdout); // after every output
// Using 128 bit integers
/*
std::string toString(__int128 num) {
std::string str;
do {
int digit = num % 10;
str = std::to_string(digit) + str;
num = (num - digit) / 10;
} while (num != 0);
return str;
}
int main() {
__int128_t x;
string s;
cin >> s;
x = (stoll)(s);
__int128_t ans = x * x * x;
cout << toString(ans);
}
*/
bool isPrime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll ans = (a * b) / g;
return ans;
}
ll add(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0) {
a += mod;
}
return a;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
vector<ll> primes;
bool prime[10005];
void seive() {
mem(prime, 1);
prime[0] = 0;
prime[1] = 0;
for (ll i = 2; i <= 10000; i++) {
if (prime[i] == 1) {
for (ll j = i * i; j <= 10000; j += i)
prime[j] = 0;
}
}
}
ll power(ll a, ll b) {
ll ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans % mod * a % mod) % mod;
a = (a * a) % mod;
b = b / 2;
}
return ans;
}
template <typename T> std::string NumberToString(T Number) {
std::ostringstream ss;
ss << Number;
return ss.str();
}
string num_to_bits(ll n) {
string ans = "";
while (n) {
ans += (n % 2) + '0';
n /= 2;
}
reverse(all(ans));
return ans;
}
ll bits_to_num(string s) {
ll ans = 0;
for (ll i = 0; i < s.size(); i++) {
ll x = s.size() - i - 1;
ll val = pow(2LL, x);
if (s[i] == '1') {
ans = ans + val;
}
}
return ans;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y);
ll modInverse(ll b, ll m) {
ll x, y;
ll g = gcdExtended(b, m, &x, &y);
if (g != 1)
return -1;
return (x % m + m) % m;
}
// Function to compute a/b under modlo m
ll modDivide(ll a, ll b, ll m) {
a = a % m;
ll inv = modInverse(b, m);
// if (inv == -1)
// cout << "Division not defined";
// else
// cout << "Result of division is " << (inv * a) % m;
return (inv * a) % m;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
// To call for modulo division (a / b) % m : modDivide(a, b, m);
/* This will store divisors of the number from 1 to n
for(i = 1; i <= n; i++) {
for(j = i; j <= n; j += i) {
v[j].pb(i);
}
}
*/
void solve() {
ll n;
cin >> n;
ll a[n], i, j;
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll left[n], right[n];
left[0] = a[0];
for (i = 1; i < n; i++) {
left[i] = gcd(left[i - 1], a[i - 1]);
}
right[n - 1] = a[n - 1];
for (i = n - 2; i >= 0; i--) {
right[i] = gcd(right[i + 1], a[i + 1]);
}
ll ans = 1;
for (i = 0; i < n - 1; i++) {
if (i == 0) {
ans = max(ans, right[0]);
} else if (i == n - 1) {
ans = max(ans, left[n - 1]);
} else {
ans = max(ans, gcd(left[i], right[i]));
}
}
cout << ans;
}
int main() {
jaldi_chal()
// freopen("input.txt", "r" , stdin);
// freopen("output.txt", "w", stdout);
// seive();
// for(int i = 2; i <= 10000; i++) {
// if(prime[i])
// primes.pb(i);
// }
bool codechef = 0;
ll t = 1;
if (codechef) {
cin >> t;
}
while (t--) {
solve();
}
return 0;
} | #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(v, val) lower_bound(v.begin(), v.end(), val)
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define dbg(x) cout << #x << " = " << x << endl
#define dbg2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define dbg3(x, y, z) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl
#define dbg4(x, y, z, q) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << ", " << #q << " = " << q << endl
#define jaldi_chal() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define S second
#define F first
#define fm(it, m) for (it = m.begin(); it != m.end(); it++)
#define ct_set(n) __builtin_popcount(n) // count no of set bits
#define INF 0x3f3f3f3f
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265 // acosl(-1)
#define precision cout << setprecision(15)
#define print_arr(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
#define print_vec(v) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << " ";
// vec.erase(std::remove(vec.begin(), vec.end(), val), vec.end());
using namespace std;
// v.resize(unique(v.begin(), v.end()) - v.begin()); // for unique elements in
// sorted vector fflush(stdout); // after every output
// Using 128 bit integers
/*
std::string toString(__int128 num) {
std::string str;
do {
int digit = num % 10;
str = std::to_string(digit) + str;
num = (num - digit) / 10;
} while (num != 0);
return str;
}
int main() {
__int128_t x;
string s;
cin >> s;
x = (stoll)(s);
__int128_t ans = x * x * x;
cout << toString(ans);
}
*/
bool isPrime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll ans = (a * b) / g;
return ans;
}
ll add(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0) {
a += mod;
}
return a;
}
ll mul(ll a, ll b) { return (a * b) % mod; }
vector<ll> primes;
bool prime[10005];
void seive() {
mem(prime, 1);
prime[0] = 0;
prime[1] = 0;
for (ll i = 2; i <= 10000; i++) {
if (prime[i] == 1) {
for (ll j = i * i; j <= 10000; j += i)
prime[j] = 0;
}
}
}
ll power(ll a, ll b) {
ll ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans % mod * a % mod) % mod;
a = (a * a) % mod;
b = b / 2;
}
return ans;
}
template <typename T> std::string NumberToString(T Number) {
std::ostringstream ss;
ss << Number;
return ss.str();
}
string num_to_bits(ll n) {
string ans = "";
while (n) {
ans += (n % 2) + '0';
n /= 2;
}
reverse(all(ans));
return ans;
}
ll bits_to_num(string s) {
ll ans = 0;
for (ll i = 0; i < s.size(); i++) {
ll x = s.size() - i - 1;
ll val = pow(2LL, x);
if (s[i] == '1') {
ans = ans + val;
}
}
return ans;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y);
ll modInverse(ll b, ll m) {
ll x, y;
ll g = gcdExtended(b, m, &x, &y);
if (g != 1)
return -1;
return (x % m + m) % m;
}
// Function to compute a/b under modlo m
ll modDivide(ll a, ll b, ll m) {
a = a % m;
ll inv = modInverse(b, m);
// if (inv == -1)
// cout << "Division not defined";
// else
// cout << "Result of division is " << (inv * a) % m;
return (inv * a) % m;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
// To call for modulo division (a / b) % m : modDivide(a, b, m);
/* This will store divisors of the number from 1 to n
for(i = 1; i <= n; i++) {
for(j = i; j <= n; j += i) {
v[j].pb(i);
}
}
*/
void solve() {
ll n;
cin >> n;
ll a[n], i, j;
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll left[n], right[n];
left[0] = a[0];
for (i = 1; i < n; i++) {
left[i] = gcd(left[i - 1], a[i - 1]);
}
right[n - 1] = a[n - 1];
for (i = n - 2; i >= 0; i--) {
right[i] = gcd(right[i + 1], a[i + 1]);
}
ll ans = 1;
for (i = 0; i < n; i++) {
if (i == 0) {
ans = max(ans, right[0]);
} else if (i == n - 1) {
ans = max(ans, left[n - 1]);
} else {
ans = max(ans, gcd(left[i], right[i]));
}
}
cout << ans;
}
int main() {
jaldi_chal()
// freopen("input.txt", "r" , stdin);
// freopen("output.txt", "w", stdout);
// seive();
// for(int i = 2; i <= 10000; i++) {
// if(prime[i])
// primes.pb(i);
// }
bool codechef = 0;
ll t = 1;
if (codechef) {
cin >> t;
}
while (t--) {
solve();
}
return 0;
} | [
"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);
left[0] = a[0];
for (i = 0; i <= n - 1; i++) { //左端からa[i]までのgcd
left[i + 1] = gcd(left[i], a[i]);
}
right[n] = a[n - 1];
for (i = n - 1; i >= 0; i--) { //右端からa[i]までのgcd
right[i] = gcd(right[i + 1], a[i]);
}
ll max = -1;
for (i = 0; i < n; i++) {
if (i == 0) {
max = right[1];
} else if (i == n - 1 && max < left[n]) {
max = left[n];
} else if (max < gcd(left[i - 1], right[i + 1])) {
max = gcd(left[i], right[i + 1]);
}
}
cout << max << endl;
return 0;
} | #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);
left[0] = a[0];
for (i = 0; i <= n - 1; i++) { //左端からa[i]までのgcd
left[i + 1] = gcd(left[i], a[i]);
}
right[n] = a[n - 1];
for (i = n - 1; i >= 0; i--) { //右端からa[i]までのgcd
right[i] = gcd(right[i + 1], a[i]);
}
ll max = -1;
for (i = 0; i < n; i++) {
if (i == 0) {
max = right[1];
} else if (i == n - 1 && max < left[n - 1]) {
max = left[n - 1];
} else if (max < gcd(left[i], right[i + 1])) {
max = gcd(left[i], right[i + 1]);
}
}
cout << max << endl;
return 0;
} | [
"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);
left[0] = a[0];
for (i = 0; i <= n - 1; i++) { //左端からa[i]までのgcd
left[i + 1] = gcd(left[i], a[i]);
}
right[n] = a[n - 1];
for (i = n - 1; i >= 0; i--) { //右端からa[i]までのgcd
right[i] = gcd(right[i + 1], a[i]);
}
ll max = -1;
for (i = 0; i < n; i++) {
if (i == 0) {
max = right[0];
} else if (i == n - 1 && max < left[n - 1]) {
max = left[n - 1];
} else if (max < gcd(left[i - 1], right[i + 1])) {
max = gcd(left[i], right[i + 2]);
}
}
cout << max << endl;
return 0;
} | #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);
left[0] = a[0];
for (i = 0; i <= n - 1; i++) { //左端からa[i]までのgcd
left[i + 1] = gcd(left[i], a[i]);
}
right[n] = a[n - 1];
for (i = n - 1; i >= 0; i--) { //右端からa[i]までのgcd
right[i] = gcd(right[i + 1], a[i]);
}
ll max = -1;
for (i = 0; i < n; i++) {
if (i == 0) {
max = right[1];
} else if (i == n - 1 && max < left[n - 1]) {
max = left[n - 1];
} else if (max < gcd(left[i], right[i + 1])) {
max = gcd(left[i], right[i + 1]);
}
}
cout << max << endl;
return 0;
} | [
"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;
}
#endif
// sub-BOF
// laptop
// author: Tqk
//#define _AOJ_
#define _C_INPUT_
#pragma region template
#pragma region basic
#define IN_FILE "./in.txt"
//#pragma GCC optimize ("O3")
#pragma warning(disable : 4455 4244 4067 4068 4996)
#pragma GCC target("avx")
#pragma GCC diagnostic ignored "-Wliteral-suffix"
#define NOMINMAX
#include "bits/stdc++.h"
using namespace std;
typedef int64_t lint;
typedef long double ld;
typedef string cs;
#define linf 1152921504606846976
#pragma endregion
#pragma region rep
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define per(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(c) for (auto &e : c)
#pragma endregion
#pragma region io
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) os << ' ' << vec[i];
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) os << ' ' << deq[i];
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> &s) {
each(s) os << e << " ";
return os;
}
#ifdef __ENV_TQK__
/*
ifstream infile(IN_FILE);
template<class T>
ifstream& operator>>(ifstream& is,vector<T>& vec);
template<class T,size_t size>
ifstream& operator>>(ifstream& is,array<T,size>& vec);
template<class T,class L>
ifstream& operator>>(ifstream& is,pair<T,L>& p);
template<class T>
ifstream& operator>>(ifstream& is,vector<T>& vec){ for(T& x: vec) is>>x;return
is; } template<class T,class L> ifstream& operator>>(ifstream& is,pair<T,L>& p){
is>>p.first;is>>p.second;return is; } inline void fin(){} template <class
Head,class... Tail> inline void fin(Head&& head,Tail&&... tail){
infile>>head;fin(move(tail)...); }
*/
#include <Windows.h>
HANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);
inline void in() { SetConsoleTextAttribute(hConsole, 10); }
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
SetConsoleTextAttribute(hConsole, 15);
cin >> head;
in(move(tail)...);
}
#else
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
#endif
inline bool out() { return (cout << '\n', 0); }
template <class T> inline bool out(T t) { return (cout << t << '\n', 0); }
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void alloc(T &c, lint s) {
rep(c.size()) c[i].resize(s);
}
#define alc alloc
#ifdef __ENV_TQK__
inline bool deb() {
SetConsoleTextAttribute(hConsole, 10);
return (cout << '\n', 0);
}
template <class T> inline bool deb(T t) {
return (SetConsoleTextAttribute(hConsole, 12), cout << t << '\n',
SetConsoleTextAttribute(hConsole, 10), 0);
}
template <class Head, class... Tail> inline bool deb(Head head, Tail... tail) {
SetConsoleTextAttribute(hConsole, 12);
cout << head << ' ';
deb(move(tail)...);
return 0;
}
#define dsp(ex) sp(ex)
#define dno(ex) no(ex)
#define look(v) \
SetConsoleTextAttribute(hConsole, 12), cout << #v << ": ", deb(v);
#else
#define deb(...) 0
#define dsp(ex) 0
#define dno(ex) 0
#define look(v) 0
#endif
#pragma endregion
#pragma region TA
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define tvin(ty1, ty2, name, size, val) \
vector<ty1> _in_vec(size); \
vector<ty2> a(size); \
in(_in_vec); \
{ \
ty1 e; \
rep(size) e = _in_vec[i], name[i] = val; \
}
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi e.first
#define se e.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE\n" : "IMPOSSIBLE\n"), 0
#define Possible(c) cout << ((c) ? "Possible\n" : "Impossible\n"), 0
#define o(p) cout << p << endl, 0
#define sp(p) cout << p << " ", 0
#define no(p) cout << p, 0
#define psort(l, r) \
if (l > r) \
swap(l, r);
inline constexpr lint gcd(lint a, lint b) {
if (!a || !b)
return 0;
while (b) {
lint c = b;
b = a % b;
a = c;
}
return a;
}
template <typename T> inline constexpr bool chmin(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool chmax(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
#define ve(type) vector<type>
#define fn(ty1, ty2, ex) [](ty1 l, ty2 r) { return (ex); }
#define lfn(ex) [](lint l, lint r) { return (ex); }
template <typename T, class F>
T fold(vector<T> a, F f, T e = 0, lint l = 0, lint r = linf) {
for (lint i = l; i < r && i < a.size(); ++i)
e = f(e, a[i]);
return e;
}
#pragma endregion
#pragma region mint
#define md_tmp template <uint_fast64_t md = 1000000007>
md_tmp class modint {
using u64 = uint_fast64_t;
public:
u64 a;
constexpr modint(const lint x = 0) noexcept : a((x + md) % md) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator^(const lint rhs) const noexcept {
return modint(*this) ^= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= md)
a -= md;
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a)
a += md;
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % md;
return *this;
}
constexpr modint &operator^=(const lint rhs) noexcept {
if (!rhs)
return *this = 1;
u64 exp = rhs - 1;
modint base = this->a;
while (exp) {
if (exp & 1)
*this *= base;
base *= base;
exp >>= 1;
}
return *this;
}
constexpr modint &operator/=(const modint rhs) noexcept {
a = (*this * (rhs ^ (md - 2))).a;
return *this;
}
};
using mint = modint<>;
md_tmp istream &operator>>(istream &os, modint<md> &m) {
os >> m.a, m.a %= md;
return os;
}
md_tmp ostream &operator<<(ostream &os, const modint<md> &m) {
return os << m.a;
}
md_tmp modint<md> ncr(lint n, lint r) { // O(r)//use bigncr
if (n < r || n < 0 || r < 0)
return modint<md>(0);
modint<md> ncr_res = 1, ncr_div = 1;
rep(r) ncr_res *= (n - i), ncr_div *= (r - i);
return ncr_res / ncr_div;
}
// lint ncri(lint n,lint r){//O(r)
// if(n<r||n<0||r<0)return 0;
// lint ncr_res=1,ncr_div=1;
// rep(r)ncr_res*=(n-i),ncr_div*=(r-i);
// return ncr_res/ncr_div;
//}
#ifndef _AOJ_
inline modint<> operator"" m(const unsigned long long n) { return modint<>(n); }
inline lint operator"" z(const unsigned long long n) { return lint(n); }
#endif
#pragma endregion
#pragma region P
class P {
public:
lint f, s;
P(lint a, lint b) : f(a), s(b){};
P() : f(0), s(0){};
};
istream &operator>>(istream &os, P &p) {
os >> p.f >> p.s;
return os;
}
constexpr bool operator<(const P &l, const P &r) {
return (l.f - r.f ? l.f < r.f : l.s < r.s);
}
constexpr bool operator>(const P &l, const P &r) {
return (l.f - r.f ? l.f > r.f : l.s > r.s);
}
constexpr bool operator<=(const P &l, const P &r) {
return !(l.f - r.f ? l.f > r.f : l.s > r.s);
}
constexpr bool operator>=(const P &l, const P &r) {
return !(l.f - r.f ? l.f < r.f : l.s < r.s);
}
#pragma endregion
#pragma region rec_lambda
/*
usage:
auto res=rec([&](auto f,int n...){
if(n<2)return n;
return f(n-=2);
})(114514);
*/
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && \
(__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
rec(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&...args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
#pragma endregion
#pragma region start
struct Start {
Start() {
#ifndef _C_INPUT_
cin.tie(0), cout.tie(0);
ios::sync_with_stdio(0);
#endif
cout << fixed << setprecision(10);
}
} __start;
#pragma endregion
#pragma endregion
#pragma region const
#define MAXN 101010
#define mod 1000000007
const ld pi = 3.14159265358979323846;
const ld tau = (1. + sqrt(5)) / 2.;
P d4[4] = {P(1, 0), P(0, 1), P(-1, 0), P(0, -1)};
P d8[8] = {P(1, 0), P(1, 1), P(0, 1), P(-1, 1),
P(-1, 0), P(-1, -1), P(0, -1), P(1, -1)};
const string AUTO_YES = "Yes";
const string AUTO_NO = "No";
int cho(bool c) { return out((c ? AUTO_YES : AUTO_NO)); }
#pragma endregion
#pragma region solve
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;
}
#pragma endregion
#pragma region main
int main() {
lint N;
scanf("%lld", &N);
std::vector<lint> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
#pragma endregion
// sub-EOF
| #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;
}
#endif
// sub-BOF
// laptop
// author: Tqk
//#define _AOJ_
#define _C_INPUT_
#pragma region template
#pragma region basic
#define IN_FILE "./in.txt"
//#pragma GCC optimize ("O3")
#pragma warning(disable : 4455 4244 4067 4068 4996)
#pragma GCC target("avx")
#pragma GCC diagnostic ignored "-Wliteral-suffix"
#define NOMINMAX
#include "bits/stdc++.h"
using namespace std;
typedef int64_t lint;
typedef long double ld;
typedef string cs;
#define linf 1152921504606846976
#pragma endregion
#pragma region rep
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1, _2, _3, _4, name, ...) name
#define _getname3(_1, _2, _3, name, ...) name
#define _trep2(tuple) _rep2 tuple
#define _trep3(tuple) _rep3 tuple
#define _trep4(tuple) _rep4 tuple
#define _rep1(n) for (lint i = 0; i < n; ++i)
#define _rep2(i, n) for (lint i = 0; i < n; ++i)
#define _rep3(i, a, b) for (lint i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (lint i = a; i < b; i += c)
#define _trrep2(tuple) _rrep2 tuple
#define _trrep3(tuple) _rrep3 tuple
#define _trrep4(tuple) _rrep4 tuple
#define _rrep1(n) for (lint i = n - 1; i >= 0; --i)
#define _rrep2(i, n) for (lint i = n - 1; i >= 0; --i)
#define _rrep3(i, a, b) for (lint i = b - 1; i >= a; --i)
#define _rrep4(i, a, b, c) \
for (lint i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rep(...) \
_vcppunko4((__VA_ARGS__, _trep4, _trep3, _trep2, _rep1))((__VA_ARGS__))
#define per(...) \
_vcppunko4((__VA_ARGS__, _trrep4, _trrep3, _trrep2, _rrep1))((__VA_ARGS__))
#define each(c) for (auto &e : c)
#pragma endregion
#pragma region io
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) os << ' ' << vec[i];
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) os << ' ' << deq[i];
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> &s) {
each(s) os << e << " ";
return os;
}
#ifdef __ENV_TQK__
/*
ifstream infile(IN_FILE);
template<class T>
ifstream& operator>>(ifstream& is,vector<T>& vec);
template<class T,size_t size>
ifstream& operator>>(ifstream& is,array<T,size>& vec);
template<class T,class L>
ifstream& operator>>(ifstream& is,pair<T,L>& p);
template<class T>
ifstream& operator>>(ifstream& is,vector<T>& vec){ for(T& x: vec) is>>x;return
is; } template<class T,class L> ifstream& operator>>(ifstream& is,pair<T,L>& p){
is>>p.first;is>>p.second;return is; } inline void fin(){} template <class
Head,class... Tail> inline void fin(Head&& head,Tail&&... tail){
infile>>head;fin(move(tail)...); }
*/
#include <Windows.h>
HANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);
inline void in() { SetConsoleTextAttribute(hConsole, 10); }
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
SetConsoleTextAttribute(hConsole, 15);
cin >> head;
in(move(tail)...);
}
#else
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
#endif
inline bool out() { return (cout << '\n', 0); }
template <class T> inline bool out(T t) { return (cout << t << '\n', 0); }
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void alloc(T &c, lint s) {
rep(c.size()) c[i].resize(s);
}
#define alc alloc
#ifdef __ENV_TQK__
inline bool deb() {
SetConsoleTextAttribute(hConsole, 10);
return (cout << '\n', 0);
}
template <class T> inline bool deb(T t) {
return (SetConsoleTextAttribute(hConsole, 12), cout << t << '\n',
SetConsoleTextAttribute(hConsole, 10), 0);
}
template <class Head, class... Tail> inline bool deb(Head head, Tail... tail) {
SetConsoleTextAttribute(hConsole, 12);
cout << head << ' ';
deb(move(tail)...);
return 0;
}
#define dsp(ex) sp(ex)
#define dno(ex) no(ex)
#define look(v) \
SetConsoleTextAttribute(hConsole, 12), cout << #v << ": ", deb(v);
#else
#define deb(...) 0
#define dsp(ex) 0
#define dno(ex) 0
#define look(v) 0
#endif
#pragma endregion
#pragma region TA
#define lin(...) \
lint __VA_ARGS__; \
in(__VA_ARGS__)
#define stin(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define vin(type, name, size) \
vector<type> name(size); \
in(name)
#define tvin(ty1, ty2, name, size, val) \
vector<ty1> _in_vec(size); \
vector<ty2> a(size); \
in(_in_vec); \
{ \
ty1 e; \
rep(size) e = _in_vec[i], name[i] = val; \
}
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi e.first
#define se e.second
#define YES(c) cout << ((c) ? "YES\n" : "NO\n"), 0
#define Yes(c) cout << ((c) ? "Yes\n" : "No\n"), 0
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE\n" : "IMPOSSIBLE\n"), 0
#define Possible(c) cout << ((c) ? "Possible\n" : "Impossible\n"), 0
#define o(p) cout << p << endl, 0
#define sp(p) cout << p << " ", 0
#define no(p) cout << p, 0
#define psort(l, r) \
if (l > r) \
swap(l, r);
inline constexpr lint gcd(lint a, lint b) {
if (!a || !b)
return 0;
while (b) {
lint c = b;
b = a % b;
a = c;
}
return a;
}
template <typename T> inline constexpr bool chmin(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool chmax(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
#define ve(type) vector<type>
#define fn(ty1, ty2, ex) [](ty1 l, ty2 r) { return (ex); }
#define lfn(ex) [](lint l, lint r) { return (ex); }
template <typename T, class F>
T fold(vector<T> a, F f, T e = 0, lint l = 0, lint r = linf) {
for (lint i = l; i < r && i < a.size(); ++i)
e = f(e, a[i]);
return e;
}
#pragma endregion
#pragma region mint
#define md_tmp template <uint_fast64_t md = 1000000007>
md_tmp class modint {
using u64 = uint_fast64_t;
public:
u64 a;
constexpr modint(const lint x = 0) noexcept : a((x + md) % md) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator^(const lint rhs) const noexcept {
return modint(*this) ^= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= md)
a -= md;
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a)
a += md;
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % md;
return *this;
}
constexpr modint &operator^=(const lint rhs) noexcept {
if (!rhs)
return *this = 1;
u64 exp = rhs - 1;
modint base = this->a;
while (exp) {
if (exp & 1)
*this *= base;
base *= base;
exp >>= 1;
}
return *this;
}
constexpr modint &operator/=(const modint rhs) noexcept {
a = (*this * (rhs ^ (md - 2))).a;
return *this;
}
};
using mint = modint<>;
md_tmp istream &operator>>(istream &os, modint<md> &m) {
os >> m.a, m.a %= md;
return os;
}
md_tmp ostream &operator<<(ostream &os, const modint<md> &m) {
return os << m.a;
}
md_tmp modint<md> ncr(lint n, lint r) { // O(r)//use bigncr
if (n < r || n < 0 || r < 0)
return modint<md>(0);
modint<md> ncr_res = 1, ncr_div = 1;
rep(r) ncr_res *= (n - i), ncr_div *= (r - i);
return ncr_res / ncr_div;
}
// lint ncri(lint n,lint r){//O(r)
// if(n<r||n<0||r<0)return 0;
// lint ncr_res=1,ncr_div=1;
// rep(r)ncr_res*=(n-i),ncr_div*=(r-i);
// return ncr_res/ncr_div;
//}
#ifndef _AOJ_
inline modint<> operator"" m(const unsigned long long n) { return modint<>(n); }
inline lint operator"" z(const unsigned long long n) { return lint(n); }
#endif
#pragma endregion
#pragma region P
class P {
public:
lint f, s;
P(lint a, lint b) : f(a), s(b){};
P() : f(0), s(0){};
};
istream &operator>>(istream &os, P &p) {
os >> p.f >> p.s;
return os;
}
constexpr bool operator<(const P &l, const P &r) {
return (l.f - r.f ? l.f < r.f : l.s < r.s);
}
constexpr bool operator>(const P &l, const P &r) {
return (l.f - r.f ? l.f > r.f : l.s > r.s);
}
constexpr bool operator<=(const P &l, const P &r) {
return !(l.f - r.f ? l.f > r.f : l.s > r.s);
}
constexpr bool operator>=(const P &l, const P &r) {
return !(l.f - r.f ? l.f < r.f : l.s < r.s);
}
#pragma endregion
#pragma region rec_lambda
/*
usage:
auto res=rec([&](auto f,int n...){
if(n<2)return n;
return f(n-=2);
})(114514);
*/
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && \
(__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
rec(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&...args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
#pragma endregion
#pragma region start
struct Start {
Start() {
#ifndef _C_INPUT_
cin.tie(0), cout.tie(0);
ios::sync_with_stdio(0);
#endif
cout << fixed << setprecision(10);
}
} __start;
#pragma endregion
#pragma endregion
#pragma region const
#define MAXN 101010
#define mod 1000000007
const ld pi = 3.14159265358979323846;
const ld tau = (1. + sqrt(5)) / 2.;
P d4[4] = {P(1, 0), P(0, 1), P(-1, 0), P(0, -1)};
P d8[8] = {P(1, 0), P(1, 1), P(0, 1), P(-1, 1),
P(-1, 0), P(-1, -1), P(0, -1), P(1, -1)};
const string AUTO_YES = "Yes";
const string AUTO_NO = "No";
int cho(bool c) { return out((c ? AUTO_YES : AUTO_NO)); }
#pragma endregion
#pragma region solve
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;
}
#pragma endregion
#pragma region main
int main() {
lint N;
scanf("%lld", &N);
std::vector<lint> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
#pragma endregion
// sub-EOF
| [
"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 % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> L(n + 2), R(n + 2);
for (int i = 1; i <= n; i++)
L[i] = gcd(a[i], L[i - 1]);
for (int i = n; i >= 1; i--)
R[i] = gcd(a[i], R[i + 1]);
int ans = 0;
for (int i = 1; i < n; i++) {
int c = gcd(L[i - 1], R[i + 1]);
ans = max(ans, c);
}
cout << ans << endl;
} | #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 % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<int> L(n + 2), R(n + 2);
for (int i = 1; i <= n; i++)
L[i] = gcd(a[i], L[i - 1]);
for (int i = n; i >= 1; i--)
R[i] = gcd(a[i], R[i + 1]);
int ans = 1;
for (int i = 1; i <= n; i++) {
int c = gcd(L[i - 1], R[i + 1]);
ans = max(ans, c);
}
cout << ans << endl;
} | [
"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[0] = a[n - 1];
left[0] = a[0];
for (int i = 1; i < n - 1; i++) {
left[i] = GCD(left[i - 1], a[i]);
}
for (int i = 1; i < n - 1; i++) {
right[i] = GCD(right[i - 1], a[n - 1 - i]);
}
ll ans = 0, gcd;
for (int i = 0; i < n - 2; i++) {
gcd = GCD(left[i], right[i]);
ans = max(gcd, ans);
}
ans = max({left[n - 2], right[n - 2], ans});
cout << ans << endl;
} | #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[0] = a[n - 1];
left[0] = a[0];
for (int i = 1; i < n - 1; i++) {
left[i] = GCD(left[i - 1], a[i]);
}
for (int i = 1; i < n - 1; i++) {
right[i] = GCD(right[i - 1], a[n - 1 - i]);
}
ll ans = 1, gcd;
for (int i = 0; i < n - 2; i++) {
gcd = GCD(left[i], right[n - 3 - i]);
ans = max(gcd, ans);
}
ans = max({left[n - 2], right[n - 2], ans});
cout << ans << endl;
} | [
"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;
data.resize(2 * n, identity);
}
segment_tree(std::vector<T> const &v, T ide, F _f) : f(_f), identity(ide) {
build(v);
}
void build(std::vector<T> const &v) {
int sz = v.size();
n = 1;
while (n < sz)
n <<= 1;
data.resize(2 * n, identity);
for (int i = 0; i < sz; ++i)
data[i + n] = v[i];
for (int i = n - 1; i > 0; --i)
data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
}
void set(int i, T x) {
i += n;
data[i] = x;
while (i, i >>= 1)
data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
}
T query(int l, int r) const {
l += n, r += n;
T x = identity;
while (l < r) {
if (l & 1)
x = f(x, data[l++]);
if (r & 1)
x = f(x, data[--r]);
l >>= 1, r >>= 1;
}
return x;
}
T operator[](int i) const { return data[i + n]; }
};
template <class T, class F> auto make_segtree(int n, T ide, F f) {
return segment_tree<T, F>(n, ide, f);
}
template <class T, class F>
auto make_segtree(std::vector<T> const &v, T ide, F f) {
return segment_tree<T, F>(v, ide, f);
}
signed main() {
int n;
cin >> n;
std::vector<int64_t> a(n);
for (auto &ai : a)
cin >> ai;
auto gcd = [](auto a, auto b) {
while (1) {
a %= b;
std::swap(a, b);
}
return a;
};
auto seg = make_segtree<int64_t>(a, 0, gcd);
int64_t ans = 1;
for (int i = 0; i < n; ++i) {
seg.set(i, 0);
ans = std::max(ans, seg.query(0, n));
seg.set(i, a[i]);
}
cout << (ans) << endl;
} | #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;
data.resize(2 * n, identity);
}
segment_tree(std::vector<T> const &v, T ide, F _f) : f(_f), identity(ide) {
build(v);
}
void build(std::vector<T> const &v) {
int sz = v.size();
n = 1;
while (n < sz)
n <<= 1;
data.resize(2 * n, identity);
for (int i = 0; i < sz; ++i)
data[i + n] = v[i];
for (int i = n - 1; i > 0; --i)
data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
}
void set(int i, T x) {
i += n;
data[i] = x;
while (i, i >>= 1)
data[i] = f(data[i << 1 | 0], data[i << 1 | 1]);
}
T query(int l, int r) const {
l += n, r += n;
T x = identity;
while (l < r) {
if (l & 1)
x = f(x, data[l++]);
if (r & 1)
x = f(x, data[--r]);
l >>= 1, r >>= 1;
}
return x;
}
T operator[](int i) const { return data[i + n]; }
};
template <class T, class F> auto make_segtree(int n, T ide, F f) {
return segment_tree<T, F>(n, ide, f);
}
template <class T, class F>
auto make_segtree(std::vector<T> const &v, T ide, F f) {
return segment_tree<T, F>(v, ide, f);
}
signed main() {
int n;
cin >> n;
std::vector<int64_t> a(n);
for (auto &ai : a)
cin >> ai;
auto gcd = [](auto a, auto b) {
while (b) {
a %= b;
std::swap(a, b);
}
return a;
};
auto seg = make_segtree<int64_t>(a, 0, gcd);
int64_t ans = 1;
for (int i = 0; i < n; ++i) {
seg.set(i, 0);
ans = std::max(ans, seg.query(0, n));
seg.set(i, a[i]);
}
cout << (ans) << endl;
} | [
"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++)
left[i + 1] = gcd(left[i], a[i]);
for (int i = n - 1; i >= 0; i--)
right[i] = gcd(right[i + 1], a[i]);
ll ma = 1;
for (int i = 0; i + 1 < n; i++) {
ma = max(ma, gcd(left[i], right[i + 1]));
}
cout << ma << endl;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
solve();
return 0;
}
| #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++)
left[i + 1] = gcd(left[i], a[i]);
for (int i = n - 1; i >= 0; i--)
right[i] = gcd(right[i + 1], a[i]);
ll ma = 1;
for (int i = 0; i < n; i++) {
ma = max(ma, gcd(left[i], right[i + 1]));
}
cout << ma << endl;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
solve();
return 0;
}
| [
"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;
typedef long long ll;
template <typename T> using V = vector<T>;
using VL = V<ll>;
using VVL = V<VL>;
template <typename T, typename U> using P = pair<T, U>;
using PL = P<ll, ll>;
using VPL = V<PL>;
template <typename T> inline bool chmax(T &a, T b);
template <typename T> inline bool chmin(T &a, T b);
void print_ints(vector<ll> v);
template <typename T> void drop(T a);
ll mygcd(ll a, ll b) { return b ? mygcd(b, a % b) : a; }
template <typename Monoid> struct SegmentTree {
ll n; // 最下段の数
vector<Monoid> nodes;
using F = function<Monoid(Monoid, Monoid)>;
const F f;
const Monoid UNITY;
SegmentTree(vector<Monoid> vs, const Monoid &unity, const F f)
: UNITY(unity), f(f) {
n = 1;
while (n < vs.size()) {
n *= 2;
}
nodes = vector<ll>(2 * n - 1, UNITY);
rep(i, vs.size()) nodes[i + n - 1] = vs[i];
for (ll i = n - 2; i >= 0; i--) {
nodes[i] = f(nodes[i * 2 + 1], nodes[i * 2 + 2]);
}
}
void update(Monoid i, Monoid val) {
i += n - 1;
nodes[i] = val;
while (i > 0) {
i = (i - 1) / 2;
nodes[i] = f(nodes[2 * i + 1], nodes[2 * i + 2]);
}
}
// [from, to)
Monoid query(ll from, ll to) {
ll res = queryInternal(from, to, 0, 0, n);
return res;
}
Monoid queryInternal(ll from, ll to, ll k, ll l, ll r) {
if (r <= from || to <= l) {
return UNITY;
}
if (from <= l && r <= to) {
return nodes[k];
}
ll vl = queryInternal(from, to, 2 * k + 1, l, (l + r) / 2);
ll vr = queryInternal(from, to, 2 * k + 2, (l + r) / 2, r);
return f(vl, vr);
}
};
void solve() {
ll N;
cin >> N;
VL as(N);
rep(i, N) cin >> as[i];
SegmentTree<ll> st(as, 0ll, mygcd);
ll res = 0;
rep(i, N) {
ll l = st.query(0, i);
ll r = st.query(i + 1, as.size());
chmax(res, mygcd(l, r));
}
cout << res << endl;
}
template <class Monoid, class Action> struct LazySegTree {
using FuncMonoid = function<Monoid(Monoid, Monoid)>;
using FuncAction = function<void(Monoid &, Action)>;
using FuncLazy = function<void(Action &, Action)>;
FuncMonoid FM;
FuncAction FA;
FuncLazy FL;
Monoid UNITY_MONOID;
Action UNITY_LAZY;
ll SIZE, HEIGHT;
vector<Monoid> dat;
vector<Action> lazy;
LazySegTree(ll n, const FuncMonoid fm, const FuncAction fa, const FuncLazy fl,
const Monoid &unity_monoid, const Action &unity_lazy)
: FM(fm), FA(fa), FL(fl), UNITY_MONOID(unity_monoid),
UNITY_LAZY(unity_lazy) {
SIZE = 1;
HEIGHT = 0;
while (SIZE < n)
SIZE <<= 1, ++HEIGHT;
dat.assign(SIZE * 2, UNITY_MONOID);
lazy.assign(SIZE * 2, UNITY_LAZY);
}
void init(ll n, const FuncMonoid fm, const FuncAction fa, const FuncLazy fl,
const Monoid &unity_monoid, const Action &unity_lazy) {
FM = fm;
FA = fa;
FL = fl;
UNITY_MONOID = unity_monoid;
UNITY_LAZY = unity_lazy;
SIZE = 1;
HEIGHT = 0;
while (SIZE < n)
SIZE <<= 1, ++HEIGHT;
dat.assign(SIZE * 2, UNITY_MONOID);
lazy.assign(SIZE * 2, UNITY_LAZY);
}
void set(ll a, const Monoid &v) { dat[a + SIZE] = v; }
void build() {
for (ll k = SIZE - 1; k > 0; --k)
dat[k] = FM(dat[k * 2], dat[k * 2 + 1]);
}
inline void evaluate(ll k) {
if (lazy[k] == UNITY_LAZY)
return;
if (k < SIZE)
FL(lazy[k * 2], lazy[k]), FL(lazy[k * 2 + 1], lazy[k]);
FA(dat[k], lazy[k]);
lazy[k] = UNITY_LAZY;
}
inline void update(ll a, ll b, const Action &v, ll k, ll l, ll r) {
evaluate(k);
if (a <= l && r <= b)
FL(lazy[k], v), evaluate(k);
else if (a < r && l < b) {
update(a, b, v, k * 2, l, (l + r) >> 1),
update(a, b, v, k * 2 + 1, (l + r) >> 1, r);
dat[k] = FM(dat[k * 2], dat[k * 2 + 1]);
}
}
/* [a, b) */
inline void update(ll a, ll b, const Action &v) {
update(a, b, v, 1, 0, SIZE);
}
inline Monoid get(ll a, ll b, ll k, ll l, ll r) {
evaluate(k);
if (a <= l && r <= b)
return dat[k];
else if (a < r && l < b)
return FM(get(a, b, k * 2, l, (l + r) >> 1),
get(a, b, k * 2 + 1, (l + r) >> 1, r));
else
return UNITY_MONOID;
}
/* [a, b) */
inline Monoid get(ll a, ll b) { return get(a, b, 1, 0, SIZE); }
inline Monoid operator[](ll a) { return get(a, a + 1); }
};
void solve2() {
ll N;
cin >> N;
auto fm = [](ll a, ll b) { return mygcd(a, b); };
auto fa = [](ll &a, ll b) { a = mygcd(a, b); };
auto fl = [](ll &a, ll b) { a = mygcd(a, b); };
LazySegTree<ll, ll> st(N, fm, fa, fl, 0, 0);
rep(i, N) {
ll a;
cin >> a;
st.set(i, a);
}
ll res = 1;
rep(i, N) { chmax(res, mygcd(st.get(0, i), st.get(i + 1, N))); }
cout << res << "\n";
}
struct exit_exception : public std::exception {
const char *what() const throw() { return "Exited"; }
};
#ifndef TEST
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
try {
solve2();
} catch (exit_exception &e) {
}
return 0;
}
#endif
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void print_ints(vector<ll> v) {
rep(i, v.size()) {
if (i > 0) {
cout << " ";
}
cout << v[i];
}
cout << endl;
}
template <typename T> void drop(T res) {
cout << res << endl;
throw exit_exception();
}
| // 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;
typedef long long ll;
template <typename T> using V = vector<T>;
using VL = V<ll>;
using VVL = V<VL>;
template <typename T, typename U> using P = pair<T, U>;
using PL = P<ll, ll>;
using VPL = V<PL>;
template <typename T> inline bool chmax(T &a, T b);
template <typename T> inline bool chmin(T &a, T b);
void print_ints(vector<ll> v);
template <typename T> void drop(T a);
ll mygcd(ll a, ll b) { return b ? mygcd(b, a % b) : a; }
template <typename Monoid> struct SegmentTree {
ll n; // 最下段の数
vector<Monoid> nodes;
using F = function<Monoid(Monoid, Monoid)>;
const F f;
const Monoid UNITY;
SegmentTree(vector<Monoid> vs, const Monoid &unity, const F f)
: UNITY(unity), f(f) {
n = 1;
while (n < vs.size()) {
n *= 2;
}
nodes = vector<ll>(2 * n - 1, UNITY);
rep(i, vs.size()) nodes[i + n - 1] = vs[i];
for (ll i = n - 2; i >= 0; i--) {
nodes[i] = f(nodes[i * 2 + 1], nodes[i * 2 + 2]);
}
}
void update(Monoid i, Monoid val) {
i += n - 1;
nodes[i] = val;
while (i > 0) {
i = (i - 1) / 2;
nodes[i] = f(nodes[2 * i + 1], nodes[2 * i + 2]);
}
}
// [from, to)
Monoid query(ll from, ll to) {
ll res = queryInternal(from, to, 0, 0, n);
return res;
}
Monoid queryInternal(ll from, ll to, ll k, ll l, ll r) {
if (r <= from || to <= l) {
return UNITY;
}
if (from <= l && r <= to) {
return nodes[k];
}
ll vl = queryInternal(from, to, 2 * k + 1, l, (l + r) / 2);
ll vr = queryInternal(from, to, 2 * k + 2, (l + r) / 2, r);
return f(vl, vr);
}
};
void solve() {
ll N;
cin >> N;
VL as(N);
rep(i, N) cin >> as[i];
SegmentTree<ll> st(as, 0ll, mygcd);
ll res = 0;
rep(i, N) {
ll l = st.query(0, i);
ll r = st.query(i + 1, as.size());
chmax(res, mygcd(l, r));
}
cout << res << endl;
}
template <class Monoid, class Action> struct LazySegTree {
using FuncMonoid = function<Monoid(Monoid, Monoid)>;
using FuncAction = function<void(Monoid &, Action)>;
using FuncLazy = function<void(Action &, Action)>;
FuncMonoid FM;
FuncAction FA;
FuncLazy FL;
Monoid UNITY_MONOID;
Action UNITY_LAZY;
ll SIZE, HEIGHT;
vector<Monoid> dat;
vector<Action> lazy;
LazySegTree(ll n, const FuncMonoid fm, const FuncAction fa, const FuncLazy fl,
const Monoid &unity_monoid, const Action &unity_lazy)
: FM(fm), FA(fa), FL(fl), UNITY_MONOID(unity_monoid),
UNITY_LAZY(unity_lazy) {
SIZE = 1;
HEIGHT = 0;
while (SIZE < n)
SIZE <<= 1, ++HEIGHT;
dat.assign(SIZE * 2, UNITY_MONOID);
lazy.assign(SIZE * 2, UNITY_LAZY);
}
void init(ll n, const FuncMonoid fm, const FuncAction fa, const FuncLazy fl,
const Monoid &unity_monoid, const Action &unity_lazy) {
FM = fm;
FA = fa;
FL = fl;
UNITY_MONOID = unity_monoid;
UNITY_LAZY = unity_lazy;
SIZE = 1;
HEIGHT = 0;
while (SIZE < n)
SIZE <<= 1, ++HEIGHT;
dat.assign(SIZE * 2, UNITY_MONOID);
lazy.assign(SIZE * 2, UNITY_LAZY);
}
void set(ll a, const Monoid &v) { dat[a + SIZE] = v; }
void build() {
for (ll k = SIZE - 1; k > 0; --k)
dat[k] = FM(dat[k * 2], dat[k * 2 + 1]);
}
inline void evaluate(ll k) {
if (lazy[k] == UNITY_LAZY)
return;
if (k < SIZE)
FL(lazy[k * 2], lazy[k]), FL(lazy[k * 2 + 1], lazy[k]);
FA(dat[k], lazy[k]);
lazy[k] = UNITY_LAZY;
}
inline void update(ll a, ll b, const Action &v, ll k, ll l, ll r) {
evaluate(k);
if (a <= l && r <= b)
FL(lazy[k], v), evaluate(k);
else if (a < r && l < b) {
update(a, b, v, k * 2, l, (l + r) >> 1),
update(a, b, v, k * 2 + 1, (l + r) >> 1, r);
dat[k] = FM(dat[k * 2], dat[k * 2 + 1]);
}
}
/* [a, b) */
inline void update(ll a, ll b, const Action &v) {
update(a, b, v, 1, 0, SIZE);
}
inline Monoid get(ll a, ll b, ll k, ll l, ll r) {
evaluate(k);
if (a <= l && r <= b)
return dat[k];
else if (a < r && l < b)
return FM(get(a, b, k * 2, l, (l + r) >> 1),
get(a, b, k * 2 + 1, (l + r) >> 1, r));
else
return UNITY_MONOID;
}
/* [a, b) */
inline Monoid get(ll a, ll b) { return get(a, b, 1, 0, SIZE); }
inline Monoid operator[](ll a) { return get(a, a + 1); }
};
void solve2() {
ll N;
cin >> N;
auto fm = [](ll a, ll b) { return mygcd(a, b); };
auto fa = [](ll &a, ll b) { a = mygcd(a, b); };
auto fl = [](ll &a, ll b) { a = mygcd(a, b); };
LazySegTree<ll, ll> st(N, fm, fa, fl, 0, 0);
rep(i, N) {
ll a;
cin >> a;
st.set(i, a);
}
st.build();
ll res = 1;
rep(i, N) { chmax(res, mygcd(st.get(0, i), st.get(i + 1, N))); }
cout << res << "\n";
}
struct exit_exception : public std::exception {
const char *what() const throw() { return "Exited"; }
};
#ifndef TEST
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
try {
solve2();
} catch (exit_exception &e) {
}
return 0;
}
#endif
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void print_ints(vector<ll> v) {
rep(i, v.size()) {
if (i > 0) {
cout << " ";
}
cout << v[i];
}
cout << endl;
}
template <typename T> void drop(T res) {
cout << res << endl;
throw exit_exception();
}
| [
"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[110000];
ll b[110000];
ll c[110000];
ll d[110000];
rep(i, 0, n) cin >> a[i];
b[0] = 0;
c[n] = 0;
rep(i, 0, n) b[i + 1] = GCD(b[i], a[i]);
for (int i = n - 1; i >= 0; i--)
c[i] = GCD(c[i + 1], a[i]);
ll ans = 0;
rep(i, 0, n - 1) {
d[i] = GCD(b[i], c[i + 1]);
ans = max(ans, d[i]);
}
cout << ans;
} | #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[110000];
ll b[110000];
ll c[110000];
ll d[110000];
rep(i, 0, n) cin >> a[i];
b[0] = 0;
c[n] = 0;
rep(i, 0, n) b[i + 1] = GCD(b[i], a[i]);
for (int i = n - 1; i >= 0; i--)
c[i] = GCD(c[i + 1], a[i]);
ll ans = 0;
rep(i, 0, n) {
d[i] = GCD(b[i], c[i + 1]);
ans = max(ans, d[i]);
}
cout << ans;
} | [
"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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), LS(N), RS(N);
rep(i, N) { cin >> A[i]; }
ll tmp = A[0];
rep(i, N) {
tmp = __gcd(A[i], tmp);
LS[i] = tmp;
}
tmp = A[N - 1];
rep(i, N) {
tmp = __gcd(A[N - 1 - i], tmp);
RS[N - 1 - i] = tmp;
}
ll M = 1;
rep(i, N) {
if (i == 0) {
cmax(M, RS[1]);
continue;
} else if (i == N - 1) {
cmax(M, LS[N - 1]);
continue;
}
cmax(M, __gcd(LS[i - 1], RS[i + 1]));
}
cout << M << endl;
} | #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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), LS(N), RS(N);
rep(i, N) { cin >> A[i]; }
ll tmp = A[0];
rep(i, N) {
tmp = __gcd(A[i], tmp);
LS[i] = tmp;
}
tmp = A[N - 1];
rep(i, N) {
tmp = __gcd(A[N - 1 - i], tmp);
RS[N - 1 - i] = tmp;
}
ll M = 0;
rep(i, N) {
if (i == 0) {
cmax(M, RS[1]);
continue;
} else if (i == N - 1) {
cmax(M, LS[N - 2]);
continue;
}
cmax(M, __gcd(LS[i - 1], RS[i + 1]));
}
cout << M << endl;
} | [
"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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), LS(N), RS(N);
rep(i, N) { cin >> A[i]; }
ll tmp = A[0];
rep(i, N) {
tmp = __gcd(A[i], tmp);
LS[i] = tmp;
}
tmp = A[N - 1];
rep(i, N) {
tmp = __gcd(A[N - 1 - i], tmp);
RS[N - 1 - i] = tmp;
}
ll M = 0;
rep(i, N) {
if (i == 0) {
cmax(M, RS[1]);
continue;
} else if (i == N - 1) {
cmax(M, LS[N - 1]);
continue;
}
cmax(M, __gcd(LS[i - 1], RS[i + 1]));
}
cout << M << endl;
} | #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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), LS(N), RS(N);
rep(i, N) { cin >> A[i]; }
ll tmp = A[0];
rep(i, N) {
tmp = __gcd(A[i], tmp);
LS[i] = tmp;
}
tmp = A[N - 1];
rep(i, N) {
tmp = __gcd(A[N - 1 - i], tmp);
RS[N - 1 - i] = tmp;
}
ll M = 0;
rep(i, N) {
if (i == 0) {
cmax(M, RS[1]);
continue;
} else if (i == N - 1) {
cmax(M, LS[N - 2]);
continue;
}
cmax(M, __gcd(LS[i - 1], RS[i + 1]));
}
cout << M << endl;
} | [
"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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), LS(N), RS(N);
rep(i, N) { cin >> A[i]; }
ll tmp = A[0];
rep(i, N) {
tmp = __gcd(A[i], tmp);
LS[i] = tmp;
}
tmp = A[N - 1];
rep(i, N) {
tmp = __gcd(A[N - 1 - i], tmp);
RS[N - 1 - i] = tmp;
}
ll M = 1;
rep(i, N) {
if (i == 0) {
cmax(M, RS[1]);
continue;
} else if (i == N - 1) {
cmax(M, LS[N - 1]);
continue;
}
cmax(M, __gcd(LS[i - 1], RS[i + 1]));
}
cout << M << endl;
} | #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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), LS(N), RS(N);
rep(i, N) { cin >> A[i]; }
ll tmp = A[0];
rep(i, N) {
tmp = __gcd(A[i], tmp);
LS[i] = tmp;
}
tmp = A[N - 1];
rep(i, N) {
tmp = __gcd(A[N - 1 - i], tmp);
RS[N - 1 - i] = tmp;
}
ll M = 1;
rep(i, N) {
if (i == 0) {
cmax(M, RS[1]);
continue;
} else if (i == N - 1) {
cmax(M, LS[N - 2]);
continue;
}
cmax(M, __gcd(LS[i - 1], RS[i + 1]));
}
cout << M << endl;
} | [
"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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), LS(N), RS(N);
rep(i, N) { cin >> A[i]; }
ll tmp = A[0];
rep(i, N) {
tmp = __gcd(A[i], tmp);
LS[i] = tmp;
}
tmp = A[N - 1];
rep(i, N) {
tmp = __gcd(A[N - 1 - i], tmp);
RS[N - 1 - i] = tmp;
}
ll M = 0;
rep(i, N) {
if (i == 0) {
cmax(M, RS[1]);
continue;
} else if (i == N - 1) {
cmax(M, LS[N - 1]);
continue;
}
cmax(M, __gcd(LS[i - 1], RS[i + 1]));
}
cout << M << endl;
} | #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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
ll N;
cin >> N;
vector<ll> A(N), LS(N), RS(N);
rep(i, N) { cin >> A[i]; }
ll tmp = A[0];
rep(i, N) {
tmp = __gcd(A[i], tmp);
LS[i] = tmp;
}
tmp = A[N - 1];
rep(i, N) {
tmp = __gcd(A[N - 1 - i], tmp);
RS[N - 1 - i] = tmp;
}
ll M = 1;
rep(i, N) {
if (i == 0) {
cmax(M, RS[1]);
continue;
} else if (i == N - 1) {
cmax(M, LS[N - 2]);
continue;
}
cmax(M, __gcd(LS[i - 1], RS[i + 1]));
}
cout << M << endl;
} | [
"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];
int M[100000];
int L[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int mini = 1000000000;
int maxi = 0;
int gc = A[0];
for (int i = 0; i < N; i++) {
gc = gcd(gc, A[i]);
M[i] = gc;
}
gc = A[N - 1];
for (int i = 0; i < N; i++) {
gc = gcd(gc, A[N - 1 - i]);
L[N - 1 - i] = gc;
}
for (int i = 1; i < N - 1; i++) {
maxi = max(maxi, gcd(M[i - 1], L[i + 1]));
}
maxi = max(maxi, L[1]);
maxi = max(maxi, M[N - 1]);
cout << maxi << endl;
}
| #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];
int M[100000];
int L[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int mini = 1000000000;
int maxi = 0;
int gc = A[0];
for (int i = 0; i < N; i++) {
gc = gcd(gc, A[i]);
M[i] = gc;
}
gc = A[N - 1];
for (int i = 0; i < N; i++) {
gc = gcd(gc, A[N - 1 - i]);
L[N - 1 - i] = gc;
}
for (int i = 1; i < N - 1; i++) {
maxi = max(maxi, gcd(M[i - 1], L[i + 1]));
}
maxi = max(maxi, L[1]);
maxi = max(maxi, M[N - 2]);
cout << maxi << endl;
}
| [
"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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.front(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i - 2]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| #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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.back(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i - 1]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| [
"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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.front(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i + 1]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| #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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.back(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i - 1]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| [
"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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.front(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| #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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.back(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i - 1]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| [
"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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.front(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i - 1]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| #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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.back(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i - 1]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| [
"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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.front(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[i + 2]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| #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) <= (ll)(n); (i)++)
#define repi2(i, s, e) for (ll(i) = (ll)(s); (i) <= (ll)(e); (i)++)
#define per(i, n) for (ll(i) = (ll)(n)-1LL; (i) >= 0LL; (i)--)
#define per2(i, s, e) for (ll(i) = (ll)(s)-1LL; (i) >= (ll)(e); (i)--)
#define peri(i, n) for (ll(i) = (ll)(n); (i) >= 0LL; (i)--)
#define peri2(i, s, e) for (ll(i) = (ll)(s); (i) >= (ll)(e); (i)--)
#define iter(i, it) for (auto &(i) : (it))
template <typename T, typename U>
ostream &operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template <typename T, typename U>
ostream &operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template <typename T> ostream &operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), F, B;
rep(i, N) cin >> A[i];
F.push_back(A.front());
iter(i, A) F.push_back(__gcd(F.back(), i));
reverse(A.begin(), A.end());
B.push_back(A.front());
iter(i, A) B.push_back(__gcd(B.back(), i));
ll ans = 0;
rep(i, N) {
ll temp;
if (i == 0)
temp = B[N - 1];
else if (i == N - 1)
temp = F[N - 1];
else
temp = __gcd(F[i], B[N - i - 1]);
ans = max(ans, temp);
}
cout << ans << endl;
return 0;
}
| [
"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++) {
left[i + 1] = gcd(left[i], left[i + 1]);
}
for (int i = n; i > 0; i--) {
right[i] = gcd(right[i], right[i + 1]);
}
ans = 0;
for (int i = 1; i < n; i++) {
ans = max(ans, gcd(left[i - 1], right[i + 1]));
}
cout << ans << endl;
return (0);
}
int gcd(int x, int y) {
if (x < y) {
swap(x, y);
}
if (y == 0) {
return (x);
}
int z = x % y;
while (z != 0) {
x = y;
y = z;
z = x % y;
}
return (y);
} | #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; i++) {
left[i + 1] = gcd(left[i], left[i + 1]);
}
for (int i = n; i > 0; i--) {
right[i] = gcd(right[i], right[i + 1]);
}
ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, gcd(left[i - 1], right[i + 1]));
}
cout << ans << endl;
return (0);
}
int gcd(int x, int y) {
if (x < y) {
swap(x, y);
}
if (y == 0) {
return (x);
}
int z = x % y;
while (z != 0) {
x = y;
y = z;
z = x % y;
}
return (y);
} | [
"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) for (auto i = (x).rbegin(); i != (x).rend(); ++i)
//降順はgreater<T>()
#define all(x) (x).begin(), (x).end()
#define rv(s) reverse((s).begin(), (s).end())
// gcd lcmはそのままok
#define gcd(a, b) __gcd(a, b)
#define bits(n) (1LL << (n))
#define pcnt(x) __builtin_popcountll(x)
//配列内等要素削除
#define Unique(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
#define Fixed(n) fixed << setprecision(n)
//総和
#define sowa(n) (((n) * ((n) + 1)) / 2)
#define updiv(a, b) ((a + b - 1) / b)
#define cauto const auto &
using P = pair<int, int>;
using Graph = vector<vector<P>>;
template <class T> //昇順
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T> //降順
using max_heap = priority_queue<T>;
template <class A, class B> using umap = unordered_map<A, B>;
template <class A> using uset = unordered_set<A>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) { //多次元初期化
std::fill((T *)array, (T *)(array + N), val);
}
template <class A, class B>
bool chmax(A &a, const B &b) { //最大値更新 返り値はbool
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class A, class B>
bool chmin(A &a, const B &b) { //最小値更新 返り値はbool
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, 1, 1, -1, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr int LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9 + 7;
constexpr int mod2 = 998244353;
//} END
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
template <typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(int a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1])))
return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(int b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R)))
return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
SegmentTree<int> seg(
n, [](int a, int b) { return gcd(a, b); }, 0);
rep(i, 0, n) {
int a;
cin >> a;
seg.set(i, a);
}
seg.build();
int ans = 0;
rep(i, 1, n) chmax(ans, gcd(seg.query(0, i - 1), seg.query(i, n)));
cout << ans << '\n';
return 0;
} | #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) for (auto i = (x).rbegin(); i != (x).rend(); ++i)
//降順はgreater<T>()
#define all(x) (x).begin(), (x).end()
#define rv(s) reverse((s).begin(), (s).end())
// gcd lcmはそのままok
#define gcd(a, b) __gcd(a, b)
#define bits(n) (1LL << (n))
#define pcnt(x) __builtin_popcountll(x)
//配列内等要素削除
#define Unique(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
#define Fixed(n) fixed << setprecision(n)
//総和
#define sowa(n) (((n) * ((n) + 1)) / 2)
#define updiv(a, b) ((a + b - 1) / b)
#define cauto const auto &
using P = pair<int, int>;
using Graph = vector<vector<P>>;
template <class T> //昇順
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T> //降順
using max_heap = priority_queue<T>;
template <class A, class B> using umap = unordered_map<A, B>;
template <class A> using uset = unordered_set<A>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) { //多次元初期化
std::fill((T *)array, (T *)(array + N), val);
}
template <class A, class B>
bool chmax(A &a, const B &b) { //最大値更新 返り値はbool
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class A, class B>
bool chmin(A &a, const B &b) { //最小値更新 返り値はbool int a, b;
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, 1, 1, -1, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr int LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9 + 7;
constexpr int mod2 = 998244353;
//} END
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
template <typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(int a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1])))
return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(int b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R)))
return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
signed main(void) {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
SegmentTree<int> seg(
n, [](int a, int b) { return gcd(a, b); }, 0);
rep(i, 0, n) {
int a;
cin >> a;
seg.set(i, a);
}
seg.build();
int ans = 0;
rep(i, 0, n) chmax(ans, gcd(seg.query(0, i), seg.query(i + 1, n)));
cout << ans << '\n';
return 0;
} | [
"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) for (auto i = (x).rbegin(); i != (x).rend(); ++i)
//降順はgreater<T>()
#define all(x) (x).begin(), (x).end()
#define rv(s) reverse((s).begin(), (s).end())
// gcd lcmはそのままok
#define gcd(a, b) __gcd(a, b)
#define bits(n) (1LL << (n))
#define pcnt(x) __builtin_popcountll(x)
//配列内等要素削除
#define Unique(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
#define Fixed(n) fixed << setprecision(n)
//総和
#define sowa(n) (((n) * ((n) + 1)) / 2)
#define updiv(a, b) ((a + b - 1) / b)
#define cauto const auto &
using P = pair<int, int>;
using Graph = vector<vector<P>>;
template <class T> //昇順
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T> //降順
using max_heap = priority_queue<T>;
template <class A, class B> using umap = unordered_map<A, B>;
template <class A> using uset = unordered_set<A>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) { //多次元初期化
std::fill((T *)array, (T *)(array + N), val);
}
template <class A, class B>
bool chmax(A &a, const B &b) { //最大値更新 返り値はbool
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class A, class B>
bool chmin(A &a, const B &b) { //最小値更新 返り値はbool
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, 1, 1, -1, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr int LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9 + 7;
constexpr int mod2 = 998244353;
//} END
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
template <typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(int a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1])))
return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(int b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R)))
return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
SegmentTree<int> seg(
n, [](int a, int b) { return gcd(a, b); }, 0);
rep(i, 0, n) {
int a;
cin >> a;
seg.set(i, a);
}
seg.build();
int ans = 0;
rep(i, 1, n) chmax(ans, gcd(seg.query(0, i - 1), seg.query(i, n)));
cout << ans << '\n';
return 0;
} | #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) for (auto i = (x).rbegin(); i != (x).rend(); ++i)
//降順はgreater<T>()
#define all(x) (x).begin(), (x).end()
#define rv(s) reverse((s).begin(), (s).end())
// gcd lcmはそのままok
#define gcd(a, b) __gcd(a, b)
#define bits(n) (1LL << (n))
#define pcnt(x) __builtin_popcountll(x)
//配列内等要素削除
#define Unique(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
#define Fixed(n) fixed << setprecision(n)
//総和
#define sowa(n) (((n) * ((n) + 1)) / 2)
#define updiv(a, b) ((a + b - 1) / b)
#define cauto const auto &
using P = pair<int, int>;
using Graph = vector<vector<P>>;
template <class T> //昇順
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T> //降順
using max_heap = priority_queue<T>;
template <class A, class B> using umap = unordered_map<A, B>;
template <class A> using uset = unordered_set<A>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) { //多次元初期化
std::fill((T *)array, (T *)(array + N), val);
}
template <class A, class B>
bool chmax(A &a, const B &b) { //最大値更新 返り値はbool
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class A, class B>
bool chmin(A &a, const B &b) { //最小値更新 返り値はbool
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, 1, 1, -1, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr int LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9 + 7;
constexpr int mod2 = 998244353;
//} END
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
template <typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(int a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1])))
return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(int b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R)))
return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
SegmentTree<int> seg(
n, [](int a, int b) { return gcd(a, b); }, 0);
rep(i, 0, n) {
int a;
cin >> a;
seg.set(i, a);
}
seg.build();
int ans = 0;
rep(i, 0, n) chmax(ans, gcd(seg.query(0, i), seg.query(i + 1, n)));
cout << ans << '\n';
return 0;
} | [
"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);
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return a * b / __gcd(a, b); }
int main() {
ll N;
scanf("%lld", &N);
vector<ll> list;
for (ll i = 0; i < N; i++) {
ll v;
scanf("%lld", &v);
list.emplace_back(v);
}
vll l(N);
vll r(N);
ll c;
c = list[0];
for (ll i = 0; i < N; i++) {
c = gcd(c, list[i]);
l[i] = c;
}
c = list[N - 1];
for (ll i = N - 1; i >= 0; i--) {
c = gcd(c, list[i]);
r[i] = c;
}
ll ans = 0;
ans = max(ans, r[1]);
ans = max(ans, l[N - 2]);
for (ll i = 1; i < N - 1; i++) {
ll tmp = gcd(l[i - 1], r[N - i]);
ans = max(ans, tmp);
}
cout << ans << endl;
}
| #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);
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return a * b / __gcd(a, b); }
int main() {
ll N;
scanf("%lld", &N);
vector<ll> list;
for (ll i = 0; i < N; i++) {
ll v;
scanf("%lld", &v);
list.emplace_back(v);
}
vll l(N);
vll r(N);
ll c;
c = list[0];
for (ll i = 0; i < N; i++) {
c = gcd(c, list[i]);
l[i] = c;
}
c = list[N - 1];
for (ll i = N - 1; i >= 0; i--) {
c = gcd(c, list[i]);
r[i] = c;
}
ll ans = 0;
ans = max(ans, r[1]);
ans = max(ans, l[N - 2]);
for (ll i = 1; i < N - 1; i++) {
ll tmp = gcd(l[i - 1], r[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
}
| [
"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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll N;
ll ans = 0;
cin >> N;
ll A[N], B[N], C[N];
FOR(i, 0, N - 1) { cin >> A[i]; }
B[0] = A[0];
FOR(i, 1, N - 1) {
B[i] = gcd(B[i - 1], A[i]);
// cout<<B[i]<<endl;
}
C[N - 1] = A[N - 1];
for (ll i = N - 2; i >= 0; i--) {
C[i] = gcd(C[i + 1], A[i]);
// cout<<C[i]<<endl;
}
FOR(i, 0, N - 3) {
ll tmp;
tmp = gcd(B[i], A[i + 2]);
ans = max(ans, tmp);
}
ans = max(ans, C[1]);
ans = max(ans, B[N - 2]);
cout << ans << endl;
}
| #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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll N;
ll ans = 0;
cin >> N;
ll A[N], B[N], C[N];
FOR(i, 0, N - 1) { cin >> A[i]; }
B[0] = A[0];
FOR(i, 1, N - 1) {
B[i] = gcd(B[i - 1], A[i]);
// cout<<B[i]<<endl;
}
C[N - 1] = A[N - 1];
for (ll i = N - 2; i >= 0; i--) {
C[i] = gcd(C[i + 1], A[i]);
// cout<<C[i]<<endl;
}
FOR(i, 0, N - 3) {
ll tmp;
tmp = gcd(B[i], C[i + 2]);
ans = max(ans, tmp);
}
ans = max(ans, C[1]);
ans = max(ans, B[N - 2]);
cout << ans << endl;
}
| [
"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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll N;
ll ans = 0;
cin >> N;
ll A[N], B[N], C[N];
FOR(i, 0, N - 1) { cin >> A[i]; }
B[0] = A[0];
FOR(i, 1, N - 1) {
B[i] = gcd(B[i - 1], A[i]);
// cout<<B[i]<<endl;
}
C[N - 1] = A[N - 1];
for (ll i = N - 2; i >= 0; i--) {
C[i] = gcd(C[i + 1], A[i]);
// cout<<C[i]<<endl;
}
FOR(i, 0, N - 3) {
ll tmp;
tmp = gcd(B[i], A[i + 2]);
ans = max(ans, tmp);
}
ans = max(ans, C[0]);
ans = max(ans, B[N - 1]);
cout << ans << endl;
}
| #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>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll N;
ll ans = 0;
cin >> N;
ll A[N], B[N], C[N];
FOR(i, 0, N - 1) { cin >> A[i]; }
B[0] = A[0];
FOR(i, 1, N - 1) {
B[i] = gcd(B[i - 1], A[i]);
// cout<<B[i]<<endl;
}
C[N - 1] = A[N - 1];
for (ll i = N - 2; i >= 0; i--) {
C[i] = gcd(C[i + 1], A[i]);
// cout<<C[i]<<endl;
}
FOR(i, 0, N - 3) {
ll tmp;
tmp = gcd(B[i], C[i + 2]);
ans = max(ans, tmp);
}
ans = max(ans, C[1]);
ans = max(ans, B[N - 2]);
cout << ans << endl;
}
| [
"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 (int i = 1; i < n; i++) {
s[i] = gcd(s[i - 1], a[i]);
}
t[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
t[i] = gcd(t[i + 1], a[i]);
}
int ans = t[1];
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(s[i - 1], t[i + 1]));
}
ans = max(ans, s[n - 1]);
cout << ans << endl;
} | #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 (int i = 1; i < n; i++) {
s[i] = gcd(s[i - 1], a[i]);
}
t[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
t[i] = gcd(t[i + 1], a[i]);
}
int ans = t[1];
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(s[i - 1], t[i + 1]));
}
ans = max(ans, s[n - 2]);
cout << ans << endl;
} | [
"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); \
cin.tie(NULL)
#define MAX_SIZE 1024
#define MOD 1000000007
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define f(n) for (ll i = 0; i < n; i++)
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repe(i, a, n) for (ll i = a; i <= n; i++)
#define repr(i, a, n) for (ll i = a; i >= n; i--)
#define ain(arr, n) \
for (ll i1 = 0; i1 < n; i1++) \
cin >> arr[i1]
#define aout(arr, n) \
for (ll i1 = 0; i1 < n; i1++) \
cout << arr[i1] << space
int main() {
TLE_na_ho;
// READ THE QUESTION PROPERLY!!
ll t;
t = 1;
// cin>>t;
while (t--) {
ll n;
cin >> n;
vll a(n);
for (auto &i : a)
cin >> i;
vll prefix(n), suffix(n);
prefix[0] = a[0];
rep(i, 1, n) { prefix[i] = __gcd(prefix[i - 1], a[i]); }
suffix[n - 1] = a[n - 1];
repr(i, n - 2, 0) { suffix[i] = __gcd(suffix[i + 1], a[i]); }
ll ans = max(prefix[n - 1], suffix[0]);
rep(i, 1, n) { ans = max(ans, __gcd(prefix[i - 1], suffix[i + 1])); }
cout << ans;
}
}
| #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); \
cin.tie(NULL)
#define MAX_SIZE 1024
#define MOD 1000000007
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define f(n) for (ll i = 0; i < n; i++)
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repe(i, a, n) for (ll i = a; i <= n; i++)
#define repr(i, a, n) for (ll i = a; i >= n; i--)
#define ain(arr, n) \
for (ll i1 = 0; i1 < n; i1++) \
cin >> arr[i1]
#define aout(arr, n) \
for (ll i1 = 0; i1 < n; i1++) \
cout << arr[i1] << space
int main() {
TLE_na_ho;
// READ THE QUESTION PROPERLY!!
ll t;
t = 1;
// cin>>t;
while (t--) {
ll n;
cin >> n;
vll a(n);
for (auto &i : a)
cin >> i;
vll prefix(n), suffix(n);
prefix[0] = a[0];
rep(i, 1, n) { prefix[i] = __gcd(prefix[i - 1], a[i]); }
suffix[n - 1] = a[n - 1];
repr(i, n - 2, 0) { suffix[i] = __gcd(suffix[i + 1], a[i]); }
ll ans = max(prefix[n - 2], suffix[1]);
rep(i, 1, n - 1) { ans = max(ans, __gcd(prefix[i - 1], suffix[i + 1])); }
cout << ans;
}
}
| [
"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 with binary search
left_gcd[1] = 0;
right_gcd[n] = 0;
for (int i = 2; i <= n; i++) {
right_gcd[n + 1 - i] = gcd(max(right_gcd[n + 2 - i], a[n + 1 - i]),
min(right_gcd[n + 2 - i], a[n + 1 - i]));
left_gcd[i] =
gcd(max(left_gcd[i - 1], a[i - 2]), min(left_gcd[i - 1], a[i - 2]));
}
// merge gcd
int answer = 0;
for (int i = 1; i <= n; i++) {
int i_gcd =
gcd(max(left_gcd[i], right_gcd[i]), min(left_gcd[i], right_gcd[i]));
if (answer < i_gcd)
answer = i_gcd;
}
cout << answer << endl;
}
| #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];
// gcd with binary search
left_gcd[1] = 0;
right_gcd[n] = 0;
for (int i = 2; i <= n; i++) {
right_gcd[n + 1 - i] = gcd(max(right_gcd[n + 2 - i], a[n + 1 - i]),
min(right_gcd[n + 2 - i], a[n + 1 - i]));
left_gcd[i] =
gcd(max(left_gcd[i - 1], a[i - 2]), min(left_gcd[i - 1], a[i - 2]));
}
// merge gcd
int answer = 0;
for (int i = 1; i <= n; i++) {
int i_gcd =
gcd(max(left_gcd[i], right_gcd[i]), min(left_gcd[i], right_gcd[i]));
if (answer < i_gcd)
answer = i_gcd;
}
cout << answer << endl;
}
| [
"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;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define pb push_back
#define all(a) a.begin(), a.end()
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define llpvec vector<pair<ll, ll>>
#define size_(a, b) (a, vector<ll>(b))
#define S 3
/*
UnionFind：素集合系管理の構造体
issame(x,y): x と y が同じ集合にいるか
treesize(x): x を含む集合の要素数
weight(x): xでの重みの累積和
diff(x,y): x,yの重みの差
unite(x,y): wの重みを考慮しx と y を同じ集合にする
*/
template <class Abel> struct UnionFind {
vector<ll> par;
vector<ll> rank;
vector<Abel> diff_weight;
UnionFind(ll n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }
void init(ll n = 1, Abel SUM_UNITY = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
for (ll i = 0; i < n; ++i)
par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
ll root(ll x) {
if (par[x] == x)
return x;
else {
ll r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(ll x) {
root(x);
return diff_weight[x];
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool unite(ll x, ll y, Abel w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y), w = -w;
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
ll treecnt(ll n) {
map<ll, bool> used;
ll ans = 0, i;
rep(i, 0, n) {
ll p = root(par[i]);
if (used[p])
continue;
used[p] = true;
ans++;
}
return ans;
}
bool diffjudge(ll x, ll y) { //親まで遡る前に出会えるか
if (par[x] == x)
return true; //出会わない
else {
ll r = par[x];
if (r == y)
return false; //出会う
diff_weight[x] += diff_weight[par[x]];
return diffjudge(r, y);
}
}
Abel diff(ll x, ll y) {
if (diffjudge(x, y) || diffjudge(y, x))
return abs(weight(y) + weight(x));
else
return abs(weight(y) - weight(x));
}
};
/*mod*/ const int mod = 1e9 + 7;
/*pi*/ const double pi = acos(-1);
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗 1*/ ll llpow(ll x, ll n) {
ll ans = 1, ii;
rep(ii, 0, n) { ans *= x; }
return ans;
}
/*n乗 2*/ ll modpow(ll x, ll n) {
ll ans = x, ii, tmp = x, t1 = 1;
ii = 1;
while (ii < n) {
if (ii * 2 < n) {
ans *= ans;
ans %= mod;
ii *= 2;
} else {
t1 = 1;
tmp = x;
while (t1 * 2 < n - ii) {
tmp *= tmp;
tmp %= mod;
t1 *= 2;
}
ans *= tmp;
ans %= mod;
ii += t1;
}
}
return ans;
}
/*階乗*/ ll fact(ll x) {
ll ii, ans = 1;
rep(ii, 0, x) {
ans *= (x - ii);
ans %= mod;
}
return ans;
}
/*逆元*/ ll inv(ll x) { return modpow(x, mod - 2); }
/*nCr*/ ll ncr(ll n, ll r) {
ll a = fact(n), b = inv(fact(n - r)), c = inv(fact(r));
if (n - r < 0)
return 0;
else
return (((a * b) % mod) * c) % mod;
}
/*nPr*/ ll npr(ll n, ll r) {
ll a = fact(n), b = inv(fact(n - r));
return (a * b) % mod;
}
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll ii;
for (ii = 2; ii * ii <= a; ii++) {
if (a % ii == 0)
return false;
}
return true;
}
/*Fibonacci数列*/ ll fib(ll x) {
ll ii, fibo[x + 10];
fibo[0] = 1;
fibo[1] = 1;
fibo[2] = 1;
rep(ii, 3, x + 1) fibo[ii] = fibo[ii - 1] + fibo[ii - 2];
return fibo[x];
}
/*桁数*/ ll dig(ll n) {
ll d = 1, tmp = n;
while (tmp / 10 > 0) {
tmp /= 10;
d++;
}
return d;
}
/*行列のコピー*/ void matcpy(ll a[S][S], ll b[S][S]) {
ll ii, jj;
rep(ii, 0, S) rep(jj, 0, S) b[ii][jj] = a[ii][jj]; /*(aをbに)*/
}
/*行列のリセット*/ void matrst(ll a[S][S]) {
ll ii, jj;
rep(ii, 0, S) rep(jj, 0, S) a[ii][jj] = 0;
}
/*行列の2乗*/ void matpow(ll a[S][S]) {
ll ans[S][S];
matrst(ans);
ll ii, jj, kk;
rep(ii, 0, S) rep(jj, 0, S) rep(kk, 0, S) {
ans[ii][jj] += a[ii][kk] * a[kk][jj];
ans[ii][jj] %= mod;
}
matcpy(ans, a);
}
/*行列の乗算*/ void matmul(ll a[S][S], ll b[S][S], ll as[S][S]) {
ll ii, jj, kk;
matrst(as);
rep(ii, 0, S) rep(jj, 0, S) rep(kk, 0, S) {
as[ii][jj] += a[ii][kk] * b[kk][jj];
as[ii][jj] %= mod;
}
}
/*迷路移動*/ const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct SegmentTree {
int n;
vector<T> dat;
SegmentTree(int n_) {
n = n_;
dat.resize(n * 2 - 1, 0);
}
void update(int i, T x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2; // parent
if (dat[i * 2 + 1] == 0)
dat[i] = dat[i * 2 + 2];
else if (dat[i * 2 + 2] == 0)
dat[i] = dat[i * 2 + 1];
else
dat[i] = gcd(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
void show() {
for (int i = 0; i < dat.size(); ++i)
cout << "show " << i << " " << dat[i] << endl;
}
T query(int a, int b) { return query_sub(a, b, 0, 0, n); }
T query_sub(int a, int b, int k, int l, int r) {
r--;
if (r <= a || b <= l) {
return 0;
} else if (a <= l && r <= b) {
return dat[k];
} else {
T vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
if (vl == 0)
return vr;
else if (vr == 0)
return vl;
else
return gcd(vl, vr);
}
}
T answer() { return dat[0]; }
};
llfor; ////////////////////////////////////////////////////////////
int main() {
ll n;
cin >> n;
ll tmp = (n % 2 == 1 ? n + 1 : n);
vector<ll> a(n);
SegmentTree<ll> seg(tmp);
rep(i, 0, n) {
cin >> a.at(i);
seg.update(i, a[i]);
}
ll ans = seg.query(0, n);
rep(i, 0, n) {
seg.update(i, 0);
ans = max(seg.query(0, n - 1), ans);
seg.update(i, a[i]);
}
pr(ans);
return 0;
}
| #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;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i, a, N) for ((i) = (a); (i) < (N); (i)++)
#define rrp(i, N, a) for ((i) = (N)-1; (i) >= (a); (i)--)
#define llfor ll i, j
#define sc(a) cin >> a
#define pr(a) cout << a << endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define pb push_back
#define all(a) a.begin(), a.end()
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define llpvec vector<pair<ll, ll>>
#define size_(a, b) (a, vector<ll>(b))
#define S 3
/*
UnionFind：素集合系管理の構造体
issame(x,y): x と y が同じ集合にいるか
treesize(x): x を含む集合の要素数
weight(x): xでの重みの累積和
diff(x,y): x,yの重みの差
unite(x,y): wの重みを考慮しx と y を同じ集合にする
*/
template <class Abel> struct UnionFind {
vector<ll> par;
vector<ll> rank;
vector<Abel> diff_weight;
UnionFind(ll n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }
void init(ll n = 1, Abel SUM_UNITY = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
for (ll i = 0; i < n; ++i)
par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
ll root(ll x) {
if (par[x] == x)
return x;
else {
ll r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(ll x) {
root(x);
return diff_weight[x];
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool unite(ll x, ll y, Abel w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y), w = -w;
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
ll treecnt(ll n) {
map<ll, bool> used;
ll ans = 0, i;
rep(i, 0, n) {
ll p = root(par[i]);
if (used[p])
continue;
used[p] = true;
ans++;
}
return ans;
}
bool diffjudge(ll x, ll y) { //親まで遡る前に出会えるか
if (par[x] == x)
return true; //出会わない
else {
ll r = par[x];
if (r == y)
return false; //出会う
diff_weight[x] += diff_weight[par[x]];
return diffjudge(r, y);
}
}
Abel diff(ll x, ll y) {
if (diffjudge(x, y) || diffjudge(y, x))
return abs(weight(y) + weight(x));
else
return abs(weight(y) - weight(x));
}
};
/*mod*/ const int mod = 1e9 + 7;
/*pi*/ const double pi = acos(-1);
/*繰り上げ除算*/ ll cei(ll x, ll y) {
ll ans = x / y;
if (x % y != 0)
ans++;
return ans;
}
/*最大公約数*/ ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
/*n乗 1*/ ll llpow(ll x, ll n) {
ll ans = 1, ii;
rep(ii, 0, n) { ans *= x; }
return ans;
}
/*n乗 2*/ ll modpow(ll x, ll n) {
ll ans = x, ii, tmp = x, t1 = 1;
ii = 1;
while (ii < n) {
if (ii * 2 < n) {
ans *= ans;
ans %= mod;
ii *= 2;
} else {
t1 = 1;
tmp = x;
while (t1 * 2 < n - ii) {
tmp *= tmp;
tmp %= mod;
t1 *= 2;
}
ans *= tmp;
ans %= mod;
ii += t1;
}
}
return ans;
}
/*階乗*/ ll fact(ll x) {
ll ii, ans = 1;
rep(ii, 0, x) {
ans *= (x - ii);
ans %= mod;
}
return ans;
}
/*逆元*/ ll inv(ll x) { return modpow(x, mod - 2); }
/*nCr*/ ll ncr(ll n, ll r) {
ll a = fact(n), b = inv(fact(n - r)), c = inv(fact(r));
if (n - r < 0)
return 0;
else
return (((a * b) % mod) * c) % mod;
}
/*nPr*/ ll npr(ll n, ll r) {
ll a = fact(n), b = inv(fact(n - r));
return (a * b) % mod;
}
/*primejudge*/ bool prime(ll a) {
if (a <= 1)
return false;
ll ii;
for (ii = 2; ii * ii <= a; ii++) {
if (a % ii == 0)
return false;
}
return true;
}
/*Fibonacci数列*/ ll fib(ll x) {
ll ii, fibo[x + 10];
fibo[0] = 1;
fibo[1] = 1;
fibo[2] = 1;
rep(ii, 3, x + 1) fibo[ii] = fibo[ii - 1] + fibo[ii - 2];
return fibo[x];
}
/*桁数*/ ll dig(ll n) {
ll d = 1, tmp = n;
while (tmp / 10 > 0) {
tmp /= 10;
d++;
}
return d;
}
/*行列のコピー*/ void matcpy(ll a[S][S], ll b[S][S]) {
ll ii, jj;
rep(ii, 0, S) rep(jj, 0, S) b[ii][jj] = a[ii][jj]; /*(aをbに)*/
}
/*行列のリセット*/ void matrst(ll a[S][S]) {
ll ii, jj;
rep(ii, 0, S) rep(jj, 0, S) a[ii][jj] = 0;
}
/*行列の2乗*/ void matpow(ll a[S][S]) {
ll ans[S][S];
matrst(ans);
ll ii, jj, kk;
rep(ii, 0, S) rep(jj, 0, S) rep(kk, 0, S) {
ans[ii][jj] += a[ii][kk] * a[kk][jj];
ans[ii][jj] %= mod;
}
matcpy(ans, a);
}
/*行列の乗算*/ void matmul(ll a[S][S], ll b[S][S], ll as[S][S]) {
ll ii, jj, kk;
matrst(as);
rep(ii, 0, S) rep(jj, 0, S) rep(kk, 0, S) {
as[ii][jj] += a[ii][kk] * b[kk][jj];
as[ii][jj] %= mod;
}
}
/*迷路移動*/ const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct SegmentTree {
int n;
vector<T> dat;
SegmentTree(int n_) {
n = n_;
dat.resize(n * 2 - 1, 0);
}
void update(int i, T x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2; // parent
if (dat[i * 2 + 1] == 0)
dat[i] = dat[i * 2 + 2];
else if (dat[i * 2 + 2] == 0)
dat[i] = dat[i * 2 + 1];
else
dat[i] = gcd(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
void show() {
for (int i = 0; i < dat.size(); ++i)
cout << "show " << i << " " << dat[i] << endl;
}
T query(int a, int b) { return query_sub(a, b, 0, 0, n); }
T query_sub(int a, int b, int k, int l, int r) {
r--;
if (r <= a || b <= l) {
return 0;
} else if (a <= l && r <= b) {
return dat[k];
} else {
T vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
if (vl == 0)
return vr;
else if (vr == 0)
return vl;
else
return gcd(vl, vr);
}
}
T answer() { return dat[0]; }
};
llfor; ////////////////////////////////////////////////////////////
int main() {
ll n;
cin >> n;
ll tmp = (n % 2 == 1 ? n + 1 : n);
vector<ll> a(n);
SegmentTree<ll> seg(tmp);
rep(i, 0, n) {
cin >> a.at(i);
seg.update(i, a[i]);
}
ll ans = seg.query(0, n);
rep(i, 0, n) {
seg.update(i, 0);
ans = max(seg.query(0, n), ans);
seg.update(i, a[i]);
}
pr(ans);
return 0;
}
| [
"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 b;
return gcd(b, a % b);
}
int main() {
int N;
std::cin >> N;
std::vector<int> vec(N);
int flag = 0;
for (int i = 0; i < N; i++)
std::cin >> vec[i];
std::vector<int> left(N);
std::vector<int> right(N);
for (int i = 0; i < N; i++) {
if (i == 0)
left[i] = vec[i];
else
left[i] = gcd(left[i - 1], vec[i]);
}
// left[0]=0;
for (int i = N - 1; 0 <= i; i--) {
if (i == N - 1)
right[i] = vec[i];
else
right[i] = gcd(right[i + 1], vec[i]);
}
// right[N-1]=0;
/*
for(int i=0;i<N;i++) std::cout<<left[i]<<" ";
std::cout<<std::endl;
for(int i=0;i<N;i++) std::cout<<right[i]<<" ";
std::cout<<std::endl;
*/
int max = 0;
int SUM = 0;
for (int i = 0; i < N; i++) {
if (i == 0)
SUM = right[i];
else if (i == N - 1)
SUM = left[i];
else
SUM = gcd(left[i - 1], right[i + 1]);
if (max < SUM)
max = SUM;
}
std::cout << max << std::endl;
return 0;
}
| #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 b;
return gcd(b, a % b);
}
int main() {
int N;
std::cin >> N;
std::vector<int> vec(N);
int flag = 0;
for (int i = 0; i < N; i++)
std::cin >> vec[i];
std::vector<int> left(N);
std::vector<int> right(N);
for (int i = 0; i < N; i++) {
if (i == 0)
left[i] = vec[i];
else
left[i] = gcd(left[i - 1], vec[i]);
}
// left[0]=0;
for (int i = N - 1; 0 <= i; i--) {
if (i == N - 1)
right[i] = vec[i];
else
right[i] = gcd(right[i + 1], vec[i]);
}
// right[N-1]=0;
/*
for(int i=0;i<N;i++) std::cout<<left[i]<<" ";
std::cout<<std::endl;
for(int i=0;i<N;i++) std::cout<<right[i]<<" ";
std::cout<<std::endl;
*/
int max = 0;
int SUM = 0;
for (int i = 0; i < N; i++) {
if (i == 0)
SUM = right[i + 1];
else if (i == N - 1)
SUM = left[i - 1];
else
SUM = gcd(left[i - 1], right[i + 1]);
if (max < SUM)
max = SUM;
// std::cout<<SUM<<std::endl;
}
std::cout << max << std::endl;
return 0;
}
| [
"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> g(n, 0);
vector<int> h(n, 0);
g[1] = a[0];
h[n - 2] = a[n - 1];
for (int i = 2; i < n; i++) {
g[i] = gcd(g[i - 1], a[i - 1]);
h[n - i - 1] = gcd(h[n - i], a[n - i]);
}
int mx = gcd(g[n - 1], h[0]);
for (int i = 1; i < n - 1; i++) {
mx = max(mx, (int)gcd(g[i], h[i]));
}
cout << mx << endl;
} | #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> g(n, 0);
vector<int> h(n, 0);
g[1] = a[0];
h[n - 2] = a[n - 1];
for (int i = 2; i < n; i++) {
g[i] = gcd(g[i - 1], a[i - 1]);
h[n - i - 1] = gcd(h[n - i], a[n - i]);
}
int mx = max(g[n - 1], h[0]);
for (int i = 1; i < n - 1; i++) {
mx = max(mx, (int)gcd(g[i], h[i]));
}
cout << mx << endl;
} | [
"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> g(n, 0);
vector<int> h(n, 0);
g[1] = a[0];
h[n - 2] = a[n - 1];
for (int i = 2; i < n; i++) {
g[i] = gcd(g[i - 1], a[i - 1]);
h[n - i - 1] = gcd(h[n - i], a[n - i]);
}
int mx = (g[n - 1], h[0]);
for (int i = 1; i < n - 1; i++) {
mx = max(mx, (int)gcd(g[i], h[i]));
}
cout << mx << endl;
} | #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> g(n, 0);
vector<int> h(n, 0);
g[1] = a[0];
h[n - 2] = a[n - 1];
for (int i = 2; i < n; i++) {
g[i] = gcd(g[i - 1], a[i - 1]);
h[n - i - 1] = gcd(h[n - i], a[n - i]);
}
int mx = max(g[n - 1], h[0]);
for (int i = 1; i < n - 1; i++) {
mx = max(mx, (int)gcd(g[i], h[i]));
}
cout << mx << endl;
} | [
"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> g(n, 0);
vector<int> h(n, 0);
g[1] = a[0];
h[n - 2] = a[n - 1];
for (int i = 2; i < n; i++) {
g[i] = gcd(g[i - 1], a[i - 1]);
h[n - i - 1] = gcd(h[n - i], a[n - i]);
}
int mx = (g[n - 1], h[0]);
for (int i = 1; i < n - 1; i++) {
mx = max(mx, (int)gcd(g[i], h[i]));
}
cout << mx << endl;
} | #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> g(n, 0);
vector<int> h(n, 0);
g[1] = a[0];
h[n - 2] = a[n - 1];
for (int i = 2; i < n; i++) {
g[i] = gcd(g[i - 1], a[i - 1]);
h[n - i - 1] = gcd(h[n - i], a[n - i]);
}
int mx = max(g[n - 1], h[0]);
for (int i = 1; i < n - 1; i++) {
mx = max(mx, (int)gcd(g[i], h[i]));
}
cout << mx << endl;
} | [
"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) {
cin >> tmp;
A.push_back(tmp);
}
vector<long> L, R;
for (int i = 0; i < N; ++i) {
if (i == 0) {
L.push_back(A[i]);
R.push_back(A[N - i - 1]);
} else {
L.push_back(gcd(L[i - 1], A[i]));
R.push_back(gcd(R[i - 1], A[N - i - 1]));
}
}
int ans = 1;
for (int i = 0; i < N; ++i) {
if (i == 0) {
ans = R[N - (i + 1) - 1];
} else if (i < N - 1) {
if (ans < gcd(L[i - 1], R[N - i - 2]))
ans = gcd(L[i - 1], R[N - i - 2]);
} else {
if (ans < L[N - 1])
ans = L[N - 1];
}
}
cout << ans << endl;
}
| #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) {
cin >> tmp;
A.push_back(tmp);
}
vector<long> L, R;
for (int i = 0; i < N; ++i) {
if (i == 0) {
L.push_back(A[i]);
R.push_back(A[N - i - 1]);
} else {
L.push_back(gcd(L[i - 1], A[i]));
R.push_back(gcd(R[i - 1], A[N - i - 1]));
}
}
int ans = 1;
for (int i = 0; i < N; ++i) {
if (i == 0) {
ans = R[N - (i + 1) - 1];
} else if (i < N - 1) {
if (ans < gcd(L[i - 1], R[N - i - 2]))
ans = gcd(L[i - 1], R[N - i - 2]);
} else {
if (ans < L[N - 2])
ans = L[N - 2];
}
}
cout << ans << endl;
}
| [
"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) % i != 0) {
c++;
}
if (c == 2) {
goto pass;
}
if (j == n - 1) {
cout << i << endl;
p = 1;
}
}
if (p == 1) {
break;
}
pass:;
}
} | #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) % i != 0) {
c++;
}
if (c == 2) {
goto pass;
}
if (j == n - 1) {
cout << i << endl;
p = 1;
}
}
if (p == 1) {
break;
}
pass:;
}
}
| [
"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); ++i)
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> gcdr(n);
vector<int> gcdl(n);
rep(i, n) {
if (i == 0)
gcdl[0] = a[i];
else
gcdl[i] = gcd(gcdl[i - 1], a[i]);
}
for (int i = n - 1; i >= 0; --i) {
if (i == n - 1)
gcdr[n - 1] = a[i];
else
gcdr[i] = gcd(gcdr[i + 1], a[i]);
}
int ans = 0;
rep(i, n) {
if (i == 0) {
ans = max(ans, gcdr[i + 1]);
} else if (i == n - 1) {
ans = max(ans, gcdr[i - 1]);
} else {
ans = max(ans, gcd(gcdl[i - 1], gcdr[i + 1]));
}
}
cout << ans << endl;
return 0;
}
| #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); ++i)
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> gcdr(n);
vector<int> gcdl(n);
rep(i, n) {
if (i == 0)
gcdl[0] = a[i];
else
gcdl[i] = gcd(gcdl[i - 1], a[i]);
}
for (int i = n - 1; i >= 0; --i) {
if (i == n - 1)
gcdr[n - 1] = a[i];
else
gcdr[i] = gcd(gcdr[i + 1], a[i]);
}
int ans = 0;
rep(i, n) {
if (i == 0) {
ans = max(ans, gcdr[i + 1]);
} else if (i == n - 1) {
ans = max(ans, gcdl[i - 1]);
} else {
ans = max(ans, gcd(gcdl[i - 1], gcdr[i + 1]));
}
}
cout << ans << endl;
return 0;
}
| [
"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>;
using vvin = vector<vin>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vst = vector<string>;
using P = pair<ll, ll>;
const int inf = 1e9 + 7;
const ll INF = 9e18;
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int lgcd[110000];
int rgcd[110000];
int main() {
cout << fixed << setprecision(20);
int n;
cin >> n;
vin a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
rep(i, 1, n + 1) { lgcd[i] = __gcd(a[i], lgcd[i - 1]); }
for (int i = n; i >= 1; i--) {
rgcd[i] = __gcd(a[i], rgcd[i + 1]);
}
int ans = 0;
rep(i, 1, n) { chmax(ans, __gcd(lgcd[i - 1], rgcd[i + 1])); }
cout << ans << endl;
} | #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>;
using vvin = vector<vin>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vst = vector<string>;
using P = pair<ll, ll>;
const int inf = 1e9 + 7;
const ll INF = 9e18;
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int lgcd[110000];
int rgcd[110000];
int main() {
cout << fixed << setprecision(20);
int n;
cin >> n;
vin a(n + 1);
rep(i, 1, n + 1) cin >> a[i];
rep(i, 1, n + 1) { lgcd[i] = __gcd(a[i], lgcd[i - 1]); }
for (int i = n; i >= 1; i--) {
rgcd[i] = __gcd(a[i], rgcd[i + 1]);
}
int ans = 0;
rep(i, 1, n + 1) { chmax(ans, __gcd(lgcd[i - 1], rgcd[i + 1])); }
cout << ans << endl;
} | [
"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, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; i >= m; i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
#define fi first
#define se second
#define set20 cout << fixed << setprecision(20);
const ll INF = 1e18;
inline void chmax(ll &a, ll b) { a = max(a, b); }
inline void chmin(ll &a, ll b) { a = min(a, b); }
double pi = acos(-1);
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];
vector<ll> B(n), C(n);
rep(i, n) {
if (i == 0) {
B[i] = A[i];
C[i] = A[n - 1 - i];
} else {
B[i] = gcd(B[i - 1], A[i]);
C[i] = gcd(C[i - 1], A[n - 1 - i]);
}
}
ll ans = 0;
rep(i, n) {
ll now = 0;
if (i == 0)
now = C[n - 2];
else if (i == n - 1)
now = B[1];
else
now = gcd(B[i - 1], C[n - 2 - i]);
chmax(ans, now);
}
cout << ans << endl;
return 0;
}
| #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, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; i >= m; i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define mpa make_pair
#define fi first
#define se second
#define set20 cout << fixed << setprecision(20);
const ll INF = 1e18;
inline void chmax(ll &a, ll b) { a = max(a, b); }
inline void chmin(ll &a, ll b) { a = min(a, b); }
double pi = acos(-1);
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];
vector<ll> B(n), C(n);
rep(i, n) {
if (i == 0) {
B[i] = A[i];
C[i] = A[n - 1 - i];
} else {
B[i] = gcd(B[i - 1], A[i]);
C[i] = gcd(C[i - 1], A[n - 1 - i]);
}
}
ll ans = 0;
rep(i, n) {
ll now = 0;
if (i == 0)
now = C[n - 2];
else if (i == n - 1)
now = B[n - 2];
else
now = gcd(B[i - 1], C[n - 2 - i]);
chmax(ans, now);
}
cout << ans << endl;
return 0;
}
| [
"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 (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readline(T &n, TT &m) {
readline(n);
readline(m);
}
template <typename T, typename TT, typename TTT>
inline void readline(T &n, TT &m, TTT &l) {
readline(n, m);
readline(l);
}
// long long input........
template <typename T> inline void readlinel(T &n) {
n = 0;
long long f = 1;
register long long ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readlinel(T &n, TT &m) {
readlinel(n);
readlinel(m);
}
template <typename T, typename TT, typename TTT>
inline void readlinel(T &n, TT &m, TTT &l) {
readlinel(n, m);
readlinel(l);
}
// debug..........
#define error(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cout << endl; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
//............ignore it..................//
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int tc = 1;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define Pi atan(1) * 4
#define ll long long int
#define happy cin.tie(0);
#define point(x) setprecision(x)
#define coding ios::sync_with_stdio(false);
#define Test printf("Case %d: ", tc++);
#define Unique(c) (c).resize(unique(all(c)) - (c).begin())
#define vout(v) \
for (auto z : v) \
cout << z << " "; \
cout << endl;
void print(int n) { printf("%d\n", n); }
void Print(int n) { printf("%d ", n); }
void print(int n, int m) {
printf("%d ", n);
printf("%d ", m);
}
void print(int n, int m, int k) {
printf("%d ", n);
printf("%d ", m);
printf("%d ", k);
}
void print(ll n) { printf("%I64d\n", n); }
void Print(ll n) { printf("%I64d ", n); }
void print(ll n, ll m) {
printf("%I64d ", n);
printf("%I64d ", m);
}
void print(ll n, ll m, ll k) {
printf("%I64d ", n);
printf("%I64d ", m);
printf("%I64d ", k);
}
int length(long long x) {
int l = 0;
for (long long i = x; i; i /= 10)
l++;
return l;
}
int length(string s) { return s.size(); }
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std::vector<int>
#define vll std::vector<ll>
#define all(n) n.begin(), n.end()
const int M = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 4e5 + 5;
const int NN = 1e6 + 5;
int l[N], r[N];
int solve() {
// happy coding
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
l[i] = __gcd(l[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int mx = 0;
for (ll i = 1; i < n; i++) {
mx = max(mx, __gcd(l[i - 1], r[i + 1]));
// mx = max(mx,__gcd(l[i+1],r[i-1]));
}
cout << mx << endl;
return 0;
// error();
}
int main() {
int test = 1;
// readline(test);//(void)getchar();
while (test--)
solve();
return 0;
} | // 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 (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readline(T &n, TT &m) {
readline(n);
readline(m);
}
template <typename T, typename TT, typename TTT>
inline void readline(T &n, TT &m, TTT &l) {
readline(n, m);
readline(l);
}
// long long input........
template <typename T> inline void readlinel(T &n) {
n = 0;
long long f = 1;
register long long ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readlinel(T &n, TT &m) {
readlinel(n);
readlinel(m);
}
template <typename T, typename TT, typename TTT>
inline void readlinel(T &n, TT &m, TTT &l) {
readlinel(n, m);
readlinel(l);
}
// debug..........
#define error(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cout << endl; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
//............ignore it..................//
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int tc = 1;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define Pi atan(1) * 4
#define ll long long int
#define happy cin.tie(0);
#define point(x) setprecision(x)
#define coding ios::sync_with_stdio(false);
#define Test printf("Case %d: ", tc++);
#define Unique(c) (c).resize(unique(all(c)) - (c).begin())
#define vout(v) \
for (auto z : v) \
cout << z << " "; \
cout << endl;
void print(int n) { printf("%d\n", n); }
void Print(int n) { printf("%d ", n); }
void print(int n, int m) {
printf("%d ", n);
printf("%d ", m);
}
void print(int n, int m, int k) {
printf("%d ", n);
printf("%d ", m);
printf("%d ", k);
}
void print(ll n) { printf("%I64d\n", n); }
void Print(ll n) { printf("%I64d ", n); }
void print(ll n, ll m) {
printf("%I64d ", n);
printf("%I64d ", m);
}
void print(ll n, ll m, ll k) {
printf("%I64d ", n);
printf("%I64d ", m);
printf("%I64d ", k);
}
int length(long long x) {
int l = 0;
for (long long i = x; i; i /= 10)
l++;
return l;
}
int length(string s) { return s.size(); }
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std::vector<int>
#define vll std::vector<ll>
#define all(n) n.begin(), n.end()
const int M = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 4e5 + 5;
const int NN = 1e6 + 5;
int l[N], r[N];
int solve() {
// happy coding
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
l[i] = __gcd(l[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
/*for(int i=0;i<=n;i++){
cout<<l[i]<<" ";
}cout<<endl;
for(int i=0;i<=n;i++){
cout<<r[i]<<" ";
}cout<<endl;
error(l[n-1],r[2]);*/
int mx = 0;
/*max(l[n-1],r[2]);*/
for (ll i = 1; i <= n; i++) {
// error(l[i-1],r[i+1],__gcd(l[i-1],r[i+1]))
mx = max(mx, __gcd(l[i - 1], r[i + 1]));
}
cout << mx << endl;
return 0;
// error();
}
int main() {
int test = 1;
// readline(test);//(void)getchar();
while (test--)
solve();
return 0;
} | [
"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 (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readline(T &n, TT &m) {
readline(n);
readline(m);
}
template <typename T, typename TT, typename TTT>
inline void readline(T &n, TT &m, TTT &l) {
readline(n, m);
readline(l);
}
// long long input........
template <typename T> inline void readlinel(T &n) {
n = 0;
long long f = 1;
register long long ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readlinel(T &n, TT &m) {
readlinel(n);
readlinel(m);
}
template <typename T, typename TT, typename TTT>
inline void readlinel(T &n, TT &m, TTT &l) {
readlinel(n, m);
readlinel(l);
}
// debug..........
#define error(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cout << endl; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
//............ignore it..................//
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int tc = 1;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define Pi atan(1) * 4
#define ll long long int
#define happy cin.tie(0);
#define point(x) setprecision(x)
#define coding ios::sync_with_stdio(false);
#define Test printf("Case %d: ", tc++);
#define Unique(c) (c).resize(unique(all(c)) - (c).begin())
#define vout(v) \
for (auto z : v) \
cout << z << " "; \
cout << endl;
void print(int n) { printf("%d\n", n); }
void Print(int n) { printf("%d ", n); }
void print(int n, int m) {
printf("%d ", n);
printf("%d ", m);
}
void print(int n, int m, int k) {
printf("%d ", n);
printf("%d ", m);
printf("%d ", k);
}
void print(ll n) { printf("%I64d\n", n); }
void Print(ll n) { printf("%I64d ", n); }
void print(ll n, ll m) {
printf("%I64d ", n);
printf("%I64d ", m);
}
void print(ll n, ll m, ll k) {
printf("%I64d ", n);
printf("%I64d ", m);
printf("%I64d ", k);
}
int length(long long x) {
int l = 0;
for (long long i = x; i; i /= 10)
l++;
return l;
}
int length(string s) { return s.size(); }
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std::vector<int>
#define vll std::vector<ll>
#define all(n) n.begin(), n.end()
const int M = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 4e5 + 5;
const int NN = 1e6 + 5;
int l[N], r[N];
int solve() {
// happy coding
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
l[i] = __gcd(l[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int mx = max(l[n], r[1]);
for (ll i = 1; i < n; i++) {
mx = max(mx, __gcd(l[i - 1], r[i + 1]));
// mx = max(mx,__gcd(l[i+1],r[i-1]));
}
cout << mx << endl;
return 0;
// error();
}
int main() {
int test = 1;
// readline(test);//(void)getchar();
while (test--)
solve();
return 0;
} | // 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 (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readline(T &n, TT &m) {
readline(n);
readline(m);
}
template <typename T, typename TT, typename TTT>
inline void readline(T &n, TT &m, TTT &l) {
readline(n, m);
readline(l);
}
// long long input........
template <typename T> inline void readlinel(T &n) {
n = 0;
long long f = 1;
register long long ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n = n * f;
}
template <typename T, typename TT> inline void readlinel(T &n, TT &m) {
readlinel(n);
readlinel(m);
}
template <typename T, typename TT, typename TTT>
inline void readlinel(T &n, TT &m, TTT &l) {
readlinel(n, m);
readlinel(l);
}
// debug..........
#define error(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cout << endl; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cout << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
//............ignore it..................//
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int tc = 1;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define Pi atan(1) * 4
#define ll long long int
#define happy cin.tie(0);
#define point(x) setprecision(x)
#define coding ios::sync_with_stdio(false);
#define Test printf("Case %d: ", tc++);
#define Unique(c) (c).resize(unique(all(c)) - (c).begin())
#define vout(v) \
for (auto z : v) \
cout << z << " "; \
cout << endl;
void print(int n) { printf("%d\n", n); }
void Print(int n) { printf("%d ", n); }
void print(int n, int m) {
printf("%d ", n);
printf("%d ", m);
}
void print(int n, int m, int k) {
printf("%d ", n);
printf("%d ", m);
printf("%d ", k);
}
void print(ll n) { printf("%I64d\n", n); }
void Print(ll n) { printf("%I64d ", n); }
void print(ll n, ll m) {
printf("%I64d ", n);
printf("%I64d ", m);
}
void print(ll n, ll m, ll k) {
printf("%I64d ", n);
printf("%I64d ", m);
printf("%I64d ", k);
}
int length(long long x) {
int l = 0;
for (long long i = x; i; i /= 10)
l++;
return l;
}
int length(string s) { return s.size(); }
#define pr pair<int, int>
#define vpr vector<pr>
#define vi std::vector<int>
#define vll std::vector<ll>
#define all(n) n.begin(), n.end()
const int M = 1e9 + 7;
const int Inf = (int)2e9 + 5;
const ll Lnf = (ll)2e18 + 5;
const int N = 4e5 + 5;
const int NN = 1e6 + 5;
int l[N], r[N];
int solve() {
// happy coding
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
l[i] = __gcd(l[i - 1], a[i]);
}
for (int i = n; i >= 1; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
int mx = max(l[n - 1], r[2]);
for (ll i = 1; i < n; i++) {
mx = max(mx, __gcd(l[i - 1], r[i + 1]));
// mx = max(mx,__gcd(l[i+1],r[i-1]));
}
cout << mx << endl;
return 0;
// error();
}
int main() {
int test = 1;
// readline(test);//(void)getchar();
while (test--)
solve();
return 0;
} | [
"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 push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define MOD 1000000007
void solve(int test_case) { // 227
int n;
cin >> n;
vi arr(n);
for (int &i : arr)
cin >> i;
vi l(n), r(n);
int lc = arr[0], rc = arr[n - 1];
REP(i, 0, n - 1) {
lc = __gcd(lc, arr[i]);
l[i] = lc;
}
for (int i = n - 1; i >= 0; i--) {
rc = __gcd(rc, arr[i]);
r[i] = rc;
}
int mx = max(l[1], r[n - 2]);
REP(i, 1, n - 2) {
int gc = __gcd(l[i - 1], r[i + 1]);
mx = max(mx, gc);
}
cout << mx;
}
int main() {
////// FILE BASED IO////
// freopen("wormhole.in", "r", stdin);
// freopen("wormhole.out", "w", stdout);
///////////////
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin>>t;
REP(i, 1, t) { solve(i); }
return 0;
}
| /*
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 push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define MOD 1000000007
void solve(int test_case) { // 227
int n;
cin >> n;
vi arr(n);
for (int &i : arr)
cin >> i;
vi l(n), r(n);
int lc = arr[0], rc = arr[n - 1];
REP(i, 0, n - 1) {
lc = __gcd(lc, arr[i]);
l[i] = lc;
}
for (int i = n - 1; i >= 0; i--) {
rc = __gcd(rc, arr[i]);
r[i] = rc;
}
int mx = max(r[1], l[n - 2]);
REP(i, 1, n - 2) {
int gc = __gcd(l[i - 1], r[i + 1]);
mx = max(mx, gc);
}
cout << mx;
}
int main() {
////// FILE BASED IO////
// freopen("wormhole.in", "r", stdin);
// freopen("wormhole.out", "w", stdout);
///////////////
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin>>t;
REP(i, 1, t) { solve(i); }
return 0;
}
| [
"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 + 1);
for (int i = 1; i <= n; i++)
l[i] = gcd(a[i - 1], l[i - 1]);
a.insert(a.begin(), 0);
for (int i = n - 1; i >= 0; i--)
r[i] = gcd(a[i + 1], r[i + 1]); /*
for(int i = 0; i <= n; i++)std::cout << l[i] << " ";
std::cout << std::endl;
for(int i = 0; i <= n; i++)std::cout << r[i] << " ";
std::cout << std::endl;*/
int max = 0;
for (int i = 0; i < n - 1; i++)
max = std::max(gcd(l[i], r[i + 1]), (long long)max);
std::cout << max << std::endl;
} | #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 + 1);
for (int i = 1; i <= n; i++)
l[i] = gcd(a[i - 1], l[i - 1]);
a.insert(a.begin(), 0);
for (int i = n - 1; i >= 0; i--)
r[i] = gcd(a[i + 1], r[i + 1]);
int max = 0;
for (int i = 0; i <= n - 1; i++)
max = std::max(gcd(l[i], r[i + 1]), (long long)max);
std::cout << max << std::endl;
} | [
"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 push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a / gcd(a, b) * b;
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
bool isprime(int n) { //素数判定
if (n == 1)
return false;
if (n == 2)
return true;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
int n;
cin >> n;
vi v(n), s(n), t(n);
rep(i, n) {
cin >> v[i];
if (i == 0)
s[i] = v[i];
else
s[i] = gcd(v[i], s[i - 1]);
}
rev(i, n) {
if (i == n - 1)
t[i] = v[i];
else
t[i] = gcd(v[i], t[i + 1]);
}
int ma = -1;
rep(i, n) {
if (i == 0)
chmax(ma, t[i + 1]);
else if (i == n - 1)
chmax(ma, s[i - 1]);
else
chmax(ma, gcd(s[i - 1], v[i + 1]));
}
cout << ma << endl;
// for(auto p:s)cout << p << ' ';cout << endl;
// for(auto p:t) cout << p << ' ';cout << endl;
return 0;
} | #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 push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a / gcd(a, b) * b;
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
bool isprime(int n) { //素数判定
if (n == 1)
return false;
if (n == 2)
return true;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
int n;
cin >> n;
vi v(n), s(n), t(n);
rep(i, n) {
cin >> v[i];
if (i == 0)
s[i] = v[i];
else
s[i] = gcd(v[i], s[i - 1]);
}
rev(i, n) {
if (i == n - 1)
t[i] = v[i];
else
t[i] = gcd(v[i], t[i + 1]);
}
int ma = -1;
rep(i, n) {
if (i == 0)
chmax(ma, t[i + 1]);
else if (i == n - 1)
chmax(ma, s[i - 1]);
else
chmax(ma, gcd(s[i - 1], t[i + 1]));
}
cout << ma << endl;
// for(auto p:s)cout << p << ' ';cout << endl;
// for(auto p:t) cout << p << ' ';cout << endl;
return 0;
} | [
"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)
n *= 2;
v = vector<int>(2 * n - 1);
rep(i, size) v[i + n - 1] = a[i];
rep(i, n) {
int j = i;
while (j > 0) {
j = (j - 1) / 2;
v[j] = gcd(v[2 * j + 1], v[2 * j + 2]);
}
}
}
SegmentTree(int size) {
n = 1;
while (n < size)
n *= 2;
v = vector<int>(2 * n - 1, 0);
}
void update(int i, int x) {
i += n - 1;
v[i] = x;
while (i > 0) {
i = (i - 1) / 2;
v[i] = gcd(v[2 * i + 1], v[2 * i + 2]);
}
}
int solve(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0;
if (a <= l && r <= b)
return v[k];
int c1 = solve(a, b, 2 * k + 1, l, (l + r) / 2);
int c2 = solve(a, b, 2 * k + 2, (l + r) / 2, r);
return gcd(c1, c2);
}
int solve(int a, int b) { return solve(a, b, 0, 0, n); }
};
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
SegmentTree st(n, a);
int ans = -1;
rep(i, n) { ans = max(ans, gcd(st.solve(0, i), st.solve(i + 1, n))); }
cout << ans << endl;
return 0;
}
| #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)
n *= 2;
v = vector<int>(2 * n - 1);
rep(i, size) v[i + n - 1] = a[i];
rep(i, size) {
int j = i + n - 1;
while (j > 0) {
j = (j - 1) / 2;
v[j] = gcd(v[2 * j + 1], v[2 * j + 2]);
}
}
}
SegmentTree(int size) {
n = 1;
while (n < size)
n *= 2;
v = vector<int>(2 * n - 1, 0);
}
void update(int i, int x) {
i += n - 1;
v[i] = x;
while (i > 0) {
i = (i - 1) / 2;
v[i] = gcd(v[2 * i + 1], v[2 * i + 2]);
}
}
int solve(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0;
if (a <= l && r <= b)
return v[k];
int c1 = solve(a, b, 2 * k + 1, l, (l + r) / 2);
int c2 = solve(a, b, 2 * k + 2, (l + r) / 2, r);
return gcd(c1, c2);
}
int solve(int a, int b) { return solve(a, b, 0, 0, n); }
};
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
SegmentTree st(n, a);
int ans = -1;
rep(i, n) { ans = max(ans, gcd(st.solve(0, i), st.solve(i + 1, n))); }
cout << ans << endl;
return 0;
}
| [
"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, n - 1) l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 1; i >= 1; --i)
r[i - 1] = gcd(r[i], a[i]);
int ans = 1;
rep(i, n) ans = max(ans, gcd(l[i], r[i]));
cout << ans << endl;
return 0;
}
| #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;
rep(i, n - 1) l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 1; i >= 1; --i)
r[i - 1] = gcd(r[i], a[i]);
int ans = 1;
rep(i, n) ans = max(ans, gcd(l[i], r[i]));
cout << ans << endl;
return 0;
}
| [
"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 >> n;
int a[n];
rep(i, n) cin >> a[i];
ll l[n + 1], r[n + 1];
l[0] = r[0] = INF;
rep(i, n) {
l[i + 1] = gcd(l[i], a[i]);
r[i + 1] = gcd(r[i], a[n - 1 - i]);
}
ll ans = 1;
rep(i, n) ans = max(ans, gcd(l[i], r[n - i - 1]));
cout << ans << endl;
return 0;
}
| #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 >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll l[n + 1], r[n + 1];
l[0] = r[0] = INF;
rep(i, n) {
l[i + 1] = gcd(l[i], a[i]);
r[i + 1] = gcd(r[i], a[n - 1 - i]);
}
ll ans = 1;
rep(i, n) ans = max(ans, gcd(l[i], r[n - i - 1]));
cout << ans << endl;
return 0;
}
| [
"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 >> n;
int a[n];
rep(i, n) cin >> a[i];
ll l[n + 1], r[n + 1];
l[0] = r[0] = INF;
rep(i, n) {
l[i + 1] = gcd(l[i], a[i]);
r[i + 1] = gcd(r[i], a[n - 1 - i]);
}
ll ans = 0;
rep(i, n) ans = max(ans, gcd(l[i], r[n - i - 1]));
cout << ans << endl;
return 0;
}
| #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 >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll l[n + 1], r[n + 1];
l[0] = r[0] = INF;
rep(i, n) {
l[i + 1] = gcd(l[i], a[i]);
r[i + 1] = gcd(r[i], a[n - 1 - i]);
}
ll ans = 1;
rep(i, n) ans = max(ans, gcd(l[i], r[n - i - 1]));
cout << ans << endl;
return 0;
}
| [
"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.