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>
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;
return 0;
}
| [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 873,642 | 873,645 | 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;
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 873,644 | 873,645 | u075775814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void) {
int n;
cin >> n;
int a[100005];
rep(i, n) cin >> a[i];
int gl[100005], gr[100005];
gl[0] = 0, gl[1] = a[0];
gr[n - 1] = 0, gr[n - 2] = a[n - 1];
reps(i, 2, n) {
gl[i] = __gcd(gl[i - 1], a[i - 1]);
gr[n - i - 1] = __gcd(gr[i - 1], a[n - i + 1]);
}
// rep (i, n) cout << gl[i] << ", " << gr[i] << endl;
int ans;
ans = gl[n - 1] > gr[0] ? gl[n - 1] : gr[0];
reps(i, 1, n - 1) {
int tmp;
tmp = __gcd(gl[i], gr[i]);
if (tmp > ans)
ans = tmp;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void) {
int n;
cin >> n;
int a[100005];
rep(i, n) cin >> a[i];
int gl[100005], gr[100005];
gl[0] = 0, gl[1] = a[0];
gr[n - 1] = 0, gr[n - 2] = a[n - 1];
reps(i, 2, n) {
gl[i] = __gcd(gl[i - 1], a[i - 1]);
gr[n - i - 1] = __gcd(gr[n - i], a[n - i]);
}
// rep (i, n) cout << gl[i] << ", " << gr[i] << endl;
int ans;
ans = gl[n - 1] > gr[0] ? gl[n - 1] : gr[0];
reps(i, 1, n - 1) {
int tmp;
tmp = __gcd(gl[i], gr[i]);
if (tmp > ans)
ans = tmp;
}
cout << ans << endl;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.remove"
] | 873,650 | 873,651 | u451699824 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void) {
int n;
cin >> n;
int a[100005];
rep(i, n) cin >> a[i];
int gl[100005], gr[100005];
gl[0] = 0, gl[1] = a[0];
gr[n - 1] = 0, gr[n - 2] = a[n - 1];
reps(i, 2, n) {
gl[i] = __gcd(gl[i - 1], a[i]);
gr[n - i - 1] = __gcd(gr[i - 1], a[n - i]);
}
// rep (i, n) cout << gl[i] << ", " << gr[i] << endl;
int ans;
ans = gl[n - 1] > gr[0] ? gl[n - 1] : gr[0];
reps(i, 1, n - 1) {
int tmp;
tmp = __gcd(gl[i], gr[i]);
if (tmp > ans)
ans = tmp;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void) {
int n;
cin >> n;
int a[100005];
rep(i, n) cin >> a[i];
int gl[100005], gr[100005];
gl[0] = 0, gl[1] = a[0];
gr[n - 1] = 0, gr[n - 2] = a[n - 1];
reps(i, 2, n) {
gl[i] = __gcd(gl[i - 1], a[i - 1]);
gr[n - i - 1] = __gcd(gr[n - i], a[n - i]);
}
// rep (i, n) cout << gl[i] << ", " << gr[i] << endl;
int ans;
ans = gl[n - 1] > gr[0] ? gl[n - 1] : gr[0];
reps(i, 1, n - 1) {
int tmp;
tmp = __gcd(gl[i], gr[i]);
if (tmp > ans)
ans = tmp;
}
cout << ans << endl;
}
| [
"assignment.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 873,652 | 873,651 | u451699824 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define loop(n, i, a) for (int i = a; i < n; i++)
#define all(arr, n) arr, arr + n
#define allv(v) (v).begin(), (v).end()
#define rallv(v) (v).rbegin(), (v).rend()
#define m_p make_pair
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define sz(x) (int)x.size()
#define pb push_back
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int n;
cin >> n;
ll arr[n];
loop(n, i, 0) cin >> arr[i];
vll gcdl(n, arr[0]), gcdr(n, arr[n - 1]);
loop(n, i, 1) gcdl[i] = __gcd(gcdl[i - 1], arr[i]);
for (int i = n - 2; i >= 0; i--)
gcdr[i] = __gcd(gcdr[i + 1], arr[i]);
ll res = max(gcdl[1], gcdr[n - 2]);
loop(n - 1, i, 1) { res = max(res, __gcd(gcdl[i - 1], gcdr[i + 1])); }
cout << res << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define loop(n, i, a) for (int i = a; i < n; i++)
#define all(arr, n) arr, arr + n
#define allv(v) (v).begin(), (v).end()
#define rallv(v) (v).rbegin(), (v).rend()
#define m_p make_pair
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define sz(x) (int)x.size()
#define pb push_back
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int n;
cin >> n;
ll arr[n];
loop(n, i, 0) cin >> arr[i];
vll gcdl(n, arr[0]), gcdr(n, arr[n - 1]);
loop(n, i, 1) gcdl[i] = __gcd(gcdl[i - 1], arr[i]);
for (int i = n - 2; i >= 0; i--)
gcdr[i] = __gcd(gcdr[i + 1], arr[i]);
ll res = max(gcdl[n - 2], gcdr[1]);
loop(n - 1, i, 1) { res = max(res, __gcd(gcdl[i - 1], gcdr[i + 1])); }
cout << res << endl;
}
| [
"call.arguments.change",
"call.arguments.add"
] | 873,662 | 873,663 | u384398403 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll a[100010];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
ll l[100010], r[100010];
l[0] = 0;
r[n + 1] = 0;
for (int i = 0; i < n - 1; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
for (int i = n; i > 0; i--) {
r[i] = gcd(r[i + 1], a[i]);
}
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
ll tempans = gcd(l[i], r[i + 1]);
if (tempans > ans)
ans = tempans;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll a[100010];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
ll l[100010], r[100010];
l[0] = 0;
r[n + 1] = 0;
for (int i = 0; i < n - 1; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
for (int i = n; i > 0; i--) {
r[i] = gcd(r[i + 1], a[i]);
}
ll ans = 0;
for (int i = 0; i <= n; i++) {
ll tempans = gcd(l[i], r[i + 1]);
if (tempans > ans)
ans = tempans;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,674 | 873,675 | u012298376 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll a[100010];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
ll l[100010], r[100010];
l[0] = 0;
r[n + 1] = 0;
for (int i = 0; i < n - 1; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
for (int i = n; i > 0; i--) {
r[i] = gcd(r[i + 1], a[i]);
}
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
ll tempans = gcd(l[i], r[i]);
if (tempans > ans)
ans = tempans;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll a[100010];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
ll l[100010], r[100010];
l[0] = 0;
r[n + 1] = 0;
for (int i = 0; i < n - 1; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
for (int i = n; i > 0; i--) {
r[i] = gcd(r[i + 1], a[i]);
}
ll ans = 0;
for (int i = 0; i <= n; i++) {
ll tempans = gcd(l[i], r[i + 1]);
if (tempans > ans)
ans = tempans;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,677 | 873,675 | u012298376 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
vector<ll> yakusuu;
void yakusuurekkyo(ll num) {
rep(i, 1, sqrt(num)) {
if (num % i == 0) {
yakusuu.push_back(i);
yakusuu.push_back(num / i);
}
}
return;
}
signed main() {
ll n;
cin >> n;
ll a[n] = {};
rep(i, 0, n) cin >> a[i];
yakusuurekkyo(a[0]);
yakusuurekkyo(a[1]);
sort(yakusuu.begin(), yakusuu.end(), greater<ll>());
/*
rep(i,0,yakusuu.size()){
cout << yakusuu[i] << endl;
}
*/
rep(i, 0, yakusuu.size()) {
ll cnt = 0;
rep(j, 0, n) {
if (a[j] % yakusuu[i])
cnt++;
if (cnt >= 2)
break;
else if (j == n - 1) {
cout << yakusuu[i] << endl;
return 0;
}
}
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
vector<ll> yakusuu;
void yakusuurekkyo(ll num) {
rep(i, 1, sqrt(num) + 10) {
if (num % i == 0) {
yakusuu.push_back(i);
yakusuu.push_back(num / i);
}
}
return;
}
signed main() {
ll n;
cin >> n;
ll a[n] = {};
rep(i, 0, n) cin >> a[i];
yakusuurekkyo(a[0]);
yakusuurekkyo(a[1]);
sort(yakusuu.begin(), yakusuu.end(), greater<ll>());
/*
rep(i,0,yakusuu.size()){
cout << yakusuu[i] << endl;
}
*/
rep(i, 0, yakusuu.size()) {
ll cnt = 0;
rep(j, 0, n) {
if (a[j] % yakusuu[i])
cnt++;
if (cnt >= 2)
break;
else if (j == n - 1) {
cout << yakusuu[i] << endl;
return 0;
}
}
}
return 0;
}
| [
"expression.operation.binary.add"
] | 873,679 | 873,680 | u129134470 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
const int nmax = 1e9 + 7;
typedef long long ll;
int GCD(int a, int b) {
int M = max(a, b), m = min(a, b);
if (m == 0) {
return M;
} else {
while (M % m != 0) {
int res = M % m;
M = m;
m = res;
}
return m;
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
vector<int> L(N), R(N);
L[0] = 0;
L[1] = A[0];
for (int i = 2; i < N; i++) {
L[i] = GCD(A[i - 1], L[i - 1]);
}
R[N - 1] = 0;
R[N - 2] = A[N - 1];
for (int i = N - 3; i >= 0; i--) {
R[i] = GCD(L[i + 1], A[i + 1]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (ans < GCD(L[i], R[i])) {
ans = GCD(L[i], R[i]);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
const int nmax = 1e9 + 7;
typedef long long ll;
int GCD(int a, int b) {
int M = max(a, b), m = min(a, b);
if (m == 0) {
return M;
} else {
while (M % m != 0) {
int res = M % m;
M = m;
m = res;
}
return m;
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
vector<int> L(N), R(N);
L[0] = 0;
L[1] = A[0];
for (int i = 2; i < N; i++) {
L[i] = GCD(A[i - 1], L[i - 1]);
}
R[N - 1] = 0;
R[N - 2] = A[N - 1];
for (int i = N - 3; i >= 0; i--) {
R[i] = GCD(R[i + 1], A[i + 1]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (ans < GCD(L[i], R[i])) {
ans = GCD(L[i], R[i]);
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,681 | 873,682 | u280096880 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using P = pair<long long, long long>;
#define rep(i, n) for (long long i = 0; i < (long long)n; i++)
#define req(i, n) for (long long i = n - 1; i >= 0; i--)
#define range(i, a, b) for (long long i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((long long)(x).size())
#define COUT(x) cout << x << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define onBoard(y, x) (y >= 0 && y < h && x >= 0 && x < w)
#define pri_que priority_queue
#define vint vector<int>
#define vvint vector<vector<int>>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define vvc vector<vector<char>>
#define vc vector<char>
#define vp vector<pair<int, int>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define show(x) cout << #x << "=" << x << endl;
#define SUM(x) accumulate(x.begin(), x.end(), 0)
#define MAX(x) *max_element(x.begin(), x.end())
#define MIN(x) *min_element(x.begin(), x.end())
#define couty cout << "Yes" << endl
#define coutn cout << "No" << endl
#define coutY cout << "YES" << endl
#define coutN cout << "NO" << endl
#define yn(x) cout << (x ? "Yes" : "No") << endl
#define YN(x) cout << (x ? "YES" : "NO") << endl
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const long long dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const long long dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const long long INF = 1e15;
const long long MOD = 1e9 + 7;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
vint l(n, 0), r(n, 0);
l[0] = a[0];
r[0] = a[n - 1];
for (int i = 1; i < n; i++)
l[i] = gcd(l[i - 1], a[i]);
for (int i = 1; i < n; i++)
r[i] = gcd(r[i - 1], a[n - 1 - i]);
int res = 0;
chmax(res, r[n - 2]);
chmax(res, l[n - 2]);
for (int i = 1; i < n - 1; i++) {
int tmp = 0;
tmp = gcd(l[i - 1], r[i - 1]);
chmax(res, tmp);
}
// rep(i,n)cout<<"l["<<i<<']'<<l[i]<<endl;
// rep(i,n)cout<<"r["<<i<<']'<<r[i]<<endl;
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using P = pair<long long, long long>;
#define rep(i, n) for (long long i = 0; i < (long long)n; i++)
#define req(i, n) for (long long i = n - 1; i >= 0; i--)
#define range(i, a, b) for (long long i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((long long)(x).size())
#define COUT(x) cout << x << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define onBoard(y, x) (y >= 0 && y < h && x >= 0 && x < w)
#define pri_que priority_queue
#define vint vector<int>
#define vvint vector<vector<int>>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define vvc vector<vector<char>>
#define vc vector<char>
#define vp vector<pair<int, int>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define show(x) cout << #x << "=" << x << endl;
#define SUM(x) accumulate(x.begin(), x.end(), 0)
#define MAX(x) *max_element(x.begin(), x.end())
#define MIN(x) *min_element(x.begin(), x.end())
#define couty cout << "Yes" << endl
#define coutn cout << "No" << endl
#define coutY cout << "YES" << endl
#define coutN cout << "NO" << endl
#define yn(x) cout << (x ? "Yes" : "No") << endl
#define YN(x) cout << (x ? "YES" : "NO") << endl
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const long long dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const long long dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const long long INF = 1e15;
const long long MOD = 1e9 + 7;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int n;
cin >> n;
vint a(n);
rep(i, n) cin >> a[i];
vint l(n, 0), r(n, 0);
l[0] = a[0];
r[0] = a[n - 1];
for (int i = 1; i < n; i++)
l[i] = gcd(l[i - 1], a[i]);
for (int i = 1; i < n; i++)
r[i] = gcd(r[i - 1], a[n - 1 - i]);
int res = 0;
chmax(res, r[n - 2]);
chmax(res, l[n - 2]);
for (int i = 1; i < n - 1; i++) {
int tmp = 0;
// tmp=gcd(l[i-1],r[i-1]);
tmp = gcd(l[i - 1], r[n - 1 - i - 1]);
chmax(res, tmp);
}
// rep(i,n)cout<<"l["<<i<<']'<<l[i]<<endl;
// rep(i,n)cout<<"r["<<i<<']'<<r[i]<<endl;
cout << res << endl;
} | [
"assignment.change"
] | 873,685 | 873,686 | u876953939 | cpp |
p03061 | #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
vll a(n), l(n), r(n + 1), m(n);
rep(i, n) { cin >> a[i]; }
l[0] = 0;
r[n] = 0;
rep(i, n) { l[i + 1] = __gcd(l[i], a[i]); }
for (int i = n - 1; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
rep(i, n) { m[i] = __gcd(l[i], r[i + 1]); }
int max = 0;
rep(i, n) {
if (max < m[i]) {
max = m[i];
}
}
cout << max;
return 0;
}
| #include <algorithm> //sort(all(変数),greater<型名>()) で降順に
#include <cmath> //切り上げceil(値)
#include <deque>
#include <iomanip> //setprecision(数字)
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
vll a(n), l(n), r(n + 1), m(n);
rep(i, n) { cin >> a[i]; }
l[0] = 0;
r[n] = 0;
rep(i, n - 1) { l[i + 1] = __gcd(l[i], a[i]); }
for (int i = n - 1; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
rep(i, n) { m[i] = __gcd(l[i], r[i + 1]); }
int max = 0;
rep(i, n) {
if (max < m[i]) {
max = m[i];
}
}
cout << max;
return 0;
}
| [
"expression.operation.binary.add"
] | 873,687 | 873,688 | u667375816 | cpp |
p03061 | // 今日はお盆前の最終出社日です
// いい加減寝ろ
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d, maxi = 0, f = 0, mini = INF, sum = 0;
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i];
sort(all(v));
vector<ll> w = divisor(v[0]);
vector<ll> x = divisor(v[1]);
set<ll> s;
rep(i, w.size()) s.insert(w[i]);
rep(i, v.size()) s.insert(v[i]);
map<ll, ll> m;
rep(i, n) {
for (auto itr = s.begin(); itr != s.end(); ++itr) {
if (v[i] % *itr == 0)
m[*itr]++;
}
}
for (auto itr = s.rbegin(); itr != s.rend(); ++itr) {
if (m[*itr] >= n - 1) {
cout << *itr << endl;
return 0;
}
}
return 0;
}
| // 今日はお盆前の最終出社日です
// いい加減寝ろ
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d, maxi = 0, f = 0, mini = INF, sum = 0;
ll n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i];
sort(all(v));
vector<ll> w = divisor(v[0]);
vector<ll> x = divisor(v[1]);
set<ll> s;
rep(i, w.size()) s.insert(w[i]);
rep(i, x.size()) s.insert(x[i]);
map<ll, ll> m;
rep(i, n) {
for (auto itr = s.begin(); itr != s.end(); ++itr) {
if (v[i] % *itr == 0)
m[*itr]++;
}
}
for (auto itr = s.rbegin(); itr != s.rend(); ++itr) {
// cout<<*itr<<endl;
if (m[*itr] >= n - 1) {
cout << *itr << endl;
return 0;
}
}
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 873,689 | 873,690 | u683769494 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
int c;
while (a % b != 0) {
c = a % b;
a = b;
b = c;
}
return b;
}
}
int main() {
// Your code here!
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> left(n);
left[0] = 0;
for (int i = 1; i < n; i++) {
int x = max(left[i - 1], a[i - 1]);
int y = min(left[i - 1], a[i - 1]);
left[i] = gcd(x, y);
}
vector<int> right(n);
right[n - 1] = 0;
for (int i = n - 2; i > -1; i--) {
// cout << i << endl;
int x = max(right[i + 1], a[i + 1]);
int y = min(right[i + 1], a[i + 1]);
right[i] = gcd(x, y);
}
int ans;
for (int i = 0; i < n; i++) {
ans = max(ans, gcd(left[i], right[i]));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
int c;
while (a % b != 0) {
c = a % b;
a = b;
b = c;
}
return b;
}
}
int main() {
// Your code here!
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> left(n);
left[0] = 0;
for (int i = 1; i < n; i++) {
int x = max(left[i - 1], a[i - 1]);
int y = min(left[i - 1], a[i - 1]);
left[i] = gcd(x, y);
}
vector<int> right(n);
right[n - 1] = 0;
for (int i = n - 2; i > -1; i--) {
// cout << i << endl;
int x = max(right[i + 1], a[i + 1]);
int y = min(right[i + 1], a[i + 1]);
right[i] = gcd(x, y);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, gcd(left[i], right[i]));
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 873,693 | 873,694 | u798818115 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0)
return gcd(b, a % b);
else
return a;
}
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
l[0] = a[0];
r[0] = a[n - 1];
for (int i = 1; i < n; i++) {
l[i] = gcd(l[i - 1], a[i]);
}
for (int i = 1; i < n; i++) {
r[i] = gcd(r[i - 1], a[n - i - 1]);
}
for (int i = 1; i < n - 1; i++) {
ans = max(gcd(l[i - 1], r[n - i - 2]), ans);
}
ans = max(l[n - 1], ans);
ans = max(r[n - 1], ans);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b != 0)
return gcd(b, a % b);
else
return a;
}
int main() {
int n, ans = 1;
cin >> n;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
l[0] = a[0];
r[0] = a[n - 1];
for (int i = 1; i < n; i++) {
l[i] = gcd(l[i - 1], a[i]);
}
for (int i = 1; i < n; i++) {
r[i] = gcd(r[i - 1], a[n - i - 1]);
}
for (int i = 1; i < n - 1; i++) {
ans = max(gcd(l[i - 1], r[n - i - 2]), ans);
}
ans = max(l[n - 2], ans);
ans = max(r[n - 2], ans);
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,705 | 873,706 | u501163846 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INT_INF = 2147483647;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef pair<int, int> P;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int l[n], r[n];
rep(i, n) {
if (i == 0)
l[i] = a[i];
else
l[i] = gcd(l[i - 1], a[i]);
}
for (int i = n - 1; i >= 0; i--) {
if (i == n - 1)
r[i] = a[i];
else
r[i] = gcd(r[i + 1], a[i]);
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
chmax(ans, gcd(l[i - 1], r[i + 1]));
}
chmax(ans, l[n - 1]);
chmax(ans, r[1]);
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INT_INF = 2147483647;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef pair<int, int> P;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int l[n], r[n];
rep(i, n) {
if (i == 0)
l[i] = a[i];
else
l[i] = gcd(l[i - 1], a[i]);
}
for (int i = n - 1; i >= 0; i--) {
if (i == (n - 1))
r[i] = a[i];
else
r[i] = gcd(r[i + 1], a[i]);
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
chmax(ans, gcd(l[i - 1], r[i + 1]));
}
chmax(ans, l[n - 2]);
chmax(ans, r[1]);
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,715 | 873,716 | u639032323 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#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 INF 1000000000000
#define MOD 1000000007
using ll = long long;
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.at(i);
vector<ll> l(n), r(n);
l.at(0) = a.at(0);
r.at(n - 1) = a.at(n - 1);
for (int i = 1; i <= n - 1; i++) {
l.at(i) = gcd(l.at(i - 1), a.at(i));
r.at(n - i - 1) = gcd(r.at(n - i), a.at(n - i - 1));
}
// rep1(i,n-1)cout<<a.at(i)<<"is eliminated. i is "<<i<<" "<<gcdf.at(i)<<"
// "<<gcdr.at(n-1-i)<<endl;
ll res = max(r.at(n - 2), r.at(1));
for (int i = 0; i < n - 2; i++) {
res = max(res, gcd(l.at(i), r.at(i + 2)));
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#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 INF 1000000000000
#define MOD 1000000007
using ll = long long;
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.at(i);
vector<ll> l(n), r(n);
l.at(0) = a.at(0);
r.at(n - 1) = a.at(n - 1);
for (int i = 1; i <= n - 1; i++) {
l.at(i) = gcd(l.at(i - 1), a.at(i));
r.at(n - i - 1) = gcd(r.at(n - i), a.at(n - i - 1));
}
// rep1(i,n-1)cout<<a.at(i)<<"is eliminated. i is "<<i<<" "<<gcdf.at(i)<<"
// "<<gcdr.at(n-1-i)<<endl;
ll res = max(l.at(n - 2), r.at(1));
// cout<<res<<endl;
for (int i = 0; i < n - 2; i++) {
res = max(res, gcd(l.at(i), r.at(i + 2)));
}
cout << res << endl;
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 873,717 | 873,718 | u779216084 | cpp |
p03061 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b != 0) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 1; i < N + 1; ++i)
cin >> A[i];
vector<long long> left(N + 2), right(N);
left[0] = 0, left[1] = A[1];
right[N + 1] = 0, right[N] = A[N];
for (int i = 2; i < N + 1; ++i) {
left[i] = gcd(A[i], left[i - 1]);
right[(N + 1) - i] = gcd(A[(N + 1) - i], right[(N + 1) - i + 1]);
}
long long gcd_max = 0;
for (int i = 1; i < N + 1; ++i) {
int a;
if (left[i - 1] == 0)
a = right[i + 1];
else if (right[i + 1] == 0)
a = left[i - 1];
else
a = gcd(left[i - 1], right[i + 1]);
if (gcd_max < a)
gcd_max = a;
}
cout << gcd_max << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
long long gcd(long long a, long long b) {
if (a % b != 0) {
return gcd(b, a % b);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 1; i < N + 1; ++i)
cin >> A[i];
vector<long long> left(N + 2), right(N + 2);
left[0] = 0, left[1] = A[1];
right[N + 1] = 0, right[N] = A[N];
for (int i = 2; i < N + 1; ++i) {
left[i] = gcd(A[i], left[i - 1]);
right[(N + 1) - i] = gcd(A[(N + 1) - i], right[(N + 1) - i + 1]);
}
long long gcd_max = 0;
for (int i = 1; i < N + 1; ++i) {
int a;
if (left[i - 1] == 0)
a = right[i + 1];
else if (right[i + 1] == 0)
a = left[i - 1];
else
a = gcd(left[i - 1], right[i + 1]);
if (gcd_max < a)
gcd_max = a;
}
cout << gcd_max << endl;
} | [
"assignment.change"
] | 873,721 | 873,722 | u323542775 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define MAX_T 1001
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
const long double PI = acos(-1);
const ll DEP = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int GCD(int x, int y) { return y ? GCD(y, x % y) : x; }
int N, a[100001];
int main() {
cin >> 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 res = 0;
for (int i = 0; i < N; i++) {
int l = left[i];
int r = right[i];
chmax(res, GCD(l, r));
}
cout << res << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define MAX_T 1001
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
const long double PI = acos(-1);
const ll DEP = 1e18;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int GCD(int x, int y) { return y ? GCD(y, x % y) : x; }
int N, a[100001];
int main() {
cin >> 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 res = 0;
for (int i = 0; i < N; i++) {
int l = left[i];
int r = right[i + 1];
chmax(res, GCD(l, r));
}
cout << res << endl;
}
| [
"assignment.change"
] | 873,725 | 873,726 | u342051078 | cpp |
p03061 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
ll gcd(ll n, ll m) {
if (n % m == 0)
return m;
return gcd(m, n % m);
}
ll lcm(ll n, ll m) { return n * m / gcd(n, m); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N, 0);
for (auto &i : A)
cin >> i;
vector<int> AA(N, 0);
vector<int> AB(N, 0);
REP(i, N) {
if (i == 0) {
AA[i] = A[i];
AB[N - 1 - i] = A[N - 1 - i];
} else {
AA[i] = gcd(AA[i - 1], A[i]);
AA[N - 1 - i] = gcd(AB[N - i], A[N - 1 - i]);
}
}
int ans = 0, tmp;
REP(i, N) {
if (i == 0) {
tmp = AB[1];
} else if (i == N - 1) {
tmp = AA[N - 2];
} else {
tmp = gcd(AA[i - 1], AB[i + 1]);
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
ll gcd(ll n, ll m) {
if (n % m == 0)
return m;
return gcd(m, n % m);
}
ll lcm(ll n, ll m) { return n * m / gcd(n, m); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
vector<ll> A(N, 0);
for (auto &i : A)
cin >> i;
vector<ll> AA(N, 0);
vector<ll> AB(N, 0);
REP(i, N) {
if (i == 0) {
AA[i] = A[i];
AB[N - 1 - i] = A[N - 1 - i];
} else {
AA[i] = gcd(AA[i - 1], A[i]);
AB[N - 1 - i] = gcd(AB[N - i], A[N - 1 - i]);
}
}
ll ans = 0, tmp;
REP(i, N) {
if (i == 0) {
tmp = AB[1];
} else if (i == N - 1) {
tmp = AA[N - 2];
} else {
tmp = gcd(AA[i - 1], AB[i + 1]);
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| [
"variable_declaration.type.change",
"assignment.variable.change",
"identifier.change"
] | 873,731 | 873,732 | u318042557 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, result = 0;
cin >> n;
int a[n], gcdleft[n + 1], gcdright[n + 1];
gcdleft[0] = 0;
gcdright[n] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
gcdleft[i + 1] = __gcd(a[i], gcdleft[i]);
}
for (int i = n - 1; i > -1; i--) {
gcdright[i] = __gcd(a[i], gcdright[i + 1]);
}
for (int i = 1; i < n; i++) {
result = max(result, __gcd(gcdleft[i - 1], gcdright[i]));
}
cout << result << '\n';
} | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, result = 0;
cin >> n;
int a[n], gcdleft[n + 1], gcdright[n + 1];
gcdleft[0] = 0;
gcdright[n] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
gcdleft[i + 1] = __gcd(a[i], gcdleft[i]);
}
for (int i = n - 1; i > -1; i--) {
gcdright[i] = __gcd(a[i], gcdright[i + 1]);
}
for (int i = 1; i < n + 1; i++) {
result = max(result, __gcd(gcdleft[i - 1], gcdright[i]));
}
cout << result << '\n';
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 873,739 | 873,740 | u270272336 | cpp |
p03061 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
ll gcd(ll x, ll y) {
if (x < y) {
ll temp = x;
x = y;
y = temp;
}
if (x % y)
return gcd(y, x % y);
return y;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> left(n);
vector<int> right(n);
left[0] = a[0];
for (int i = 1; i < n; i++) {
left[i] = gcd(a[i], left[i - 1]);
}
right[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
right[i] = gcd(a[i], right[i + 1]);
}
int ans = max(left[n - 1], right[1]);
for (int i = 1; i < n - 1; i++) {
ans = max(ans, (int)gcd(left[i - 1], right[i + 1]));
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
ll gcd(ll x, ll y) {
if (x < y) {
ll temp = x;
x = y;
y = temp;
}
if (x % y)
return gcd(y, x % y);
return y;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> left(n);
vector<int> right(n);
left[0] = a[0];
for (int i = 1; i < n; i++) {
left[i] = gcd(a[i], left[i - 1]);
}
right[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
right[i] = gcd(a[i], right[i + 1]);
}
int ans = max(left[n - 2], right[1]);
for (int i = 1; i < n - 1; i++) {
ans = max(ans, (int)gcd(left[i - 1], right[i + 1]));
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,741 | 873,742 | u075296067 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define vii vector<pair<int, int>>
#define ii pair<int, int>
#define loop(n) for (ll i = 0; i < n; i++)
#define pb push_back
const ll mod = 1e9 + 7;
void fast();
int main() {
fast();
int n;
cin >> n;
int a[n];
loop(n) cin >> a[i];
sort(a, a + n);
vi prefix(n + 1, a[0]), suffix(n + 1, a[n - 1]);
for (int i = 1; i < n; i++)
prefix[i] = __gcd((ll)a[i], prefix[i - 1]);
for (int i = n - 2; i >= 0; --i)
suffix[i] = __gcd((ll)a[i], suffix[i + 1]);
ll res = max(prefix[n - 1], suffix[0]);
for (int i = 1; i < n - 1; i++)
res = max(res, __gcd(prefix[i - 1], suffix[i + 1]));
cout << res;
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
/*
*/
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define vii vector<pair<int, int>>
#define ii pair<int, int>
#define loop(n) for (ll i = 0; i < n; i++)
#define pb push_back
const ll mod = 1e9 + 7;
void fast();
int main() {
fast();
int n;
cin >> n;
int a[n];
loop(n) cin >> a[i];
sort(a, a + n);
vi prefix(n + 1, a[0]), suffix(n + 1, a[n - 1]);
for (int i = 1; i < n; i++)
prefix[i] = __gcd((ll)a[i], prefix[i - 1]);
for (int i = n - 2; i >= 0; --i)
suffix[i] = __gcd((ll)a[i], suffix[i + 1]);
ll res = max(prefix[n - 2], suffix[1]);
for (int i = 1; i < n - 1; i++)
res = max(res, __gcd(prefix[i - 1], suffix[i + 1]));
cout << res;
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
/*
*/
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,747 | 873,748 | u936875047 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(a, n) for (int i = a; i < n; i++)
ll gcd(ll n1, ll n2) { return n2 == 0 ? n1 : gcd(n2, n1 % n2); }
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> A(N), R(N + 1), L(N + 1);
rep(0, N) cin >> A[i];
L[1] = A[0], R[N - 1] = A[N - 1];
rep(0, N - 1) {
L[i + 2] = gcd(A[i + 1], L[i + 1]);
R[N - 2 - i] = gcd(R[N - i - 1], A[N - 2 - i]);
}
L[0] = R[N - 1], R[N] = R[1];
rep(0, N) { ans = max(ans, gcd(L[i], R[i + 1])); }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(a, n) for (int i = a; i < n; i++)
ll gcd(ll n1, ll n2) { return n2 == 0 ? n1 : gcd(n2, n1 % n2); }
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> A(N), R(N + 1), L(N + 1);
rep(0, N) cin >> A[i];
L[1] = A[0], R[N - 1] = A[N - 1];
rep(0, N - 1) {
L[i + 2] = gcd(A[i + 1], L[i + 1]);
R[N - 2 - i] = gcd(R[N - i - 1], A[N - 2 - i]);
}
L[0] = R[N - 1], R[N] = L[1];
rep(0, N) { ans = max(ans, gcd(L[i], R[i + 1])); }
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 873,751 | 873,752 | u432088501 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(a, n) for (int i = a; i < n; i++)
ll gcd(ll n1, ll n2) { return n2 == 0 ? n1 : gcd(n2, n1 % n2); }
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> A(N), R(N + 1), L(N + 1);
rep(0, N) cin >> A[i];
L[1] = A[0], R[N - 1] = A[N - 1];
rep(0, N - 1) {
L[i + 2] = gcd(A[i + 1], L[i + 1]);
R[N - 2 - i] = gcd(R[N - i - 1], A[N - 1 - i]);
}
L[0] = A[N - 1], R[N] = A[0];
rep(0, N) { ans = max(ans, gcd(L[i], R[i + 1])); }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(a, n) for (int i = a; i < n; i++)
ll gcd(ll n1, ll n2) { return n2 == 0 ? n1 : gcd(n2, n1 % n2); }
int main() {
ll N, ans = 0;
cin >> N;
vector<ll> A(N), R(N + 1), L(N + 1);
rep(0, N) cin >> A[i];
L[1] = A[0], R[N - 1] = A[N - 1];
rep(0, N - 1) {
L[i + 2] = gcd(A[i + 1], L[i + 1]);
R[N - 2 - i] = gcd(R[N - i - 1], A[N - 2 - i]);
}
L[0] = R[N - 1], R[N] = L[1];
rep(0, N) { ans = max(ans, gcd(L[i], R[i + 1])); }
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 873,753 | 873,752 | u432088501 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) \
do { \
sort(v, v + n); \
reverse(v, v + n); \
} while (0)
#define all(x) (x).begin(), (x).end()
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<ll, ll> LP;
ll POW(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return POW(x * x, n / 2) % MOD;
return x % MOD * POW(x, n - 1) % MOD;
}
ll POW2(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return POW2(x * x, n / 2);
return x * POW2(x, n - 1);
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v;
u = v;
v = r;
}
return u;
}
ll lcm(ll u, ll v) { return u * v / gcd(u, v); }
ll KAI(ll m) {
if (m < 0)
return 0;
if (m == 0)
return 1;
return m * KAI(m - 1) % MOD;
}
ll KAI2(ll m) {
if (m < 0)
return 0;
if (m == 0)
return 1;
return m * KAI2(m - 1);
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll a, ll m) { return (a % m + m) % m; }
ll modinv(ll a) {
ll x, y;
extGCD(a, MOD, x, y);
return mod(x, MOD);
}
ll COM(ll m, ll n) {
if (m < n)
return 0;
if (n < 0)
return 0;
if (n == 0)
return 1;
if (m == n)
return 1;
return KAI(m) % MOD * modinv(KAI(n) % MOD * KAI(m - n) % MOD) % MOD;
}
ll COM2(ll m, ll n) {
if (m < n)
return 0;
if (n < 0)
return 0;
if (n == 0)
return 1;
if (m == n)
return 1;
return KAI2(m) / KAI2(n) / KAI2(m - n);
}
ll DEC(ll x, ll m, ll n) { return x % POW(m, n + 1) / POW(m, n); }
ll keta(ll x, ll n) {
if (x == 0)
return 0;
return keta(x / n, n) + 1;
}
ll DIV(ll x, ll n) {
if (x == 0)
return 0;
return x / n + DIV(x / n, n);
}
ll ORD(ll x, ll n) {
if (x == 0)
return INF;
if (x % n != 0)
return 0;
return 1 + ORD(x / n, n);
}
int main() {
ll n, a[200000], x[200000], y[200000], c[200000], ans;
cin >> n;
rep(i, n) cin >> a[i];
x[0] = a[0];
FOR(i, 1, n) x[i] = gcd(x[i - 1], a[i]);
y[n - 1] = a[n - 1];
per(i, n - 1) y[i] = gcd(y[i + 1], a[i]);
c[0] = y[0];
c[n - 1] = x[n - 2];
FOR(i, 1, n - 1) c[i] = gcd(x[i - 1], y[i + 1]);
ans = c[0];
rep(i, n) ans = max(ans, c[i]);
printf("%lld", ans);
} | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) \
do { \
sort(v, v + n); \
reverse(v, v + n); \
} while (0)
#define all(x) (x).begin(), (x).end()
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
typedef pair<ll, ll> LP;
ll POW(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return POW(x * x, n / 2) % MOD;
return x % MOD * POW(x, n - 1) % MOD;
}
ll POW2(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return POW2(x * x, n / 2);
return x * POW2(x, n - 1);
}
ll gcd(ll u, ll v) {
ll r;
while (0 != v) {
r = u % v;
u = v;
v = r;
}
return u;
}
ll lcm(ll u, ll v) { return u * v / gcd(u, v); }
ll KAI(ll m) {
if (m < 0)
return 0;
if (m == 0)
return 1;
return m * KAI(m - 1) % MOD;
}
ll KAI2(ll m) {
if (m < 0)
return 0;
if (m == 0)
return 1;
return m * KAI2(m - 1);
}
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
inline ll mod(ll a, ll m) { return (a % m + m) % m; }
ll modinv(ll a) {
ll x, y;
extGCD(a, MOD, x, y);
return mod(x, MOD);
}
ll COM(ll m, ll n) {
if (m < n)
return 0;
if (n < 0)
return 0;
if (n == 0)
return 1;
if (m == n)
return 1;
return KAI(m) % MOD * modinv(KAI(n) % MOD * KAI(m - n) % MOD) % MOD;
}
ll COM2(ll m, ll n) {
if (m < n)
return 0;
if (n < 0)
return 0;
if (n == 0)
return 1;
if (m == n)
return 1;
return KAI2(m) / KAI2(n) / KAI2(m - n);
}
ll DEC(ll x, ll m, ll n) { return x % POW(m, n + 1) / POW(m, n); }
ll keta(ll x, ll n) {
if (x == 0)
return 0;
return keta(x / n, n) + 1;
}
ll DIV(ll x, ll n) {
if (x == 0)
return 0;
return x / n + DIV(x / n, n);
}
ll ORD(ll x, ll n) {
if (x == 0)
return INF;
if (x % n != 0)
return 0;
return 1 + ORD(x / n, n);
}
int main() {
ll n, a[200000], x[200000], y[200000], c[200000], ans;
cin >> n;
rep(i, n) cin >> a[i];
x[0] = a[0];
FOR(i, 1, n) x[i] = gcd(x[i - 1], a[i]);
y[n - 1] = a[n - 1];
per(i, n - 1) y[i] = gcd(y[i + 1], a[i]);
c[0] = y[1];
c[n - 1] = x[n - 2];
FOR(i, 1, n - 1) c[i] = gcd(x[i - 1], y[i + 1]);
ans = c[0];
rep(i, n) ans = max(ans, c[i]);
printf("%lld", ans);
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 873,754 | 873,755 | u107995903 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n);
vector<long long> left(n), right(n);
for (int i = 0; i < n; i++)
cin >> v[i];
left[0] = v[0];
right[n - 1] = v[n - 1];
long long l = 0, r;
for (int i = 1; i < n; i++) {
l = __gcd(v[i], v[i - 1]);
left[i] = l;
}
for (int i = n - 2; i > -1; i--) {
r = __gcd(v[i], v[i + 1]);
right[i] = r;
}
long long ans = 0;
for (int i = 0; i < n - 2; i++) {
ans = max(ans, __gcd(left[i], right[i + 2]));
}
ans = max(ans, max(left[n - 2], right[1]));
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> v(n);
vector<long long> left(n), right(n);
for (int i = 0; i < n; i++)
cin >> v[i];
left[0] = v[0];
right[n - 1] = v[n - 1];
long long l = 0, r;
for (int i = 1; i < n; i++) {
l = __gcd(v[i], left[i - 1]);
left[i] = l;
}
for (int i = n - 2; i > -1; i--) {
r = __gcd(v[i], right[i + 1]);
right[i] = r;
}
long long ans = 0;
for (int i = 0; i < n - 2; i++) {
ans = max(ans, __gcd(left[i], right[i + 2]));
}
ans = max(ans, max(left[n - 2], right[1]));
cout << ans;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,761 | 873,762 | u724012411 | cpp |
p03061 | #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
#define N 200005
#define pq priority_queue<ll>
using namespace std;
int a[N], l[N], r[N];
int main() {
int n;
int ans = 0;
cin >> n;
rep(i, 1, n) cin >> a[i];
l[1] = a[1], r[n] = a[n];
rep(i, 2, n) l[i] = __gcd(l[i - 1], a[i]);
ford(i, n - 1, 1) r[i] = __gcd(r[i + 1], a[i]);
rep(i, 2, n - 1) ans = max(ans, __gcd(l[i - 1], r[i + 1]));
cout << ans;
re 0;
}
| #include <bits/stdc++.h>
#define ford(i, a, b) for (int i = (a); i >= b; i--)
#define rep(i, a, b) for (int i = (a); (i) <= (b); (i)++)
#define ll long long
#define re return
#define mp map<int, int>
#define N 200005
#define pq priority_queue<ll>
using namespace std;
int a[N], l[N], r[N];
int main() {
int n;
int ans = 0;
cin >> n;
rep(i, 1, n) cin >> a[i];
l[1] = a[1], r[n] = a[n];
rep(i, 2, n) l[i] = __gcd(l[i - 1], a[i]);
ford(i, n - 1, 1) r[i] = __gcd(r[i + 1], a[i]);
rep(i, 1, n) ans = max(ans, __gcd(l[i - 1], r[i + 1]));
cout << ans;
re 0;
}
| [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 873,766 | 873,767 | u796123030 | cpp |
p03061 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef unsigned long long int ull;
typedef pair<ll, ll> P;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
V<ll> a(n), l(n, 1), r(n, 1);
for (int i = 0; i < n; i++) {
cin >> a[i];
l[i] = a[i];
r[i] = a[i];
}
for (int i = 0; i < n - 1; i++)
l[i + 1] = gcd(l[i], l[i + 1]);
for (int i = n; i > 1; i--)
r[i - 1] = gcd(r[i], r[i - 1]);
ll ans = max(l[n - 2], r[1]);
for (int i = 0; i < n - 2; i++) {
ll d = gcd(l[i], r[i + 2]);
chmax(ans, d);
}
cout << ans << endl;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef unsigned long long int ull;
typedef pair<ll, ll> P;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
V<ll> a(n), l(n, 1), r(n, 1);
for (int i = 0; i < n; i++) {
cin >> a[i];
l[i] = a[i];
r[i] = a[i];
}
for (int i = 0; i < n - 1; i++)
l[i + 1] = gcd(l[i], l[i + 1]);
for (int i = n - 1; i >= 1; i--)
r[i - 1] = gcd(r[i], r[i - 1]);
ll ans = max(l[n - 2], r[1]);
for (int i = 0; i < n - 2; i++) {
ll d = gcd(l[i], r[i + 2]);
chmax(ans, d);
}
cout << ans << endl;
}
| [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 873,768 | 873,769 | u822169805 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), P(N), B(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
P[0] = A[0];
B[N - 1] = A[N - 1];
for (int i = 1; i < N; ++i)
P[i] = __gcd(A[i], P[i - 1]);
for (int i = N - 2; i >= 0; --i)
B[i] = __gcd(A[i], B[i + 1]);
int ans = max(B[1], P[N - 1]);
for (int i = 1; i < N - 1; ++i)
ans = max(ans, __gcd(P[i - 1], B[i + 1]));
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), P(N), B(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
P[0] = A[0];
B[N - 1] = A[N - 1];
for (int i = 1; i < N; ++i)
P[i] = __gcd(A[i], P[i - 1]);
for (int i = N - 2; i >= 0; --i)
B[i] = __gcd(A[i], B[i + 1]);
int ans = max(B[1], P[N - 2]);
for (int i = 1; i < N - 1; ++i)
ans = max(ans, __gcd(P[i - 1], B[i + 1]));
cout << ans << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,770 | 873,771 | u107077660 | cpp |
p03061 | #include <bits/stdc++.h>
#include <fstream>
#define inputtxt() \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf())
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define foreach(e, v) for (auto e : v)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
#define collect(arr, size) rep(i, size) cin >> arr[i];
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
collect(a, n);
vector<int> l(n), r(n);
l[0] = a[0];
r[n - 1] = a[n - 1];
reps(i, 1, n - 1) {
l[i] = gcd(l[i - 1], a[i]);
r[n - 1 - i] = gcd(r[n - i], a[n - 1 - i]);
}
int mx = max(l[n - 2], r[n - 2]);
rep(i, n - 2) { mx = max(mx, gcd(l[i], r[i + 2])); }
cout << mx << endl;
return 0;
} | #include <bits/stdc++.h>
#include <fstream>
#define inputtxt() \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf())
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define foreach(e, v) for (auto e : v)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
#define collect(arr, size) rep(i, size) cin >> arr[i];
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
collect(a, n);
vector<int> l(n), r(n);
l[0] = a[0];
r[n - 1] = a[n - 1];
reps(i, 1, n - 1) {
l[i] = gcd(l[i - 1], a[i]);
r[n - 1 - i] = gcd(r[n - i], a[n - 1 - i]);
}
int mx = max(l[n - 2], r[1]);
rep(i, n - 2) { mx = max(mx, gcd(l[i], r[i + 2])); }
cout << mx << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,779 | 873,780 | u979852867 | cpp |
p03061 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define int long long
// abどちらが大きくてもいけるよ
signed gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// 使う時はgcdも呼び出してあげよう
signed ngcd(vector<int> a) {
int res = a.at(0);
for (int i = 1; i < a.size() && res != 1; i++) {
res = gcd(res, a.at(i));
}
return res;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
if (n == 2) {
cout << max(a.at(0), a.at(1)) << endl;
;
return 0;
}
vector<int> l(n), r(n), total(n);
l.at(0) = a.at(0);
l.at(1) = gcd(a.at(0), a.at(1));
for (int i = 2; i < n; i++) {
l.at(i) = gcd(l.at(i - 1), a.at(i));
}
r.at(n - 1) = a.at(n - 1);
r.at(n - 2) = gcd(a.at(n - 1), a.at(n - 2));
for (int i = n - 3; i >= 0; i--) {
r.at(i) = gcd(r.at(i), r.at(i + 1));
}
total.at(0) = r.at(1);
total.at(n - 1) = l.at(n - 2);
for (int i = 1; i < n - 1; i++) {
total.at(i) = gcd(l.at(i - 1), r.at(i + 1));
}
int ans = 1;
for (int i = 0; i < n; i++) {
ans = max(ans, total.at(i));
}
cout << ans << endl;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define int long long
// abどちらが大きくてもいけるよ
signed gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// 使う時はgcdも呼び出してあげよう
signed ngcd(vector<int> a) {
int res = a.at(0);
for (int i = 1; i < a.size() && res != 1; i++) {
res = gcd(res, a.at(i));
}
return res;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
if (n == 2) {
cout << max(a.at(0), a.at(1)) << endl;
;
return 0;
}
vector<int> l(n), r(n), total(n);
l.at(0) = a.at(0);
l.at(1) = gcd(a.at(0), a.at(1));
for (int i = 2; i < n; i++) {
l.at(i) = gcd(l.at(i - 1), a.at(i));
}
r.at(n - 1) = a.at(n - 1);
r.at(n - 2) = gcd(a.at(n - 1), a.at(n - 2));
for (int i = n - 3; i >= 0; i--) {
r.at(i) = gcd(a.at(i), r.at(i + 1));
}
total.at(0) = r.at(1);
total.at(n - 1) = l.at(n - 2);
for (int i = 1; i < n - 1; i++) {
total.at(i) = gcd(l.at(i - 1), r.at(i + 1));
}
int ans = 1;
for (int i = 0; i < n; i++) {
ans = max(ans, total.at(i));
}
cout << ans << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,781 | 873,782 | u487060019 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int n;
cin >> n;
int a[100000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int L[100000];
for (int i = 1; i < n; i++) {
L[0] = 0;
L[i] = gcd(L[i - 1], a[i - 1]);
}
int R[100000];
for (int i = n - 2; i >= 0; i--) {
R[n - 1] = 0;
R[i] = gcd(R[i + 1], a[i + 1]);
}
int M[100000];
int ans = 0;
for (int i = 0; i < n; i++) {
M[i] = gcd(L[i], R[i]);
ans = max(ans, M[i]);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#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;
int a[100000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int L[100000];
for (int i = 1; i < n; i++) {
L[0] = 0;
L[i] = gcd(L[i - 1], a[i - 1]);
}
int R[100000];
for (int i = n - 2; i >= 0; i--) {
R[n - 1] = 0;
R[i] = gcd(R[i + 1], a[i + 1]);
}
int M[100000];
int ans = 0;
for (int i = 0; i < n; i++) {
M[i] = gcd(L[i], R[i]);
ans = max(ans, M[i]);
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"function.return_value.change"
] | 873,785 | 873,786 | u745267317 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
ull gcd(ull a, ull b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ull N;
cin >> N;
ull A[N], next_gcd[N], back_gcd[N];
ull max_gcd = 0, gcd_n, prev_gcd_n, gcd_b, prev_gcd_b;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
if (i == 0)
gcd_n = A[0];
gcd_n = gcd(gcd_n, A[i]);
next_gcd[i] = gcd_n;
};
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1)
gcd_b = A[N - 1];
gcd_b = gcd(gcd_b, A[i]);
back_gcd[i] = gcd_b;
};
for (int i = 0; i < N; i++) {
if (i == 0)
gcd_n = back_gcd[N - 1];
else
gcd_n = next_gcd[i - 1];
if (i == N - 1)
gcd_b = next_gcd[0];
gcd_b = back_gcd[i + 1];
max_gcd = max(max_gcd, gcd(gcd_n, gcd_b));
}
cout << max_gcd << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
ull gcd(ull a, ull b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ull N;
cin >> N;
ull A[N], next_gcd[N], back_gcd[N];
ull max_gcd = 0, gcd_n, prev_gcd_n, gcd_b, prev_gcd_b;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++) {
if (i == 0)
gcd_n = A[0];
gcd_n = gcd(gcd_n, A[i]);
next_gcd[i] = gcd_n;
};
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1)
gcd_b = A[N - 1];
gcd_b = gcd(gcd_b, A[i]);
back_gcd[i] = gcd_b;
};
for (int i = 0; i < N; i++) {
if (i == 0)
gcd_n = back_gcd[N - 1];
else
gcd_n = next_gcd[i - 1];
if (i == N - 1)
gcd_b = next_gcd[0];
else
gcd_b = back_gcd[i + 1];
max_gcd = max(max_gcd, gcd(gcd_n, gcd_b));
}
cout << max_gcd << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 873,789 | 873,790 | u494249944 | cpp |
p03061 | #include <algorithm>
#include <iostream>
using namespace std;
int gcd(int x, int y) {
int r;
while (y != 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int u[n];
int d[n];
u[0] = a[0];
d[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
u[i] = gcd(u[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; i--) {
d[i] = gcd(d[i + 1], a[i]);
}
int ans;
ans = max(d[1], d[n - 2]);
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(u[i - 1], d[i + 1]));
}
cout << ans << '\n';
}
| #include <algorithm>
#include <iostream>
using namespace std;
int gcd(int x, int y) {
int r;
while (y != 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int u[n];
int d[n];
u[0] = a[0];
d[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
u[i] = gcd(u[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; i--) {
d[i] = gcd(d[i + 1], a[i]);
}
// for(int i = 0; i < n; i++){
// cout << u[i] << " ";
// }
// cout << "\n";
// for(int i = 0; i < n; i++){
// cout << d[i] << " ";
// }
// cout << "\n";
int ans;
ans = max(d[1], u[n - 2]);
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(u[i - 1], d[i + 1]));
}
cout << ans << '\n';
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,791 | 873,792 | u416773418 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>; // to cost
using UnWeightedGraph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int 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;
}
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<vector<T>> &df) {
for (int i = 0; i < df.size(); i++)
for (int j = 0; j < df[i].size(); j++)
is >> df[i][j];
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
int gcd(int a, int b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
cin >> a;
if (n == 1) {
print(a[0]);
return 0;
}
vector<int> r(n + 1), rr(n + 1);
r[0] = a[0];
rr[n] = a[n - 1];
rep(i, n) {
if (i == 0)
continue;
r[i] = gcd(r[i - 1], a[i]);
}
rrep(i, n) { rr[i] = gcd(rr[i + 1], a[i]); }
dump(r, rr);
int ans = 1;
for (int i = 0; i < n; i++) {
if (i == 0) {
dump(rr[i + 1]);
chmax(ans, rr[i + 1]);
} else if (i == n - 1) {
dump(r[i - 1]);
chmax(ans, r[i]);
} else {
dump(rr[i + 1], r[i - 1]);
chmax(ans, gcd(rr[i + 1], r[i - 1]));
}
}
print(ans);
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>; // to cost
using UnWeightedGraph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int 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;
}
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<vector<T>> &df) {
for (int i = 0; i < df.size(); i++)
for (int j = 0; j < df[i].size(); j++)
is >> df[i][j];
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
int gcd(int a, int b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
cin >> a;
if (n == 1) {
print(a[0]);
return 0;
}
vector<int> r(n + 1), rr(n + 1);
r[0] = a[0];
rr[n] = a[n - 1];
rep(i, n) {
if (i == 0)
continue;
r[i] = gcd(r[i - 1], a[i]);
}
rrep(i, n) { rr[i] = gcd(rr[i + 1], a[i]); }
dump(r, rr);
int ans = 1;
for (int i = 0; i < n; i++) {
if (i == 0) {
dump(rr[i + 1]);
chmax(ans, rr[i + 1]);
} else if (i == n - 1) {
dump(r[i - 1]);
chmax(ans, r[i - 1]);
} else {
dump(rr[i + 1], r[i - 1]);
chmax(ans, gcd(rr[i + 1], r[i - 1]));
}
}
print(ans);
}
| [
"expression.operation.binary.add"
] | 873,795 | 873,796 | u616029737 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define rep1(i, N) for (ll i = 1; i < (N); i++)
ll N;
ll A[100005];
ll pgcd[100005];
ll sgcd[100005];
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(a % b, b);
}
ll ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> A[i];
pgcd[0] = A[0];
rep1(i, N) { pgcd[i] = gcd(pgcd[i - 1], A[i]); }
sgcd[N - 1] = A[N - 1];
rep1(i, N) {
ll j = N - i;
sgcd[j - 1] = gcd(sgcd[j], A[j - 1]);
}
rep(i, N) {
if (i == 0) {
ans = max(ans, pgcd[1]);
} else if (i == N - 1) {
ans = max(ans, sgcd[N - 2]);
} else {
ans = max(ans, gcd(pgcd[i - 1], sgcd[i + 1]));
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define rep1(i, N) for (ll i = 1; i < (N); i++)
ll N;
ll A[100005];
ll pgcd[100005];
ll sgcd[100005];
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
else
return gcd(a % b, b);
}
ll ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> A[i];
pgcd[0] = A[0];
rep1(i, N) { pgcd[i] = gcd(pgcd[i - 1], A[i]); }
sgcd[N - 1] = A[N - 1];
rep1(i, N) {
ll j = N - i;
sgcd[j - 1] = gcd(sgcd[j], A[j - 1]);
}
rep(i, N) {
if (i == 0) {
ans = max(ans, sgcd[1]);
} else if (i == N - 1) {
ans = max(ans, pgcd[N - 2]);
} else {
ans = max(ans, gcd(pgcd[i - 1], sgcd[i + 1]));
}
}
cout << ans << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,812 | 873,813 | u654191866 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0 || b == 0) {
return max(a, b);
} else if (a == 1 || b == 1) {
return 1;
}
long long q;
bool pro = true;
while (pro) {
q = a % b;
if (q = 0) {
return min(a, b);
} else {
a = b;
b = q;
if (a % b == 0) {
return q;
pro = false;
}
}
}
}
int main() {
int N;
cin >> N;
if (N == 2) {
int a, b;
cin >> a >> b;
cout << max(a, b) << endl;
} else {
vector<long long> an(N);
for (int i = 0; i < N; i++) {
cin >> an.at(i);
}
vector<long long> li(N);
vector<long long> ri(N);
li.at(0) = an.at(0);
ri.at(N - 1) = an.at(N - 1);
for (int i = 1; i < N; i++) {
li.at(i) = gcd(li.at(i - 1), an.at(i));
}
for (int i = N - 2; i >= 0; i = i - 1) {
ri.at(i) = gcd(ri.at(i + 1), an.at(i));
}
long long m = ri.at(1);
for (int i = 1; i < N - 1; i++) {
long long mi = gcd(ri.at(i + 1), li.at(i - 1));
if (mi > m) {
m = mi;
}
}
if (li.at(N - 2) > m) {
m = li.at(N - 2);
}
cout << m << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0 || b == 0) {
return max(a, b);
} else if (a == 1 || b == 1) {
return 1;
}
long long q;
bool pro = true;
while (pro) {
q = a % b;
if (q == 0) {
return min(a, b);
} else {
a = b;
b = q;
if (a % b == 0) {
return q;
pro = false;
}
}
}
}
int main() {
int N;
cin >> N;
if (N == 2) {
int a, b;
cin >> a >> b;
cout << max(a, b) << endl;
} else {
vector<long long> an(N);
for (int i = 0; i < N; i++) {
cin >> an.at(i);
}
vector<long long> li(N);
vector<long long> ri(N);
li.at(0) = an.at(0);
ri.at(N - 1) = an.at(N - 1);
for (int i = 1; i < N; i++) {
li.at(i) = gcd(li.at(i - 1), an.at(i));
}
for (int i = N - 2; i >= 0; i = i - 1) {
ri.at(i) = gcd(ri.at(i + 1), an.at(i));
}
long long m = ri.at(1);
for (int i = 1; i < N - 1; i++) {
long long mi = gcd(ri.at(i + 1), li.at(i - 1));
if (mi > m) {
m = mi;
}
}
if (li.at(N - 2) > m) {
m = li.at(N - 2);
}
cout << m << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 873,816 | 873,817 | u176979814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main(void) {
int n;
cin >> n;
ll a[n + 5], b[n + 5], c[n + 5];
rep(i, n) { cin >> a[i]; }
b[0] = a[0];
for (int i = 1; i < n; i++) {
b[i] = gcd(a[i], b[i - 1]);
}
c[n] = a[n - 1];
for (int i = n - 1; i >= 2; i--) {
c[i] = gcd(c[i + 1], a[i - 1]);
}
ll ans = max(b[n - 1], c[2]);
for (int i = 0; i < n - 2; i++) {
ans = max(gcd(b[i], c[i + 3]), ans);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b) {
return gcd(b, a);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main(void) {
int n;
cin >> n;
ll a[n + 5], b[n + 5], c[n + 5];
rep(i, n) { cin >> a[i]; }
b[0] = a[0];
for (int i = 1; i < n; i++) {
b[i] = gcd(a[i], b[i - 1]);
}
c[n] = a[n - 1];
for (int i = n - 1; i >= 2; i--) {
c[i] = gcd(c[i + 1], a[i - 1]);
}
ll ans = max(b[n - 2], c[2]);
for (int i = 0; i < n - 2; i++) {
ans = max(gcd(b[i], c[i + 3]), ans);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,820 | 873,821 | u950411977 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(a % b, b);
}
int main(void) {
int N, ans = 0, temp;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int leftgcd[N]; //左からi番目までのgcd
int rightgcd[N]; //右からi番目までのgcd
leftgcd[0] = A[0];
rightgcd[0] = A[N - 1];
for (int i = 1; i < N; i++) {
leftgcd[i] = gcd(leftgcd[i - 1], A[i]);
}
for (int i = 1; i < N; i++) {
rightgcd[i] = gcd(rightgcd[i - 1], A[(N - 1) - i]);
}
//あとは地点iから左のgcdと右のgcdのgcdを求める
for (int i = 0; i < N - 1; i++) {
if (i == 0) {
temp = rightgcd[N - 1 - 1];
} else if (i == (N - 1)) {
temp = leftgcd[N - 2];
} else {
temp = gcd(leftgcd[i - 1], rightgcd[N - 2 - i]);
}
if (temp > ans)
ans = temp;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(a % b, b);
}
int main(void) {
int N, ans = 0, temp;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
cin >> A[i];
int leftgcd[N]; //左からi番目までのgcd
int rightgcd[N]; //右からi番目までのgcd
leftgcd[0] = A[0];
rightgcd[0] = A[N - 1];
for (int i = 1; i < N; i++) {
leftgcd[i] = gcd(leftgcd[i - 1], A[i]);
}
for (int i = 1; i < N; i++) {
rightgcd[i] = gcd(rightgcd[i - 1], A[(N - 1) - i]);
}
//あとは地点iから左のgcdと右のgcdのgcdを求める
for (int i = 0; i <= N - 1; i++) {
if (i == 0) {
temp = rightgcd[N - 1 - 1];
} else if (i == (N - 1)) {
temp = leftgcd[N - 2];
} else {
temp = gcd(leftgcd[i - 1], rightgcd[N - 2 - i]);
}
if (temp > ans)
ans = temp;
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,822 | 873,823 | u168774513 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n + 1), r(n + 1);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i)
l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 1; i >= 0; --i)
r[i] = gcd(r[i + 1], a[i]);
ll res = 0;
for (int i = 0; i < n; ++i) {
ll L = l[i];
ll R = r[i];
res = max(res, gcd(L, R));
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n + 1), r(n + 1);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i)
l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 1; i >= 0; --i)
r[i] = gcd(r[i + 1], a[i]);
ll res = 0;
for (int i = 0; i < n; ++i) {
ll L = l[i];
ll R = r[i + 1];
res = max(res, gcd(L, R));
}
cout << res << endl;
return 0;
}
| [
"assignment.change"
] | 873,824 | 873,825 | u620269708 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n + 1), r(n + 1);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i)
l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 1; i >= 0; + --i)
r[i] = gcd(r[i + 1], a[i]);
ll res = 0;
for (int i = 0; i < n; ++i) {
ll L = l[i];
ll R = r[i];
res = max(res, gcd(L, R));
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n + 1), r(n + 1);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i)
l[i + 1] = gcd(l[i], a[i]);
for (int i = n - 1; i >= 0; --i)
r[i] = gcd(r[i + 1], a[i]);
ll res = 0;
for (int i = 0; i < n; ++i) {
ll L = l[i];
ll R = r[i + 1];
res = max(res, gcd(L, R));
}
cout << res << endl;
return 0;
}
| [
"expression.operation.unary.arithmetic.remove"
] | 873,826 | 873,825 | u620269708 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a == 0 || b == 0)
return max(a, b);
if (a == 1 || b == 1)
return 1;
if (a < b)
return gcd(b, a);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int N;
vector<int64_t> A(100010);
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
// L[i]:A[1]~A[i]のgcd, R[i]:A[i]~A[N]のgcd
vector<int64_t> L(100010, 0), R(100010, 0);
L[1] = A[1];
R[N] = A[N];
for (int i = 1; i <= N; i++) {
L[i + 1] = gcd(L[i], A[i + 1]);
R[N - i] = gcd(R[N - i + 1], A[N - i]);
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, gcd(L[i - 1], R[i + 1]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a == 0 || b == 0)
return max(a, b);
if (a == 1 || b == 1)
return 1;
if (a < b)
return gcd(b, a);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int N;
vector<int64_t> A(100010);
cin >> N;
for (int i = 1; i <= N; i++)
cin >> A[i];
// L[i]:A[1]~A[i]のgcd, R[i]:A[i]~A[N]のgcd
vector<int64_t> L(100010, 0), R(100010, 0);
L[1] = A[1];
R[N] = A[N];
for (int i = 1; i <= N; i++) {
L[i + 1] = gcd(L[i], A[i + 1]);
R[N - i] = gcd(R[N - i + 1], A[N - i]);
}
int64_t ans = 0;
for (int i = 0; i <= N; i++) {
ans = max(ans, gcd(L[i - 1], R[i + 1]));
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,829 | 873,830 | u285358283 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
const double EPS = 1e-10;
// a,bの最大公約数
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
//最小公倍数, 複数の時はlcm(a,lcm(b,c))みたいな感じで
template <class T> T lcm(T a, T b) { return a * (b / gcd(a, b)); }
template <typename Monoid, typename F> class SegmentTree {
private:
int n;
vector<Monoid> node;
const F op; //演算
const Monoid e; //単位元
public:
SegmentTree(int sz, const F op, const Monoid &e) : op(op), e(e) {
n = 1;
while (n < sz)
n *= 2;
node.assign(2 * n, e);
}
void set(int k, const Monoid &x) { node[k + n - 1] = x; }
void build() {
for (int i = 0; i < n - 1; i++) {
node[i] = op(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int k, const Monoid &x) {
k += n - 1;
node[k] = x;
while (k > 0) {
k = (k - 1) / 2;
node[k] = op(node[2 * k + 1], node[2 * k + 2]);
}
}
Monoid query(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return e;
if (a <= l && r <= b)
return node[k];
else {
Monoid vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
Monoid vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return op(vl, vr);
}
}
Monoid operator[](const int &k) const { return node[k + n]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll e = 1;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
e = lcm(e, a[i]);
}
auto f = [](int a, int b) { return gcd(a, b); };
SegmentTree<ll, decltype(f)> seg(n + 10, f, e);
rep(i, n) { seg.update(i, a[i]); }
ll ans = 0;
rep(i, n) {
seg.update(i, e);
chmax(ans, seg.query(0, n));
seg.update(i, a[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
const double EPS = 1e-10;
// a,bの最大公約数
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
//最小公倍数, 複数の時はlcm(a,lcm(b,c))みたいな感じで
template <class T> T lcm(T a, T b) { return a * (b / gcd(a, b)); }
template <typename Monoid, typename F> class SegmentTree {
private:
int n;
vector<Monoid> node;
const F op; //演算
const Monoid e; //単位元
public:
SegmentTree(int sz, const F op, const Monoid &e) : op(op), e(e) {
n = 1;
while (n < sz)
n *= 2;
node.assign(2 * n, e);
}
void set(int k, const Monoid &x) { node[k + n - 1] = x; }
void build() {
for (int i = 0; i < n - 1; i++) {
node[i] = op(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int k, const Monoid &x) {
k += n - 1;
node[k] = x;
while (k > 0) {
k = (k - 1) / 2;
node[k] = op(node[2 * k + 1], node[2 * k + 2]);
}
}
Monoid query(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return e;
if (a <= l && r <= b)
return node[k];
else {
Monoid vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
Monoid vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return op(vl, vr);
}
}
Monoid operator[](const int &k) const { return node[k + n]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll e = 1;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
e = lcm(e, a[i]);
}
auto f = [&](ll a, ll b) { return gcd(a, b); };
SegmentTree<ll, decltype(f)> seg(n + 10, f, e);
rep(i, n) { seg.update(i, a[i]); }
ll ans = 0;
rep(i, n) {
seg.update(i, e);
chmax(ans, seg.query(0, n));
seg.update(i, a[i]);
}
cout << ans << endl;
} | [] | 873,835 | 873,836 | u340010271 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
const double EPS = 1e-10;
// a,bの最大公約数
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
//最小公倍数, 複数の時はlcm(a,lcm(b,c))みたいな感じで
template <class T> T lcm(T a, T b) { return a * (b / gcd(a, b)); }
template <typename Monoid, typename F> class SegmentTree {
private:
int n;
vector<Monoid> node;
const F op; //演算
const Monoid e; //単位元
public:
SegmentTree(int sz, const F op, const Monoid &e) : op(op), e(e) {
n = 1;
while (n < sz)
n *= 2;
node.assign(2 * n, e);
}
void set(int k, const Monoid &x) { node[k + n - 1] = x; }
void build() {
for (int i = 0; i < n - 1; i++) {
node[i] = op(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int k, const Monoid &x) {
k += n - 1;
node[k] = x;
while (k > 0) {
k = (k - 1) / 2;
node[k] = op(node[2 * k + 1], node[2 * k + 2]);
}
}
Monoid query(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return e;
if (a <= l && r <= b)
return node[k];
else {
Monoid vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
Monoid vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return op(vl, vr);
}
}
Monoid operator[](const int &k) const { return node[k + n]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll e = 1;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
e = lcm(e, a[i]);
}
auto f = [](int a, int b) { return gcd(a, b); };
SegmentTree<ll, decltype(f)> seg(n + 10, f, e);
rep(i, n) { seg.update(i, a[i]); }
ll ans = 0;
rep(i, n) {
seg.update(i, e);
chmax(ans, seg.query(0, n));
seg.update(i, a[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
const double EPS = 1e-10;
// a,bの最大公約数
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
//最小公倍数, 複数の時はlcm(a,lcm(b,c))みたいな感じで
template <class T> T lcm(T a, T b) { return a * (b / gcd(a, b)); }
template <typename Monoid, typename F> class SegmentTree {
private:
int n;
vector<Monoid> node;
const F op; //演算
const Monoid e; //単位元
public:
SegmentTree(int sz, const F op, const Monoid &e) : op(op), e(e) {
n = 1;
while (n < sz)
n *= 2;
node.assign(2 * n, e);
}
void set(int k, const Monoid &x) { node[k + n - 1] = x; }
void build() {
for (int i = 0; i < n - 1; i++) {
node[i] = op(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int k, const Monoid &x) {
k += n - 1;
node[k] = x;
while (k > 0) {
k = (k - 1) / 2;
node[k] = op(node[2 * k + 1], node[2 * k + 2]);
}
}
Monoid query(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return e;
if (a <= l && r <= b)
return node[k];
else {
Monoid vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
Monoid vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return op(vl, vr);
}
}
Monoid operator[](const int &k) const { return node[k + n]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll e = 1;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
e = lcm(e, a[i]);
}
auto f = [&](ll a, ll b) { return gcd(a, b); };
SegmentTree<ll, decltype(f)> seg(n + 10, f, e);
rep(i, n) { seg.update(i, a[i]); }
ll ans = 0;
rep(i, n) {
seg.update(i, e);
chmax(ans, seg.query(0, n));
seg.update(i, a[i]);
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 873,837 | 873,836 | u340010271 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
ll gcd(ll a, ll b) {
ll temp;
temp = a % b;
while (temp != 0) {
a = b;
b = temp;
temp = a % b;
}
return b;
}
int main() {
ll n, a, ans = 0, check;
cin >> n;
ll A[n], F[n], B[n];
RAP(i, n) { cin >> A[i]; }
F[0] = A[0], B[0] = A[n - 1];
FOR(i, 1, n) {
F[i] = gcd(F[i - 1], A[i]);
B[i] = gcd(B[i - 1], A[n - 1 - i]);
}
RAP(i, n) {
if (i == 0) {
check = B[n - 2];
} else if (i == n - 1) {
check = F[n - 2];
} else {
check = gcd(F[i - 1], B[i - 1]);
}
ans = max(ans, check);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
ll gcd(ll a, ll b) {
ll temp;
temp = a % b;
while (temp != 0) {
a = b;
b = temp;
temp = a % b;
}
return b;
}
int main() {
ll n, a, ans = 0, check;
cin >> n;
ll A[n], F[n], B[n];
RAP(i, n) { cin >> A[i]; }
F[0] = A[0], B[0] = A[n - 1];
FOR(i, 1, n) {
F[i] = gcd(F[i - 1], A[i]);
B[i] = gcd(B[i - 1], A[n - 1 - i]);
}
RAP(i, n) {
if (i == 0) {
check = B[n - 2];
} else if (i == n - 1) {
check = F[n - 2];
} else {
check = gcd(F[i - 1], B[n - 2 - i]);
}
ans = max(ans, check);
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"assignment.change"
] | 873,838 | 873,839 | u761994361 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long long y, long long x) { return x ? gcd(x, y % x) : y; }
int main(void) {
int n;
cin >> n;
vector<int> a(n), d(n), e(n);
rep(i, n) {
cin >> a.at(i);
d.at(i) = 0;
e.at(i) = 0;
}
int tmp = a.at(0);
rep(i, n) {
tmp = gcd(tmp, a.at(i));
d.at(i) = tmp;
}
tmp = a.at(n - 1);
rep(i, n) {
tmp = gcd(tmp, a.at(n - i - 1));
e.at(i) = tmp;
}
int gcd_max = 0;
rep(i, n) {
if (i != 0 && i != n - 1) {
tmp = gcd(d.at(i - 1), e.at(i - 1));
} else {
if (i == 0) {
tmp = e.at(n - 2);
} else {
tmp = d.at(n - 2);
}
}
gcd_max = max(tmp, gcd_max);
}
cout << gcd_max << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long gcd(long long y, long long x) { return x ? gcd(x, y % x) : y; }
int main(void) {
int n;
cin >> n;
vector<int> a(n), d(n), e(n);
rep(i, n) {
cin >> a.at(i);
d.at(i) = 0;
e.at(i) = 0;
}
int tmp = a.at(0);
rep(i, n) {
tmp = gcd(tmp, a.at(i));
d.at(i) = tmp;
}
tmp = a.at(n - 1);
rep(i, n) {
tmp = gcd(tmp, a.at(n - i - 1));
e.at(i) = tmp;
}
int gcd_max = 0;
rep(i, n) {
if (i != 0 && i != n - 1) {
tmp = gcd(d.at(i - 1), e.at(n - i - 2));
} else {
if (i == 0) {
tmp = e.at(n - 2);
} else {
tmp = d.at(n - 2);
}
}
gcd_max = max(tmp, gcd_max);
}
cout << gcd_max << endl;
return 0;
} | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,842 | 873,843 | u690475097 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> data(N), front(N), back(N);
for (int i = 0; i < N; i++)
cin >> data.at(i);
front.at(N - 1) = data.at(N - 1);
back.at(0) = data.at(0);
for (int i = 1; i < N; i++) {
back.at(i) = __gcd(back.at(i - 1), data.at(i));
front.at(N - 1 - i) = __gcd(back.at(N - i), data.at(N - 1 - i));
}
long ans = 1;
for (int i = 0; i < N; i++) {
if (i == 0) {
ans = max(ans, front.at(i + 1));
} else if (i == N - 1) {
ans = max(ans, back.at(N - 2));
} else {
ans = max(ans, __gcd(front.at(i + 1), back.at(N - 2)));
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> data(N), front(N), back(N);
for (int i = 0; i < N; i++)
cin >> data.at(i);
front.at(N - 1) = data.at(N - 1);
back.at(0) = data.at(0);
for (int i = 1; i < N; i++) {
back.at(i) = __gcd(back.at(i - 1), data.at(i));
front.at(N - 1 - i) = __gcd(front.at(N - i), data.at(N - 1 - i));
}
long ans = 1;
for (int i = 0; i < N; i++) {
if (i == 0) {
ans = max(ans, front.at(i + 1));
} else if (i == N - 1) {
ans = max(ans, back.at(N - 2));
} else {
ans = max(ans, __gcd(front.at(i + 1), back.at(i - 1)));
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.change"
] | 873,848 | 873,849 | u239087789 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
// aとbの最大公約数を求める
long long evalmod(long long a, long long b) {
long long maxval = std::max(a, b);
long long minval = std::min(a, b);
if (minval == 0) {
return maxval;
}
long long tmpval = maxval % minval;
return evalmod(minval, tmpval);
}
int main() {
int N;
scanf("%d", &N);
std::vector<long long> A(N), L(N), R(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
L[0] = A[0];
for (int i = 1; i < N; i++) {
L[i] = evalmod(L[i - 1], A[i]);
}
R[0] = A[N - 1];
for (int i = 1; i < N; i++) {
R[i] = evalmod(R[i - 1], A[N - 1 - i]);
}
long long mod = A[0];
for (int i = 1; i < N; i++) {
mod = evalmod(mod, A[i]);
}
long long ans = 1;
for (int i = 0; i < N; i++) {
if (i == 0) {
ans = std::max(ans, R[N - 2]);
} else if (i == N - 1) {
ans = std::max(ans, L[N - 1]);
} else {
ans = std::max(ans, evalmod(L[i - 1], R[N - i - 2]));
}
}
printf("%lld\n", ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
// aとbの最大公約数を求める
long long evalmod(long long a, long long b) {
long long maxval = std::max(a, b);
long long minval = std::min(a, b);
if (minval == 0) {
return maxval;
}
long long tmpval = maxval % minval;
return evalmod(minval, tmpval);
}
int main() {
int N;
scanf("%d", &N);
std::vector<long long> A(N), L(N), R(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
L[0] = A[0];
for (int i = 1; i < N; i++) {
L[i] = evalmod(L[i - 1], A[i]);
}
R[0] = A[N - 1];
for (int i = 1; i < N; i++) {
R[i] = evalmod(R[i - 1], A[N - 1 - i]);
}
long long mod = A[0];
for (int i = 1; i < N; i++) {
mod = evalmod(mod, A[i]);
}
long long ans = 1;
for (int i = 0; i < N; i++) {
if (i == 0) {
ans = std::max(ans, R[N - 2]);
} else if (i == N - 1) {
ans = std::max(ans, L[N - 2]);
} else {
ans = std::max(ans, evalmod(L[i - 1], R[N - i - 2]));
}
}
printf("%lld\n", ans);
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,860 | 873,861 | u339419997 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define ffrvs(ii, nn, mm) for (int ii = nn; ii >= mm; ii--)
#define srt(vvv) sort(vvv.begin(), vvv.end())
#define srtrvs(vvv) reverse(vvv.begin(), vvv.end())
#define Graph vector<vector<int>>
i64 inf = 1000000007;
i64 giant = 4000000000000000037;
using namespace std;
//メモリ置き場
int n;
vector<int> a;
// inputします
void input() {
cin >> n;
a.resize(n);
ff(i, 0, n) { cin >> a[i]; }
srt(a);
}
//ライブラリ置き場
//最大公約数
i64 gcd(i64 aa28, i64 bb28) { // aa28>bb28とすること
i64 rr28 = aa28 % bb28;
if (rr28 == 0)
return bb28;
return gcd(bb28, rr28);
}
//最小公倍数
i64 lcm(i64 aa29, i64 bb29) { return aa29 * bb29 / gcd(aa29, bb29); }
// main
int main() {
input();
vector<int> l(n);
vector<int> r(n);
l[0] = a[0];
ff(i, 1, n - 1) { l[i] = gcd(l[i - 1], a[i]); }
r[n - 1] = a[n - 1];
ffrvs(i, n - 2, 1) { r[i] = gcd(r[i + 1], a[i]); }
int ans = r[1];
ff(i, 1, n - 1) {
int pre = gcd(r[i + 1], l[i - 1]);
if (pre > ans)
ans = pre;
}
if (l[n - 1] > ans)
ans = l[n - 1];
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define ffrvs(ii, nn, mm) for (int ii = nn; ii >= mm; ii--)
#define srt(vvv) sort(vvv.begin(), vvv.end())
#define srtrvs(vvv) reverse(vvv.begin(), vvv.end())
#define Graph vector<vector<int>>
i64 inf = 1000000007;
i64 giant = 4000000000000000037;
using namespace std;
//メモリ置き場
int n;
vector<int> a;
// inputします
void input() {
cin >> n;
a.resize(n);
ff(i, 0, n) { cin >> a[i]; }
srt(a);
}
//ライブラリ置き場
//最大公約数
i64 gcd(i64 aa28, i64 bb28) { // aa28>bb28とすること
i64 rr28 = aa28 % bb28;
if (rr28 == 0)
return bb28;
return gcd(bb28, rr28);
}
//最小公倍数
i64 lcm(i64 aa29, i64 bb29) { return aa29 * bb29 / gcd(aa29, bb29); }
// main
int main() {
input();
vector<int> l(n);
vector<int> r(n);
l[0] = a[0];
ff(i, 1, n - 1) { l[i] = gcd(l[i - 1], a[i]); }
r[n - 1] = a[n - 1];
ffrvs(i, n - 2, 1) { r[i] = gcd(r[i + 1], a[i]); }
int ans = r[1];
ff(i, 1, n - 1) {
int pre = gcd(r[i + 1], l[i - 1]);
if (pre > ans)
ans = pre;
}
if (l[n - 2] > ans)
ans = l[n - 2];
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 873,862 | 873,863 | u771541325 | cpp |
p03061 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
return gcd(b, r);
}
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int l[n + 1], r[n + 1];
l[0] = 0, r[n] = 0;
l[1] = a[0], r[n - 1] = a[n - 1];
for (int i = 2; i < n; i++)
l[i] = gcd(l[i - 1], a[i]);
for (int i = n - 2; i >= 0; i--)
r[i] = gcd(r[i + 1], a[i]);
int ans = 1;
rep(i, n) {
if (l[i] == 0)
ans = max(ans, r[i + 1]);
else if (r[i + 1] == 0)
ans = max(ans, l[i]);
else
ans = max(ans, (int)gcd(l[i], r[i + 1]));
}
OP(ans);
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
return gcd(b, r);
}
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int l[n + 1], r[n + 1];
l[0] = 0, r[n] = 0;
l[1] = a[0], r[n - 1] = a[n - 1];
for (int i = 2; i <= n; i++)
l[i] = gcd(l[i - 1], a[i - 1]);
for (int i = n - 2; i >= 0; i--)
r[i] = gcd(r[i + 1], a[i]);
int ans = 1;
rep(i, n + 1) {
if (l[i] == 0)
ans = max(ans, r[i + 1]);
else if (r[i + 1] == 0)
ans = max(ans, l[i]);
else
ans = max(ans, (int)gcd(l[i], r[i + 1]));
}
OP(ans);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 873,864 | 873,865 | u016189984 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i = n; i >= 1; --i)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FILL(c, v) fill((c).begin(), (c).end(), v)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define CLR(a) memset((a), 0, sizeof(a))
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long LL;
typedef unsigned long long ULL;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL A[100001];
LL L_gcd[100001];
LL R_gcd[100001];
void solve() {
int N;
cin >> N;
LL ans = 0;
REP1(i, N) {
cin >> A[i];
L_gcd[i] = gcd(L_gcd[i - 1], A[i - 1]);
}
RREP1(i, N) { R_gcd[i] = gcd(R_gcd[i + 1], A[i]); }
REP0(i, N) { // A[i] を除外した場合における gcd
ans = max(gcd(L_gcd[i], R_gcd[i + 1]), ans);
}
cout << ans << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
solve();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i = n; i >= 1; --i)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FILL(c, v) fill((c).begin(), (c).end(), v)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define CLR(a) memset((a), 0, sizeof(a))
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long LL;
typedef unsigned long long ULL;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL A[100001];
LL L_gcd[100001];
LL R_gcd[100001];
void solve() {
int N;
cin >> N;
LL ans = 0;
REP1(i, N) {
cin >> A[i];
L_gcd[i] = gcd(L_gcd[i - 1], A[i - 1]);
}
RREP1(i, N) { R_gcd[i] = gcd(R_gcd[i + 1], A[i]); }
REP1(i, N) { // A[i] を除外した場合における gcd
ans = max(gcd(L_gcd[i], R_gcd[i + 1]), ans);
}
cout << ans << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
solve();
return 0;
} | [
"identifier.change"
] | 873,866 | 873,867 | u938389536 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i = n; i >= 1; --i)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FILL(c, v) fill((c).begin(), (c).end(), v)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define CLR(a) memset((a), 0, sizeof(a))
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long LL;
typedef unsigned long long ULL;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL A[100001];
LL L_gcd[100001];
LL R_gcd[100001];
void solve() {
int N;
cin >> N;
LL ans = 0;
REP1(i, N) {
cin >> A[i];
L_gcd[i] = gcd(L_gcd[i - 1], A[i]);
}
RREP1(i, N) { R_gcd[i] = gcd(R_gcd[i + 1], A[i]); }
REP0(i, N) { // A[i] を除外した場合における gcd
ans = max(gcd(L_gcd[i - 1], R_gcd[i + 1]), ans);
}
cout << ans << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
solve();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i = n; i >= 1; --i)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FILL(c, v) fill((c).begin(), (c).end(), v)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define CLR(a) memset((a), 0, sizeof(a))
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long LL;
typedef unsigned long long ULL;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL A[100001];
LL L_gcd[100001];
LL R_gcd[100001];
void solve() {
int N;
cin >> N;
LL ans = 0;
REP1(i, N) {
cin >> A[i];
L_gcd[i] = gcd(L_gcd[i - 1], A[i - 1]);
}
RREP1(i, N) { R_gcd[i] = gcd(R_gcd[i + 1], A[i]); }
REP1(i, N) { // A[i] を除外した場合における gcd
ans = max(gcd(L_gcd[i], R_gcd[i + 1]), ans);
}
cout << ans << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
solve();
return 0;
} | [
"assignment.change",
"identifier.change",
"expression.operation.binary.remove"
] | 873,868 | 873,867 | u938389536 | cpp |
p03061 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
const ll INF = 10000000000;
/****** define constant end ********/
/****** define variable start ******/
ll n;
vl a;
/******* define variable end *******/
ll gcd(ll a, ll b) {
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
return a + b;
}
ll solve() {
cin >> n;
a.resize(n);
REP(i, n) { cin >> a[i]; }
vl l(n);
vl r(n);
l[0] = 0;
r[n] = 0;
vl m(n);
REP(j, n) { l[j + 1] = gcd(l[j], a[j]); }
for (ll j = n - 1; j >= 0; j--) {
r[j] = gcd(r[j + 1], a[j]);
}
REP(i, n) { m[i] = gcd(l[i], r[i + 1]); }
ll ans = 0;
REP(i, n) { ans = max(m[i], ans); }
cout << ans << endl;
return 0;
}
int main() {
// clock_t start = clock();
cout << std::fixed << std::setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll end_solve = solve();
/*
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
1000.0; printf("time %lf[ms]\n", time);
*/
return (int)end_solve;
}
| #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
const ll INF = 10000000000;
/****** define constant end ********/
/****** define variable start ******/
ll n;
vl a;
/******* define variable end *******/
ll gcd(ll a, ll b) {
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
return a + b;
}
ll solve() {
cin >> n;
a.resize(n);
REP(i, n) { cin >> a[i]; }
vl l(n + 1);
vl r(n + 1);
l[0] = 0;
r[n] = 0;
vl m(n);
REP(j, n) { l[j + 1] = gcd(l[j], a[j]); }
for (ll j = n - 1; j >= 0; j--) {
r[j] = gcd(r[j + 1], a[j]);
}
REP(i, n) { m[i] = gcd(l[i], r[i + 1]); }
ll ans = 0;
REP(i, n) { ans = max(m[i], ans); }
cout << ans << endl;
return 0;
}
int main() {
// clock_t start = clock();
cout << std::fixed << std::setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll end_solve = solve();
/*
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
1000.0; printf("time %lf[ms]\n", time);
*/
return (int)end_solve;
}
| [
"assignment.change"
] | 873,869 | 873,870 | u313994303 | cpp |
p03061 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
const ll INF = 10000000000;
/****** define constant end ********/
/****** define variable start ******/
ll n;
vl a;
/******* define variable end *******/
ll gcd(ll a, ll b) {
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
return a + b;
}
ll solve() {
cin >> n;
a.resize(n);
REP(i, n) { cin >> a[i]; }
vl l(n);
vl r(n);
l[0] = 0;
r[0] = 0;
vl m(n);
REP(j, n) { l[j + 1] = gcd(l[j], a[j]); }
for (ll j = n - 1; j >= 0; j--) {
r[j] = gcd(r[j + 1], a[j]);
}
REP(i, n) { m[i] = gcd(l[i], r[i + 1]); }
ll ans = 0;
REP(i, n) { ans = max(m[i], ans); }
cout << ans << endl;
return 0;
}
int main() {
// clock_t start = clock();
cout << std::fixed << std::setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll end_solve = solve();
/*
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
1000.0; printf("time %lf[ms]\n", time);
*/
return (int)end_solve;
}
| #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> P;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
const ll INF = 10000000000;
/****** define constant end ********/
/****** define variable start ******/
ll n;
vl a;
/******* define variable end *******/
ll gcd(ll a, ll b) {
while (a && b) {
if (a >= b)
a %= b;
else
b %= a;
}
return a + b;
}
ll solve() {
cin >> n;
a.resize(n);
REP(i, n) { cin >> a[i]; }
vl l(n + 1);
vl r(n + 1);
l[0] = 0;
r[n] = 0;
vl m(n);
REP(j, n) { l[j + 1] = gcd(l[j], a[j]); }
for (ll j = n - 1; j >= 0; j--) {
r[j] = gcd(r[j + 1], a[j]);
}
REP(i, n) { m[i] = gcd(l[i], r[i + 1]); }
ll ans = 0;
REP(i, n) { ans = max(m[i], ans); }
cout << ans << endl;
return 0;
}
int main() {
// clock_t start = clock();
cout << std::fixed << std::setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll end_solve = solve();
/*
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
1000.0; printf("time %lf[ms]\n", time);
*/
return (int)end_solve;
}
| [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 873,871 | 873,870 | u313994303 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define fi first
#define se second
#define _SAD() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define SZ(s) s.size()
#define SRT(x, y) sort(x, x + y)
#define REV(a, b) reverse(a, a + b)
#define VSRT(x) sort(x.begin(), x.end())
#define VREV(x) reverse(x.begin(), x.end())
/*-----------------------------------------------------------------------------------------------*/
const int N = 1e5 + 10;
int n;
int a[N], b[N], x, ans = 0;
int main() {
_SAD()
cin >> n;
rep(i, n) cin >> a[i];
x = a[n - 1];
rrep(i, n) {
x = __gcd(x, a[i]);
b[i] = x;
}
ans = max(x, b[1]);
x = a[0];
repn(i, n - 2) {
ans = max(ans, __gcd(x, b[i + 1]));
x = __gcd(x, a[i]);
}
cout << ans << nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define fi first
#define se second
#define _SAD() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define SZ(s) s.size()
#define SRT(x, y) sort(x, x + y)
#define REV(a, b) reverse(a, a + b)
#define VSRT(x) sort(x.begin(), x.end())
#define VREV(x) reverse(x.begin(), x.end())
/*-----------------------------------------------------------------------------------------------*/
const int N = 1e5 + 10;
int n;
int a[N], b[N], x, ans = 0;
int main() {
_SAD()
cin >> n;
rep(i, n) cin >> a[i];
x = a[n - 1];
rrep(i, n) {
x = __gcd(x, a[i]);
b[i] = x;
}
ans = max(x, b[1]);
x = a[0];
repn(i, n - 2) {
ans = max(ans, __gcd(x, b[i + 1]));
x = __gcd(x, a[i]);
}
cout << max(ans, x) << nl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 873,876 | 873,877 | u351012095 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
long int i, n;
cin >> n;
long int a[n + 2];
for (i = 0; i < n; i++)
cin >> a[i];
long int x[n + 2], y[n + 2];
x[0] = a[0];
for (i = 1; i < n; i++) {
x[i] = __gcd(x[i - 1], a[i]);
}
y[n - 1] = a[n - 1];
for (i = n - 2; i >= 0; i--) {
y[i] = __gcd(y[i + 1], a[i]);
}
long int Max = 0;
Max = x[1];
Max = max(Max, y[n - 2]);
for (i = 1; i < n - 1; i++)
Max = max(Max, __gcd(x[i - 1], y[i + 1]));
cout << Max;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int i, n;
cin >> n;
long int a[n + 2];
for (i = 0; i < n; i++)
cin >> a[i];
long int x[n + 2], y[n + 2];
x[0] = a[0];
for (i = 1; i < n; i++) {
x[i] = __gcd(x[i - 1], a[i]);
}
y[n - 1] = a[n - 1];
for (i = n - 2; i >= 0; i--) {
y[i] = __gcd(y[i + 1], a[i]);
}
long int Max = 0;
Max = y[1];
Max = max(Max, x[n - 2]);
// cout<<"max from Here is "<<Max;
for (i = 1; i < n - 1; i++)
Max = max(Max, __gcd(x[i - 1], y[i + 1]));
cout << Max;
return (0);
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,878 | 873,879 | u135798926 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return ((a % b == 0 ? b : gcd(b, a % b))); }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> gcd_1(n);
vector<int> gcd_2(n);
gcd_1[0] = a[0];
gcd_2[0] = a[n - 1];
for (int i = 1; i < n; i++) {
gcd_1[i] = gcd(gcd_1[i - 1], a[i]);
gcd_2[i] = gcd(gcd_2[i - 1], a[n - i - 1]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int g = 0;
if (i == 0)
g = gcd_2[n - 2];
else if (i == n - 1)
g == gcd_1[n - 2];
else {
g = gcd(gcd_1[i - 1], gcd_2[n - i - 2]);
}
if (g > ans)
ans = g;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return ((a % b == 0 ? b : gcd(b, a % b))); }
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> gcd_1(n);
vector<int> gcd_2(n);
gcd_1[0] = a[0];
gcd_2[0] = a[n - 1];
for (int i = 1; i < n; i++) {
gcd_1[i] = gcd(gcd_1[i - 1], a[i]);
gcd_2[i] = gcd(gcd_2[i - 1], a[n - i - 1]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int g = 0;
if (i == 0)
g = gcd_2[n - 2];
else if (i == n - 1)
g = gcd_1[n - 2];
else {
g = gcd(gcd_1[i - 1], gcd_2[n - i - 2]);
}
if (g > ans)
ans = g;
}
cout << ans << endl;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 873,880 | 873,881 | u045368371 | cpp |
p03061 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll, ll>
#define int long long
using namespace std;
const ll N = 1e6 + 2;
const ll MOD = 1e9 + 7;
const ll INF = 1e15;
bool occ[10];
void solve() {
ll n;
cin >> n;
ll a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
ll gg[n + 1];
gg[0] = 0;
for (int i = 1; i <= n; i++)
gg[i] = __gcd(gg[i - 1], a[i]);
ll ggs[n + 1];
ggs[n] = a[n];
for (int i = n - 1; i >= 1; i--)
ggs[i] = __gcd(ggs[i + 1], a[i]);
ll ans = 0;
for (int i = 1; i <= n - 1; i++) {
ans = max(ans, __gcd(gg[i - 1], ggs[i + 1]));
}
ans = max(ans, gg[n]);
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll t = 1;
while (t--) {
solve();
}
// return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll, ll>
#define int long long
using namespace std;
const ll N = 1e6 + 2;
const ll MOD = 1e9 + 7;
const ll INF = 1e15;
bool occ[10];
void solve() {
ll n;
cin >> n;
ll a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
ll gg[n + 1];
gg[0] = 0;
for (int i = 1; i <= n; i++)
gg[i] = __gcd(gg[i - 1], a[i]);
ll ggs[n + 1];
ggs[n] = a[n];
for (int i = n - 1; i >= 1; i--)
ggs[i] = __gcd(ggs[i + 1], a[i]);
ll ans = 0;
for (int i = 1; i <= n - 1; i++) {
ans = max(ans, __gcd(gg[i - 1], ggs[i + 1]));
}
ans = max(ans, gg[n - 1]);
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll t = 1;
while (t--) {
solve();
}
// return 0;
}
| [
"assignment.change"
] | 873,882 | 873,883 | u435416250 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int GCD(int x, int y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
int ans = 0;
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> L(N), R(N);
for (int i = 0; i < N; i++) {
if (i != 0) {
L.at(i) = GCD(L.at(i - 1), A.at(i));
} else {
L.at(i) = A.at(i);
}
}
for (int i = N - 1; 0 <= i; i--) {
if (i != N - 1) {
R.at(i) = GCD(R.at(i + 1), A.at(i));
} else {
R.at(i) = A.at(i);
}
}
for (int i = 0; i < N; i++) {
if (i == 0) {
ans = max(R.at(1), ans);
} else if (i == N - 1) {
ans = max(L.at(N - 1), ans);
} else {
ans = max(GCD(L.at(i - 1), R.at(i + 1)), ans);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int GCD(int x, int y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
int ans = 0;
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> L(N), R(N);
for (int i = 0; i < N; i++) {
if (i != 0) {
L.at(i) = GCD(L.at(i - 1), A.at(i));
} else {
L.at(i) = A.at(i);
}
}
for (int i = N - 1; 0 <= i; i--) {
if (i != N - 1) {
R.at(i) = GCD(R.at(i + 1), A.at(i));
} else {
R.at(i) = A.at(i);
}
}
for (int i = 0; i < N; i++) {
if (i == 0) {
ans = max(R.at(i + 1), ans);
} else if (i == N - 1) {
ans = max(L.at(i - 1), ans);
} else {
ans = max(GCD(L.at(i - 1), R.at(i + 1)), ans);
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,884 | 873,885 | u491330513 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
//////////////////////////////////////////////////
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
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]);
}
ll ans = 0;
for (int i = 1; i < n; i++) {
chmax(ans, gcd(l[i - 1], r[i + 1]));
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
//////////////////////////////////////////////////
long long gcd(long long a, long long b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
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]);
}
ll ans = 0;
for (int i = 1; i <= n; i++) {
chmax(ans, gcd(l[i - 1], r[i + 1]));
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,890 | 873,891 | u374929478 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> vect(n);
// storing in vector
for (int i = 0; i < n; i++)
cin >> vect[i];
vector<long> l(n + 1, 0), r(n + 1, 0);
// base initialization
l[1] = vect[0];
r[n - 1] = vect[n - 1];
// finding gcd (from right and left side)
for (int i = 1; i < n; i++) {
l[i + 1] = __gcd(l[i], vect[i]);
r[n - i - 1] = __gcd(r[n - i], vect[n - i - 1]);
}
int maxi = 0;
int temp;
for (int i = 1; i < n; i++) {
temp = __gcd(l[i - 1], r[i]);
(temp > maxi) ? maxi = temp : maxi = maxi;
// cout << maxi <<'\n'
}
cout << maxi << '\n';
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vect(n);
// storing in vector
for (int i = 0; i < n; i++)
cin >> vect[i];
vector<int> l(n + 1, 0), r(n + 1, 0);
// base initialization
l[1] = vect[0];
r[n - 1] = vect[n - 1];
// finding gcd (from right and left side)
for (int i = 1; i < n; i++) {
l[i + 1] = __gcd(l[i], vect[i]);
r[n - i - 1] = __gcd(r[n - i], vect[n - i - 1]);
}
int maxi = 0;
int temp;
for (int i = 1; i < n + 1; i++) {
temp = __gcd(l[i - 1], r[i]);
(temp > maxi) ? maxi = temp : maxi = maxi;
// cout << maxi <<'\n'
}
cout << maxi << '\n';
return 0;
}
| [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 873,899 | 873,900 | u551519692 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> vect(n);
// storing in vector
for (int i = 0; i < n; i++)
cin >> vect[i];
vector<long> l(n + 1, 0), r(n + 1, 0);
// base initialization
l[1] = vect[0];
r[n - 1] = vect[n - 1];
// finding gcd (from right and left side)
for (int i = 1; i < n; i++) {
l[i + 1] = __gcd(l[i], vect[i]);
r[n - i - 1] = __gcd(r[n - i], vect[n - i - 1]);
}
int maxi = 0;
int temp;
for (int i = 1; i < n; i++) {
temp = __gcd(l[i - 1], r[i]);
(temp > maxi) ? maxi = temp : maxi = maxi;
// cout << maxi <<'\n'
}
cout << maxi << '\n';
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> vect(n);
// storing in vector
for (int i = 0; i < n; i++)
cin >> vect[i];
vector<long> l(n + 1, 0), r(n + 1, 0);
// base initialization
l[1] = vect[0];
r[n - 1] = vect[n - 1];
// finding gcd (from right and left side)
for (int i = 1; i < n; i++) {
l[i + 1] = __gcd(l[i], vect[i]);
r[n - i - 1] = __gcd(r[n - i], vect[n - i - 1]);
}
int maxi = 0;
int temp;
for (int i = 1; i < n + 1; i++) {
temp = __gcd(l[i - 1], r[i]);
(temp > maxi) ? maxi = temp : maxi = maxi;
// cout << maxi <<'\n'
}
cout << maxi << '\n';
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 873,899 | 873,901 | u551519692 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int a[100100];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> L(n), R(n);
for (int i = 0; i < n; i++) {
L[i + 1] = gcd(L[i], a[i]);
}
for (int i = n - 1; i > 0; i--) {
R[i - 1] = gcd(R[i], a[i]);
}
int maxx = 0;
for (int i = 0; i < n - 1; i++) {
maxx = max(maxx, gcd(L[i], R[i]));
}
cout << maxx << endl;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
int a[100100];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> L(n), R(n);
for (int i = 0; i < n - 1; i++) {
L[i + 1] = gcd(L[i], a[i]);
}
for (int i = n - 1; i > 0; i--) {
R[i - 1] = gcd(R[i], a[i]);
}
int maxx = 1;
for (int i = 0; i < n; i++) {
maxx = max(maxx, gcd(L[i], R[i]));
}
cout << maxx << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 873,910 | 873,909 | u796877631 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int g1[100010], g2[100010], a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
g1[0] = a[0];
for (int i = 1; i < n; i++) {
g1[i] = __gcd(g1[i - 1], a[i]);
}
g2[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
g2[i] = __gcd(g2[i + 1], a[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0) {
ans = max(ans, g2[i + 1]);
} else {
if (i == n - 1)
ans = max(ans, g1[i - 1]);
else
ans = max(__gcd(g1[i], g2[i]), ans);
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int g1[100010], g2[100010], a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
g1[0] = a[0];
for (int i = 1; i < n; i++) {
g1[i] = __gcd(g1[i - 1], a[i]);
}
g2[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
g2[i] = __gcd(g2[i + 1], a[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0) {
ans = max(ans, g2[i + 1]);
} else {
if (i == n - 1)
ans = max(ans, g1[i - 1]);
else
ans = max(__gcd(g1[i - 1], g2[i + 1]), ans);
}
}
cout << ans;
return 0;
} | [
"assignment.change"
] | 873,919 | 873,920 | u684822781 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
vector<int> Z(0, 0);
for (int i = 0; i < N; i++) {
cin >> A;
Z.push_back(A);
}
vector<int> X(1, Z[0]), Y(1, Z[N - 1]);
int b = Z[0];
for (int i = 1; i < N - 1; i++) {
int a = Z[i], c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
X.push_back(b);
}
b = Z[N - 1];
for (int i = N - 2; i > 0; i--) {
int a = Z[i], c = b % a;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
Y.push_back(b);
}
int ans = Y[N - 2];
for (int i = 0; i < N - 2; i++) {
int a = X[i], b = Y[N - i - 3], c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
ans = max(ans, b);
}
ans = max(ans, X[N - 2]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
vector<int> Z(0, 0);
for (int i = 0; i < N; i++) {
cin >> A;
Z.push_back(A);
}
vector<int> X(1, Z[0]), Y(1, Z[N - 1]);
int b = Z[0];
for (int i = 1; i < N - 1; i++) {
int a = Z[i], c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
X.push_back(b);
}
b = Z[N - 1];
for (int i = N - 2; i > 0; i--) {
int a = Z[i], c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
Y.push_back(b);
}
int ans = Y[N - 2];
for (int i = 0; i < N - 2; i++) {
int a = X[i], b = Y[N - i - 3], c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
ans = max(ans, b);
}
ans = max(ans, X[N - 2]);
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 873,921 | 873,922 | u071282706 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long int> left(n), right(n), total(n);
left[0] = a[0];
right[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
left[i] = gcd(a[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; i--) {
right[i] = gcd(a[i], right[i + 1]);
}
total[0] = right[1];
total[n - 1] = left[n - 2];
for (int i = 1; i < n - 1; i++) {
total[i] = gcd(left[i - 1], right[i + 1]);
}
sort(total.begin(), total.end());
cout << total[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long int> left(n), right(n), total(n);
left[0] = a[0];
right[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
left[i] = gcd(left[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; i--) {
right[i] = gcd(a[i], right[i + 1]);
}
total[0] = right[1];
total[n - 1] = left[n - 2];
for (int i = 1; i < n - 1; i++) {
total[i] = gcd(left[i - 1], right[i + 1]);
}
sort(total.begin(), total.end());
cout << total[n - 1] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 873,929 | 873,930 | u159663513 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
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;
cin >> n;
vector<int> a(n), l(n), r(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
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;
for (int i = 0; i < n; i++) {
ans = max(ans, gcd(l[i], r[i]));
}
cout << ans << endl;
return 0;
} | #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];
for (int i = 0; i < n - 1; i++)
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;
for (int i = 0; i < n; i++) {
ans = max(ans, gcd(l[i], r[i]));
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"identifier.change",
"function.return_value.change"
] | 873,945 | 873,946 | u633402865 | cpp |
p03061 | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N), lv(N), rv(N);
REP(i, N) cin >> A[i];
if (N == 2) {
cout << max(A[0], A[1]) << endl;
exit(0);
}
lv[0] = A[0];
FOR(i, 1, N) lv[i] = gcd(A[i], lv[i - 1]);
rv[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
rv[i] = gcd(A[i], rv[i + 1]);
int maximum = 0;
chmax(maximum, rv[1]);
chmax(maximum, lv[N - 1]);
FOR(i, 1, N - 1) chmax(maximum, gcd(lv[i - 1], rv[i + 1]));
cout << maximum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N), lv(N), rv(N);
REP(i, N) cin >> A[i];
if (N == 2) {
cout << max(A[0], A[1]) << endl;
exit(0);
}
lv[0] = A[0];
FOR(i, 1, N) lv[i] = gcd(A[i], lv[i - 1]);
rv[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--)
rv[i] = gcd(A[i], rv[i + 1]);
int maximum = 0;
chmax(maximum, rv[1]);
chmax(maximum, lv[N - 2]);
FOR(i, 1, N - 1) chmax(maximum, gcd(lv[i - 1], rv[i + 1]));
cout << maximum << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,947 | 873,948 | u492030100 | cpp |
p03061 | // Created by conan1024hao on 2019/11/23.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 10e16
#define MOD 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define fi first
#define se second
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define PI acos(-1.0)
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll cmp(pair<ll, string> a, pair<ll, string> b) {
if (a.fi != b.fi)
return a.fi < b.fi;
else
return a.se < b.se;
}
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
int n;
cin >> n;
vector<ll> a(n);
for (ll i = 1; i <= n; i++)
cin >> a[i];
vector<ll> l(n + 2);
vector<ll> r(n + 2);
vector<ll> m(n + 2);
sort(all(a));
l[0] = 0;
r[n + 1] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = GCD(l[i], a[i]);
}
for (int i = n; i > 1; i--) {
r[i] = GCD(r[i + 1], a[i]);
}
for (int i = 1; i <= n; i++) {
m[i] = GCD(l[i], r[i + 1]);
}
ll ans = -1;
for (int i = 1; i <= n; i++) {
chmax(ans, m[i]);
}
cout << ans << endl;
//-------------------------------
return 0;
}
//---------------------------------------------------------------------------
| // Created by conan1024hao on 2019/11/23.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define INF 10e16
#define MOD 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define fi first
#define se second
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define PI acos(-1.0)
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll cmp(pair<ll, string> a, pair<ll, string> b) {
if (a.fi != b.fi)
return a.fi < b.fi;
else
return a.se < b.se;
}
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
int n;
cin >> n;
vector<ll> a(n + 1);
for (ll i = 1; i <= n; i++)
cin >> a[i];
vector<ll> l(n + 2);
vector<ll> r(n + 2);
vector<ll> m(n + 2);
sort(all(a));
l[0] = 0;
r[n + 1] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = GCD(l[i], a[i]);
}
for (int i = n; i > 1; i--) {
r[i] = GCD(r[i + 1], a[i]);
}
for (int i = 1; i <= n; i++) {
m[i] = GCD(l[i], r[i + 1]);
}
ll ans = -1;
for (int i = 1; i <= n; i++) {
chmax(ans, m[i]);
}
cout << ans << endl;
//-------------------------------
return 0;
}
//---------------------------------------------------------------------------
| [
"assignment.change"
] | 873,953 | 873,954 | u220212997 | cpp |
p03061 |
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[n];
vector<int> l(n), r(n);
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;
} | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> l(n), r(n);
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;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,969 | 873,970 | u979078704 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
ll a[n], l[n], r[n];
cin >> a[0];
l[0] = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
l[i] = gcd(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
r[n - 1 - i] = gcd(a[n - 1 - i], r[n - i]);
}
ll M = max(l[n - 2], r[0]);
for (int i = 1; i < n - 1; i++) {
M = max(gcd(l[i - 1], r[i + 1]), M);
}
cout << M;
return 0;
} | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
ll a[n], l[n], r[n];
cin >> a[0];
l[0] = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
l[i] = gcd(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
r[n - 1 - i] = gcd(a[n - 1 - i], r[n - i]);
}
ll M = max(l[n - 2], r[1]);
for (int i = 1; i < n - 1; i++) {
M = max(gcd(l[i - 1], r[i + 1]), M);
}
cout << M;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 873,971 | 873,972 | u850867546 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll A[100100];
ll L[100100];
ll R[100100];
int main() {
int N;
cin >> N;
REP(i, N) {
ll a;
cin >> a;
A[i] = a;
}
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]);
}
ll ans = 1;
REP(i, N) {
if (i == 0) {
ll right = R[1];
chmax(ans, right);
} else if (i == N - 1) {
ll left = L[1];
chmax(ans, left);
} else {
ll left = L[i - 1];
ll right = R[i + 1];
ll tmp = gcd(left, right);
chmax(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll A[100100];
ll L[100100];
ll R[100100];
int main() {
int N;
cin >> N;
REP(i, N) {
ll a;
cin >> a;
A[i] = a;
}
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]);
}
ll ans = 0;
REP(i, N) {
if (i == 0) {
ll right = R[1];
chmax(ans, right);
} else if (i == N - 1) {
ll left = L[N - 2];
chmax(ans, left);
} else {
ll left = L[i - 1];
ll right = R[i + 1];
ll tmp = gcd(left, right);
chmax(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 873,975 | 873,976 | u666394517 | cpp |
p03061 | #include <iostream>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long long int> v, l, r;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
v.push_back(a);
}
l.push_back(v.at(0));
r.push_back(v.at(n - 1));
for (int i = 1; i < n; i++) {
l.push_back(gcd(l.at(i - 1), v.at(i)));
r.insert(r.begin(), gcd(r.at(i - 1), v.at(n - 1 - i)));
}
long long int max = r.at(1);
for (int i = 1; i < n - 1; i++) {
if (gcd(l.at(i - 1), r.at(i + 1)) > max) {
max = gcd(l.at(i - 1), r.at(i + 1));
}
}
if (l.at(n - 2) > max) {
max = l.at(n - 2);
}
cout << max << "\n";
} | #include <iostream>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long long int> v, l, r;
for (int i = 0; i < n; i++) {
long long int a;
cin >> a;
v.push_back(a);
}
l.push_back(v.at(0));
r.push_back(v.at(n - 1));
for (int i = 1; i < n; i++) {
l.push_back(gcd(l.at(i - 1), v.at(i)));
r.insert(r.begin(), gcd(r.at(0), v.at(n - 1 - i)));
}
long long int max = r.at(1);
for (int i = 1; i < n - 1; i++) {
if (gcd(l.at(i - 1), r.at(i + 1)) > max) {
max = gcd(l.at(i - 1), r.at(i + 1));
}
}
if (l.at(n - 2) > max) {
max = l.at(n - 2);
}
cout << max << "\n";
} | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 873,977 | 873,978 | u094746828 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y);
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> left(n);
left[0] = a[0];
for (int i = 1; i < n; i++) {
left[i] = gcd(left[i - 1], a[i]);
}
vector<int> right(n);
right[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
right[i] = gcd(right[i + 1], a[i]);
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(left[i - 1], right[i + 1]));
}
ans = max(ans, left[n - 1]);
ans = max(ans, right[1]);
cout << ans << endl;
}
int gcd(int x, int y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y);
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> left(n);
left[0] = a[0];
for (int i = 1; i < n; i++) {
left[i] = gcd(left[i - 1], a[i]);
}
vector<int> right(n);
right[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
right[i] = gcd(right[i + 1], a[i]);
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(left[i - 1], right[i + 1]));
}
ans = max(ans, left[n - 2]);
ans = max(ans, right[1]);
cout << ans << endl;
}
int gcd(int x, int y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,981 | 873,982 | u526708273 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(i, k, n) for (ll i = k; i < n; ++i)
#define inputar(a, n) \
ll a[n]; \
rep(i, 0, n) cin >> a[i]
#define PI 3.14159265
const int MOD = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define test4(x, y, z, a) \
cerr << "x is " << x << " y is " << y << " z is " \
<< z << " a is " << a << endl;
#define test3(x, y, z) \
cerr << "x is " << x << " y is " << y << " z is " \
<< z << endl;
#define test2(x, y) cerr << "x is " << x << " y is " << y << endl;
#define test1(x) cerr << "x is " << x << endl;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
IOS;
ll n;
cin >> n;
ll a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
ll pre[n + 1], suf[n + 1];
ll c = a[0];
for (int i = 0; i < n; i++) {
c = gcd(c, a[i]);
pre[i] = c;
}
c = a[n - 1];
for (int i = n - 1; i >= 0; i--) {
c = gcd(c, a[i]);
suf[i] = c;
// cout<<c<<endl;
}
ll mx = 0;
for (int i = 1; i < n - 1; i++) {
ll ans = gcd(pre[i - 1], suf[i + 1]);
mx = max(ans, mx);
// cout<<ans<<endl;
}
mx = max(mx, suf[1]);
mx = max(mx, pre[n - 1]);
cout << mx << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(i, k, n) for (ll i = k; i < n; ++i)
#define inputar(a, n) \
ll a[n]; \
rep(i, 0, n) cin >> a[i]
#define PI 3.14159265
const int MOD = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define test4(x, y, z, a) \
cerr << "x is " << x << " y is " << y << " z is " \
<< z << " a is " << a << endl;
#define test3(x, y, z) \
cerr << "x is " << x << " y is " << y << " z is " \
<< z << endl;
#define test2(x, y) cerr << "x is " << x << " y is " << y << endl;
#define test1(x) cerr << "x is " << x << endl;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
IOS;
ll n;
cin >> n;
ll a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
ll pre[n + 1], suf[n + 1];
ll c = a[0];
for (int i = 0; i < n; i++) {
c = gcd(c, a[i]);
pre[i] = c;
}
c = a[n - 1];
for (int i = n - 1; i >= 0; i--) {
c = gcd(c, a[i]);
suf[i] = c;
// cout<<c<<endl;
}
ll mx = 0;
for (int i = 1; i < n - 1; i++) {
ll ans = gcd(pre[i - 1], suf[i + 1]);
mx = max(ans, mx);
// cout<<ans<<endl;
}
mx = max(mx, suf[1]);
mx = max(mx, pre[n - 2]);
cout << mx << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,992 | 873,993 | u216460814 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(i, k, n) for (ll i = k; i < n; ++i)
#define inputar(a, n) \
ll a[n]; \
rep(i, 0, n) cin >> a[i]
#define PI 3.14159265
const int MOD = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define test4(x, y, z, a) \
cerr << "x is " << x << " y is " << y << " z is " \
<< z << " a is " << a << endl;
#define test3(x, y, z) \
cerr << "x is " << x << " y is " << y << " z is " \
<< z << endl;
#define test2(x, y) cerr << "x is " << x << " y is " << y << endl;
#define test1(x) cerr << "x is " << x << endl;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
IOS;
ll n;
cin >> n;
ll a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
ll pre[n + 1], suf[n + 1];
ll c = a[0];
for (int i = 0; i < n; i++) {
c = gcd(c, a[i]);
pre[i] = c;
}
c = a[n - 1];
for (int i = n - 1; i >= 0; i--) {
c = gcd(c, a[i]);
suf[i] = c;
// cout<<c<<endl;
}
ll mx = 0;
for (int i = 1; i < n - 1; i++) {
ll ans = gcd(pre[i - 1], suf[i + 1]);
mx = max(ans, mx);
// cout<<ans<<endl;
}
mx = max(mx, suf[1]);
mx = max(mx, pre[n - 1]);
cout << mx << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(i, k, n) for (ll i = k; i < n; ++i)
#define inputar(a, n) \
ll a[n]; \
rep(i, 0, n) cin >> a[i]
#define PI 3.14159265
const int MOD = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define test4(x, y, z, a) \
cerr << "x is " << x << " y is " << y << " z is " \
<< z << " a is " << a << endl;
#define test3(x, y, z) \
cerr << "x is " << x << " y is " << y << " z is " \
<< z << endl;
#define test2(x, y) cerr << "x is " << x << " y is " << y << endl;
#define test1(x) cerr << "x is " << x << endl;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
IOS;
ll n;
cin >> n;
ll a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << max(a[0], a[1]) << endl;
return 0;
}
ll pre[n + 1], suf[n + 1];
ll c = a[0];
for (int i = 0; i < n; i++) {
c = gcd(c, a[i]);
pre[i] = c;
}
c = a[n - 1];
for (int i = n - 1; i >= 0; i--) {
c = gcd(c, a[i]);
suf[i] = c;
// cout<<c<<endl;
}
ll mx = 0;
for (int i = 1; i < n - 1; i++) {
ll ans = gcd(pre[i - 1], suf[i + 1]);
mx = max(ans, mx);
// cout<<ans<<endl;
}
mx = max(mx, suf[1]);
mx = max(mx, pre[n - 2]);
cout << mx << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 873,994 | 873,993 | u216460814 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LOCAL 0
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define fore(i, a, b) for (int i = (a), _b = (b); i < (_b); ++i)
#define fort(i, a, b) for (int i = (a), _b = (b); i <= (_b); ++i)
#define ford(i, a, b) for (int i = (a), _b = (b); i >= (_b); --i)
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &arg1) {
cerr << name << ": " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &arg1, Args &...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " /";
__f(comma + 1, args...);
}
template <class T> bool mini(T &a, T b) { return a > b ? (a = b, 1) : 0; }
template <class T> bool maxi(T &a, T b) { return a < b ? (a = b, 1) : 0; }
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<LL> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
const int INF = 1e9 + 7;
int main() {
#if LOCAL
freopen("CP.inp", "r", stdin);
// freopen("CP.out", "w", stdout);
#endif // LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vi a(n);
fore(i, 0, n) cin >> a[i];
vi l(n), r(n);
fore(i, 0, n) l[i] = (i == 0 ? a[i] : __gcd(l[i - 1], a[i]));
ford(i, n - 1, 0) r[i] = (i == n - 1 ? a[i] : __gcd(r[i + 1], a[i]));
LL ans = max(l[1], r[n - 2]);
fore(i, 1, n - 1) maxi(ans, __gcd(l[i - 1], r[i + 1]));
cout << ans << '\n';
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LOCAL 0
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define fore(i, a, b) for (int i = (a), _b = (b); i < (_b); ++i)
#define fort(i, a, b) for (int i = (a), _b = (b); i <= (_b); ++i)
#define ford(i, a, b) for (int i = (a), _b = (b); i >= (_b); --i)
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &arg1) {
cerr << name << ": " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &arg1, Args &...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " /";
__f(comma + 1, args...);
}
template <class T> bool mini(T &a, T b) { return a > b ? (a = b, 1) : 0; }
template <class T> bool maxi(T &a, T b) { return a < b ? (a = b, 1) : 0; }
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<LL> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
const int INF = 1e9 + 7;
int main() {
#if LOCAL
freopen("CP.inp", "r", stdin);
// freopen("CP.out", "w", stdout);
#endif // LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vi a(n);
fore(i, 0, n) cin >> a[i];
vi l(n), r(n);
fore(i, 0, n) l[i] = (i == 0 ? a[i] : __gcd(l[i - 1], a[i]));
ford(i, n - 1, 0) r[i] = (i == n - 1 ? a[i] : __gcd(r[i + 1], a[i]));
LL ans = max(l[n - 2], r[1]);
fore(i, 1, n - 1) maxi(ans, __gcd(l[i - 1], r[i + 1]));
cout << ans << '\n';
return 0;
}
| [
"call.arguments.change",
"call.arguments.add"
] | 873,995 | 873,996 | u334141868 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
constexpr ll INF = 1000000000;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> g1(n);
int k = a[0];
g1[0] = a[0];
for (int i = 1; i < n; i++) {
g1[i] = gcd(k, a[i]);
k = gcd(k, a[i]);
}
reverse(a.begin(), a.end());
vector<int> g2(n);
int kl = a[0];
g2[0] = kl;
for (int i = 1; i < n; i++) {
g2[i] = gcd(kl, a[i]);
kl = gcd(kl, a[i]);
}
reverse(g2.begin(), g2.end());
vector<int> ans(n);
for (int i = 1; i < n - 1; i++) {
ans[i] = gcd(g1[i - 1], g2[i + 1]);
}
ans[0] = g2[1];
ans[n - 1] = g1[n - 1];
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
cout << ans[0] << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
constexpr ll INF = 1000000000;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> g1(n);
int k = a[0];
g1[0] = a[0];
for (int i = 1; i < n; i++) {
g1[i] = gcd(k, a[i]);
k = gcd(k, a[i]);
}
reverse(a.begin(), a.end());
vector<int> g2(n);
int kl = a[0];
g2[0] = kl;
for (int i = 1; i < n; i++) {
g2[i] = gcd(kl, a[i]);
kl = gcd(kl, a[i]);
}
reverse(g2.begin(), g2.end());
vector<int> ans(n);
for (int i = 1; i < n - 1; i++) {
ans[i] = gcd(g1[i - 1], g2[i + 1]);
}
ans[0] = g2[1];
ans[n - 1] = g1[n - 2];
sort(ans.begin(), ans.end());
reverse(ans.begin(), ans.end());
cout << ans[0] << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,997 | 873,998 | u955534952 | cpp |
p03061 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define LB(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define ERASE(v) v.erase(unique(v.begin(), v.end()), v.end())
// #define int ll
using namespace std;
const int INF(1 << 30);
const ll LLINF(1LL << 55LL);
const int MOD = 1000000007;
const int MAX = 510000;
const double pi = acos(-1);
const double eps = 1e-9;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n, a[100010], b[100010], c[100010], ans = 1;
cin >> n;
rep(i, n) { cin >> a[i]; }
b[0] = a[0];
rep2(i, 1, n) { b[i] = gcd(a[i], b[i - 1]); }
c[n - 1] = a[n - 1];
for (ll i = n - 2; i >= 0; i--) {
c[i] = gcd(a[i], c[i + 1]);
}
rep(i, n) {
if (i == 0) {
ans = max(ans, c[i + 1]);
} else if (i == n - 1) {
ans = max(ans, b[i]);
} else {
ans = max(ans, gcd(b[i - 1], c[i + 1]));
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define LB(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define UB(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define ERASE(v) v.erase(unique(v.begin(), v.end()), v.end())
// #define int ll
using namespace std;
const int INF(1 << 30);
const ll LLINF(1LL << 55LL);
const int MOD = 1000000007;
const int MAX = 510000;
const double pi = acos(-1);
const double eps = 1e-9;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n, a[100010], b[100010], c[100010], ans = 1;
cin >> n;
rep(i, n) { cin >> a[i]; }
b[0] = a[0];
rep2(i, 1, n) { b[i] = gcd(a[i], b[i - 1]); }
c[n - 1] = a[n - 1];
for (ll i = n - 2; i >= 0; i--) {
c[i] = gcd(a[i], c[i + 1]);
}
rep(i, n) {
if (i == 0) {
ans = max(ans, c[i + 1]);
} else if (i == n - 1) {
ans = max(ans, b[i - 1]);
} else {
ans = max(ans, gcd(b[i - 1], c[i + 1]));
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 874,003 | 874,004 | u241367243 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T x, T y) {
// 最小公倍数を求める
if (y == 0)
return x;
gcd(y, x % y);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &&i : A) {
cin >> i;
}
// 前計算
vector<int> l(N), r(N);
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]);
}
for (int i = N - 2; i >= 0; i--) {
r[i] = gcd(r[i + 1], A[i]);
}
int ans = max(l[N - 1], r[1]);
for (int i = 1; i < N - 1; i++) {
ans = max(ans, gcd(l[i - 1], r[i + 1]));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> T gcd(T x, T y) {
// 最小公倍数を求める
if (y == 0)
return x;
gcd(y, x % y);
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &&i : A) {
cin >> i;
}
// 前計算
vector<int> l(N), r(N);
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]);
}
for (int i = N - 2; i >= 0; i--) {
r[i] = gcd(r[i + 1], A[i]);
}
int ans = max(l[N - 2], r[1]);
for (int i = 1; i < N - 1; i++) {
ans = max(ans, gcd(l[i - 1], r[i + 1]));
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,009 | 874,010 | u324303263 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
unsigned long long GCD(unsigned long long a, unsigned long long b) {
return (b == 0) ? a : GCD(b, a % b);
}
void solve() {
int n;
cin >> n;
int a[100000], b[100000], c[100000];
rep(i, n) { cin >> a[i]; }
b[0] = a[0];
c[0] = a[n - 1];
int ans = 1;
for (int i = 1; i < n; i++) {
b[i] = GCD(a[i], b[i - 1]);
c[i] = GCD(a[n - 1 - i], c[i - 1]);
}
for (int i = 1; i < n - 1; i++) {
ans = max(ans, (int)GCD(b[i - 1], c[n - 2 - i]));
}
ans = max(ans, b[n - 1]);
ans = max(ans, c[n - 1]);
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
unsigned long long GCD(unsigned long long a, unsigned long long b) {
return (b == 0) ? a : GCD(b, a % b);
}
void solve() {
int n;
cin >> n;
int a[100000], b[100000], c[100000];
rep(i, n) { cin >> a[i]; }
b[0] = a[0];
c[0] = a[n - 1];
int ans = 1;
for (int i = 1; i < n; i++) {
b[i] = GCD(a[i], b[i - 1]);
c[i] = GCD(a[n - 1 - i], c[i - 1]);
}
for (int i = 1; i < n - 1; i++) {
ans = max(ans, (int)GCD(b[i - 1], c[n - 2 - i]));
}
ans = max(ans, b[n - 2]);
ans = max(ans, c[n - 2]);
cout << ans << endl;
}
int main() {
solve();
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,037 | 874,038 | u331948661 | cpp |
p03061 | #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n + 2, 0);
rep(i, n) {
ll tmp;
cin >> tmp;
a[i + 1] = tmp;
}
vector<ll> gcd_l(n + 2, 0), gcd_r(n + 2, 0);
gcd_l[0] = 0;
gcd_r[n + 1] = 0;
for (int i = 0; i < n; i++) {
gcd_l[i + 1] = gcd(gcd_l[i], a[i]);
gcd_r[n - i] = gcd(gcd_r[n + 1 - i], a[n - i]);
}
ll ans = -1;
for (int i = 1; i < n; i++) {
ans = max(ans, gcd(gcd_l[i], gcd_r[i + 1]));
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <math.h>
//#include <numeric>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
vector<ll> a(n + 2, 0);
rep(i, n) {
ll tmp;
cin >> tmp;
a[i + 1] = tmp;
}
vector<ll> gcd_l(n + 2, 0), gcd_r(n + 2, 0);
gcd_l[0] = 0;
gcd_r[n + 1] = 0;
for (int i = 0; i < n; i++) {
gcd_l[i + 1] = gcd(gcd_l[i], a[i]);
gcd_r[n - i] = gcd(gcd_r[n + 1 - i], a[n - i]);
}
ll ans = -1;
for (int i = 1; i <= n; i++) {
ans = max(ans, gcd(gcd_l[i], gcd_r[i + 1]));
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,044 | 874,045 | u829260400 | cpp |
p03061 | #include <iostream>
#include <vector>
using namespace std;
long long GCD(long long x, long long y) {
if (y == 0)
return x;
else
return GCD(y, x % 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> left(n, 0);
for (int i = 0; i < n; ++i)
left[i + 1] = GCD(left[i], a[i]);
vector<long long> right(n, 0);
for (int i = n - 1; i >= 0; --i)
right[i] = GCD(right[i + 1], a[i]);
long long res = 0;
for (int i = 0; i < n; ++i)
res = max(res, GCD(left[i], right[i + 1]));
cout << res << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
long long GCD(long long x, long long y) {
if (y == 0)
return x;
else
return GCD(y, x % 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> left(n + 1, 0);
for (int i = 0; i < n; ++i)
left[i + 1] = GCD(left[i], a[i]);
vector<long long> right(n + 1, 0);
for (int i = n - 1; i >= 0; --i)
right[i] = GCD(right[i + 1], a[i]);
long long res = 0;
for (int i = 0; i < n; ++i)
res = max(res, GCD(left[i], right[i + 1]));
cout << res << endl;
}
| [
"assignment.change"
] | 874,056 | 874,057 | u912025537 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i);
}
vector<int> A(N - 1);
vector<int> B(N - 1);
A.at(0) = V.at(0);
for (int i = 1; i < N - 1; ++i) {
A.at(i) = gcd(A.at(i - 1), V.at(i));
}
B.at(0) = V.at(N - 1);
for (int i = 1; i < N - 1; ++i) {
B.at(i) = gcd(A.at(N - i - 1), B.at(i - 1));
}
for (int i = 0; i < N; ++i) {
if (i == 0) {
W.at(i) = B.at(N - 2);
} else if (i == N - 1) {
W.at(i) = A.at(N - 2);
} else {
W.at(i) = gcd(A.at(i - 1), B.at(N - i - 2));
}
}
int a = W.at(0);
for (int i = 1; i < N; ++i) {
if (a < W.at(i)) {
a = W.at(i);
}
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i);
}
vector<int> A(N - 1);
vector<int> B(N - 1);
A.at(0) = V.at(0);
for (int i = 1; i < N - 1; ++i) {
A.at(i) = gcd(A.at(i - 1), V.at(i));
}
B.at(0) = V.at(N - 1);
for (int i = 1; i < N - 1; ++i) {
B.at(i) = gcd(V.at(N - i - 1), B.at(i - 1));
}
for (int i = 0; i < N; ++i) {
if (i == 0) {
W.at(i) = B.at(N - 2);
} else if (i == N - 1) {
W.at(i) = A.at(N - 2);
} else {
W.at(i) = gcd(A.at(i - 1), B.at(N - i - 2));
}
}
int a = W.at(0);
for (int i = 1; i < N; ++i) {
if (a < W.at(i)) {
a = W.at(i);
}
}
cout << a << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,068 | 874,069 | u042113240 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(a, a % b);
} else {
return gcd(b, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i);
}
vector<int> A(N - 1);
vector<int> B(N - 1);
A.at(0) = V.at(0);
for (int i = 1; i < N - 1; ++i) {
A.at(i) = gcd(A.at(i - 1), V.at(i));
}
B.at(0) = V.at(N - 1);
for (int i = 1; i < N - 1; ++i) {
B.at(i) = gcd(A.at(N - i - 1), B.at(i - 1));
}
for (int i = 0; i < N; ++i) {
if (i == 0) {
W.at(i) = B.at(N - 2);
} else if (i == N - 1) {
W.at(i) = A.at(N - 2);
} else {
W.at(i) = gcd(A.at(i - 1), B.at(N - i - 2));
}
}
int a = W.at(0);
for (int i = 1; i < N; ++i) {
if (a < W.at(i)) {
a = W.at(i);
}
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i);
}
vector<int> A(N - 1);
vector<int> B(N - 1);
A.at(0) = V.at(0);
for (int i = 1; i < N - 1; ++i) {
A.at(i) = gcd(A.at(i - 1), V.at(i));
}
B.at(0) = V.at(N - 1);
for (int i = 1; i < N - 1; ++i) {
B.at(i) = gcd(V.at(N - i - 1), B.at(i - 1));
}
for (int i = 0; i < N; ++i) {
if (i == 0) {
W.at(i) = B.at(N - 2);
} else if (i == N - 1) {
W.at(i) = A.at(N - 2);
} else {
W.at(i) = gcd(A.at(i - 1), B.at(N - i - 2));
}
}
int a = W.at(0);
for (int i = 1; i < N; ++i) {
if (a < W.at(i)) {
a = W.at(i);
}
}
cout << a << endl;
}
| [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"assignment.value.change"
] | 874,070 | 874,069 | u042113240 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(a, a % b);
} else {
return gcd(b, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i);
}
vector<int> A(N - 1);
vector<int> B(N - 1);
A.at(0) = V.at(0);
for (int i = 1; i < N - 1; ++i) {
A.at(i) = gcd(A.at(i - 1), V.at(i));
}
B.at(0) = V.at(N - 1);
for (int i = 1; i < N - 1; ++i) {
B.at(i) = gcd(A.at(N - i - 1), B.at(i - 1));
}
for (int i = 0; i < N; ++i) {
if (i == 0) {
W.at(i) = B.at(N - 2);
} else if (i == N) {
W.at(i) = A.at(N - 2);
} else {
W.at(i) = gcd(A.at(i - 1), B.at(N - i - 2));
}
}
int a = W.at(0);
for (int i = 1; i < N; ++i) {
if (a < W.at(i)) {
a = W.at(i);
}
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} else if (b % a == 0) {
return a;
} else if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> W(N);
for (int i = 0; i < N; ++i) {
cin >> V.at(i);
}
vector<int> A(N - 1);
vector<int> B(N - 1);
A.at(0) = V.at(0);
for (int i = 1; i < N - 1; ++i) {
A.at(i) = gcd(A.at(i - 1), V.at(i));
}
B.at(0) = V.at(N - 1);
for (int i = 1; i < N - 1; ++i) {
B.at(i) = gcd(V.at(N - i - 1), B.at(i - 1));
}
for (int i = 0; i < N; ++i) {
if (i == 0) {
W.at(i) = B.at(N - 2);
} else if (i == N - 1) {
W.at(i) = A.at(N - 2);
} else {
W.at(i) = gcd(A.at(i - 1), B.at(N - i - 2));
}
}
int a = W.at(0);
for (int i = 1; i < N; ++i) {
if (a < W.at(i)) {
a = W.at(i);
}
}
cout << a << endl;
}
| [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,071 | 874,069 | u042113240 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b);
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1, 0);
for (long long i = 1; i <= n; ++i)
cin >> a[i];
vector<long long> l(n + 1, 0);
for (long long i = 1; i <= n; ++i)
l[i] = gcd(a[i - 1], a[i]);
vector<long long> r(n + 1, 0);
for (long long i = n; i > 0; --i)
r[i] = gcd(a[i + 1], a[i]);
vector<long long> m(n + 1, 0);
for (long long i = 1; i <= n; ++i)
m[i] = gcd(l[i - 1], r[i + 1]);
long long ans = 0;
for (long long i = 1; i <= n; ++i)
ans = max(ans, m[i]);
cout << ans << '\n';
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long gcd(long long a, long long b);
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1, 0);
for (long long i = 1; i <= n; ++i)
cin >> a[i];
vector<long long> l(n + 1, 0);
for (long long i = 1; i <= n; ++i)
l[i] = gcd(l[i - 1], a[i]);
vector<long long> r(n + 2, 0);
for (long long i = n; i > 0; --i)
r[i] = gcd(r[i + 1], a[i]);
vector<long long> m(n + 1, 0);
for (long long i = 1; i <= n; ++i)
m[i] = gcd(l[i - 1], r[i + 1]);
long long ans = 0;
for (long long i = 1; i <= n; ++i)
ans = max(ans, m[i]);
cout << ans << '\n';
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 874,072 | 874,073 | u964185015 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
// 再帰関数による最大公約数
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
vector<int> l(n), r(n); // l.at(i)は左から(i + 1)個の数のgcd，rは右から
l.at(0) = a.at(0);
r.at(n - 1) = a.at(n - 1);
for (int i = 1; i < n; i++) {
l.at(i) = gcd(l.at(i - 1), a.at(i));
}
for (int i = n - 2; i >= 0; i--) {
r.at(i) = gcd(r.at(i + 1), a.at(i));
}
int ans = max(l.at(n - 1), r.at(0));
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(l.at(i - 1), r.at(i + 1)));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// 再帰関数による最大公約数
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
vector<int> l(n), r(n); // l.at(i)は左から(i + 1)個の数のgcd，rは右から
l.at(0) = a.at(0);
r.at(n - 1) = a.at(n - 1);
for (int i = 1; i < n; i++) {
l.at(i) = gcd(l.at(i - 1), a.at(i));
}
for (int i = n - 2; i >= 0; i--) {
r.at(i) = gcd(r.at(i + 1), a.at(i));
}
int ans = max(l.at(n - 2), r.at(1));
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(l.at(i - 1), r.at(i + 1)));
}
cout << ans << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,082 | 874,083 | u979163294 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
*/
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
while (b != 0) {
int t = a;
a = b;
b = t % b;
}
return a;
}
int main() {
int N;
cin >> N;
vector<int> a(N + 2, 0);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> cum(N + 2, 0), cum2(N + 2, 0);
cum[1] = a[1];
cum2[N] = a[N];
for (int i = 2; i <= N; i++)
cum[i] = gcd(a[i], cum[i - 1]);
for (int i = N - 1; i >= 1; i--)
cum[i] = gcd(a[i], cum2[i + 1]);
int ans = 0;
for (int i = 1; i <= N; i++) {
int tmp = gcd(cum[i - 1], cum2[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a
// > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
*/
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
while (b != 0) {
int t = a;
a = b;
b = t % b;
}
return a;
}
int main() {
int N;
cin >> N;
vector<int> a(N + 2, 0);
for (int i = 1; i <= N; i++)
cin >> a[i];
vector<int> cum(N + 2, 0), cum2(N + 2, 0);
cum[1] = a[1];
cum2[N] = a[N];
for (int i = 2; i <= N; i++)
cum[i] = gcd(a[i], cum[i - 1]);
for (int i = N - 1; i >= 1; i--)
cum2[i] = gcd(a[i], cum2[i + 1]);
int ans = 0;
for (int i = 1; i <= N; i++) {
int tmp = gcd(cum[i - 1], cum2[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
} | [
"assignment.variable.change",
"identifier.change"
] | 874,088 | 874,089 | u052332717 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<char, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 62;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> ca(n + 1, 0), cb(n + 1, 0);
for (int i = 0; i <= n; i++) {
ca[i + 1] = __gcd(ca[i], a[i]);
}
for (int i = n; i >= 1; i--) {
cb[i - 1] = __gcd(cb[i], a[i - 1]);
}
int ans = 0;
for (int i = 1; i < n; i++) {
ans = max(ans, __gcd(ca[i], cb[i + 1]));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<char, LL> P;
const LL mod = 998244353;
const LL LINF = 1LL << 62;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> ca(n + 1, 0), cb(n + 1, 0);
for (int i = 0; i < n; i++) {
ca[i + 1] = __gcd(ca[i], a[i]);
}
for (int i = n; i >= 1; i--) {
cb[i - 1] = __gcd(cb[i], a[i - 1]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, __gcd(ca[i], cb[i + 1]));
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 874,092 | 874,091 | u640323045 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
vector<long long> L(N);
for (long long i = 0; i < N; i++) {
if (i == 0) {
L[i] = A[i];
} else {
L[i] = gcd(L[i], A[i - 1]);
}
}
vector<long long> R(N);
for (long long i = N - 1; i >= 0; i--) {
if (i == N - 1) {
R[i] = A[i];
} else {
R[i] = gcd(A[i], R[i + 1]);
}
}
long long maxv = 0;
long long cur = 0;
for (long long i = 0; i < N; i++) {
if (i == 0) {
cur = R[1];
} else if (i == N - 1) {
cur = L[N - 2];
} else {
cur = gcd(L[i - 1], R[i + 1]);
}
maxv = max(maxv, cur);
}
cout << maxv << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
vector<long long> L(N);
for (long long i = 0; i < N; i++) {
if (i == 0) {
L[i] = A[i];
} else {
L[i] = gcd(L[i - 1], A[i]);
}
}
vector<long long> R(N);
for (long long i = N - 1; i >= 0; i--) {
if (i == N - 1) {
R[i] = A[i];
} else {
R[i] = gcd(A[i], R[i + 1]);
}
}
long long maxv = 0;
long long cur = 0;
for (long long i = 0; i < N; i++) {
if (i == 0) {
cur = R[1];
} else if (i == N - 1) {
cur = L[N - 2];
} else {
cur = gcd(L[i - 1], R[i + 1]);
}
maxv = max(maxv, cur);
}
cout << maxv << endl;
return 0;
} | [
"assignment.change",
"expression.operation.binary.remove"
] | 874,095 | 874,096 | u942160358 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
vector<long long> L(N);
for (long long i = 0; i < N; i++) {
if (i == 0) {
L[i] = A[i];
} else {
L[i] = gcd(L[i], A[i - 1]);
}
}
vector<long long> R(N);
for (long long i = N - 1; i >= 0; i--) {
if (i == N - 1) {
R[i] = A[i];
} else {
R[i] = gcd(A[i], R[i + 1]);
}
}
long long maxv = 0;
long long cur = 0;
for (long long i = 0; i < N; i++) {
if (i == 0) {
cur = R[1];
} else if (i == N - 1) {
cur == L[N - 2];
} else {
cur = gcd(L[i - 1], R[i + 1]);
}
maxv = max(maxv, cur);
}
cout << maxv << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(x % y, y);
}
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++) {
cin >> A[i];
}
vector<long long> L(N);
for (long long i = 0; i < N; i++) {
if (i == 0) {
L[i] = A[i];
} else {
L[i] = gcd(L[i - 1], A[i]);
}
}
vector<long long> R(N);
for (long long i = N - 1; i >= 0; i--) {
if (i == N - 1) {
R[i] = A[i];
} else {
R[i] = gcd(A[i], R[i + 1]);
}
}
long long maxv = 0;
long long cur = 0;
for (long long i = 0; i < N; i++) {
if (i == 0) {
cur = R[1];
} else if (i == N - 1) {
cur = L[N - 2];
} else {
cur = gcd(L[i - 1], R[i + 1]);
}
maxv = max(maxv, cur);
}
cout << maxv << endl;
return 0;
} | [
"assignment.change",
"expression.operation.binary.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 874,097 | 874,096 | u942160358 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(long x, long y) {
long tmp, r;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
long n;
long long int ans = 0;
cin >> n;
vector<long long int> a(n), left(n), right(n);
rep(i, n) cin >> a[i];
ans = 0;
rep(i, n - 1) {
left[0] = a[0];
left[i + 1] = gcd(a[i + 1], left[i]);
right[n - 1] = a[n - 1];
right[n - 2 - i] = gcd(right[n - 1 - i], a[n - i - 2]);
}
ans = max(left[n - 1], right[0]);
for (int i = 1; i < n - 1; i++) {
if (ans < gcd(left[i - 1], right[i + 1]))
ans = gcd(left[i - 1], right[i + 1]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(long x, long y) {
long tmp, r;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
long n;
long long int ans = 0;
cin >> n;
vector<long long int> a(n), left(n), right(n);
rep(i, n) cin >> a[i];
ans = 0;
rep(i, n - 1) {
left[0] = a[0];
left[i + 1] = gcd(a[i + 1], left[i]);
right[n - 1] = a[n - 1];
right[n - 2 - i] = gcd(right[n - 1 - i], a[n - i - 2]);
}
ans = max(left[n - 2], right[1]);
for (int i = 1; i < n - 1; i++) {
if (ans < gcd(left[i - 1], right[i + 1]))
ans = gcd(left[i - 1], right[i + 1]);
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,101 | 874,102 | u961052574 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(int x, int y) {
int tmp, r;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
long n;
long long int ans = 0;
cin >> n;
vector<long long int> a(n), left(n), right(n);
rep(i, n) cin >> a[i];
ans = 0;
rep(i, n - 1) {
left[0] = a[0];
left[i + 1] = gcd(a[i + 1], left[i]);
right[n - 1] = a[n - 1];
right[n - 2 - i] = gcd(right[n - 1 - i], a[n - i - 2]);
}
ans = max(left[n - 1], right[1]);
for (int i = 1; i < n - 1; i++) {
if (ans < gcd(left[i - 1], right[i + 1]))
ans = gcd(left[i - 1], right[i + 1]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int gcd(long x, long y) {
long tmp, r;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int main() {
long n;
long long int ans = 0;
cin >> n;
vector<long long int> a(n), left(n), right(n);
rep(i, n) cin >> a[i];
ans = 0;
rep(i, n - 1) {
left[0] = a[0];
left[i + 1] = gcd(a[i + 1], left[i]);
right[n - 1] = a[n - 1];
right[n - 2 - i] = gcd(right[n - 1 - i], a[n - i - 2]);
}
ans = max(left[n - 2], right[1]);
for (int i = 1; i < n - 1; i++) {
if (ans < gcd(left[i - 1], right[i + 1]))
ans = gcd(left[i - 1], right[i + 1]);
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,103 | 874,102 | u961052574 | cpp |
p03061 | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
int N;
cin >> N;
long long *A = new long long[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long gmax = 0;
long long *LGCD = new long long[N];
long long *RGCD = new long long[N];
long long last;
last = A[0];
LGCD[0] = 0;
for (int i = 1; i < N; i++) {
last = gcd(last, A[i]);
LGCD[i] = last;
}
last = A[N - 1];
RGCD[N - 1] = 0;
for (int i = N - 2; i >= 0; i--) {
last = gcd(last, A[i]);
RGCD[i] = last;
}
// for ( int i = 0; i < N; i ++ ) cout << LGCD[i] << " ";
// cout << endl;
// for ( int i = 0; i < N; i ++ ) cout << RGCD[i] << " ";
// cout << endl;
for (int skip = 0; skip < N; skip++) {
// cout << "skip " << skip << ":";
// 0 - skip-1
long long lgcd = 0;
if (skip == 0) {
} else if (skip == 1) {
lgcd = A[0];
} else if (skip >= 2) {
lgcd = LGCD[skip - 1];
}
// skip+1 - N-1
long long rgcd = 0;
if (skip == N - 1) {
} else if (skip == N - 2) {
rgcd = A[N - 1];
} else if (skip <= N - 3) {
rgcd = LGCD[skip + 1];
}
long long g;
if (lgcd == 0) {
g = rgcd;
}
if (rgcd == 0) {
g = lgcd;
} else {
g = gcd(lgcd, rgcd);
}
if (g > gmax)
gmax = g;
// cout << lgcd << " " << rgcd << " " << g << endl;
}
cout << gmax << endl;
return 0;
} | #include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
int N;
cin >> N;
long long *A = new long long[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long gmax = 0;
long long *LGCD = new long long[N];
long long *RGCD = new long long[N];
long long last;
last = A[0];
LGCD[0] = 0;
for (int i = 1; i < N; i++) {
last = gcd(last, A[i]);
LGCD[i] = last;
}
last = A[N - 1];
RGCD[N - 1] = 0;
for (int i = N - 2; i >= 0; i--) {
last = gcd(last, A[i]);
RGCD[i] = last;
}
// for ( int i = 0; i < N; i ++ ) cout << LGCD[i] << " ";
// cout << endl;
// for ( int i = 0; i < N; i ++ ) cout << RGCD[i] << " ";
// cout << endl;
for (int skip = 0; skip < N; skip++) {
// cout << "skip " << skip << ":";
// 0 - skip-1
long long lgcd = 0;
if (skip == 0) {
} else if (skip == 1) {
lgcd = A[0];
} else if (skip >= 2) {
lgcd = LGCD[skip - 1];
}
// skip+1 - N-1
long long rgcd = 0;
if (skip == N - 1) {
} else if (skip == N - 2) {
rgcd = A[N - 1];
} else if (skip <= N - 3) {
rgcd = RGCD[skip + 1];
}
long long g;
if (lgcd == 0) {
g = rgcd;
}
if (rgcd == 0) {
g = lgcd;
} else {
g = gcd(lgcd, rgcd);
}
if (g > gmax)
gmax = g;
// cout << lgcd << " " << rgcd << " " << g << endl;
}
cout << gmax << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 874,118 | 874,119 | u951403082 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
//#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
template <class Monoid> struct SegTree {
using Func = function<Monoid(Monoid, Monoid)>;
vector<Monoid> dat;
int SIZE_R;
const Func F;
const Monoid UNITY;
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 = vector<Monoid>(SIZE_R * 2, UNITY);
}
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]);
}
}
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]);
}
}
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]; }
};
#define int int64_t
signed main() {
int n;
cin >> n;
SegTree<int64_t> seg(
n, [](int64_t a, int64_t b) { return GCD(a, b); }, 0);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
seg.set(i, a[i]);
}
seg.build();
int64_t ans{};
for (int i = 0; i < n; ++i) {
int64_t left = seg.get(0, i);
int64_t right = seg.get(i + 1, n);
amax(ans, GCD(left, right));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
//#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
template <class Monoid> struct SegTree {
using Func = function<Monoid(Monoid, Monoid)>;
vector<Monoid> dat;
int SIZE_R;
const Func F;
const Monoid UNITY;
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 = vector<Monoid>(SIZE_R * 2, UNITY);
}
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]);
}
}
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]);
}
}
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]; }
};
#define int int64_t
signed main() {
int n;
cin >> n;
SegTree<int64_t> seg(
n, [](int64_t a, int64_t b) { return GCD(a, b); }, 0);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
seg.set(i, a[i]);
}
seg.build();
int64_t ans{};
for (int i = 0; i < n; ++i) {
int64_t left = seg.get(0, i);
int64_t right = seg.get(i + 1, n);
amax(ans, GCD(left, right));
}
cout << ans << endl;
}
| [
"call.arguments.change"
] | 874,127 | 874,128 | u509680664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
//#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
template <class Monoid> struct SegTree {
using Func = function<Monoid(Monoid, Monoid)>;
vector<Monoid> dat;
int SIZE_R;
const Func F;
const Monoid UNITY;
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);
}
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]);
}
}
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]);
}
}
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]; }
};
#define int int64_t
signed main() {
int n;
cin >> n;
SegTree<int64_t> seg(
n, [](int64_t a, int64_t b) { return GCD(a, b); }, 0);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
seg.set(i, a[i]);
}
seg.build();
int64_t ans{};
for (int i = 0; i < n; ++i) {
int64_t left = seg.get(0, i);
int64_t right = seg.get(i + 1, n);
amax(ans, GCD(left, right));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
//#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
template <class Monoid> struct SegTree {
using Func = function<Monoid(Monoid, Monoid)>;
vector<Monoid> dat;
int SIZE_R;
const Func F;
const Monoid UNITY;
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);
}
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]);
}
}
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]);
}
}
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]; }
};
#define int int64_t
signed main() {
int n;
cin >> n;
SegTree<int64_t> seg(
n, [](int64_t a, int64_t b) { return GCD(a, b); }, 0);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
seg.set(i, a[i]);
}
seg.build();
int64_t ans{};
for (int i = 0; i < n; ++i) {
int64_t left = seg.get(0, i);
int64_t right = seg.get(i + 1, n);
amax(ans, GCD(left, right));
}
cout << ans << endl;
}
| [
"call.arguments.change"
] | 874,129 | 874,130 | u509680664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
//#define int int64_t
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
vector<int> L(n, -1);
L[0] = a[0];
vector<int> R(n, -1);
R[n - 1] = a[n - 1];
// cumGCD
for (int l = 1; l < n; ++l) {
L[l] = GCD(L[l - 1], a[l]);
}
for (int r = n - 2; r >= 0; --r) {
R[r] = GCD(R[r + 1], a[r]);
}
int ans = max(L[1], R[n - 2]);
// int ans{};
for (int i = 1; i < n - 1; ++i) {
int l = L[i - 1];
int r = R[i + 1];
amax(ans, GCD(l, r));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
//#define int int64_t
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
vector<int> L(n, -1);
L[0] = a[0];
vector<int> R(n, -1);
R[n - 1] = a[n - 1];
// cumGCD
for (int l = 1; l < n; ++l) {
L[l] = GCD(L[l - 1], a[l]);
}
for (int r = n - 2; r >= 0; --r) {
R[r] = GCD(R[r + 1], a[r]);
}
int ans = max(L[n - 2], R[1]); //下のfor文だと,これらを計算しないから.
for (int i = 1; i < n - 1; ++i) {
int l = L[i - 1];
int r = R[i + 1];
amax(ans, GCD(l, r));
}
cout << ans << endl;
} | [
"call.arguments.change",
"call.arguments.add"
] | 874,133 | 874,134 | u509680664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
//#define int int64_t
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
vector<int> L(n, -1);
L[0] = a[0];
vector<int> R(n, -1);
R[n - 1] = a[n - 1];
// cumGCD
for (int l = 1; l < n; ++l) {
L[l] = GCD(L[l - 1], a[l]);
}
for (int r = n - 1; r >= 0; --r) {
R[r] = GCD(R[r + 1], a[r]);
}
int ans = max(L[n - 2], R[1]);
for (int i = 1; i < n - 1; ++i) {
int l = L[i];
int r = R[i + 1];
amax(ans, GCD(l, r));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
//#define int int64_t
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
vector<int> L(n, -1);
L[0] = a[0];
vector<int> R(n, -1);
R[n - 1] = a[n - 1];
// cumGCD
for (int l = 1; l < n; ++l) {
L[l] = GCD(L[l - 1], a[l]);
}
for (int r = n - 2; r >= 0; --r) {
R[r] = GCD(R[r + 1], a[r]);
}
int ans = max(L[n - 2], R[1]); //下のfor文だと,これらを計算しないから.
for (int i = 1; i < n - 1; ++i) {
int l = L[i - 1];
int r = R[i + 1];
amax(ans, GCD(l, r));
}
cout << ans << endl;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,135 | 874,134 | u509680664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
//#define int int64_t
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
vector<int> L(n, -1);
L[0] = a[0];
vector<int> R(n, -1);
R[n - 1] = a[n - 1];
// cumGCD
for (int l = 1; l < n; ++l) {
L[l] = GCD(L[l - 1], a[l]);
}
for (int r = n - 2; r >= 0; --r) {
R[r] = GCD(R[r + 1], a[r]);
}
int ans = max(L[n - 2], R[1]);
for (int i = 1; i < n - 1; ++i) {
int l = L[i];
int r = R[i + 1];
amax(ans, GCD(l, r));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
//#define int int64_t
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
vector<int> L(n, -1);
L[0] = a[0];
vector<int> R(n, -1);
R[n - 1] = a[n - 1];
// cumGCD
for (int l = 1; l < n; ++l) {
L[l] = GCD(L[l - 1], a[l]);
}
for (int r = n - 2; r >= 0; --r) {
R[r] = GCD(R[r + 1], a[r]);
}
int ans = max(L[n - 2], R[1]); //下のfor文だと,これらを計算しないから.
for (int i = 1; i < n - 1; ++i) {
int l = L[i - 1];
int r = R[i + 1];
amax(ans, GCD(l, r));
}
cout << ans << endl;
} | [
"assignment.change"
] | 874,136 | 874,134 | u509680664 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.