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;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll lgcds[N];
ll rgcds[N];
lgcds[0] = rgcds[N - 2] = A[N - 1];
lgcds[1] = rgcds[N - 1] = A[0];
for (int i = 1; i <= N - 2; ++i) {
lgcds[i + 1] = __gcd(lgcds[i], A[i]);
rgcds[N - i - 2] = __gcd(rgcds[N - i - 1], A[N - i - 1]);
}
ll max_gcd = 1;
for (int i = 0; i < N - 1; ++i) {
ll gcd = __gcd(lgcds[i], rgcds[i]);
max_gcd = max(max_gcd, gcd);
}
cout << max_gcd << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll lgcds[N];
ll rgcds[N];
lgcds[0] = rgcds[N - 2] = A[N - 1];
lgcds[1] = rgcds[N - 1] = A[0];
for (int i = 1; i <= N - 2; ++i) {
lgcds[i + 1] = __gcd(lgcds[i], A[i]);
rgcds[N - i - 2] = __gcd(rgcds[N - i - 1], A[N - i - 1]);
}
ll max_gcd = 1;
for (int i = 0; i < N; ++i) {
ll gcd = __gcd(lgcds[i], rgcds[i]);
max_gcd = max(max_gcd, gcd);
}
cout << max_gcd << '\n';
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,620 | 874,621 | u009579822 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll lgcds[N];
ll rgcds[N];
lgcds[0] = rgcds[N - 2] = A[N - 1];
lgcds[1] = rgcds[N - 1] = A[0];
for (int i = 1; i <= N - 2; ++i) {
lgcds[i + 1] = __gcd(lgcds[i], A[i]);
rgcds[N - i - 2] = __gcd(rgcds[N - i - 1], A[N - i - 1]);
}
int max_gcd = 1;
for (int i = 0; i < N - 1; ++i) {
int gcd = __gcd(lgcds[i], rgcds[i]);
max_gcd = max(max_gcd, gcd);
}
cout << max_gcd << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
ll lgcds[N];
ll rgcds[N];
lgcds[0] = rgcds[N - 2] = A[N - 1];
lgcds[1] = rgcds[N - 1] = A[0];
for (int i = 1; i <= N - 2; ++i) {
lgcds[i + 1] = __gcd(lgcds[i], A[i]);
rgcds[N - i - 2] = __gcd(rgcds[N - i - 1], A[N - i - 1]);
}
ll max_gcd = 1;
for (int i = 0; i < N; ++i) {
ll gcd = __gcd(lgcds[i], rgcds[i]);
max_gcd = max(max_gcd, gcd);
}
cout << max_gcd << '\n';
return 0;
}
| [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,622 | 874,621 | u009579822 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n];
int pre[n] = {0}, suf[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i != 0)
pre[i] = __gcd(a[i], pre[i - 1]);
if (i == 0)
pre[i] = a[0];
}
suf[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
suf[i] = __gcd(a[i], suf[i + 1]);
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
ans = max(ans, __gcd(a[i - 1], a[i + 1]));
}
ans = max(ans, pre[n - 2]);
ans = max(ans, suf[1]);
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n];
int pre[n] = {0}, suf[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i != 0)
pre[i] = __gcd(a[i], pre[i - 1]);
if (i == 0)
pre[i] = a[0];
}
suf[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
suf[i] = __gcd(a[i], suf[i + 1]);
}
int ans = 0;
for (int i = 1; i < n - 1; i++) {
ans = max(ans, __gcd(pre[i - 1], suf[i + 1]));
}
ans = max(ans, pre[n - 2]);
ans = max(ans, suf[1]);
cout << ans;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,623 | 874,624 | u961487195 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d", &n)
#define scnll(n) scanf("%lld", &n)
#define scn2(n, m) scanf("%d%d", &n, &m)
#define scn3(n, m, w) scanf("%d%d%d", &n, &m, &w)
#define scn2ll(n, m) scanf("%lld%lld", &n, &m)
#define atoz(v) v.begin(), v.end()
#define ratoz(v) v.rbegin(), v.rend()
#define Fill(a, v) memset(a, v, sizeof(a))
#define sz(v) v.size()
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define sqr(x) x *x
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define ten(n) (int)1e##n
#define tenll(n) (lli)1e##n
#define mod 1000000007
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
/// priority_queue< int, vector< int >, greater< int > > minHeap;
void mor() {
cout << "NO";
exit(0);
}
int main() {
/// freopen("output.txt","w",stdout);
/// freopen("input.txt","r",stdin);
/// FastIO;
int n;
scn(n);
int a[n + 1];
for (int i = 1; i <= n; i++)
scn(a[i]);
vector<int> L(n + 3, 0), R(n + 3, 0);
for (int i = 1; i <= n; i++)
L[i] = __gcd(L[i - 1], a[i]);
for (int i = n; i; i--)
R[i] = __gcd(R[i + 1], a[i]);
int ans = L[n];
for (int i = 1; i <= n; i++) {
ans = max(ans, __gcd(R[i + 1], L[i - 1]));
}
cout << ans;
return main();
}
/// sin and cos expect input in radians not degrees. so use , sin(degrees * pi /
/// 180)
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d", &n)
#define scnll(n) scanf("%lld", &n)
#define scn2(n, m) scanf("%d%d", &n, &m)
#define scn3(n, m, w) scanf("%d%d%d", &n, &m, &w)
#define scn2ll(n, m) scanf("%lld%lld", &n, &m)
#define atoz(v) v.begin(), v.end()
#define ratoz(v) v.rbegin(), v.rend()
#define Fill(a, v) memset(a, v, sizeof(a))
#define sz(v) v.size()
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define sqr(x) x *x
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define ten(n) (int)1e##n
#define tenll(n) (lli)1e##n
#define mod 1000000007
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
/// priority_queue< int, vector< int >, greater< int > > minHeap;
void mor() {
cout << "NO";
exit(0);
}
int main() {
/// freopen("output.txt","w",stdout);
/// freopen("input.txt","r",stdin);
/// FastIO;
int n;
scn(n);
int a[n + 1];
for (int i = 1; i <= n; i++)
scn(a[i]);
vector<int> L(n + 3, 0), R(n + 3, 0);
for (int i = 1; i <= n; i++)
L[i] = __gcd(L[i - 1], a[i]);
for (int i = n; i; i--)
R[i] = __gcd(R[i + 1], a[i]);
int ans = L[n];
for (int i = 1; i <= n; i++) {
ans = max(ans, __gcd(R[i + 1], L[i - 1]));
}
cout << ans;
return 0;
}
/// sin and cos expect input in radians not degrees. so use , sin(degrees * pi /
/// 180)
| [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change",
"call.arguments.change"
] | 874,627 | 874,628 | u582464343 | cpp |
p03061 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
long gcd(long i, long j) {
long counter;
if (i == 0)
counter = j;
if (j == 0)
counter = i;
if (i != 0 && j != 0) {
if (i > j)
swap(i, j);
long r = j % i;
while (r != 0) {
j = i;
i = r;
r = j % i;
counter = i;
}
}
return counter;
}
int main() {
int N;
cin >> N;
vector<long> A(N);
vector<long> begin(N);
vector<long> end(N + 1);
long counter;
long counter_max = 0;
begin[0] = 0;
end[N] = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N; i++) {
begin[i] = gcd(begin[i - 1], A[i - 1]);
}
for (int i = N - 1; i > 0; i--) {
end[i] = gcd(end[i + 1], A[i]);
}
for (int i = 0; i < N; i++) {
counter_max = max(counter_max, gcd(begin[i], end[i + 1]));
}
cout << counter_max << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
long gcd(long i, long j) {
long counter;
if (i == 0)
counter = j;
if (j == 0)
counter = i;
if (i != 0 && j != 0) {
if (i > j)
swap(i, j);
long r = j % i;
while (r != 0) {
j = i;
i = r;
r = j % i;
}
counter = i;
}
return counter;
}
int main() {
int N;
cin >> N;
vector<long> A(N);
vector<long> begin(N);
vector<long> end(N + 1);
long counter;
long counter_max = 0;
begin[0] = 0;
end[N] = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N; i++) {
begin[i] = gcd(begin[i - 1], A[i - 1]);
}
for (int i = N - 1; i > 0; i--) {
end[i] = gcd(end[i + 1], A[i]);
}
for (int i = 0; i < N; i++) {
counter_max = max(counter_max, gcd(begin[i], end[i + 1]));
}
cout << counter_max << endl;
}
| [] | 874,632 | 874,633 | u774910314 | cpp |
p03061 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
long gcd(long i, long j) {
long counter = i;
if (i == 0)
counter = j;
// if(j == 0)counter = i;
if (i != 0 && j != 0) {
if (i > j)
swap(i, j);
long r = j % i;
while (r != 0) {
j = i;
i = r;
r = j % i;
counter = i;
}
}
return counter;
}
int main() {
int N;
cin >> N;
vector<long> A(N);
vector<long> begin(N);
vector<long> end(N + 1);
long counter;
long counter_max = 0;
begin[0] = 0;
end[N] = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N; i++) {
begin[i] = gcd(begin[i - 1], A[i - 1]);
}
for (int i = N - 1; i > 0; i--) {
end[i] = gcd(end[i + 1], A[i]);
}
for (int i = 0; i < N; i++) {
counter_max = max(counter_max, gcd(begin[i], end[i + 1]));
}
cout << counter_max << endl;
}
| #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
long gcd(long i, long j) {
long counter = i;
if (i == 0)
counter = j;
// if(j == 0)counter = i;
if (i != 0 && j != 0) {
if (i > j)
swap(i, j);
long r = j % i;
while (r != 0) {
j = i;
i = r;
r = j % i;
}
counter = i;
}
return counter;
}
int main() {
int N;
cin >> N;
vector<long> A(N);
vector<long> begin(N);
vector<long> end(N + 1);
long counter;
long counter_max = 0;
begin[0] = 0;
end[N] = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N; i++) {
begin[i] = gcd(begin[i - 1], A[i - 1]);
}
for (int i = N - 1; i > 0; i--) {
end[i] = gcd(end[i + 1], A[i]);
}
for (int i = 0; i < N; i++) {
// cout << begin[i] << end[i + 1] << gcd(begin[i],end[i + 1]) << endl;
counter_max = max(counter_max, gcd(begin[i], end[i + 1]));
}
cout << counter_max << endl;
}
| [] | 874,634 | 874,635 | u774910314 | cpp |
p03061 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int gcd(int x, int y) { return !x && !y ? gcd(y % x, x) : x + y; }
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a)
cin >> x;
vector<int> lg(n), rg(n);
lg[1] = a[0];
for (int i = 2; i < n; ++i)
lg[i] = gcd(lg[i - 1], a[i - 1]);
rg[n - 2] = a[n - 1];
for (int i = n - 3; i >= n; --i)
rg[i] = gcd(rg[i + 1], a[i + 1]);
int answer = max(lg[n - 1], rg[0]);
FOR(i, 1, n - 1) answer = max(answer, gcd(lg[i], rg[i]));
cout << answer << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int gcd(int x, int y) { return x && y ? gcd(y % x, x) : x + y; }
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a)
cin >> x;
vector<int> lg(n), rg(n);
lg[1] = a[0];
for (int i = 2; i < n; ++i)
lg[i] = gcd(lg[i - 1], a[i - 1]);
rg[n - 2] = a[n - 1];
for (int i = n - 3; i >= 0; --i)
rg[i] = gcd(rg[i + 1], a[i + 1]);
int answer = max(lg[n - 1], rg[0]);
FOR(i, 1, n - 1) answer = max(answer, gcd(lg[i], rg[i]));
cout << answer << endl;
return 0;
}
| [
"expression.operation.unary.logical.remove",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,644 | 874,645 | u633757735 | cpp |
p03061 | // AtCoder abc152-C
#include <algorithm>
#include <cstdio>
unsigned int getGCD(unsigned int a, unsigned int b) {
if (a < b)
std::swap(a, b);
while (b != 0) {
unsigned int mod = a % b;
a = b;
b = mod;
}
return a;
}
unsigned int getPowerOf2(unsigned int min) {
unsigned int value = 1;
while (value < min)
value <<= 1; // value *= 2;
return value;
}
unsigned int *getGCDSegmentTree(unsigned int *values, unsigned int number,
unsigned int *outTreeSize) {
unsigned int numberPadded = getPowerOf2(number);
unsigned int size = numberPadded * 2;
unsigned int *tree = new unsigned int[size];
for (unsigned int i = 0; i < number; i++) {
tree[numberPadded + i] = values[i];
}
for (unsigned int i = numberPadded + number; i < size; i++) {
tree[i] = 0;
}
for (unsigned int i = numberPadded - 1; i > 0; i--) {
tree[i] = getGCD(tree[2 * i], tree[2 * i + 1]);
}
tree[0] = 0;
*outTreeSize = size;
return tree;
}
unsigned int getMinGCDRecursive(unsigned int *gcdTree, unsigned int treeSize,
unsigned int index, unsigned int restGCD) {
if (index >= (treeSize / 2)) {
return restGCD;
}
unsigned int leftIndex = 2 * index;
unsigned int rightIndex = 2 * index + 1;
unsigned int gcdLeft = gcdTree[leftIndex];
unsigned int gcdRight = gcdTree[rightIndex];
unsigned int gcdMinLeft = getMinGCDRecursive(gcdTree, treeSize, leftIndex,
getGCD(gcdRight, restGCD));
unsigned int gcdMinRight = getMinGCDRecursive(gcdTree, treeSize, leftIndex,
getGCD(gcdLeft, restGCD));
return (gcdMinLeft < gcdMinRight) ? gcdMinRight : gcdMinLeft;
}
unsigned int getMinGCD(unsigned int *gcdTree, unsigned int treeSize) {
return getMinGCDRecursive(gcdTree, treeSize, 1, 0);
}
int main() {
unsigned int n;
std::scanf("%u", &n);
unsigned int *values = new unsigned int[n];
for (unsigned int i = 0; i < n; i++) {
unsigned int value;
std::scanf("%u", &value);
values[i] = value;
}
unsigned int treeSize = 0;
unsigned int *gcdTree = getGCDSegmentTree(values, n, &treeSize);
unsigned int result = getMinGCD(gcdTree, treeSize);
std::printf("%u\n", result);
delete[] gcdTree;
delete[] values;
return 0;
}
| // AtCoder abc152-C
#include <algorithm>
#include <cstdio>
unsigned int getGCD(unsigned int a, unsigned int b) {
if (a < b)
std::swap(a, b);
while (b != 0) {
unsigned int mod = a % b;
a = b;
b = mod;
}
return a;
}
unsigned int getPowerOf2(unsigned int min) {
unsigned int value = 1;
while (value < min)
value <<= 1; // value *= 2;
return value;
}
unsigned int *getGCDSegmentTree(unsigned int *values, unsigned int number,
unsigned int *outTreeSize) {
unsigned int numberPadded = getPowerOf2(number);
unsigned int size = numberPadded * 2;
unsigned int *tree = new unsigned int[size];
for (unsigned int i = 0; i < number; i++) {
tree[numberPadded + i] = values[i];
}
for (unsigned int i = numberPadded + number; i < size; i++) {
tree[i] = 0;
}
for (unsigned int i = numberPadded - 1; i > 0; i--) {
tree[i] = getGCD(tree[2 * i], tree[2 * i + 1]);
}
tree[0] = 0;
*outTreeSize = size;
return tree;
}
unsigned int getMinGCDRecursive(unsigned int *gcdTree, unsigned int treeSize,
unsigned int index, unsigned int restGCD) {
if (index >= (treeSize / 2)) {
return restGCD;
}
unsigned int leftIndex = 2 * index;
unsigned int rightIndex = 2 * index + 1;
unsigned int gcdLeft = gcdTree[leftIndex];
unsigned int gcdRight = gcdTree[rightIndex];
unsigned int gcdMinLeft = getMinGCDRecursive(gcdTree, treeSize, leftIndex,
getGCD(gcdRight, restGCD));
unsigned int gcdMinRight = getMinGCDRecursive(gcdTree, treeSize, rightIndex,
getGCD(gcdLeft, restGCD));
return (gcdMinLeft < gcdMinRight) ? gcdMinRight : gcdMinLeft;
}
unsigned int getMinGCD(unsigned int *gcdTree, unsigned int treeSize) {
return getMinGCDRecursive(gcdTree, treeSize, 1, 0);
}
int main() {
unsigned int n;
std::scanf("%u", &n);
unsigned int *values = new unsigned int[n];
for (unsigned int i = 0; i < n; i++) {
unsigned int value;
std::scanf("%u", &value);
values[i] = value;
}
unsigned int treeSize = 0;
unsigned int *gcdTree = getGCDSegmentTree(values, n, &treeSize);
unsigned int result = getMinGCD(gcdTree, treeSize);
std::printf("%u\n", result);
delete[] gcdTree;
delete[] values;
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 874,650 | 874,651 | u045928390 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (a != 0) {
return gcd(b % a, a);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> left_sum(N), right_sum(N);
left_sum[0] = A[0];
right_sum[0] = A[N - 1];
for (int i = 1; i < N; i++) {
left_sum[i] = gcd(left_sum[i - 1], A[i]);
right_sum[i] = gcd(right_sum[i - 1], A[N - i - 1]);
}
reverse(right_sum.begin(), right_sum.end());
// for (int i = 0; i < N; i++)
// {
// cout << "left_sum" << left_sum[i] << endl;
// cout << "right_sum" << right_sum[i] << endl;
// }
vector<int> calc(N);
for (int i = 0; i < N; i++) {
if (i == 0) {
calc[0] = right_sum[1];
} else if (i == N - 1) {
calc[N - 1] = left_sum[N - 2];
} else {
calc[i] = gcd(left_sum[i - 1], right_sum[N - i]);
}
}
int ans = *max_element(calc.begin(), calc.end());
// for (int i = 0; i < N; i++)
//{
// cout << "calc" << calc[i] << endl;
//}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
swap(a, b);
}
if (a != 0) {
return gcd(b % a, a);
} else {
return b;
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> left_sum(N), right_sum(N);
left_sum[0] = A[0];
right_sum[0] = A[N - 1];
for (int i = 1; i < N; i++) {
left_sum[i] = gcd(left_sum[i - 1], A[i]);
right_sum[i] = gcd(right_sum[i - 1], A[N - i - 1]);
}
reverse(right_sum.begin(), right_sum.end());
// for (int i = 0; i < N; i++)
// {
// cout << "left_sum" << left_sum[i] << endl;
// cout << "right_sum" << right_sum[i] << endl;
// }
vector<int> calc(N);
for (int i = 0; i < N; i++) {
if (i == 0) {
calc[0] = right_sum[1];
} else if (i == N - 1) {
calc[N - 1] = left_sum[N - 2];
} else {
calc[i] = gcd(left_sum[i - 1], right_sum[i + 1]);
}
}
int ans = *max_element(calc.begin(), calc.end());
// for (int i = 0; i < N; i++)
//{
// cout << "calc" << calc[i] << endl;
//}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 874,652 | 874,653 | u934246119 | cpp |
p03061 | #include <iostream>
#include <vector>
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<int> left(N + 1, 0), right(N + 1, 0);
// left累積GCD
for (int i = 0; i < N; ++i) {
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 max = 0;
for (int i = 0; i < N - 1; ++i) {
int l = left[i], r = right[i + 1];
int g = GCD(l, r);
if (max < g)
max = g;
}
cout << max << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
vector<int> left(N + 1, 0), right(N + 1, 0);
// left累積GCD
for (int i = 0; i < N; ++i) {
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 max = 0;
for (int i = 0; i < N; ++i) {
int l = left[i], r = right[i + 1];
int g = GCD(l, r);
if (max < g)
max = g;
}
cout << max << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,654 | 874,655 | u477694598 | cpp |
p03061 | #include <iostream>
#define endl '\n'
#include <algorithm>
using namespace std;
const int MAXN = 1e5 + 200;
int L[MAXN], R[MAXN], A[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
cin >> A[0];
L[0] = A[0];
for (int i = 1; i < N; ++i) {
cin >> A[i];
L[i] = __gcd(L[i - 1], A[i]);
}
R[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; --i) {
R[i] = __gcd(A[i], R[i + 1]);
}
int ans = 0;
ans = max(L[1], R[N - 2]);
for (int i = 1; i < N - 1; ++i) {
ans = max(ans, __gcd(L[i - 1], R[i + 1]));
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#define endl '\n'
#include <algorithm>
using namespace std;
const int MAXN = 1e5 + 200;
int L[MAXN], R[MAXN], A[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
cin >> A[0];
L[0] = A[0];
for (int i = 1; i < N; ++i) {
cin >> A[i];
L[i] = __gcd(L[i - 1], A[i]);
}
R[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; --i) {
R[i] = __gcd(A[i], R[i + 1]);
}
int ans = 0;
ans = max(R[1], L[N - 2]);
for (int i = 1; i < N - 1; ++i) {
ans = max(ans, __gcd(L[i - 1], R[i + 1]));
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,656 | 874,657 | u985469162 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a == 0) {
return b;
}
if (b == 0) {
return a;
}
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int ans = 0, N;
cin >> N;
vector<int> A(N), M(N), L(N), R(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
if (i == 0)
L[i] = 0;
L[i + 1] = gcd(L[i], A[i]);
// cout << L[i] << endl;
}
for (int i = N - 1; i >= 0; i--) {
R[N] = 0;
R[i] = gcd(R[i + 1], A[i]);
M[i] = gcd(L[i], R[i + 1]);
// cout << R[i] << endl;
}
sort(M.begin(), M.end());
cout << M[N - 1] << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a == 0) {
return b;
}
if (b == 0) {
return a;
}
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int ans = 0, N;
cin >> N;
vector<int> A(N), M(N), L(N + 1), R(N + 1);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
if (i == 0)
L[i] = 0;
L[i + 1] = gcd(L[i], A[i]);
}
for (int i = N - 1; i >= 0; i--) {
R[N] = 0;
R[i] = gcd(R[i + 1], A[i]);
M[i] = gcd(L[i], R[i + 1]);
}
sort(M.begin(), M.end());
cout << M[N - 1] << endl;
} | [
"assignment.change"
] | 874,660 | 874,659 | u982721500 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100010;
int a[maxn], dpl[maxn], dpr[maxn];
int main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
dpl[0] = a[0];
dpr[n - 1] = a[n - 1];
for (int i = 2; i < n; ++i) {
dpl[i] = __gcd(dpl[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; --i) {
dpr[i] = __gcd(dpr[i + 1], a[i]);
}
int ans = 0;
for (int i = 1; i < n - 1; ++i)
ans = max(ans, __gcd(dpl[i - 1], dpr[i + 1]));
ans = max(ans, max(dpl[n - 2], dpr[1]));
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100010;
int a[maxn], dpl[maxn], dpr[maxn];
int main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
dpl[0] = a[0];
dpr[n - 1] = a[n - 1];
for (int i = 1; i < n; ++i) {
dpl[i] = __gcd(dpl[i - 1], a[i]);
}
for (int i = n - 2; i >= 0; --i) {
dpr[i] = __gcd(dpr[i + 1], a[i]);
}
int ans = 0;
for (int i = 1; i < n - 1; ++i)
ans = max(ans, __gcd(dpl[i - 1], dpr[i + 1]));
ans = max(ans, max(dpl[n - 2], dpr[1]));
cout << ans;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,663 | 874,664 | u209067041 | cpp |
p03061 | #include <iostream>
using namespace std;
template <class T> inline int gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int l[n + 1], r[n + 1];
l[0] = 0;
r[n] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i - 1] = gcd(r[n - i], a[n - i - 1]);
}
int m = 0;
for (int i = 1; i < n - 1; i++) {
m = max(m, gcd(l[i], r[i + 1]));
}
cout << m << endl;
}
| #include <iostream>
using namespace std;
template <class T> inline int gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int l[n + 1], r[n + 1];
l[0] = 0;
r[n] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i - 1] = gcd(r[n - i], a[n - i - 1]);
}
int m = 0;
for (int i = 0; i < n; i++) {
m = max(m, gcd(l[i], r[i + 1]));
}
cout << m << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,667 | 874,668 | u093744128 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n, MAX = 0;
cin >> n;
vector<int> a(n), l(n), r(n);
a[0] = 0;
l[0] = 0;
r[n + 1] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
l[i] = gcd(l[i - 1], a[i - 1]);
}
for (int i = n; i >= 0; i--) {
r[i] = gcd(r[i + 1], a[i + 1]);
}
for (int i = 0; i <= n; i++) {
if (MAX < gcd(l[i], r[i]))
MAX = gcd(l[i], r[i]);
}
cout << MAX << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n, MAX = 0;
cin >> n;
vector<int> a(n + 2), l(n + 2), r(n + 2);
a[0] = 0;
l[0] = 0;
r[n + 1] = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
l[i] = gcd(l[i - 1], a[i - 1]);
}
for (int i = n; i >= 0; i--) {
r[i] = gcd(r[i + 1], a[i + 1]);
}
for (int i = 0; i <= n; i++) {
if (MAX < gcd(l[i], r[i]))
MAX = gcd(l[i], r[i]);
}
cout << MAX << endl;
return 0;
} | [
"assignment.change"
] | 874,676 | 874,677 | u382176401 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
int v[n];
for (auto i = 0; i < n; i++)
cin >> v[i];
int l[n], r[n];
for (auto i = 0; i < n; i++) {
if (i == 0) {
l[i] = 0;
r[i] = 0;
}
else if (i == 1) {
l[i] = v[i - 1];
r[i] = v[n - 1 - (i - 1)];
}
else {
l[i] = gcd(l[i - 1], v[i - 1]);
r[i] = gcd(v[i - 1], r[n - 1 - (i - 1)]);
}
}
int max = -1, tmp;
for (auto i = 0; i < n; i++) {
tmp = gcd(l[i], r[n - i - 1]);
if (tmp > max)
max = tmp;
}
cout << max << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
cin >> n;
int v[n];
for (auto i = 0; i < n; i++)
cin >> v[i];
int l[n], r[n];
for (auto i = 0; i < n; i++) {
if (i == 0) {
l[i] = 0;
r[i] = 0;
}
else if (i == 1) {
l[i] = v[i - 1];
r[i] = v[n - 1 - (i - 1)];
}
else {
l[i] = gcd(l[i - 1], v[i - 1]);
r[i] = gcd(r[i - 1], v[n - 1 - (i - 1)]);
}
}
int max = -1, tmp;
for (auto i = 0; i < n; i++) {
tmp = gcd(l[i], r[n - i - 1]);
if (tmp > max)
max = tmp;
}
cout << max << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,684 | 874,685 | u377032133 | cpp |
p03061 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
struct edge {
int to, cost;
};
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
const int INF = 1e9;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int mx4[] = {0, 1, 0, -1};
const int my4[] = {1, 0, -1, 0};
const int mx8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int my8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vi a(n), b(n), c(n);
rep(i, n) cin >> a[i];
b[0] = a[0], c[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
b[i] = gcd(b[i - 1], a[i]);
for (int i = n - 2; i >= 0; i--)
b[i] = gcd(a[i], c[i + 1]);
int ma = max(b[n - 2], c[1]);
for (int i = 1; i < n - 1; i++) {
ma = max(ma, gcd(b[i - 1], c[i + 1]));
}
cout << ma << endl;
return 0;
}
| #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
struct edge {
int to, cost;
};
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
const int INF = 1e9;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int mx4[] = {0, 1, 0, -1};
const int my4[] = {1, 0, -1, 0};
const int mx8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int my8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vi a(n), b(n), c(n);
rep(i, n) cin >> a[i];
b[0] = a[0], c[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
b[i] = gcd(b[i - 1], a[i]);
for (int i = n - 2; i >= 0; i--)
c[i] = gcd(a[i], c[i + 1]);
int ma = max(b[n - 2], c[1]);
for (int i = 1; i < n - 1; i++) {
ma = max(ma, gcd(b[i - 1], c[i + 1]));
}
cout << ma << endl;
return 0;
}
| [
"assignment.variable.change",
"identifier.change"
] | 874,686 | 874,687 | u216772548 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
long long c = max(a, b);
long long d = min(a, b);
long long e = c % d;
if (e == 0)
return d;
else {
return gcd(d, e);
}
}
int main() {
int N;
cin >> N;
vector<long long> A(N);
vector<long long> x(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i == 0)
x[0] = A[0];
else {
x[i] = gcd(A[i], x[i - 1]);
}
}
vector<long long> y(N);
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1)
y[i] = A[i];
else {
y[i] = gcd(A[i], y[i + 1]);
}
}
long long ans = 0;
for (int i = 1; i < N - 1; i++) {
ans = max(ans, gcd(x[i - 1], y[i + 1]));
}
ans = max(ans, max(x[N - 1], y[1]));
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
long long c = max(a, b);
long long d = min(a, b);
long long e = c % d;
if (e == 0)
return d;
else {
return gcd(d, e);
}
}
int main() {
int N;
cin >> N;
vector<long long> A(N);
vector<long long> x(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i == 0)
x[0] = A[0];
else {
x[i] = gcd(A[i], x[i - 1]);
}
}
vector<long long> y(N);
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1)
y[i] = A[i];
else {
y[i] = gcd(A[i], y[i + 1]);
}
}
long long ans = 0;
for (int i = 1; i < N - 1; i++) {
ans = max(ans, gcd(x[i - 1], y[i + 1]));
}
ans = max(ans, max(x[N - 2], y[1]));
cout << ans;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,694 | 874,695 | u664207511 | cpp |
p03061 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 998244353;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
ll l[MAX] = {}, r[MAX] = {};
for (i = 1; i <= N; i++)
cin >> a[i];
for (i = 1; i <= N; i++)
l[i] = gcd(l[i - 1], a[i]);
for (i = N; i >= 1; i--)
r[i] = gcd(r[i + 1], a[i]);
ll ans = 1;
for (i = 1; i < N; i++)
chmax(ans, gcd(l[i], r[i + 2]));
pt(ans);
}
| #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 998244353;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
ll l[MAX] = {}, r[MAX] = {};
for (i = 1; i <= N; i++)
cin >> a[i];
for (i = 1; i <= N; i++)
l[i] = gcd(l[i - 1], a[i]);
for (i = N; i >= 1; i--)
r[i] = gcd(r[i + 1], a[i]);
ll ans = 1;
for (i = 0; i < N; i++)
chmax(ans, gcd(l[i], r[i + 2]));
pt(ans);
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,698 | 874,699 | u768152935 | cpp |
p03061 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 998244353;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
ll l[MAX] = {}, r[MAX] = {};
for (i = 1; i <= N; i++)
cin >> a[i];
for (i = 1; i <= N; i++)
l[i] = gcd(l[i - 1], a[i]);
for (i = N; i >= 1; i--)
r[i] = gcd(r[i + 1], a[i]);
ll ans = 1;
for (i = 1; i <= N; i++)
chmax(ans, gcd(l[i], r[i]));
pt(ans);
}
| #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 998244353;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
ll l[MAX] = {}, r[MAX] = {};
for (i = 1; i <= N; i++)
cin >> a[i];
for (i = 1; i <= N; i++)
l[i] = gcd(l[i - 1], a[i]);
for (i = N; i >= 1; i--)
r[i] = gcd(r[i + 1], a[i]);
ll ans = 1;
for (i = 0; i < N; i++)
chmax(ans, gcd(l[i], r[i + 2]));
pt(ans);
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,700 | 874,699 | u768152935 | cpp |
p03061 | #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 998244353;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
ll l[MAX] = {}, r[MAX] = {};
for (i = 1; i <= N; i++)
cin >> a[i];
for (i = 1; i <= N; i++)
l[i] = gcd(l[i - 1], a[i]);
for (i = N; i >= 1; i--)
r[i] = gcd(r[i + 1], a[i]);
ll ans = 1;
for (i = 0; i <= N; i++)
chmax(ans, gcd(l[i], r[i + 1]));
pt(ans);
}
| #include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; \
}
#define chmin(a, b) \
{ \
if (a > b) \
a = b; \
}
#define moC(a, s, b) (a) = ((a)s(b) + MOD) % MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF = 1e18;
static const ll MAX = 1e5 + 7;
static const ll MOD = 998244353;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main(void) {
ll N;
cin >> N;
ll a[MAX];
ll i;
ll l[MAX] = {}, r[MAX] = {};
for (i = 1; i <= N; i++)
cin >> a[i];
for (i = 1; i <= N; i++)
l[i] = gcd(l[i - 1], a[i]);
for (i = N; i >= 1; i--)
r[i] = gcd(r[i + 1], a[i]);
ll ans = 1;
for (i = 0; i < N; i++)
chmax(ans, gcd(l[i], r[i + 2]));
pt(ans);
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 874,701 | 874,699 | u768152935 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
vector<int> l(n), r(n);
for (int i = 0; i < n; i++)
l[i + 1] = gcd(a[i], l[i]);
for (int i = n - 1; i > 0; i--)
r[i - 1] = gcd(a[i], r[i]);
int ans = 1;
for (int i = 0; i < n; i++) {
int tmp = gcd(l[i], r[i]);
ans = max(ans, tmp);
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
vector<int> l(n), r(n);
for (int i = 0; i < n - 1; i++)
l[i + 1] = gcd(a[i], l[i]);
for (int i = n - 1; i > 0; i--)
r[i - 1] = gcd(a[i], r[i]);
int ans = 1;
for (int i = 0; i < n; i++) {
int tmp = gcd(l[i], r[i]);
ans = max(ans, tmp);
}
printf("%d\n", ans);
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,704 | 874,705 | u627434558 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], 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;
}
| #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], 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;
} | [] | 874,706 | 874,707 | u627434558 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], 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;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> l(N), r(N);
for (int i = 0; i < N - 1; ++i) {
l[i + 1] = gcd(l[i], 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;
} | [] | 874,708 | 874,707 | u627434558 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
// cout << l[i+1] << " " << r[n-i] << endl;
}
ll ans = 0;
for (int i = 1; i < n; i++) {
// cout <<i<<": "<<l[i] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i - 1], r[i + 1])); //なぜこのlの添え字がi-1なのか？
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
}
ll ans = 0;
for (int i = 1; i < n + 1; i++) {
ans = max(ans, gcd(l[i - 1], r[i + 1])); //なぜこのlの添え字がi-1なのか？
// L: 0 12 3 3
// \ \ \ このペアで比較している．
// R: 3 3 18 0
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,709 | 874,710 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
// cout << l[i+1] << " " << r[n-i] << endl;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
// cout <<i<<": "<<l[i] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i - 1], r[i + 1]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
}
ll ans = 0;
for (int i = 1; i < n + 1; i++) {
ans = max(ans, gcd(l[i - 1], r[i + 1])); //なぜこのlの添え字がi-1なのか？
// L: 0 12 3 3
// \ \ \ このペアで比較している．
// R: 3 3 18 0
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,711 | 874,710 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
}
ll ans = 0;
for (int i = 0; i < n; i++) {
// cout << l[i] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i], r[i + 1]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
}
ll ans = 0;
for (int i = 1; i < n + 1; i++) {
ans = max(ans, gcd(l[i - 1], r[i + 1])); //なぜこのlの添え字がi-1なのか？
// L: 0 12 3 3
// \ \ \ このペアで比較している．
// R: 3 3 18 0
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 874,712 | 874,710 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
// cout << l[i+1] << " " << r[n-i] << endl;
}
ll ans = 0;
for (int i = 1; i < n; i++) {
// cout <<i<<": "<<l[i] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i - 1], r[i + 1])); //なぜこのlの添え字がi-1なのか？
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
// cout << l[i+1] << " " << r[n-i] << endl;
}
// for(int i=0; i<n+1; i++)cout << r[i+1] << " ";
ll ans = 0;
for (int i = 1; i < n + 1; i++) {
// cout <<i<<": "<<l[i-1] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i - 1], r[i + 1])); //なぜこのlの添え字がi-1なのか？
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,709 | 874,713 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
// cout << l[i+1] << " " << r[n-i] << endl;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
// cout <<i<<": "<<l[i] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i - 1], r[i + 1]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
// cout << l[i+1] << " " << r[n-i] << endl;
}
// for(int i=0; i<n+1; i++)cout << r[i+1] << " ";
ll ans = 0;
for (int i = 1; i < n + 1; i++) {
// cout <<i<<": "<<l[i-1] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i - 1], r[i + 1])); //なぜこのlの添え字がi-1なのか？
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 874,711 | 874,713 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
}
ll ans = 0;
for (int i = 0; i < n; i++) {
// cout << l[i] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i], r[i + 1]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int n;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> l(n + 2, 0), r(n + 2, 0);
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
r[n - i] = gcd(r[n - (i - 1)], a[n - i - 1]);
// cout << l[i+1] << " " << r[n-i] << endl;
}
// for(int i=0; i<n+1; i++)cout << r[i+1] << " ";
ll ans = 0;
for (int i = 1; i < n + 1; i++) {
// cout <<i<<": "<<l[i-1] << " " << r[i+1] << endl;
ans = max(ans, gcd(l[i - 1], r[i + 1])); //なぜこのlの添え字がi-1なのか？
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 874,712 | 874,713 | u255001744 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n), r(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = __gcd(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
ll ans = max(r[0], l[n - 1]);
for (int i = 1; i < n - 1; i++) {
ll tmp = __gcd(l[i - 1], r[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n), r(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = __gcd(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
ll ans = max(r[1], l[n - 2]);
for (int i = 1; i < n - 1; i++) {
ll tmp = __gcd(l[i - 1], r[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,716 | 874,717 | u773916255 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n), r(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = __gcd(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
ll ans = max(r[1], l[n - 1]);
for (int i = 1; i < n - 1; i++) {
ll tmp = __gcd(l[i - 1], r[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<ll> a(n), l(n), r(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = __gcd(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = __gcd(r[i + 1], a[i]);
}
ll ans = max(r[1], l[n - 2]);
for (int i = 1; i < n - 1; i++) {
ll tmp = __gcd(l[i - 1], r[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,718 | 874,717 | u773916255 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mod 1e9 + 7
#define ll long long int
#define epsilon 1e-7
ll min(ll x, ll y) {
if (x < y)
return x;
return y;
}
int a[100000];
int f[100000];
int b[100000];
int gcd(int a, int b) {
if (a < b) {
int t = a;
a = b;
b = t;
}
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main(void) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int fr = a[0];
for (int i = 0; i < n; i++) {
fr = gcd(fr, a[i]);
f[i] = fr;
}
int ba = a[n - 1];
for (int i = n - 1; i >= 0; i--) {
ba = gcd(ba, a[i]);
b[i] = ba;
}
int max = 1;
for (int i = 0; i < n; i++) {
if (i == 0)
if (b[1] > max)
max = b[1];
else if (i == n - 1)
if (f[n - 2] > max)
max = f[n - 2];
else {
int gg = gcd(f[i - 1], b[i + 1]);
if (gg > max)
max = gg;
}
// printf("%d\n", max);
}
printf("%d\n", max);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mod 1e9 + 7
#define ll long long int
#define epsilon 1e-7
ll min(ll x, ll y) {
if (x < y)
return x;
return y;
}
int a[100000];
int f[100000];
int b[100000];
int gcd(int a, int b) {
if (a < b) {
int t = a;
a = b;
b = t;
}
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main(void) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int fr = a[0];
for (int i = 0; i < n; i++) {
fr = gcd(fr, a[i]);
f[i] = fr;
}
int ba = a[n - 1];
for (int i = n - 1; i >= 0; i--) {
ba = gcd(ba, a[i]);
b[i] = ba;
}
int max = 1;
for (int i = 0; i < n; i++) {
if (i == 0) {
if (b[1] > max)
max = b[1];
} else if (i == n - 1) {
if (f[n - 2] > max)
max = f[n - 2];
} else {
int gg = gcd(f[i - 1], b[i + 1]);
if (gg > max)
max = gg;
}
// printf("%d\n", max);
}
printf("%d\n", max);
return 0;
} | [] | 874,721 | 874,722 | u436045956 | cpp |
p03061 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x) // decltypeで型取得、引数があればva_argsのところに入れる
using namespace std;
typedef long long ll; // long longをllでかけるようにした
const int INF = 1e9;
// 最大公約数
int gcd(int a, int b) {
int c;
if (a < b) {
a += b;
b = a - b;
a -= b;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main(void) {
int n;
cin >> n;
vector<int> A(n), left(n), right(n);
REP(i, n) cin >> A[i];
int ans = 0;
left[0] = A[0];
right[0] = A[n - 1];
FOR(i, 1, n) {
left[i] = gcd(left[i - 1], A[i]);
right[i] = gcd(right[i - 1], A[n - 1 - i]);
}
REP(i, n) {
if (i == 0)
ans = max(ans, right[n - 2]);
else if (i == n - 1)
ans = max(ans, left[n - 2]);
else
ans = max(ans, gcd(left[i - 1], right[n - i - 1]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x) // decltypeで型取得、引数があればva_argsのところに入れる
using namespace std;
typedef long long ll; // long longをllでかけるようにした
const int INF = 1e9;
// 最大公約数
int gcd(int a, int b) {
int c;
if (a < b) {
a += b;
b = a - b;
a -= b;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main(void) {
int n;
cin >> n;
vector<int> A(n), left(n), right(n);
REP(i, n) cin >> A[i];
int ans = 0;
left[0] = A[0];
right[0] = A[n - 1];
FOR(i, 1, n) {
left[i] = gcd(left[i - 1], A[i]);
right[i] = gcd(right[i - 1], A[n - 1 - i]);
}
REP(i, n) {
if (i == 0)
ans = max(ans, right[n - 2]);
else if (i == n - 1)
ans = max(ans, left[n - 2]);
else
ans = max(ans, gcd(left[i - 1], right[n - i - 2]));
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,732 | 874,733 | u369212307 | cpp |
p03061 | #include <bits/stdc++.h>
#define lli unsigned long long int
#define ll long long int
#define PI acos(-1.0)
#define UNIQUE(V) (V).erase(unique(ALL(V), (V).end()) //vector/string etc must need to be sorted
#define timesave \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ALL(V) (V).begin(), (V).end()
#define MEMSET(a, val) memset(a, val, sizeof(a))
using namespace std;
template <class T> T GCD(T a, T b) { return (b != 0 ? GCD<T>(b, a % b) : a); }
template <class T> T LCM(T a, T b) { return ((a * b) / GCD<T>(a, b)); }
int main() {
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// timesave;
// while(1){
int n;
cin >> n;
int a[n + 5], b[n + 5], c[n + 5];
for (int i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0];
c[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
b[i] = __gcd(a[i], b[i - 1]);
}
for (int i = n - 2; i >= 0; i--) {
c[i] = __gcd(a[i], c[i + 1]);
}
int x, y, gcd = max(c[1], b[n - 1]);
for (int i = 1; i < n - 1; i++) {
x = b[i - 1];
y = c[i + 1];
gcd = max(gcd, __gcd(x, y));
}
cout << gcd << endl;
//}
return 0;
}
| #include <bits/stdc++.h>
#define lli unsigned long long int
#define ll long long int
#define PI acos(-1.0)
#define UNIQUE(V) (V).erase(unique(ALL(V), (V).end()) //vector/string etc must need to be sorted
#define timesave \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ALL(V) (V).begin(), (V).end()
#define MEMSET(a, val) memset(a, val, sizeof(a))
using namespace std;
template <class T> T GCD(T a, T b) { return (b != 0 ? GCD<T>(b, a % b) : a); }
template <class T> T LCM(T a, T b) { return ((a * b) / GCD<T>(a, b)); }
int main() {
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// timesave;
// while(1){
int n;
cin >> n;
int a[n + 5], b[n + 5], c[n + 5];
for (int i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0];
c[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
b[i] = __gcd(a[i], b[i - 1]);
}
for (int i = n - 2; i >= 0; i--) {
c[i] = __gcd(a[i], c[i + 1]);
}
int x, y, gcd = max(c[1], b[n - 2]);
for (int i = 1; i < n - 1; i++) {
x = b[i - 1];
y = c[i + 1];
gcd = max(gcd, __gcd(x, y));
}
cout << gcd << endl;
//}
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,746 | 874,747 | u842407954 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) { return b == 0 ? a : GCD(b, a % b); }
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = GCD(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = GCD(r[i + 1], a[i]);
}
int res = max(l[n - 2], r[1]);
res = max(res, l[n - 1]);
for (int i = 1; i < n - 2; i++) {
res = max(res, GCD(l[i - 1], r[i + 1]));
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) { return b == 0 ? a : GCD(b, a % b); }
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = GCD(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = GCD(r[i + 1], a[i]);
}
int res = max(l[n - 2], r[1]);
res = max(res, l[n - 1]);
for (int i = 1; i <= n - 2; i++) {
res = max(res, GCD(l[i - 1], r[i + 1]));
}
cout << res;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,748 | 874,749 | u521455622 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b != 0) {
int t = a % b;
a = b;
b = t;
}
return a;
}
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = GCD(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = GCD(r[i + 1], a[i]);
}
int res = max(l[n - 2], r[1]);
for (int i = 1; i < n - 2; i++) {
res = max(res, GCD(l[i - 1], r[i + 1]));
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b != 0) {
int t = a % b;
a = b;
b = t;
}
return a;
}
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = GCD(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = GCD(r[i + 1], a[i]);
}
int res = max(l[n - 2], r[1]);
for (int i = 1; i <= n - 2; i++) {
res = max(res, GCD(l[i - 1], r[i + 1]));
}
cout << res;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,750 | 874,751 | u283246948 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b != 0) {
int t = a % b;
a = b;
b = t;
}
return a;
}
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = GCD(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = GCD(r[i + 1], a[i]);
}
int res = max(l[n - 1], r[1]);
for (int i = 1; i < n - 2; i++) {
res = max(res, GCD(l[i - 1], r[i + 1]));
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b != 0) {
int t = a % b;
a = b;
b = t;
}
return a;
}
int main() {
int n;
cin >> n;
int a[n], l[n], r[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (int i = 1; i < n; i++) {
l[i] = GCD(l[i - 1], a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
r[i] = GCD(r[i + 1], a[i]);
}
int res = max(l[n - 2], r[1]);
for (int i = 1; i <= n - 2; i++) {
res = max(res, GCD(l[i - 1], r[i + 1]));
}
cout << res;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 874,752 | 874,751 | u283246948 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
ll N, A[100005], S1[100005], S2[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
S1[0] = A[0];
for (ll i = 1; i < N; i++) {
S1[i] = __gcd(S1[i - 1], A[i]);
}
S2[N - 1] = A[N - 1];
for (ll i = N - 2; i >= 0; i--) {
S2[i] = __gcd(S2[i + 1], A[i]);
}
ll ans = S1[N - 1];
ans = max(ans, S2[1]);
ans = max(ans, S1[N - 1]);
for (ll i = 0; i < N - 2; i++) {
ans = max(ans, __gcd(S1[i], S2[i + 2]));
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
ll N, A[100005], S1[100005], S2[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
S1[0] = A[0];
for (ll i = 1; i < N; i++) {
S1[i] = __gcd(S1[i - 1], A[i]);
}
S2[N - 1] = A[N - 1];
for (ll i = N - 2; i >= 0; i--) {
S2[i] = __gcd(S2[i + 1], A[i]);
}
ll ans = S1[N - 1];
ans = max(ans, S2[1]);
ans = max(ans, S1[N - 2]);
for (ll i = 0; i < N - 2; i++) {
ans = max(ans, __gcd(S1[i], S2[i + 2]));
}
cout << ans << "\n";
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,760 | 874,761 | u061157803 | cpp |
p03061 | #include <bits/stdc++.h>
#define _ << ' ' <<
using namespace std;
using vi = vector<int>;
using ll = long long;
void view(const vector<int> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
int gcd(int m, int n) { return !n ? m : gcd(n, m % n); }
int main() {
int i, j;
int n;
cin >> n;
vi a(n + 2);
a[0] = a[a.size()] = 0;
for (i = 1; i <= n; i++)
cin >> a[i];
vi l = a;
vi r = a;
for (int i = 1; i <= n; ++i)
l[i] = gcd(l[i - 1], l[i]);
for (int i = n; i >= 1; --i)
r[i] = gcd(r[i + 1], r[i]);
int maxCommonDivisor = 0;
for (i = 1; i <= n; i++)
maxCommonDivisor = max(maxCommonDivisor, gcd(l[i - 1], r[i + 1]));
cout << maxCommonDivisor << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _ << ' ' <<
using namespace std;
using vi = vector<int>;
using ll = long long;
void view(const vector<int> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
int gcd(int m, int n) { return !n ? m : gcd(n, m % n); }
int main() {
int i, j;
ll n;
cin >> n;
vi a(n + 2);
a[0] = a[a.size() - 1] = 0;
for (i = 1; i <= n; i++)
cin >> a[i];
vi l = a;
vi r = a;
for (int i = 1; i <= n; ++i)
l[i] = gcd(l[i - 1], l[i]);
for (int i = n; i >= 1; --i)
r[i] = gcd(r[i + 1], r[i]);
int maxCommonDivisor = 0;
for (i = 1; i <= n; i++)
maxCommonDivisor = max(maxCommonDivisor, gcd(l[i - 1], r[i + 1]));
cout << maxCommonDivisor << endl;
return 0;
}
| [
"variable_declaration.type.change",
"assignment.change"
] | 874,764 | 874,765 | u542612766 | cpp |
p03061 | #include <bits/stdc++.h>
#define _ << ' ' <<
using namespace std;
using vi = vector<int>;
using ll = long long;
void view(const vector<int> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
int gcd(int m, int n) { return !n ? m : gcd(n, m % n); }
int main() {
int i, j;
int n;
cin >> n;
vi a(n + 2);
a[0] = a[a.size()] = 0;
for (i = 1; i <= n; i++)
cin >> a[i];
vi l = a;
vi r = a;
for (int i = 1; i <= n; ++i)
l[i] = gcd(l[i - 1], l[i]);
for (int i = n; i >= 1; --i)
r[i] = gcd(r[i + 1], r[i]);
int maxCommonDivisor = 0;
for (i = 1; i <= n; ++i)
maxCommonDivisor = max(maxCommonDivisor, gcd(l[i - 1], r[i + 1]));
cout << maxCommonDivisor << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _ << ' ' <<
using namespace std;
using vi = vector<int>;
using ll = long long;
void view(const vector<int> &v) {
for (const auto &e : v)
cout << e << " ";
cout << endl;
}
int gcd(int m, int n) { return !n ? m : gcd(n, m % n); }
int main() {
int i, j;
ll n;
cin >> n;
vi a(n + 2);
a[0] = a[a.size() - 1] = 0;
for (i = 1; i <= n; i++)
cin >> a[i];
vi l = a;
vi r = a;
for (int i = 1; i <= n; ++i)
l[i] = gcd(l[i - 1], l[i]);
for (int i = n; i >= 1; --i)
r[i] = gcd(r[i + 1], r[i]);
int maxCommonDivisor = 0;
for (i = 1; i <= n; i++)
maxCommonDivisor = max(maxCommonDivisor, gcd(l[i - 1], r[i + 1]));
cout << maxCommonDivisor << endl;
return 0;
}
| [
"variable_declaration.type.change",
"assignment.change"
] | 874,766 | 874,765 | u542612766 | cpp |
p03061 | /*..............................................*\
Author:Kishor Kumar Paroi
Dept:CSE-1703053
email.kishor.josephite@gmail.com
RUET,BANGLADESH
\*---------------------------*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define max(a, b) ((a > b) ? a : b) // finding max
#define min(a, b) ((a < b) ? a : b) // finding min
#define Max(a, b, c) max(a, max(b, c)) // finding max between 3 numbers
#define Min(a, b, c) min(a, min(b, c)) // finding min between 3 numbers
#define Pi acos(-1.0) // defining Pi for mathematical uses
#define Clear(a) memset(a, 0, sizeof(a)) // clearing memory of an array
#define setfalse(a) memset(a, false, sizeof(a)) // setting the array into false
#define settrue(a) memset(a, true, sizeof(a)) // setting the array into true
#define clrstr(a) memset(a, '\0', sizeof(a)) // setting string array to null
#define open freopen("input.txt", "r", stdin) // opening input file
#define close freopen("output.txt", "w", stdout) // opening output file
#define Case(a) printf("Case %d: ", a) // printing case number
#define caseh(a) printf("Case #%d: ", a) // printing case number having '#'
#define getcase(a) scanf("%d", &a) // scanning case number
#define caseloop(a, b) for (a = 1; a <= b; a++) // making case loop
#define EPS 1e-9 // small value for avoiding preccesion error
#define LL long long // long long short form
#define fori(i, n) for (int i = 1; i <= n; ++i)
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define error(x) cout << #x << " " << x << endl
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define vi vector<int> v
// const int N=100*1000;
// const int mod=1e9+7;
//# define int min3(int a,int b,int c){return min(a,min(b,c));}
//#define int max3(int a,int b,int c){return max(a,max(b,c));}
//#define int min4(int a,int b,int c,int d){return min(min(a,b),min(c,d));}
//#define int max4(int a,int b,int c,int d){return max(max(a,b),max(c,d));}
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, i, j;
cin >> n;
vi(n);
for (i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
for (i = v[1]; i > 0; i--) {
int x = 0;
for (j = 0; j < n; j++) {
if (v[j] % i != 0)
x++;
}
if (x < 2)
cout << i << endl;
break;
}
return 0;
}
| /*..............................................*\
Author:Kishor Kumar Paroi
Dept:CSE-1703053
email.kishor.josephite@gmail.com
RUET,BANGLADESH
\*---------------------------*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define max(a, b) ((a > b) ? a : b) // finding max
#define min(a, b) ((a < b) ? a : b) // finding min
#define Max(a, b, c) max(a, max(b, c)) // finding max between 3 numbers
#define Min(a, b, c) min(a, min(b, c)) // finding min between 3 numbers
#define Pi acos(-1.0) // defining Pi for mathematical uses
#define Clear(a) memset(a, 0, sizeof(a)) // clearing memory of an array
#define setfalse(a) memset(a, false, sizeof(a)) // setting the array into false
#define settrue(a) memset(a, true, sizeof(a)) // setting the array into true
#define clrstr(a) memset(a, '\0', sizeof(a)) // setting string array to null
#define open freopen("input.txt", "r", stdin) // opening input file
#define close freopen("output.txt", "w", stdout) // opening output file
#define Case(a) printf("Case %d: ", a) // printing case number
#define caseh(a) printf("Case #%d: ", a) // printing case number having '#'
#define getcase(a) scanf("%d", &a) // scanning case number
#define caseloop(a, b) for (a = 1; a <= b; a++) // making case loop
#define EPS 1e-9 // small value for avoiding preccesion error
#define LL long long // long long short form
#define fori(i, n) for (int i = 1; i <= n; ++i)
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define error(x) cout << #x << " " << x << endl
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define vi vector<int> v
// const int N=100*1000;
// const int mod=1e9+7;
//# define int min3(int a,int b,int c){return min(a,min(b,c));}
//#define int max3(int a,int b,int c){return max(a,max(b,c));}
//#define int min4(int a,int b,int c,int d){return min(min(a,b),min(c,d));}
//#define int max4(int a,int b,int c,int d){return max(max(a,b),max(c,d));}
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, i, j;
cin >> n;
vi(n);
for (i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
for (i = v[1]; i > 0; i--) {
int x = 0;
for (j = 0; j < n; j++) {
if (v[j] % i != 0)
x++;
}
if (x < 2) {
cout << i << endl;
break;
}
}
return 0;
}
| [] | 874,767 | 874,768 | u031686335 | cpp |
p03061 | /*..............................................*\
Author:Kishor Kumar Paroi
Dept:CSE-1703053
email.kishor.josephite@gmail.com
RUET,BANGLADESH
\*---------------------------*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define max(a, b) ((a > b) ? a : b) // finding max
#define min(a, b) ((a < b) ? a : b) // finding min
#define Max(a, b, c) max(a, max(b, c)) // finding max between 3 numbers
#define Min(a, b, c) min(a, min(b, c)) // finding min between 3 numbers
#define Pi acos(-1.0) // defining Pi for mathematical uses
#define Clear(a) memset(a, 0, sizeof(a)) // clearing memory of an array
#define setfalse(a) memset(a, false, sizeof(a)) // setting the array into false
#define settrue(a) memset(a, true, sizeof(a)) // setting the array into true
#define clrstr(a) memset(a, '\0', sizeof(a)) // setting string array to null
#define open freopen("input.txt", "r", stdin) // opening input file
#define close freopen("output.txt", "w", stdout) // opening output file
#define Case(a) printf("Case %d: ", a) // printing case number
#define caseh(a) printf("Case #%d: ", a) // printing case number having '#'
#define getcase(a) scanf("%d", &a) // scanning case number
#define caseloop(a, b) for (a = 1; a <= b; a++) // making case loop
#define EPS 1e-9 // small value for avoiding preccesion error
#define LL long long // long long short form
#define fori(i, n) for (int i = 1; i <= n; ++i)
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define error(x) cout << #x << " " << x << endl
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define vi vector<int> v
// const int N=100*1000;
// const int mod=1e9+7;
//# define int min3(int a,int b,int c){return min(a,min(b,c));}
//#define int max3(int a,int b,int c){return max(a,max(b,c));}
//#define int min4(int a,int b,int c,int d){return min(min(a,b),min(c,d));}
//#define int max4(int a,int b,int c,int d){return max(max(a,b),max(c,d));}
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, i, j;
cin >> n;
vi(n);
for (i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
for (i = v[2]; i > 0; i--) {
int x = 0;
for (j = 0; j < n; j++) {
if (v[j] % i != 0)
x++;
}
if (x < 2)
cout << i << endl;
break;
}
return 0;
}
| /*..............................................*\
Author:Kishor Kumar Paroi
Dept:CSE-1703053
email.kishor.josephite@gmail.com
RUET,BANGLADESH
\*---------------------------*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define max(a, b) ((a > b) ? a : b) // finding max
#define min(a, b) ((a < b) ? a : b) // finding min
#define Max(a, b, c) max(a, max(b, c)) // finding max between 3 numbers
#define Min(a, b, c) min(a, min(b, c)) // finding min between 3 numbers
#define Pi acos(-1.0) // defining Pi for mathematical uses
#define Clear(a) memset(a, 0, sizeof(a)) // clearing memory of an array
#define setfalse(a) memset(a, false, sizeof(a)) // setting the array into false
#define settrue(a) memset(a, true, sizeof(a)) // setting the array into true
#define clrstr(a) memset(a, '\0', sizeof(a)) // setting string array to null
#define open freopen("input.txt", "r", stdin) // opening input file
#define close freopen("output.txt", "w", stdout) // opening output file
#define Case(a) printf("Case %d: ", a) // printing case number
#define caseh(a) printf("Case #%d: ", a) // printing case number having '#'
#define getcase(a) scanf("%d", &a) // scanning case number
#define caseloop(a, b) for (a = 1; a <= b; a++) // making case loop
#define EPS 1e-9 // small value for avoiding preccesion error
#define LL long long // long long short form
#define fori(i, n) for (int i = 1; i <= n; ++i)
#define forn(i, n) for (int i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define error(x) cout << #x << " " << x << endl
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define vi vector<int> v
// const int N=100*1000;
// const int mod=1e9+7;
//# define int min3(int a,int b,int c){return min(a,min(b,c));}
//#define int max3(int a,int b,int c){return max(a,max(b,c));}
//#define int min4(int a,int b,int c,int d){return min(min(a,b),min(c,d));}
//#define int max4(int a,int b,int c,int d){return max(max(a,b),max(c,d));}
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, i, j;
cin >> n;
vi(n);
for (i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
for (i = v[1]; i > 0; i--) {
int x = 0;
for (j = 0; j < n; j++) {
if (v[j] % i != 0)
x++;
}
if (x < 2) {
cout << i << endl;
break;
}
}
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 874,769 | 874,768 | u031686335 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y % x == 0)
return x;
else
return gcd(y % x, x);
}
int main() {
int n, m, k;
m = 0;
cin >> n;
vector<int> li(n), l(n + 1, 0), r(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> li[i];
for (int i = 0; i < n; i++) {
l.at(i + 1) = gcd(li[i], l[i]);
r.at(n - i - 1) = gcd(li[n - 1 - i], r[n - i]);
}
for (int i = 0; i < n; i++) {
k = gcd(l[i], r[i + 1]);
if (k > m)
m = k;
}
cout << m << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0)
return y;
else
return gcd(y % x, x);
}
int main() {
int n, m, k;
m = 0;
cin >> n;
vector<int> li(n), l(n + 1, 0), r(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> li[i];
for (int i = 0; i < n; i++) {
l.at(i + 1) = gcd(li[i], l[i]);
r.at(n - i - 1) = gcd(li[n - 1 - i], r[n - i]);
}
for (int i = 0; i < n; i++) {
k = gcd(l[i], r[i + 1]);
if (k > m)
m = k;
}
cout << m << endl;
return 0;
} | [
"expression.operation.binary.remove",
"identifier.change",
"function.return_value.change"
] | 874,772 | 874,773 | u618107373 | cpp |
p03061 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define CO(x) cout << (x) << endl;
#define COSP(x) cout << (x) << " ";
#define DICIMAL(x) fixed << setprecision(x)
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
const int INF = 1e9;
const ll LINF = 1e18;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vi A;
vi revA;
REP(i, N) {
int n;
cin >> n;
A.push_back(n);
revA.push_back(n);
}
reverse(ALL(revA)); // for making dpr[]
// making left_GCD and right_GCD
vi dpl(N, 0);
dpl[0] = -1, dpl[1] = A[0];
vi dpr(N, 0);
dpr[0] = -1, dpr[1] = revA[0];
REP(i, N) {
if (i > 1) {
dpl[i] = gcd(dpl[i - 1], A[i - 1]);
dpr[i] = gcd(dpr[i - 1], revA[i - 1]);
}
}
reverse(ALL(dpr));
int ans = 0;
REP(i, N) {
if (i == 0)
ans = max(ans, dpr[i]);
else if (i == 0)
ans = max(ans, dpl[i]);
else
ans = max(ans, gcd(dpl[i], dpr[i]));
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define CO(x) cout << (x) << endl;
#define COSP(x) cout << (x) << " ";
#define DICIMAL(x) fixed << setprecision(x)
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
const int INF = 1e9;
const ll LINF = 1e18;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vi A;
vi revA;
REP(i, N) {
int n;
cin >> n;
A.push_back(n);
revA.push_back(n);
}
reverse(ALL(revA)); // for making dpr[]
// making left_GCD and right_GCD
vi dpl(N, 0);
dpl[0] = -1, dpl[1] = A[0];
vi dpr(N, 0);
dpr[0] = -1, dpr[1] = revA[0];
REP(i, N) {
if (i > 1) {
dpl[i] = gcd(dpl[i - 1], A[i - 1]);
dpr[i] = gcd(dpr[i - 1], revA[i - 1]);
}
}
reverse(ALL(dpr));
int ans = 0;
REP(i, N) {
if (i == 0)
ans = max(ans, dpr[i]);
else if (i == N - 1)
ans = max(ans, dpl[i]);
else
ans = max(ans, gcd(dpl[i], dpr[i]));
}
cout << ans << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 874,774 | 874,775 | u625729943 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int maxN = 1e5 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
ll sq(ll x) { return (x * x) % MOD; }
ll modP(ll a, ll b) {
return (!b ? 1 : (sq(modP(a, b / 2)) * (b % 2 ? a : 1)) % MOD);
}
ll a[maxN], l[maxN], r[maxN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
r[n] = 0;
for (int i = n; i > 0; i--) {
r[i - 1] = gcd(r[i], a[i - 1]);
}
ll mx = r[0];
for (int i = 1; i < n; i++) {
mx = max(mx, gcd(l[i - 1], r[i]));
}
cout << mx << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int maxN = 1e5 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
ll sq(ll x) { return (x * x) % MOD; }
ll modP(ll a, ll b) {
return (!b ? 1 : (sq(modP(a, b / 2)) * (b % 2 ? a : 1)) % MOD);
}
ll a[maxN], l[maxN], r[maxN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
r[n] = 0;
for (int i = n; i > 0; i--) {
r[i - 1] = gcd(r[i], a[i - 1]);
}
ll mx = r[1];
for (int i = 1; i < n; i++) {
mx = max(mx, gcd(l[i], r[i + 1]));
}
cout << mx << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove",
"assignment.change"
] | 874,781 | 874,782 | u032789819 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int maxN = 1e5 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
ll sq(ll x) { return (x * x) % MOD; }
ll modP(ll a, ll b) {
return (!b ? 1 : (sq(modP(a, b / 2)) * (b % 2 ? a : 1)) % MOD);
}
ll a[maxN], l[maxN], r[maxN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
r[n] = 0;
for (int i = n; i > 0; i--) {
r[i - 1] = gcd(r[i], a[i - 1]);
}
ll mx = r[1];
for (int i = 1; i < n; i++) {
mx = max(mx, gcd(l[i - 1], r[i]));
}
cout << mx << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int maxN = 1e5 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
ll sq(ll x) { return (x * x) % MOD; }
ll modP(ll a, ll b) {
return (!b ? 1 : (sq(modP(a, b / 2)) * (b % 2 ? a : 1)) % MOD);
}
ll a[maxN], l[maxN], r[maxN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
}
r[n] = 0;
for (int i = n; i > 0; i--) {
r[i - 1] = gcd(r[i], a[i - 1]);
}
ll mx = r[1];
for (int i = 1; i < n; i++) {
mx = max(mx, gcd(l[i], r[i + 1]));
}
cout << mx << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 874,783 | 874,782 | u032789819 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n + 1];
int l[n + 2], r[n + 2];
for (i = 1; i <= n; i++)
cin >> a[i];
l[0] = 0;
r[n + 1] = 0;
for (i = 1; i <= n; i++)
l[i] = __gcd(l[i - 1], a[i]);
for (i = n; i >= 1; i--)
r[i] = __gcd(r[i + 1], a[i]);
int mx = 0;
for (i = 1; i < n; i++) {
mx = max(mx, __gcd(l[i - 1], r[i + 1]));
}
cout << mx;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n + 1];
int l[n + 2], r[n + 2];
for (i = 1; i <= n; i++)
cin >> a[i];
l[0] = 0;
r[n + 1] = 0;
for (i = 1; i <= n; i++)
l[i] = __gcd(l[i - 1], a[i]);
for (i = n; i >= 1; i--)
r[i] = __gcd(r[i + 1], a[i]);
int mx = 0;
for (i = 1; i <= n; i++) {
mx = max(mx, __gcd(l[i - 1], r[i + 1]));
}
cout << mx;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,786 | 874,787 | u228402731 | cpp |
p03061 | #include <bits/stdc++.h>
#define f(a, n) for (ll i = a; i < n; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define all(v) v.begin(), v.end()
using namespace std;
const ll mod = (1e+9) + 7;
const ll size = 2e5 + 9;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll power(ll a, ll b, ll m = mod) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % m;
b = b >> 1;
a = (a * a) % m;
}
return res;
}
void solve() {
ll n;
cin >> n;
ll a[n + 1];
f(1, n + 1) cin >> a[i];
ll p[n + 2], s[n + 2];
p[1] = a[1];
for (ll i = 2; i <= n; i++)
p[i] = gcd(p[i - 1], a[i]);
s[n] = a[n];
for (ll i = n - 1; i > 0; i--)
s[i] = gcd(s[i + 1], a[i]);
p[0] = s[n + 1] = 0;
ll ans = LLONG_MIN;
for (ll i = 1; i < n; i++)
ans = max(ans, gcd(p[i - 1], s[i + 1]));
cout << ans << endl;
}
int main() {
#ifdef JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
clock_t beg = clock();
solve();
clock_t end = clock();
fprintf(stderr, "%.3f sec, Copyright %c 2019 Skyscraper. \n",
double(end - beg) / CLOCKS_PER_SEC, 184);
return 0;
} | #include <bits/stdc++.h>
#define f(a, n) for (ll i = a; i < n; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define all(v) v.begin(), v.end()
using namespace std;
const ll mod = (1e+9) + 7;
const ll size = 2e5 + 9;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll power(ll a, ll b, ll m = mod) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % m;
b = b >> 1;
a = (a * a) % m;
}
return res;
}
void solve() {
ll n;
cin >> n;
ll a[n + 1];
f(1, n + 1) cin >> a[i];
ll p[n + 2], s[n + 2];
p[1] = a[1];
for (ll i = 2; i <= n; i++)
p[i] = gcd(p[i - 1], a[i]);
s[n] = a[n];
for (ll i = n - 1; i > 0; i--)
s[i] = gcd(s[i + 1], a[i]);
p[0] = s[n + 1] = 0;
ll ans = LLONG_MIN;
for (ll i = 1; i <= n; i++)
ans = max(ans, gcd(p[i - 1], s[i + 1]));
cout << ans << endl;
}
int main() {
#ifdef JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
clock_t beg = clock();
solve();
clock_t end = clock();
fprintf(stderr, "%.3f sec, Copyright %c 2019 Skyscraper. \n",
double(end - beg) / CLOCKS_PER_SEC, 184);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,788 | 874,789 | u865644664 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { //整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_back(x / i);
} //約数はペアを持つことを利用
}
}
sort(divisor.begin(), divisor.end());
// divisor.push_back(x);
return divisor;
}
int main() {
ll n, ans = 1;
cin >> n;
vector<ll> v(n), a, b;
for (ll i = 0; i < n; i++) {
cin >> v.at(i);
}
a = finddivisor(v.at(0));
b = finddivisor(v.at(1));
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % a.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, a.at(i));
}
}
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % b.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, b.at(i));
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { //整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_back(x / i);
} //約数はペアを持つことを利用（6の約数が2と分かれば、6/2も約数と分かる)
}
}
sort(divisor.begin(), divisor.end());
return divisor;
}
int main() {
ll n, ans = 1;
cin >> n;
vector<ll> v(n), a, b;
for (ll i = 0; i < n; i++) {
cin >> v.at(i);
}
a = finddivisor(v.at(0));
b = finddivisor(v.at(1));
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % a.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, a.at(i));
}
}
for (int i = 0; i < b.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % b.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, b.at(i));
}
}
cout << ans << endl;
}
/*別解
ある１つの項（A1,とかANとか)を除いたとき、残りの全ての項のgcdの最大値を求める（n通りのうちの最大値)
→答えは必ず,除いた項以外のすべての項の、約数である（それはそう）
なので適当に二つ項を持ってきて、その二つの項の約数でA1からANを割ったとき、
あまりが０にならない項が1つ以下存在する（その数を約数に持たない数が1つ存在するor存在しない)ような約数のmaxを求める
（あまりが０にならないということは、その数で割れないということ）
（余りが0にならない項が１つ存在するなら、その項を除けばよいので、1つまでならセーフ）
必要条件から絞るパターン*/ | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,790 | 874,791 | u317711717 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { //整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_back(x / i);
} //約数はペアを持つことを利用
}
}
sort(divisor.begin(), divisor.end());
// divisor.push_back(x);
return divisor;
}
int main() {
ll n, ans = 1;
cin >> n;
vector<ll> v(n), a, b;
for (ll i = 0; i < n; i++) {
cin >> v.at(i);
}
a = finddivisor(v.at(0));
b = finddivisor(v.at(1));
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % a.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, a.at(i));
}
}
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % b.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, b.at(i));
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
vector<ll> finddivisor(ll x) { //整数xの約数が入ったvectorを返すよ(xを含む)
vector<ll> divisor;
for (ll i = 1; (i * i) <= x; i++) {
if (x % i == 0) {
divisor.push_back(i);
if (i * i != x) {
divisor.push_back(x / i);
} //約数はペアを持つことを利用
}
}
sort(divisor.begin(), divisor.end());
// divisor.push_back(x);
return divisor;
}
int main() {
ll n, ans = 1;
cin >> n;
vector<ll> v(n), a, b;
for (ll i = 0; i < n; i++) {
cin >> v.at(i);
}
a = finddivisor(v.at(0));
b = finddivisor(v.at(1));
for (int i = 0; i < a.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % a.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, a.at(i));
}
}
for (int i = 0; i < b.size(); i++) {
ll cnt = 0;
for (int j = 0; j < n; j++) {
if (v.at(j) % b.at(i) != 0) {
cnt++;
}
if (cnt >= 2) {
break;
}
}
if (cnt < 2) {
ans = max(ans, b.at(i));
}
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 874,790 | 874,792 | u317711717 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
ll N, m = 1;
cin >> N;
vector<ll> A(N);
vector<ll> forward(N), back(N), ans(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
if (N == 2) {
cout << max(A.at(0), A.at(1)) << endl;
return 0;
}
forward.at(0) = A.at(0);
back.at(0) = A.at(N - 1);
for (int i = 1; i < N; i++) {
forward.at(i) = gcd(forward.at(i - 1), A.at(i));
back.at(i) = gcd(back.at(i - 1), A.at(N - i - 1));
}
ans.at(0) = back.at(N - 1);
ans.at(N - 1) = forward.at(N - 1);
for (int i = 1; i < N - 1; i++) {
ans.at(i) = gcd(forward.at(i - 1), back.at(N - i - 2));
}
sort(ans.begin(), ans.end());
cout << ans.at(N - 1);
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
ll N, m = 1;
cin >> N;
vector<ll> A(N);
vector<ll> forward(N), back(N), ans(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
if (N == 2) {
cout << max(A.at(0), A.at(1)) << endl;
return 0;
}
forward.at(0) = A.at(0);
back.at(0) = A.at(N - 1);
for (int i = 1; i < N; i++) {
forward.at(i) = gcd(forward.at(i - 1), A.at(i));
back.at(i) = gcd(back.at(i - 1), A.at(N - i - 1));
}
ans.at(0) = back.at(N - 2);
ans.at(N - 1) = forward.at(N - 2);
for (int i = 1; i < N - 1; i++) {
ans.at(i) = gcd(forward.at(i - 1), back.at(N - i - 2));
}
sort(ans.begin(), ans.end());
cout << ans.at(N - 1);
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,803 | 874,804 | u889812821 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
ll N, m = 1;
cin >> N;
vector<ll> A(N);
vector<ll> forward(N), back(N), ans(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
if (N == 2) {
cout << max(A.at(0), A.at(1)) << endl;
return 0;
}
forward.at(0) = A.at(0);
back.at(0) = A.at(N - 1);
for (int i = 1; i < N; i++) {
forward.at(i) = gcd(forward.at(i - 1), A.at(i));
back.at(i) = gcd(back.at(i - 1), A.at(N - i - 1));
}
ans.at(0) = back.at(1);
ans.at(N - 1) = forward.at(N - 2);
for (int i = 1; i < N - 1; i++) {
ans.at(i) = gcd(forward.at(i - 1), back.at(N - i - 2));
}
sort(ans.begin(), ans.end());
cout << ans.at(N - 1);
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(ll a, ll b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
ll N, m = 1;
cin >> N;
vector<ll> A(N);
vector<ll> forward(N), back(N), ans(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
if (N == 2) {
cout << max(A.at(0), A.at(1)) << endl;
return 0;
}
forward.at(0) = A.at(0);
back.at(0) = A.at(N - 1);
for (int i = 1; i < N; i++) {
forward.at(i) = gcd(forward.at(i - 1), A.at(i));
back.at(i) = gcd(back.at(i - 1), A.at(N - i - 1));
}
ans.at(0) = back.at(N - 2);
ans.at(N - 1) = forward.at(N - 2);
for (int i = 1; i < N - 1; i++) {
ans.at(i) = gcd(forward.at(i - 1), back.at(N - i - 2));
}
sort(ans.begin(), ans.end());
cout << ans.at(N - 1);
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.change"
] | 874,805 | 874,804 | u889812821 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, j, k) for (int i = (int)(j); i < (int)(k); ++i)
#define ROF(i, j, k) for (int i = (int)(j); i >= (int)(k); --i)
#define FORLL(i, n, m) for (long long i = n; i < (long long)(m); i++)
#define SORT(v, n) sort(v, v + n)
#define REVERSE(v) reverse((v).begin(), (v).end())
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
typedef pair<int, int> P;
ll ADD(ll x, ll y) { return (x + y) % MOD; }
ll SUB(ll x, ll y) { return (x - y + MOD) % MOD; }
ll MUL(ll x, ll y) { return x * y % MOD; }
ll POW(ll x, ll e) {
ll v = 1;
for (; e; x = MUL(x, x), e >>= 1)
if (e & 1)
v = MUL(v, x);
return v;
}
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/
return MUL(x, POW(y, MOD - 2));
}
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 _gcd(unsigned a, unsigned b) {
if (a < b)
_gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int pre[100005], suf[100005];
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
// sort(a.begin(), a.end());
pre[0] = a[0];
FOR(i, 1, n + 1) pre[i] = __gcd(pre[i - 1], a[i]);
suf[n - 1] = a[n - 1];
ROF(i, n - 2, 0) suf[i] = __gcd(suf[i + 1], suf[i]);
int ans = 0;
REP(i, n) ans = max(ans, __gcd(pre[i - 1], suf[i + 1]));
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, j, k) for (int i = (int)(j); i < (int)(k); ++i)
#define ROF(i, j, k) for (int i = (int)(j); i >= (int)(k); --i)
#define FORLL(i, n, m) for (long long i = n; i < (long long)(m); i++)
#define SORT(v, n) sort(v, v + n)
#define REVERSE(v) reverse((v).begin(), (v).end())
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
typedef pair<int, int> P;
ll ADD(ll x, ll y) { return (x + y) % MOD; }
ll SUB(ll x, ll y) { return (x - y + MOD) % MOD; }
ll MUL(ll x, ll y) { return x * y % MOD; }
ll POW(ll x, ll e) {
ll v = 1;
for (; e; x = MUL(x, x), e >>= 1)
if (e & 1)
v = MUL(v, x);
return v;
}
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/
return MUL(x, POW(y, MOD - 2));
}
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 _gcd(unsigned a, unsigned b) {
if (a < b)
_gcd(b, a);
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int pre[100005], suf[100005];
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
// sort(a.begin(), a.end());
pre[0] = a[0];
FOR(i, 1, n + 1) pre[i] = __gcd(pre[i - 1], a[i]);
suf[n - 1] = a[n - 1];
ROF(i, n - 2, 0) suf[i] = __gcd(suf[i + 1], a[i]);
int ans = 0;
REP(i, n) ans = max(ans, __gcd(pre[i - 1], suf[i + 1]));
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,826 | 874,827 | u783861517 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b)
return gcd(b, a);
int r = a % b;
if (r == 0)
return b;
return gcd(b, r);
}
int main(void) {
int N;
cin >> N;
vector<int> A(N), left(N - 1), right(N - 1), total(N);
for (auto &i : A)
cin >> i;
left[0] = A[0];
right[N - 2] = A[N - 1];
int N2 = N - 2;
for (int i = 1; i <= N2; i++) {
left[i] = gcd(left[i - 1], A[i]);
right[N2 - i] = gcd(right[N2 - i + 1], A[N2 - i + 1]);
}
total[0] = right[0];
total[N - 1] = left[N2];
for (int i = 1; i <= N2; i++)
total[i] = gcd(left[i - 1], right[N2 - i + 1]);
for (auto i : left)
cerr << i << " ";
cerr << endl;
for (auto i : right)
cerr << i << " ";
cerr << endl;
for (auto i : total)
cerr << i << " ";
cerr << endl;
int ans = 0;
for (auto i : total)
ans = max(ans, i);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a < b)
return gcd(b, a);
int r = a % b;
if (r == 0)
return b;
return gcd(b, r);
}
int main(void) {
int N;
cin >> N;
vector<int> A(N), left(N - 1), right(N - 1), total(N);
for (auto &i : A)
cin >> i;
left[0] = A[0];
right[N - 2] = A[N - 1];
int N2 = N - 2;
for (int i = 1; i <= N2; i++) {
left[i] = gcd(left[i - 1], A[i]);
right[N2 - i] = gcd(right[N2 - i + 1], A[N2 - i + 1]);
}
total[0] = right[0];
total[N - 1] = left[N2];
for (int i = 1; i <= N2; i++)
total[i] = gcd(left[i - 1], right[i]);
for (auto i : left)
cerr << i << " ";
cerr << endl;
for (auto i : right)
cerr << i << " ";
cerr << endl;
for (auto i : total)
cerr << i << " ";
cerr << endl;
int ans = 0;
for (auto i : total)
ans = max(ans, i);
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 874,828 | 874,829 | u330913290 | cpp |
p03061 | /*input
15
1 2 1 1 3 2 2 2 3 3 3 1 1 2 2
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define pb push_back
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
int mod = 1000000007;
#define PI 3.14159265
#define endl '\n'
#define debug(x) cout << #x << " = " << x << endl;
#define MAX 100001
template <typename T> T GCD(T a, T b) {
ll t;
while (a) {
t = a;
a = b % a;
b = t;
}
return b;
}
template <typename T> string toString(T a) { return to_string(a); }
template <typename T> void toInt(string s, T &x) {
stringstream str(s);
str >> x;
}
inline int add(int x, int y) {
x += y;
if (x >= mod)
x -= mod;
return x;
}
inline int sub(int x, int y) {
x -= y;
if (x < 0)
x += mod;
return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % mod; }
inline int powr(int a, ll b) {
int x = 1 % mod;
while (b) {
if (b & 1)
x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline int inv(int a) { return powr(a, mod - 2); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int v;
vector<int> vec;
for (int i = 0; i < n; i++) {
cin >> v;
vec.pb(v);
}
int g = 0;
vector<int> f, b;
for (auto it : vec) {
g = __gcd(g, it);
f.pb(g);
}
g = 0;
for (int i = n - 1; i >= 0; i--) {
g = __gcd(g, vec[i]);
b.pb(g);
}
reverse(all(b));
int ans = 1;
for (int i = 0; i < n; i++) {
if (i == 0) {
ans = max(ans, b[i + 1]);
} else if (i == n - 1) {
ans = max(ans, b[i - 1]);
} else {
ans = max(ans, __gcd(f[i - 1], b[i + 1]));
}
}
cout << ans << endl;
return 0;
} | /*input
15
1 2 1 1 3 2 2 2 3 3 3 1 1 2 2
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef long double ld;
#define pb push_back
#define all(c) c.begin(), c.end()
#define allr(c) c.rbegin(), c.rend()
int mod = 1000000007;
#define PI 3.14159265
#define endl '\n'
#define debug(x) cout << #x << " = " << x << endl;
#define MAX 100001
template <typename T> T GCD(T a, T b) {
ll t;
while (a) {
t = a;
a = b % a;
b = t;
}
return b;
}
template <typename T> string toString(T a) { return to_string(a); }
template <typename T> void toInt(string s, T &x) {
stringstream str(s);
str >> x;
}
inline int add(int x, int y) {
x += y;
if (x >= mod)
x -= mod;
return x;
}
inline int sub(int x, int y) {
x -= y;
if (x < 0)
x += mod;
return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % mod; }
inline int powr(int a, ll b) {
int x = 1 % mod;
while (b) {
if (b & 1)
x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline int inv(int a) { return powr(a, mod - 2); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int v;
vector<int> vec;
for (int i = 0; i < n; i++) {
cin >> v;
vec.pb(v);
}
int g = 0;
vector<int> f, b;
for (auto it : vec) {
g = __gcd(g, it);
f.pb(g);
}
g = 0;
for (int i = n - 1; i >= 0; i--) {
g = __gcd(g, vec[i]);
b.pb(g);
}
reverse(all(b));
int ans = 1;
for (int i = 0; i < n; i++) {
if (i == 0) {
ans = max(ans, b[i + 1]);
} else if (i == n - 1) {
ans = max(ans, f[i - 1]);
} else {
ans = max(ans, __gcd(f[i - 1], b[i + 1]));
}
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,832 | 874,833 | u186304815 | cpp |
p03061 | // ABC125 A -
#include <bits/stdc++.h>
using namespace std;
int64_t calc_gdc(int64_t a, int64_t b) {
if (a < b) {
swap(a, b);
}
int64_t r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int64_t n;
#if LOCAL & 1
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
cin >> n;
vector<int64_t> atbl(n);
for (auto &a : atbl) {
cin >> a;
}
#if 1
//外す数を探す
vector<int64_t> tmp(n);
tmp[n - 1] = atbl[n - 1];
for (int i = n - 2; i >= 0; --i) {
tmp[i] = calc_gdc(atbl[i], tmp[i + 1]);
}
vector<int64_t> tmp_st(n);
tmp_st[0] = atbl[0];
for (int i = 1; i < n; ++i) {
tmp_st[i] = calc_gdc(atbl[i], tmp_st[i - 1]);
}
int64_t ans = 0;
for (int skip = 0; skip < n; ++skip) {
int64_t val;
if (skip == 0) {
val = tmp[1];
} else if (skip == n - 1) {
val = tmp_st[n - 1];
} else {
int64_t ll = tmp_st[skip - 1];
int64_t rr = tmp[skip + 1];
val = calc_gdc(ll, rr);
}
ans = max(ans, val);
}
cout << ans << endl;
#else
// tleする
int64_t ans = 0;
for (int skip = 0; skip < n; ++skip) {
bool flag = false;
int64_t val = -1;
for (int i = 0; i < n; ++i) {
if (i == skip)
continue;
if (val < 0) {
val = atbl[i];
} else {
val = calc_gdc(val, atbl[i]);
}
}
ans = max(ans, val);
}
cout << ans << endl;
#endif
return 0;
} | // ABC125 A -
#include <bits/stdc++.h>
using namespace std;
int64_t calc_gdc(int64_t a, int64_t b) {
if (a < b) {
swap(a, b);
}
int64_t r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int64_t n;
#if LOCAL & 0
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
cin >> n;
vector<int64_t> atbl(n);
for (auto &a : atbl) {
cin >> a;
}
#if 1
//外す数を探す
vector<int64_t> tmp(n);
tmp[n - 1] = atbl[n - 1];
for (int i = n - 2; i >= 0; --i) {
tmp[i] = calc_gdc(atbl[i], tmp[i + 1]);
}
vector<int64_t> tmp_st(n);
tmp_st[0] = atbl[0];
for (int i = 1; i < n; ++i) {
tmp_st[i] = calc_gdc(atbl[i], tmp_st[i - 1]);
}
int64_t ans = 0;
for (int skip = 0; skip < n; ++skip) {
int64_t val;
if (skip == 0) {
val = tmp[1];
} else if (skip == n - 1) {
val = tmp_st[n - 2];
} else {
int64_t ll = tmp_st[skip - 1];
int64_t rr = tmp[skip + 1];
val = calc_gdc(ll, rr);
}
ans = max(ans, val);
}
cout << ans << endl;
#else
// tleする
int64_t ans = 0;
for (int skip = 0; skip < n; ++skip) {
bool flag = false;
int64_t val = -1;
for (int i = 0; i < n; ++i) {
if (i == skip)
continue;
if (val < 0) {
val = atbl[i];
} else {
val = calc_gdc(val, atbl[i]);
}
}
ans = max(ans, val);
}
cout << ans << endl;
#endif
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 874,836 | 874,837 | u182321487 | cpp |
p03061 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define c(P) cout << P << "\n"
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, a, n) for (ll i = a; i < n; i++)
#define frr(i, a, n) for (ll i = n - 1; i >= a; i--)
const ll N = 500005;
const ll mod = 1e9 + 7;
using namespace std;
void solve() {
// string s;
ll n, m, k, x = 0, y = 0, c = 0, q, ans = 0;
cin >> n;
ll a[n];
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
ll arr[n], b[n];
arr[0] = a[0];
b[n - 1] = a[n - 1];
for (int i = 1; i < n; ++i) {
arr[i] = __gcd(arr[i - 1], a[i]);
b[n - i - 1] = __gcd(b[n - i], a[n - i - 1]);
}
ans = max(arr[n - 1], b[1]);
for (int i = 1; i < n - 1; ++i) {
x = __gcd(arr[i - 1], b[i + 1]);
ans = max(x, ans);
}
cout << ans << " ";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
// cin>>T;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define c(P) cout << P << "\n"
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define F first
#define S second
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define fr(i, a, n) for (ll i = a; i < n; i++)
#define frr(i, a, n) for (ll i = n - 1; i >= a; i--)
const ll N = 500005;
const ll mod = 1e9 + 7;
using namespace std;
void solve() {
// string s;
ll n, m, k, x = 0, y = 0, c = 0, q, ans = 0;
cin >> n;
ll a[n];
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
ll arr[n], b[n];
arr[0] = a[0];
b[n - 1] = a[n - 1];
for (int i = 1; i < n; ++i) {
arr[i] = __gcd(arr[i - 1], a[i]);
b[n - i - 1] = __gcd(b[n - i], a[n - i - 1]);
}
ans = max(arr[n - 2], b[1]);
for (int i = 1; i < n - 1; ++i) {
x = __gcd(arr[i - 1], b[i + 1]);
ans = max(x, ans);
}
cout << ans << " ";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll T = 1;
// cin>>T;
while (T--) {
solve();
}
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,854 | 874,855 | u305721160 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 100000;
ll gcd(ll u, ll v);
ll pref[MAXN];
ll suff[MAXN];
int main() {
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> arr(N);
for (int i = 0; i < N; ++i) {
cin >> arr[i];
if (i == 0) {
pref[i] = arr[i];
} else {
pref[i] = gcd(pref[i - 1], arr[i]);
}
}
for (int i = N - 1; i >= 0; --i) {
if (i == N - 1)
suff[i] = arr[i];
else
suff[i] = gcd(suff[i + 1], arr[i]);
}
ll ans = 0;
for (int i = 1; i < N - 1; ++i) {
ans = max(ans, gcd(suff[i + 1], pref[i - 1]));
}
ans = max(ans, suff[1]);
ans = max(ans, pref[N - 1]);
cout << ans << endl;
return 0;
}
ll gcd(ll u, ll v) {
if (u == v)
return u;
if (u == 0)
return v;
if (v == 0)
return u;
// look for factors of 2
if (~u & 1) // u is even
{
if (v & 1) // v is odd
return gcd(u >> 1, v);
else // both u and v are even
return gcd(u >> 1, v >> 1) << 1;
}
if (~v & 1) // u is odd, v is even
return gcd(u, v >> 1);
// reduce larger argument
if (u > v)
return gcd((u - v) >> 1, v);
return gcd((v - u) >> 1, u);
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 100000;
ll gcd(ll u, ll v);
ll pref[MAXN];
ll suff[MAXN];
int main() {
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> arr(N);
for (int i = 0; i < N; ++i) {
cin >> arr[i];
if (i == 0) {
pref[i] = arr[i];
} else {
pref[i] = gcd(pref[i - 1], arr[i]);
}
}
for (int i = N - 1; i >= 0; --i) {
if (i == N - 1)
suff[i] = arr[i];
else
suff[i] = gcd(suff[i + 1], arr[i]);
}
ll ans = 0;
for (int i = 1; i < N - 1; ++i) {
ans = max(ans, gcd(suff[i + 1], pref[i - 1]));
}
ans = max(ans, suff[1]);
ans = max(ans, pref[N - 2]);
cout << ans << endl;
return 0;
}
ll gcd(ll u, ll v) {
if (u == v)
return u;
if (u == 0)
return v;
if (v == 0)
return u;
// look for factors of 2
if (~u & 1) // u is even
{
if (v & 1) // v is odd
return gcd(u >> 1, v);
else // both u and v are even
return gcd(u >> 1, v >> 1) << 1;
}
if (~v & 1) // u is odd, v is even
return gcd(u, v >> 1);
// reduce larger argument
if (u > v)
return gcd((u - v) >> 1, v);
return gcd((v - u) >> 1, u);
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,856 | 874,857 | u826794194 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i < (n); i++)
#define REP2(i, d, n) for (int i = (d); i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define CLR(a) memset((a), 0, sizeof(a))
#define MCLR(a) memset((a), -1, sizeof(a))
#define RANGE(x, y, maxX, maxY) \
(0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const int DX[] = {1, 0, -1, 0}, DY[] = {0, -1, 0, 1};
LL gcd(LL a, LL b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve(long long N, std::vector<long long> A) {
if (N == 2) {
cout << max(A[0], A[1]) << endl;
return;
}
set<int> use_skip, temp;
use_skip.insert(A[0]);
use_skip.insert(A[1]);
LL all_gcd = gcd(A[0], A[1]);
REP2(i, 2, N) {
temp.insert(all_gcd);
for (auto it = use_skip.begin(); it != use_skip.end(); it++) {
temp.insert(gcd(*it, A[i]));
}
use_skip = temp;
all_gcd = gcd(all_gcd, A[i]);
}
int ans = 0;
for (auto it = use_skip.begin(); it != use_skip.end(); it++) {
ans = max(ans, *it);
}
cout << ans << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, n) for (int i = 1; i < (n); i++)
#define REP2(i, d, n) for (int i = (d); i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define CLR(a) memset((a), 0, sizeof(a))
#define MCLR(a) memset((a), -1, sizeof(a))
#define RANGE(x, y, maxX, maxY) \
(0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const int DX[] = {1, 0, -1, 0}, DY[] = {0, -1, 0, 1};
LL gcd(LL a, LL b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve(long long N, std::vector<long long> A) {
if (N == 2) {
cout << max(A[0], A[1]) << endl;
return;
}
set<int> use_skip, temp;
use_skip.insert(A[0]);
use_skip.insert(A[1]);
LL all_gcd = gcd(A[0], A[1]);
REP2(i, 2, N) {
temp.insert(all_gcd);
for (auto it = use_skip.begin(); it != use_skip.end(); it++) {
temp.insert(gcd(*it, A[i]));
}
use_skip = temp;
temp.clear();
all_gcd = gcd(all_gcd, A[i]);
}
int ans = 0;
for (auto it = use_skip.begin(); it != use_skip.end(); it++) {
ans = max(ans, *it);
}
cout << ans << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
solve(N, std::move(A));
return 0;
}
| [
"call.add"
] | 874,866 | 874,867 | u250996767 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define SZ(x) (x).size()
#define CLR(x) memset(x, 0, sizeof x)
#define pdebug() printf("%d\n", __LINE__)
#define Itype(a) typeof(a.begin())
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define FORO(i, n) REP(i, 0, (int)n - 1)
#define FORI(i, n) REP(i, 1, (int)n)
#define FORIT(i, t) for (Itype(t) i = t.begin(); i != t.end(); i++)
#define eps 1e-6
#define sqr(x) ((x) * (x))
#define dist(_a, _b) sqrt(sqr(_a.A - _b.A) + sqr(_a.B - _b.B))
#define abs(x) (x < 0 ? -x : x)
#define norm(_a) sqrt(sqr(_a.A) + sqr(_a.B))
template <typename T> void getMin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void getMax(T &a, T b) {
if (a < b)
a = b;
}
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
FORO(i, N) { cin >> A[i]; }
int lgcd[N];
int rgcd[N];
lgcd[0] = A[0];
rgcd[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
lgcd[i] = __gcd(lgcd[i - 1], A[i]);
rgcd[N - i - 1] = __gcd(rgcd[N - i], A[N - i - 1]);
}
int ans = max(lgcd[1], rgcd[N - 2]);
for (int i = 1; i < N - 1; i++) {
ans = max(ans, __gcd(lgcd[i - 1], rgcd[i + 1]));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef int Int;
typedef pair<Int, Int> pii;
typedef pair<Int, double> pid;
typedef pair<double, double> pdd;
typedef pair<Int, pii> pip;
typedef pair<double, Int> pdp;
#define A first
#define B second
#define pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define SZ(x) (x).size()
#define CLR(x) memset(x, 0, sizeof x)
#define pdebug() printf("%d\n", __LINE__)
#define Itype(a) typeof(a.begin())
#define REP(i, a, b) for (int i = (a); i <= (b); i++)
#define FORO(i, n) REP(i, 0, (int)n - 1)
#define FORI(i, n) REP(i, 1, (int)n)
#define FORIT(i, t) for (Itype(t) i = t.begin(); i != t.end(); i++)
#define eps 1e-6
#define sqr(x) ((x) * (x))
#define dist(_a, _b) sqrt(sqr(_a.A - _b.A) + sqr(_a.B - _b.B))
#define abs(x) (x < 0 ? -x : x)
#define norm(_a) sqrt(sqr(_a.A) + sqr(_a.B))
template <typename T> void getMin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void getMax(T &a, T b) {
if (a < b)
a = b;
}
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
FORO(i, N) { cin >> A[i]; }
int lgcd[N];
int rgcd[N];
lgcd[0] = A[0];
rgcd[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
lgcd[i] = __gcd(lgcd[i - 1], A[i]);
rgcd[N - i - 1] = __gcd(rgcd[N - i], A[N - i - 1]);
}
int ans = max(rgcd[1], lgcd[N - 2]);
for (int i = 1; i < N - 1; i++) {
ans = max(ans, __gcd(lgcd[i - 1], rgcd[i + 1]));
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 874,870 | 874,871 | u414444658 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int N;
vll A;
ll left_cum[100001], right_cum[100001];
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
left_cum[0] = A[0];
right_cum[N - 1] = A[N - 1];
for (int i = 1; i < N; ++i) {
left_cum[i] = __gcd(left_cum[i - 1], A[i]);
right_cum[N - i - 1] = __gcd(right_cum[N - i], A[N - i - 1]);
}
ll ans = max(left_cum[N - 2], right_cum[1]);
if (N == 2) {
cout << ans << endl;
return 0;
}
for (int i = 1; i < N - 2; ++i) {
ll tmp = __gcd(left_cum[i - 1], right_cum[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int N;
vll A;
ll left_cum[100001], right_cum[100001];
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
left_cum[0] = A[0];
right_cum[N - 1] = A[N - 1];
for (int i = 1; i < N; ++i) {
left_cum[i] = __gcd(left_cum[i - 1], A[i]);
right_cum[N - i - 1] = __gcd(right_cum[N - i], A[N - i - 1]);
}
ll ans = max(left_cum[N - 2], right_cum[1]);
if (N == 2) {
cout << ans << endl;
return 0;
}
for (int i = 1; i < N - 1; ++i) {
ll tmp = __gcd(left_cum[i - 1], right_cum[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,893 | 874,894 | u826487371 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int N;
vll A;
ll left_cum[100001], right_cum[100001];
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
left_cum[0] = A[0];
right_cum[N - 1] = A[N - 1];
for (int i = 1; i < N; ++i) {
left_cum[i] = __gcd(left_cum[i - 1], A[i]);
right_cum[N - i - 1] = __gcd(right_cum[N - i], A[N - i]);
}
ll ans = max(left_cum[N - 2], right_cum[1]);
if (N == 2) {
cout << ans << endl;
return 0;
}
for (int i = 1; i < N - 2; ++i) {
ll tmp = __gcd(left_cum[i - 1], right_cum[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int N;
vll A;
ll left_cum[100001], right_cum[100001];
int main() {
cin >> N;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
left_cum[0] = A[0];
right_cum[N - 1] = A[N - 1];
for (int i = 1; i < N; ++i) {
left_cum[i] = __gcd(left_cum[i - 1], A[i]);
right_cum[N - i - 1] = __gcd(right_cum[N - i], A[N - i - 1]);
}
ll ans = max(left_cum[N - 2], right_cum[1]);
if (N == 2) {
cout << ans << endl;
return 0;
}
for (int i = 1; i < N - 1; ++i) {
ll tmp = __gcd(left_cum[i - 1], right_cum[i + 1]);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"assignment.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 874,895 | 874,894 | u826487371 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<int, int> ii;
int main() {
int N;
cin >> N;
vll A;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
vll LG(N), RG(N);
LG[0] = A[0];
RG[N - 1] = A[N - 1];
for (int i = 0; i < N - 1; ++i) {
LG[i + 1] = __gcd(LG[i], A[i + 1]);
}
for (int i = N - 1; i >= 1; --i) {
RG[i - 1] = __gcd(RG[i], A[i - 1]);
}
ll ans = RG[1];
if (N == 2) {
ans = max(A[0], A[1]);
cout << ans << endl;
return 0;
}
for (int i = 1; i < N - 1; ++i) {
ll tmp = __gcd(LG[i - 1], RG[i + 1]);
ans = max(ans, tmp);
}
ans = max(ans, LG[N - 1]);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef pair<int, int> ii;
int main() {
int N;
cin >> N;
vll A;
for (int i = 0; i < N; ++i) {
ll a;
cin >> a;
A.push_back(a);
}
vll LG(N), RG(N);
LG[0] = A[0];
RG[N - 1] = A[N - 1];
for (int i = 0; i < N - 1; ++i) {
LG[i + 1] = __gcd(LG[i], A[i + 1]);
}
for (int i = N - 1; i >= 1; --i) {
RG[i - 1] = __gcd(RG[i], A[i - 1]);
}
ll ans = RG[1];
if (N == 2) {
ans = max(A[0], A[1]);
cout << ans << endl;
return 0;
}
for (int i = 1; i < N - 1; ++i) {
ll tmp = __gcd(LG[i - 1], RG[i + 1]);
ans = max(ans, tmp);
}
ans = max(ans, LG[N - 2]);
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,896 | 874,897 | u826487371 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
int A[N];
int L[N];
int R[N];
int ans = 0;
L[0] = R[N + 1] = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
L[i] = gcd(L[i - 1], A[i]);
}
for (int i = N; 1 <= i; i--) {
R[i] = gcd(R[i + 1], A[i]);
}
for (int i = 1; i <= N; i++) {
ans = max(ans, gcd(L[i], R[i + 1]));
}
cout << ans << 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[N];
int L[N];
int R[N];
int ans = 0;
L[0] = R[N + 1] = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
L[i] = gcd(L[i - 1], A[i]);
}
for (int i = N; 1 <= i; i--) {
R[i] = gcd(R[i + 1], A[i]);
}
for (int i = 1; i <= N; i++) {
ans = max(ans, gcd(L[i - 1], R[i + 1]));
}
cout << ans << endl;
} | [
"assignment.change"
] | 874,898 | 874,899 | u845882023 | cpp |
p03061 | #include <bits/stdc++.h>
#define w cout
#define e endl
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1] = {}, pre[n + 1] = {}, suff[n + 1] = {};
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = 1; i <= n; i++) {
pre[i] = __gcd(pre[i - 1], arr[i]);
suff[n - i + 1] = __gcd(suff[n - i + 2], arr[n - i + 1]);
}
int ans = 0;
ans = pre[n];
for (int i = 1; i <= n; i++) {
ans = max(ans, __gcd(pre[i - 1], suff[i + 1]));
}
w << ans;
}
| #include <bits/stdc++.h>
#define w cout
#define e endl
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 10] = {}, pre[n + 10] = {}, suff[n + 10] = {};
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
for (int i = 1; i <= n; i++) {
pre[i] = __gcd(pre[i - 1], arr[i]);
suff[n - i + 1] = __gcd(suff[n - i + 2], arr[n - i + 1]);
}
int ans = 0;
ans = pre[n];
for (int i = 1; i <= n; i++) {
ans = max(ans, __gcd(pre[i - 1], suff[i + 1]));
}
w << ans;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 874,905 | 874,906 | u566755496 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define INF 1 << 30
#define MIN_INF (-1)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
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 long long ll;
using namespace std;
typedef pair<int, int> pii;
map<string, vector<ll>> memo;
vector<string> chars = {"A", "G", "C", "T"};
int N;
int mod = 1e+9;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> as(N);
rep(i, N) { cin >> as[i]; }
vector<int> ls(N);
vector<int> rs(N);
ls[0] = as[0];
rep(i, N - 1) { ls[i + 1] = gcd(ls[i], as[i + 1]); }
rs[N] = as[N - 1];
for (int i = N; i > 1; i--) {
rs[i - 1] = gcd(rs[i], as[i - 1]);
}
int ans = 0;
for (int i = 1; i < N - 1; i++) {
int tmp = gcd(ls[i - 1], rs[i + 1]);
ans = max(ans, tmp);
}
ans = max(ans, rs[1]);
ans = max(ans, ls[N - 1]);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define INF 1 << 30
#define MIN_INF (-1)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
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 long long ll;
using namespace std;
typedef pair<int, int> pii;
map<string, vector<ll>> memo;
vector<string> chars = {"A", "G", "C", "T"};
int N;
int mod = 1e+9;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> as(N);
rep(i, N) { cin >> as[i]; }
vector<int> ls(N);
vector<int> rs(N);
ls[0] = as[0];
rep(i, N - 1) { ls[i + 1] = gcd(ls[i], as[i + 1]); }
rs[N - 1] = as[N - 1];
for (int i = N - 1; i > 1; i--) {
rs[i - 1] = gcd(rs[i], as[i - 1]);
}
int ans = 0;
for (int i = 1; i < N - 1; i++) {
int tmp = gcd(ls[i - 1], rs[i + 1]);
ans = max(ans, tmp);
}
ans = max(ans, rs[1]);
ans = max(ans, ls[N - 2]);
cout << ans << endl;
return 0;
}
| [
"assignment.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,911 | 874,912 | u426057057 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> left(n + 1);
vector<int> right(n + 1);
left[0] = 0;
right[n] = 0;
int ans = 0;
for (int i = 1; i <= n; i++)
left[i] = __gcd(left[i - 1], arr[i]);
for (int i = n - 1; i >= 0; i--)
right[i] = __gcd(right[i + 1], arr[i]);
for (int i = 0; i < n; i++)
ans = max(ans, __gcd(left[i], right[i + 1]));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> left(n + 1);
vector<int> right(n + 1);
left[0] = 0;
right[n] = 0;
int ans = 0;
for (int i = 1; i <= n; i++)
left[i] = __gcd(left[i - 1], arr[i - 1]);
for (int i = n - 1; i >= 0; i--)
right[i] = __gcd(right[i + 1], arr[i]);
for (int i = 0; i < n; i++)
ans = max(ans, __gcd(left[i], right[i + 1]));
cout << ans << endl;
} | [
"assignment.change"
] | 874,922 | 874,923 | u253225079 | cpp |
p03061 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
template <typename T> void output(T, int);
int gcd(int a, int b);
int main() {
// source
int n;
cin >> n;
int a[n];
rep(i, n) { cin >> a[i]; }
int l[n];
int r[n];
l[0] = a[0];
r[n - 1] = a[n - 1];
repd(i, 1, n) {
l[i] = gcd(l[i - 1], a[i]);
r[n - 1 - i] = gcd(r[n - 1], a[n - 1 - i]);
}
int ans = r[1];
repd(i, 1, n - 1) { ans = max(ans, gcd(l[i - 1], r[i + 1])); }
ans = max(ans, l[n - 2]);
cout << ans << endl;
return 0;
}
template <typename T> void output(T a, int precision) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
int gcd(int a, int b) {
if (b == 0) {
return a;
}
if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
template <typename T> void output(T, int);
int gcd(int a, int b);
int main() {
// source
int n;
cin >> n;
int a[n];
rep(i, n) { cin >> a[i]; }
int l[n];
int r[n];
l[0] = a[0];
r[n - 1] = a[n - 1];
repd(i, 1, n) {
l[i] = gcd(l[i - 1], a[i]);
r[n - 1 - i] = gcd(r[n - i], a[n - 1 - i]);
}
int ans = r[1];
repd(i, 1, n - 1) { ans = max(ans, gcd(l[i - 1], r[i + 1])); }
ans = max(ans, l[n - 2]);
cout << ans << endl;
return 0;
}
template <typename T> void output(T a, int precision) {
if (precision > 0) {
cout << setprecision(precision) << a << "\n";
} else {
cout << a << "\n";
}
}
int gcd(int a, int b) {
if (b == 0) {
return a;
}
if (a > b) {
return gcd(b, a % b);
} else {
return gcd(a, b % a);
}
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,926 | 874,927 | u030992242 | cpp |
p03061 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--) /// n-1番目からn回
#define REP(i, a, b) for (int i = a; i < b; i++) /// a番目からb回
#define RREP(i, a, b) for (int i = a; i < b; i--)
typedef long long int lld;
typedef vector<lld> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
/// min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
int gcd(int a, int b);
int main() {
int n, ans = 0, tmp = 0;
cin >> n;
vi a(1000000), lef(1000000), ri(1000000);
rep(i, n) cin >> a[i];
tmp = a[0];
lef[0] = tmp;
REP(i, 1, n)
tmp = lef[i] = gcd(tmp, a[i]);
tmp = a[n - 1];
ri[n - 1] = a[n - 1];
rrep(i, n) { tmp = ri[i] = gcd(tmp, a[i]); }
ans = max(lef[n - 1], ri[1]);
// cout<<ans<<endl;
REP(i, 1, n - 1)
ans = max(gcd(lef[i - 1], ri[i + 1]), ans);
/*
cout<<"left"<<endl;
rep(i,n)
cout<<lef[i]<<endl;
puts("");
rep(i,n)
cout<<ri[i]<<endl;
*/
cout << ans << endl;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
} | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--) /// n-1番目からn回
#define REP(i, a, b) for (int i = a; i < b; i++) /// a番目からb回
#define RREP(i, a, b) for (int i = a; i < b; i--)
typedef long long int lld;
typedef vector<lld> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
/// min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
int gcd(int a, int b);
int main() {
int n, ans = 0, tmp = 0;
cin >> n;
vi a(1000000), lef(1000000), ri(1000000);
rep(i, n) cin >> a[i];
tmp = a[0];
lef[0] = tmp;
REP(i, 1, n)
tmp = lef[i] = gcd(tmp, a[i]);
tmp = a[n - 1];
ri[n - 1] = a[n - 1];
rrep(i, n) { tmp = ri[i] = gcd(tmp, a[i]); }
ans = max(lef[n - 2], ri[1]);
// cout<<ans<<endl;
REP(i, 1, n - 1)
ans = max(gcd(lef[i - 1], ri[i + 1]), ans);
/*
cout<<"left"<<endl;
rep(i,n)
cout<<lef[i]<<endl;
puts("");
rep(i,n)
cout<<ri[i]<<endl;
*/
cout << ans << endl;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,928 | 874,929 | u696415377 | cpp |
p03061 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--) /// n-1番目からn回
#define REP(i, a, b) for (int i = a; i < b; i++) /// a番目からb回
#define RREP(i, a, b) for (int i = a; i < b; i--)
typedef long long int lld;
typedef vector<lld> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
/// min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
int gcd(int a, int b);
int main() {
int n, ans = 0, tmp = 0;
cin >> n;
vi a(1000000), lef(1000000), ri(1000000);
rep(i, n) cin >> a[i];
tmp = a[0];
lef[0] = tmp;
REP(i, 1, n)
tmp = lef[i] = gcd(tmp, a[i]);
tmp = a[n - 1];
ri[n - 1] = a[n - 1];
rrep(i, n) { tmp = ri[i] = gcd(tmp, a[i]); }
ans = max(lef[n - 1], ri[0]);
// cout<<ans<<endl;
REP(i, 1, n - 1)
ans = max(gcd(lef[i - 1], ri[i + 1]), ans);
/*
cout<<"left"<<endl;
rep(i,n)
cout<<lef[i]<<endl;
puts("");
rep(i,n)
cout<<ri[i]<<endl;
*/
cout << ans << endl;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
| #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--) /// n-1番目からn回
#define REP(i, a, b) for (int i = a; i < b; i++) /// a番目からb回
#define RREP(i, a, b) for (int i = a; i < b; i--)
typedef long long int lld;
typedef vector<lld> vl;
typedef vector<int> vi;
typedef vector<string> vs;
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
/// min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
int gcd(int a, int b);
int main() {
int n, ans = 0, tmp = 0;
cin >> n;
vi a(1000000), lef(1000000), ri(1000000);
rep(i, n) cin >> a[i];
tmp = a[0];
lef[0] = tmp;
REP(i, 1, n)
tmp = lef[i] = gcd(tmp, a[i]);
tmp = a[n - 1];
ri[n - 1] = a[n - 1];
rrep(i, n) { tmp = ri[i] = gcd(tmp, a[i]); }
ans = max(lef[n - 2], ri[1]);
// cout<<ans<<endl;
REP(i, 1, n - 1)
ans = max(gcd(lef[i - 1], ri[i + 1]), ans);
/*
cout<<"left"<<endl;
rep(i,n)
cout<<lef[i]<<endl;
puts("");
rep(i,n)
cout<<ri[i]<<endl;
*/
cout << ans << endl;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,930 | 874,929 | u696415377 | cpp |
p03061 | #include <iostream>
using namespace std;
int foward[100000] = {};
int backward[100000] = {};
int n = 0;
int gcd(int a, int b) {
if (a == b || b == 0)
return a;
return gcd(b, a % b);
}
int gcd_without(int i) {
if (i == 0)
return backward[n - 2];
else if (i == n - 1)
return foward[n - 2];
return gcd(foward[i - 1], backward[n - i]);
}
int main() {
cin >> n;
int a[100000] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int last_v = 0;
for (int i = 0; i < n; i++) {
foward[i] = gcd(a[i], last_v);
last_v = foward[i];
}
last_v = 0;
for (int i = 0; i < n; i++) {
backward[i] = gcd(a[n - i - 1], last_v);
last_v = backward[i];
}
int max = 0;
for (int i = 0; i < n; i++) {
// i以外のやつでgcd
int gcd_value = gcd_without(i);
if (max < gcd_value)
max = gcd_value;
}
cout << max << endl;
}
| #include <iostream>
using namespace std;
int foward[100000] = {};
int backward[100000] = {};
int n = 0;
int gcd(int a, int b) {
if (a == b || b == 0)
return a;
return gcd(b, a % b);
}
int gcd_without(int i) {
if (i == 0)
return backward[n - 2];
else if (i == n - 1)
return foward[n - 2];
return gcd(foward[i - 1], backward[n - i - 2]);
}
int main() {
cin >> n;
int a[100000] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int last_v = 0;
for (int i = 0; i < n; i++) {
foward[i] = gcd(a[i], last_v);
last_v = foward[i];
}
last_v = 0;
for (int i = 0; i < n; i++) {
backward[i] = gcd(a[n - i - 1], last_v);
last_v = backward[i];
}
int max = 0;
for (int i = 0; i < n; i++) {
// i以外のやつでgcd
int gcd_value = gcd_without(i);
if (max < gcd_value)
max = gcd_value;
}
cout << max << endl;
}
| [
"expression.operation.binary.add"
] | 874,931 | 874,932 | u347503894 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long> a(n), l(n + 1), r(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
l[0] = 0;
r[n + 1] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
int j = n - i - 1;
r[j] = gcd(r[j + 1], a[j]);
}
long res = 1;
for (int i = 0; i < n; i++) {
res = max(res, gcd(l[i], r[i + 1]));
}
cout << res << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long gcd(long a, long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<long> a(n), l(n + 1), r(n + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
l[0] = 0;
r[n] = 0;
for (int i = 0; i < n; i++) {
l[i + 1] = gcd(l[i], a[i]);
int j = n - 1 - i;
r[j] = gcd(r[j + 1], a[j]);
}
long res = 1;
for (int i = 0; i < n; i++) {
res = max(res, gcd(l[i], r[i + 1]));
}
cout << res << endl;
} | [
"expression.operation.binary.remove"
] | 874,938 | 874,937 | u265608204 | cpp |
p03061 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
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 vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
// repetition
//------------------------------------------
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define VEC_2D(a, b) vector<vector<int>>(a, vector<int>(b, 0))
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define INF (1001000000)
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define UNIQ(c) (c).erase(unique((c).begin(), (c).end()), (c).end());
#define MOD 1000000007LL
#define MS(v, n) memset((v), (n), sizeof(v))
// input
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
// output
#define P(p) cout << (p) << endl;
#define FSP(a) cout << fixed << setprecision(a)
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> bool is_prime(T n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int extgcd(int a, int b, int &x, int &y) { //
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
ll comb(ll a, ll b, ll mod) {
ll mul = 1;
ll div = 1;
rep(i, b) {
mul *= (a - (ll)i);
mul %= mod;
div *= ((ll)i + 1);
div %= mod;
}
mul *= mod_pow(div, mod - 2, mod);
return mul % mod;
}
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
bool is_kadomatsu(int a, int b, int c) {
if (a == b || a == c || b == c)
return false;
if (a > b && c > b)
return true;
if (a < b && c < b)
return true;
return false;
}
struct UF {
int n;
vi d;
UF() {}
UF(int n) : n(n), d(n, -1) {}
int root(int v) {
if (d[v] < 0)
return v;
return d[v] = root(d[v]);
}
bool same(int a, int b) { return root(a) == root(b); }
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (size(x) < size(y))
swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
int size(int v) { return -d[root(v)]; }
};
struct Fibonacci {
vvll fib;
Fibonacci() {
fib.resize(2, vll(2));
fib[0][0] = 1;
fib[0][1] = 1;
fib[1][0] = 1;
fib[1][1] = 0;
}
vvll mul(vvll &A, vvll &B) {
vvll C(2, vll(2));
rep(i, 2) {
rep(k, 2) {
rep(j, 2) { C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD; }
}
}
return C;
}
ll pow(ll n) {
vvll A = fib;
vvll B(2, vll(2));
rep(i, 2) { B[i][i] = 1; }
while (n > 0) {
if (n & 1)
B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B[1][0];
}
};
vector<int> divisor(int n) {
if (n == 1)
return {};
vi res;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.emplace_back(i);
if (i != 1 && i != n / i)
res.emplace_back(n / i);
}
}
return res;
}
struct Bellmanford {
int n;
struct edge {
int from, to, cost;
};
vector<edge> E;
vi d;
Bellmanford(int n) : n(n), d(n) { E.resize(n); }
void add_edge(int x, int y, int cost) {
edge e;
e.from = x;
e.to = y;
e.cost = cost;
E.push_back(e);
}
void shortest_path(int s) {
rep(i, n) d[i] = INF;
d[s] = 0;
while (true) {
bool update = false;
for (auto e : E) {
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
update = true;
}
}
if (!update)
break;
}
}
};
struct Dijkstra {
int n;
struct edge {
int to;
ll cost;
};
vector<vector<edge>> G;
vll d;
Dijkstra(int n) : n(n), d(n) { G.resize(n); }
void add_edge(int x, int y, ll cost) {
edge e;
e.to = y;
e.cost = cost;
G[x].push_back(e);
}
void shortest_path(int s) {
rep(i, n) d[i] = 100000000000000000;
d[s] = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
que;
que.push(make_pair(0, s));
while (!que.empty()) {
pii p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
};
struct Segmenttree {
int n;
vector<int> dat;
Segmenttree(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat = vector<int>(2 * n - 1, 0);
}
void add(int idx, ll val) { // 0-indexed
idx += n - 1;
dat[idx] += val;
while (idx > 0) {
idx = (idx - 1) / 2;
dat[idx] += val;
}
}
int query(int a, int b) { return query_seg(a, b, 0, 0, n); }
int query_seg(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0;
if (a <= l && r <= b)
return dat[k];
else {
return query_seg(a, b, k * 2 + 1, l, (l + r) / 2) +
query_seg(a, b, k * 2 + 2, (l + r) / 2, r);
}
}
};
struct Trie {
Trie *next[26];
Trie() { fill(next, next + 26, (Trie *)0); }
void insert(char *s) {
if (*s == '\0')
return;
if (this->next[*s - 'a'] == NULL) {
this->next[*s - 'a'] = new Trie();
}
this->next[*s - 'a']->insert(s + 1);
}
bool find(char *s) {
if (*s == '\0')
return true;
if (this->next[*s - 'a'] == NULL) {
return false;
}
return this->next[*s - 'a']->find(s + 1);
}
};
struct BIT {
int n;
vi bit;
BIT() {}
BIT(int n) : n(n) { bit.resize(n + 1); }
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
/*
struct edge { int to, cap, rev; };
vector<edge> G[200005];
int level[200005];
int iter[200005];
void add_edge(int from, int to, int cap) {
G[from].push_back({ to, cap, (int)G[to].size() });
G[to].push_back({ from, 0, (int)G[from].size() - 1 });
}
void fbfs(int s) {
memset(level, -1, sizeof(level));
queue<int> que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
int v = que.front(); que.pop();
for (edge &e : G[v]) {
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int fdfs(int v, int t, int f) {
if (v == t) return f;
for (edge &e : G[v]) {
if (e.cap > 0 && level[v] < level[e.to]) {
int d = fdfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t) {
int flow = 0;
for (;;) {
fbfs(s);
if (level[t] < 0) return flow;
memset(iter, 0, sizeof(iter));
int f;
while ((f = fdfs(s, t, INF)) > 0) {
flow += f;
}
}
}
*/
//------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
ll ans = 1;
vll l(n), r(n);
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]);
}
rep(i, n) {
if (i == 0) {
ans = max(ans, l[1]);
} else if (i == n - 1) {
ans = max(ans, r[n - 2]);
} else {
ans = max(ans, gcd(l[i - 1], r[i + 1]));
}
}
P(ans);
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
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 vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
// repetition
//------------------------------------------
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define VEC_2D(a, b) vector<vector<int>>(a, vector<int>(b, 0))
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define INF (1001000000)
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define UNIQ(c) (c).erase(unique((c).begin(), (c).end()), (c).end());
#define MOD 1000000007LL
#define MS(v, n) memset((v), (n), sizeof(v))
// input
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
// output
#define P(p) cout << (p) << endl;
#define FSP(a) cout << fixed << setprecision(a)
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> bool is_prime(T n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int extgcd(int a, int b, int &x, int &y) { //
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = mod_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
ll comb(ll a, ll b, ll mod) {
ll mul = 1;
ll div = 1;
rep(i, b) {
mul *= (a - (ll)i);
mul %= mod;
div *= ((ll)i + 1);
div %= mod;
}
mul *= mod_pow(div, mod - 2, mod);
return mul % mod;
}
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
bool is_kadomatsu(int a, int b, int c) {
if (a == b || a == c || b == c)
return false;
if (a > b && c > b)
return true;
if (a < b && c < b)
return true;
return false;
}
struct UF {
int n;
vi d;
UF() {}
UF(int n) : n(n), d(n, -1) {}
int root(int v) {
if (d[v] < 0)
return v;
return d[v] = root(d[v]);
}
bool same(int a, int b) { return root(a) == root(b); }
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (size(x) < size(y))
swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
int size(int v) { return -d[root(v)]; }
};
struct Fibonacci {
vvll fib;
Fibonacci() {
fib.resize(2, vll(2));
fib[0][0] = 1;
fib[0][1] = 1;
fib[1][0] = 1;
fib[1][1] = 0;
}
vvll mul(vvll &A, vvll &B) {
vvll C(2, vll(2));
rep(i, 2) {
rep(k, 2) {
rep(j, 2) { C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD; }
}
}
return C;
}
ll pow(ll n) {
vvll A = fib;
vvll B(2, vll(2));
rep(i, 2) { B[i][i] = 1; }
while (n > 0) {
if (n & 1)
B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B[1][0];
}
};
vector<int> divisor(int n) {
if (n == 1)
return {};
vi res;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.emplace_back(i);
if (i != 1 && i != n / i)
res.emplace_back(n / i);
}
}
return res;
}
struct Bellmanford {
int n;
struct edge {
int from, to, cost;
};
vector<edge> E;
vi d;
Bellmanford(int n) : n(n), d(n) { E.resize(n); }
void add_edge(int x, int y, int cost) {
edge e;
e.from = x;
e.to = y;
e.cost = cost;
E.push_back(e);
}
void shortest_path(int s) {
rep(i, n) d[i] = INF;
d[s] = 0;
while (true) {
bool update = false;
for (auto e : E) {
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
update = true;
}
}
if (!update)
break;
}
}
};
struct Dijkstra {
int n;
struct edge {
int to;
ll cost;
};
vector<vector<edge>> G;
vll d;
Dijkstra(int n) : n(n), d(n) { G.resize(n); }
void add_edge(int x, int y, ll cost) {
edge e;
e.to = y;
e.cost = cost;
G[x].push_back(e);
}
void shortest_path(int s) {
rep(i, n) d[i] = 100000000000000000;
d[s] = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
que;
que.push(make_pair(0, s));
while (!que.empty()) {
pii p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
};
struct Segmenttree {
int n;
vector<int> dat;
Segmenttree(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat = vector<int>(2 * n - 1, 0);
}
void add(int idx, ll val) { // 0-indexed
idx += n - 1;
dat[idx] += val;
while (idx > 0) {
idx = (idx - 1) / 2;
dat[idx] += val;
}
}
int query(int a, int b) { return query_seg(a, b, 0, 0, n); }
int query_seg(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0;
if (a <= l && r <= b)
return dat[k];
else {
return query_seg(a, b, k * 2 + 1, l, (l + r) / 2) +
query_seg(a, b, k * 2 + 2, (l + r) / 2, r);
}
}
};
struct Trie {
Trie *next[26];
Trie() { fill(next, next + 26, (Trie *)0); }
void insert(char *s) {
if (*s == '\0')
return;
if (this->next[*s - 'a'] == NULL) {
this->next[*s - 'a'] = new Trie();
}
this->next[*s - 'a']->insert(s + 1);
}
bool find(char *s) {
if (*s == '\0')
return true;
if (this->next[*s - 'a'] == NULL) {
return false;
}
return this->next[*s - 'a']->find(s + 1);
}
};
struct BIT {
int n;
vi bit;
BIT() {}
BIT(int n) : n(n) { bit.resize(n + 1); }
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
/*
struct edge { int to, cap, rev; };
vector<edge> G[200005];
int level[200005];
int iter[200005];
void add_edge(int from, int to, int cap) {
G[from].push_back({ to, cap, (int)G[to].size() });
G[to].push_back({ from, 0, (int)G[from].size() - 1 });
}
void fbfs(int s) {
memset(level, -1, sizeof(level));
queue<int> que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
int v = que.front(); que.pop();
for (edge &e : G[v]) {
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int fdfs(int v, int t, int f) {
if (v == t) return f;
for (edge &e : G[v]) {
if (e.cap > 0 && level[v] < level[e.to]) {
int d = fdfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t) {
int flow = 0;
for (;;) {
fbfs(s);
if (level[t] < 0) return flow;
memset(iter, 0, sizeof(iter));
int f;
while ((f = fdfs(s, t, INF)) > 0) {
flow += f;
}
}
}
*/
//------------------------
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vll a(n);
rep(i, n) cin >> a[i];
ll ans = 1;
vll l(n), r(n);
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]);
}
rep(i, n) {
if (i == 0) {
ans = max(ans, r[1]);
} else if (i == n - 1) {
ans = max(ans, l[n - 2]);
} else {
ans = max(ans, gcd(l[i - 1], r[i + 1]));
}
}
P(ans);
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,943 | 874,944 | u221758210 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> front(N - 1), back(N - 1);
int gcdf = A[0];
for (int i = 0; i < front.size(); i++) {
gcdf = __gcd(gcdf, A[i]);
front[i] = gcdf;
}
reverse(A.begin(), A.end());
int gcdb = A[0];
for (int i = 0; i < back.size(); i++) {
gcdb = __gcd(gcdb, A[i]);
back[i] = gcdb;
}
reverse(back.begin(), back.end());
vector<int> gcd(N);
for (int i = 0; i < N; i++) {
if (i == 0) {
gcd[i] = back[0];
} else if (i == N - 1) {
gcd[i] = front[front.size() - 1];
} else {
gcd[i] = __gcd(front[i + 1], back[i]);
}
// cout << gcd[i] << endl;
}
sort(gcd.begin(), gcd.end());
reverse(gcd.begin(), gcd.end());
cout << gcd[0] << endl;
};
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> front(N - 1), back(N - 1);
int gcdf = A[0];
for (int i = 0; i < front.size(); i++) {
gcdf = __gcd(gcdf, A[i]);
front[i] = gcdf;
}
reverse(A.begin(), A.end());
int gcdb = A[0];
for (int i = 0; i < back.size(); i++) {
gcdb = __gcd(gcdb, A[i]);
back[i] = gcdb;
}
reverse(back.begin(), back.end());
vector<int> gcd(N);
for (int i = 0; i < N; i++) {
if (i == 0) {
gcd[i] = back[0];
} else if (i == N - 1) {
gcd[i] = front[front.size() - 1];
} else {
gcd[i] = __gcd(front[i - 1], back[i]);
}
// cout << gcd[i] << endl;
}
sort(gcd.begin(), gcd.end());
reverse(gcd.begin(), gcd.end());
cout << gcd[0] << endl;
};
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,955 | 874,956 | u987594251 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
set<int> a, b;
int n, x, k, i, ans = 1;
cin >> n;
for (i = 0; i < n; i++) {
b.clear();
swap(a, b);
cin >> x;
for (set<int>::iterator it = b.begin(); it != b.end(); it++)
a.insert(gcd(*it, x));
a.insert(k);
k = gcd(k, x);
}
for (set<int>::iterator it = a.begin(); it != a.end(); it++)
ans = max(ans, *it);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
set<int> a, b;
int n, x, k = 0, i, ans = 1;
cin >> n;
for (i = 0; i < n; i++) {
b.clear();
swap(a, b);
cin >> x;
for (set<int>::iterator it = b.begin(); it != b.end(); it++)
a.insert(gcd(*it, x));
a.insert(k);
k = gcd(k, x);
}
for (set<int>::iterator it = a.begin(); it != a.end(); it++)
ans = max(ans, *it);
cout << ans << endl;
} | [
"variable_declaration.value.change"
] | 874,957 | 874,958 | u038054933 | cpp |
p03061 | // template version 1.8
// varibable settings {{{
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
#define int long long
const int INF = 1e18;
const int MOD = 1e9 + 7;
#define infile "../test/sample-1.in"
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
#define fi first
#define se second
// }}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
// dump macro
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
// }}}
int gcd(int a, int b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
int solve() {
int n;
cin >> n;
vector<int> a(n);
int g = a[0];
rep(i, n) {
cin >> a[i];
g = gcd(g, a[i]);
}
vi l(n, 0);
l[0] = a[0];
rep(i, 1, n) { l[i] = gcd(l[i - 1], a[i]); }
dump(l);
vi r(n, 0);
r[n - 1] = a[n - 1];
rrep(i, 0, n - 1) { r[i] = gcd(r[i + 1], a[i]); }
dump(r);
int res = 1;
chmax(res, r[1]);
chmax(res, l[n - 1]);
rep(i, 1, n - 1) { chmax(res, gcd(l[i - 1], r[i + 1])); }
cout << res << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| // template version 1.8
// varibable settings {{{
using namespace std;
#include <bits/stdc++.h>
#include <iostream>
#define int long long
const int INF = 1e18;
const int MOD = 1e9 + 7;
#define infile "../test/sample-1.in"
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
#define fi first
#define se second
// }}}
// define basic macro {{{
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define rrep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) \
sort(all(x)); \
x.erase(unique(all(x)), x.end())
template <class T> inline void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;
template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
// dump macro
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
// }}}
int gcd(int a, int b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
int solve() {
int n;
cin >> n;
vector<int> a(n);
int g = a[0];
rep(i, n) {
cin >> a[i];
g = gcd(g, a[i]);
}
vi l(n, 0);
l[0] = a[0];
rep(i, 1, n) { l[i] = gcd(l[i - 1], a[i]); }
dump(l);
vi r(n, 0);
r[n - 1] = a[n - 1];
rrep(i, 0, n - 1) { r[i] = gcd(r[i + 1], a[i]); }
dump(r);
int res = 1;
chmax(res, r[1]);
chmax(res, l[n - 2]);
rep(i, 1, n - 1) { chmax(res, gcd(l[i - 1], r[i + 1])); }
cout << res << endl;
return 0;
}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
solve();
return 0;
} //}}}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,980 | 874,981 | u314057689 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, i, j, min = (ll)1e9, min2;
cin >> n;
vector<ll> a(n), l(n), r(n), b(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (i = 0; i < n; i++) {
if (i != 0) {
l[i] = gcd(l[i - 1], a[i]);
}
}
r[n - 1] = a[n - 1];
for (i = n - 2; i >= 0; i--) {
r[i] = gcd(l[i + 1], a[i]);
}
b[0] = r[1];
b[n - 1] = l[n - 2];
for (i = 1; i < n - 1; i++) {
b[i] = gcd(l[i - 1], r[i + 1]);
}
sort(b.begin(), b.end());
cout << b[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
ll n, i, j, min = (ll)1e9, min2;
cin >> n;
vector<ll> a(n), l(n), r(n), b(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
l[0] = a[0];
for (i = 0; i < n; i++) {
if (i != 0) {
l[i] = gcd(l[i - 1], a[i]);
}
}
r[n - 1] = a[n - 1];
for (i = n - 2; i >= 0; i--) {
r[i] = gcd(r[i + 1], a[i]);
}
b[0] = r[1];
b[n - 1] = l[n - 2];
for (i = 1; i < n - 1; i++) {
b[i] = gcd(l[i - 1], r[i + 1]);
}
sort(b.begin(), b.end());
cout << b[n - 1] << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 874,982 | 874,983 | u061912210 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int N;
int A[500001];
int R[500001];
int L[500001];
int ans = 0;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
cin >> N;
for (int n = 0; n < N; n++) {
cin >> A[n];
}
L[0] = A[0];
R[N - 1] = A[N - 1];
for (int n = 1; n < N; n++) {
L[n] = gcd(L[n - 1], A[n]);
R[N - n - 1] = gcd(R[N - n], A[N - n - 1]);
}
ans = R[1];
ans = max(ans, L[N - 1]);
for (int n = 1; n < N - 1; n++) {
ans = max(ans, gcd(L[n - 1], R[n + 1]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int N;
int A[500001];
int R[500001];
int L[500001];
int ans = 0;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
cin >> N;
for (int n = 0; n < N; n++) {
cin >> A[n];
}
L[0] = A[0];
R[N - 1] = A[N - 1];
for (int n = 1; n < N; n++) {
L[n] = gcd(L[n - 1], A[n]);
R[N - n - 1] = gcd(R[N - n], A[N - n - 1]);
}
ans = R[1];
ans = max(ans, L[N - 2]);
for (int n = 1; n < N - 1; n++) {
ans = max(ans, gcd(L[n - 1], R[n + 1]));
}
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,984 | 874,985 | u608297208 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int N;
int A[500001];
int R[500001];
int L[500001];
int ans = 0;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
cin >> N;
for (int n = 0; n < N; n++) {
cin >> A[n];
}
L[0] = A[0];
R[N - 1] = A[N - 1];
for (int n = 1; n < N; n++) {
L[n] = gcd(L[n - 1], A[n]);
R[N - n - 1] = gcd(R[N - n], A[n]);
}
ans = R[1];
ans = max(ans, L[N - 1]);
for (int n = 1; n < N - 1; n++) {
ans = max(ans, gcd(L[n - 1], R[n + 1]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int N;
int A[500001];
int R[500001];
int L[500001];
int ans = 0;
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int main() {
cin >> N;
for (int n = 0; n < N; n++) {
cin >> A[n];
}
L[0] = A[0];
R[N - 1] = A[N - 1];
for (int n = 1; n < N; n++) {
L[n] = gcd(L[n - 1], A[n]);
R[N - n - 1] = gcd(R[N - n], A[N - n - 1]);
}
ans = R[1];
ans = max(ans, L[N - 2]);
for (int n = 1; n < N - 1; n++) {
ans = max(ans, gcd(L[n - 1], R[n + 1]));
}
cout << ans << endl;
} | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 874,986 | 874,985 | u608297208 | cpp |
p03061 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <regex>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ull = unsigned long long;
using ll = long long;
ull gcd(ull a, ull b) { return (b == 0) ? a : gcd(b, a % b); }
bool is_prime(ull num) {
if (num <= 3) {
return num > 1;
} else if (num % 2 == 0 || num % 3 == 0) {
return false;
} else {
for (ull i = 5; i * i <= num; i += 6) {
if (num % i == 0 || num % (i + 2) == 0) {
return false;
}
}
return true;
}
}
int main() {
// sieve(1000000000);
// 素数判定の表
int N;
cin >> N;
vector<ull> vec(N);
for (size_t i = 0; i < N; i++) {
cin >> vec[i];
}
// 最大公約数は順番を入れ替えてもOK
// なので累積和風に、事前に計算しておく
vector<ull> left(N);
left[0] = vec[0];
for (size_t i = 0; i < N - 1; i++) {
left[i + 1] = gcd(left[i], vec[i + 1]);
}
vector<ull> right(N);
right[N - 1] = vec[N - 1];
for (size_t i = N - 1; i > 1; i--) {
left[i - 1] = gcd(right[i], vec[i - 1]);
}
ull ans = 1;
for (size_t i = 0; i < N; i++) {
if (i == 0) {
ans = max(ans, right[i + 1]);
} else if (i == N - 1) {
ans = max(ans, left[i - 1]);
} else {
ans = max(ans, gcd(left[i - 1], right[i + 1]));
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <regex>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ull = unsigned long long;
using ll = long long;
ull gcd(ull a, ull b) { return (b == 0) ? a : gcd(b, a % b); }
bool is_prime(ull num) {
if (num <= 3) {
return num > 1;
} else if (num % 2 == 0 || num % 3 == 0) {
return false;
} else {
for (ull i = 5; i * i <= num; i += 6) {
if (num % i == 0 || num % (i + 2) == 0) {
return false;
}
}
return true;
}
}
int main() {
// sieve(1000000000);
// 素数判定の表
int N;
cin >> N;
vector<ull> vec(N);
for (size_t i = 0; i < N; i++) {
cin >> vec[i];
}
// 最大公約数は順番を入れ替えてもOK
// なので累積和風に、事前に計算しておく
vector<ull> left(N);
left[0] = vec[0];
for (size_t i = 0; i < N - 1; i++) {
left[i + 1] = gcd(left[i], vec[i + 1]);
}
vector<ull> right(N);
right[N - 1] = vec[N - 1];
for (size_t i = N - 1; i > 1; i--) {
right[i - 1] = gcd(right[i], vec[i - 1]);
}
ull ans = 1;
for (size_t i = 0; i < N; i++) {
if (i == 0) {
ans = max(ans, right[i + 1]);
} else if (i == N - 1) {
ans = max(ans, left[i - 1]);
} else {
ans = max(ans, gcd(left[i - 1], right[i + 1]));
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.variable.change",
"identifier.change"
] | 874,995 | 874,996 | u101264341 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a < b)
return gcd(b, a);
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<int64_t> t(n);
for (int i = 0; i < n; i++) {
cin >> t[i];
}
vector<int64_t> gcd1(n);
vector<int64_t> gcd2(n);
int64_t curGcd = t[0];
for (int i = 1; i < n; i++) {
gcd1[i] = curGcd;
curGcd = gcd(curGcd, t[i]);
}
curGcd = t[n - 1];
for (int i = n - 2; i >= 0; i--) {
gcd2[i] = curGcd;
curGcd = gcd(curGcd, t[i]);
}
int64_t ans = 0;
for (int i = 0; i < n - 1; i++) {
ans = max(ans, gcd(gcd1[i], gcd2[i]));
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a < b)
return gcd(b, a);
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<int64_t> t(n);
for (int i = 0; i < n; i++) {
cin >> t[i];
}
vector<int64_t> gcd1(n);
vector<int64_t> gcd2(n);
int64_t curGcd = t[0];
for (int i = 1; i < n; i++) {
gcd1[i] = curGcd;
curGcd = gcd(curGcd, t[i]);
}
curGcd = t[n - 1];
for (int i = n - 2; i >= 0; i--) {
gcd2[i] = curGcd;
curGcd = gcd(curGcd, t[i]);
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, gcd(gcd1[i], gcd2[i]));
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 874,997 | 874,998 | u672765904 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n;
cin >> n;
vector<ll> a(n), f(n), b(n), d(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
if (i == 0)
f[i] = a[i];
else
f[i] = gcd(a[i - 1], a[i]);
}
for (int i = n - 1; i >= 0; --i) {
if (i == n - 1)
b[n - 1] = a[n - 1];
else
b[i] = gcd(a[i + 1], a[i]);
}
ll maxd = 0;
for (int i = 0; i < n; ++i) {
if (i == 0)
d[i] = b[1];
else if (i == n - 1)
d[i] = f[n - 2];
else
d[i] = gcd(f[i - 1], b[i + 1]);
maxd = max(maxd, d[i]);
}
cout << maxd << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int main() {
int n;
cin >> n;
vector<ll> a(n), f(n), b(n), d(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
if (i == 0)
f[i] = a[i];
else
f[i] = gcd(f[i - 1], a[i]);
}
for (int i = n - 1; i >= 0; --i) {
if (i == n - 1)
b[n - 1] = a[n - 1];
else
b[i] = gcd(b[i + 1], a[i]);
}
ll maxd = 0;
for (int i = 0; i < n; ++i) {
if (i == 0)
d[i] = b[1];
else if (i == n - 1)
d[i] = f[n - 2];
else
d[i] = gcd(f[i - 1], b[i + 1]);
maxd = max(maxd, d[i]);
}
cout << maxd << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 875,007 | 875,008 | u456333842 | cpp |
p03061 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
#define iINF (1 << 30)
#define INF (1LL << 59)
#define forn(i) for (int i = 0; i < n; ++i)
#define form(i, n) for (int i = 0; i < n; ++i)
#define NIL -1
const ll mod = 998244353;
int n;
int m;
int ans;
string str;
int gcd(int x, int y) {
if (y > x)
return gcd(y, x);
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int a[100010];
int la[100010];
int ra[100010];
cin >> n;
forn(i) cin >> a[i];
la[0] = a[0];
ra[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
la[i] = gcd(la[i - 1], a[i]);
ra[n - 1 - i] = gcd(ra[n - i], a[n - 1 - i]);
}
ans = max(la[1], ra[n - 2]);
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(la[i - 1], ra[i + 1]));
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
#define iINF (1 << 30)
#define INF (1LL << 59)
#define forn(i) for (int i = 0; i < n; ++i)
#define form(i, n) for (int i = 0; i < n; ++i)
#define NIL -1
const ll mod = 998244353;
int n;
int m;
int ans;
string str;
int gcd(int x, int y) {
if (y > x)
return gcd(y, x);
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int a[100010];
int la[100010];
int ra[100010];
cin >> n;
forn(i) cin >> a[i];
la[0] = a[0];
ra[n - 1] = a[n - 1];
for (int i = 1; i < n; i++) {
la[i] = gcd(la[i - 1], a[i]);
ra[n - 1 - i] = gcd(ra[n - i], a[n - 1 - i]);
}
ans = max(la[n - 2], ra[1]);
for (int i = 1; i < n - 1; i++) {
ans = max(ans, gcd(la[i - 1], ra[i + 1]));
}
cout << ans << endl;
return 0;
} | [
"call.arguments.change",
"call.arguments.add"
] | 875,009 | 875,010 | u120190063 | cpp |
p03061 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef U_L_LONG
typedef unsigned long long U_L_LONG;
#endif
#ifndef L_LONG
typedef long long L_LONG;
#endif
#ifndef LL_ABS
#define LL_ABS(x) (((((x) < 0) ? ((x) * (-1)) : (x))))
#endif
static void C_problem();
int main() {
C_problem();
fflush(stdout);
return 0;
}
static L_LONG llong_gcd(L_LONG first, L_LONG second) {
L_LONG num1 = first, num2 = second;
if (num1 == 0)
return num2;
if (num2 == 0)
return num1;
L_LONG remainder = 0, common = 0;
while (!common) {
remainder = num1 % num2;
if (remainder == 0) {
common = num2;
} else {
num1 = num2;
num2 = remainder;
}
}
return (common);
}
static L_LONG C_Euclidean(L_LONG *container, int cSize) {
if (cSize == 2) {
return (llong_gcd(container[0], container[1]));
}
std::vector<L_LONG> gcdFwds, gcdBkwds;
gcdFwds.resize(cSize - 1, 0);
gcdBkwds.resize(cSize - 1, 0);
L_LONG gcdFwd = container[0];
L_LONG gcdBkwd = container[cSize - 1];
for (int i = 1; i < cSize - 1; i++) {
gcdFwds[i] = gcdFwd = llong_gcd(gcdFwd, container[i + 1]);
gcdBkwds[cSize - 2 - i] = gcdBkwd =
(llong_gcd(gcdBkwd, container[cSize - 1 - i]));
}
int size = gcdFwds.size();
L_LONG maxGcd = 0; // std::max(gcdFwds[size - 2], gcdBkwds[2]);
for (int i = 0; i < size - 1; i++) {
maxGcd = std::max(maxGcd, llong_gcd(gcdFwds[i], gcdBkwds[i + 1]));
}
return maxGcd;
}
static void C_problem() {
int N = 0;
static L_LONG A[100008] = {0};
scanf(" %d", &N);
for (int i = 1; i < N + 1; i++) {
scanf(" %lld", &A[i]);
}
// 先頭と末尾に0を追加する. 合計で N+2
A[0] = 0;
A[N + 1] = 0;
// std::sort(&A[0], &A[N - 1]);
// std::sort(&A[1], &A[N - 1], std::greater<L_LONG>());
printf("%lld\n", C_Euclidean(A, N + 2));
}
|
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef U_L_LONG
typedef unsigned long long U_L_LONG;
#endif
#ifndef L_LONG
typedef long long L_LONG;
#endif
#ifndef LL_ABS
#define LL_ABS(x) (((((x) < 0) ? ((x) * (-1)) : (x))))
#endif
static void C_problem();
int main() {
C_problem();
fflush(stdout);
return 0;
}
static L_LONG llong_gcd(L_LONG first, L_LONG second) {
L_LONG num1 = first, num2 = second;
if (num1 == 0)
return num2;
if (num2 == 0)
return num1;
L_LONG remainder = 0, common = 0;
while (!common) {
remainder = num1 % num2;
if (remainder == 0) {
common = num2;
} else {
num1 = num2;
num2 = remainder;
}
}
return (common);
}
static L_LONG C_Euclidean(L_LONG *container, int cSize) {
if (cSize == 2) {
return (llong_gcd(container[0], container[1]));
}
std::vector<L_LONG> gcdFwds, gcdBkwds;
gcdFwds.resize(cSize - 1, 0);
gcdBkwds.resize(cSize - 1, 0);
L_LONG gcdFwd = container[0];
L_LONG gcdBkwd = container[cSize - 1];
for (int i = 1; i < cSize - 1; i++) {
gcdFwds[i] = gcdFwd = llong_gcd(gcdFwd, container[i]);
gcdBkwds[cSize - 2 - i] = gcdBkwd =
(llong_gcd(gcdBkwd, container[cSize - 1 - i]));
}
int size = gcdFwds.size();
L_LONG maxGcd = 0; // std::max(gcdFwds[size - 2], gcdBkwds[2]);
for (int i = 0; i < size - 1; i++) {
maxGcd = std::max(maxGcd, llong_gcd(gcdFwds[i], gcdBkwds[i + 1]));
}
return maxGcd;
}
static void C_problem() {
int N = 0;
static L_LONG A[100008] = {0};
scanf(" %d", &N);
for (int i = 1; i < N + 1; i++) {
scanf(" %lld", &A[i]);
}
// 先頭と末尾に0を追加する. 合計で N+2
A[0] = 0;
A[N + 1] = 0;
// std::sort(&A[0], &A[N - 1]);
// std::sort(&A[1], &A[N - 1], std::greater<L_LONG>());
printf("%lld\n", C_Euclidean(A, N + 2));
}
| [
"expression.operation.binary.remove"
] | 875,023 | 875,024 | u887675488 | cpp |
p03061 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main(int argc, char const *argv[]) {
int64_t n;
cin >> n;
vector<int64_t> a(n);
vector<int64_t> pre(n);
vector<int64_t> post(n);
for (int64_t i = 0; i < n; ++i) {
cin >> a[i];
}
for (int64_t i = 0; i < n; ++i) {
if (i == 0) {
pre[i] = a[i];
} else {
pre[i] = gcd(pre[i - i], a[i]);
}
}
for (int64_t i = n - 1; i >= 0; --i) {
if (i == (n - 1)) {
post[i] = a[i];
} else {
post[i] = gcd(post[i + 1], a[i]);
}
}
int64_t res = 0;
int64_t tmp;
for (int64_t i = 0; i < n; ++i) {
if (i == 0) {
tmp = post[1];
} else if (i == (n - 1)) {
tmp = pre[n - 2];
} else {
tmp = gcd(pre[i - 1], post[i + 1]);
}
if (tmp > res)
res = tmp;
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main(int argc, char const *argv[]) {
int64_t n;
cin >> n;
vector<int64_t> a(n);
vector<int64_t> pre(n);
vector<int64_t> post(n);
for (int64_t i = 0; i < n; ++i) {
cin >> a[i];
}
for (int64_t i = 0; i < n; ++i) {
if (i == 0) {
pre[i] = a[i];
} else {
pre[i] = gcd(pre[i - 1], a[i]);
}
}
for (int64_t i = n - 1; i >= 0; --i) {
if (i == (n - 1)) {
post[i] = a[i];
} else {
post[i] = gcd(post[i + 1], a[i]);
}
}
int64_t res = 0;
int64_t tmp;
for (int64_t i = 0; i < n; ++i) {
if (i == 0) {
tmp = post[1];
} else if (i == (n - 1)) {
tmp = pre[n - 2];
} else {
tmp = gcd(pre[i - 1], post[i + 1]);
}
if (tmp > res)
res = tmp;
}
cout << res << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,025 | 875,026 | u729166490 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = max(1, min(A.at(0),
A.at(N - 1))); // Mを小さくしていっていくつ割り切るか調べる
while (true) {
int count = 0; // MがAをいくつ割り切れないか数える
for (int i = 0; i < N; i++) {
if (A.at(i) % M > 0) {
count++;
}
if (count > 1) {
break;
}
}
if (count <= 1) {
break;
}
M -= 1;
}
cout << M << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = max(A.at(0), A.at(N - 1)); // Mを小さくしていっていくつ割り切るか調べる
while (true) {
int count = 0; // MがAをいくつ割り切れないか数える
for (int i = 0; i < N; i++) {
if (A.at(i) % M > 0) {
count++;
}
if (count > 1) {
break;
}
}
if (count <= 1) {
break;
}
M -= 1;
}
cout << M << endl;
}
| [
"call.arguments.change"
] | 875,027 | 875,028 | u668650380 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = min(A.at(0), A.at(N - 1)); // Mを小さくしていっていくつ割り切るか調べる
while (true) {
int count = 0; // MがAをいくつ割り切れないか数える
for (int i = 0; i < N; i++) {
if (A.at(i) % M > 0) {
count++;
}
if (count > 1) {
break;
}
}
if (count <= 1) {
break;
}
M -= 1;
}
cout << M << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = max(A.at(0), A.at(N - 1)); // Mを小さくしていっていくつ割り切るか調べる
while (true) {
int count = 0; // MがAをいくつ割り切れないか数える
for (int i = 0; i < N; i++) {
if (A.at(i) % M > 0) {
count++;
}
if (count > 1) {
break;
}
}
if (count <= 1) {
break;
}
M -= 1;
}
cout << M << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 875,029 | 875,028 | u668650380 | cpp |
p03061 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
int N, A[101010], ans, Al[101010], Ar[101010];
int i, j;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
scanf("%d", &N);
fornum(i, 0, N) { scanf("%d", &A[i]); }
Al[0] = A[0];
Ar[N - 1] = A[N - 1];
fornum(i, 1, N) {
Al[i] = gcd(A[i], Al[i - 1]);
Ar[N - 1 - i] = gcd(A[N - 1 - i], Ar[N - i]);
}
/*
fornum(i,0,N){
printf("%d ", Al[i]);
}
printf("\n");
fornum(i,0,N){
printf("%d ", Ar[i]);
}*/
ans = Ar[1];
if (ans < Al[N - 1])
ans = Al[N - 2];
fornum(i, 1, N - 1) {
int a = gcd(Al[i - 1], Ar[i + 1]);
if (a > ans)
ans = a;
}
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
int N, A[101010], ans, Al[101010], Ar[101010];
int i, j;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
scanf("%d", &N);
fornum(i, 0, N) { scanf("%d", &A[i]); }
Al[0] = A[0];
Ar[N - 1] = A[N - 1];
fornum(i, 1, N) {
Al[i] = gcd(A[i], Al[i - 1]);
Ar[N - 1 - i] = gcd(A[N - 1 - i], Ar[N - i]);
}
/*
fornum(i,0,N){
printf("%d ", Al[i]);
}
printf("\n");
fornum(i,0,N){
printf("%d ", Ar[i]);
}*/
ans = Ar[1];
if (ans < Al[N - 2])
ans = Al[N - 2];
fornum(i, 1, N - 1) {
int a = gcd(Al[i - 1], Ar[i + 1]);
if (a > ans)
ans = a;
}
printf("%d", ans);
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 875,032 | 875,033 | u259396003 | cpp |
p03061 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long LL;
typedef unsigned long UL;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
int count0;
for (int i = a[n]; i > 0; --i) {
count0 = 0;
REP(j, n) {
if (a[j] % i != 0) {
++count0;
if (count0 > 1) {
break;
}
}
}
if (count0 <= 1) {
cout << i << endl;
return 0;
}
}
return 0;
}
| #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long LL;
typedef unsigned long UL;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
int count0;
for (int i = a[1]; i > 0; --i) {
count0 = 0;
REP(j, n) {
if (a[j] % i != 0) {
++count0;
if (count0 > 1) {
break;
}
}
}
if (count0 <= 1) {
cout << i << endl;
return 0;
}
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change"
] | 875,041 | 875,040 | u549268855 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100001];
int b[100001];
int b1[100001];
int sum;
int ans = 0;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
memset(b, 0, sizeof(b));
memset(b1, 0, sizeof(b1));
b[1] = a[1];
b1[n] = a[n];
for (int i = 2; i <= n; i++)
b[i] = __gcd(b[i - 1], a[i]);
for (int i = n - 1; i >= 1; i--)
b1[i] = __gcd(b[i + 1], a[i]);
for (int i = 1; i <= n; i++) {
if (i == 1)
ans = max(ans, b1[2]);
else if (i == n)
ans = max(ans, b[n - 1]);
else
ans = max(ans, __gcd(b[i - 1], b1[i + 1]));
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int a[100001];
int b[100001];
int b1[100001];
int ans = 0;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
memset(b, 0, sizeof(b));
memset(b1, 0, sizeof(b1));
b[1] = a[1];
b1[n] = a[n];
for (int i = 2; i <= n; i++)
b[i] = __gcd(b[i - 1], a[i]);
for (int i = n - 1; i >= 1; i--)
b1[i] = __gcd(b1[i + 1], a[i]);
for (int i = 1; i <= n; i++) {
if (i == 1)
ans = max(ans, b1[2]);
else if (i == n)
ans = max(ans, b[n - 1]);
else
ans = max(ans, __gcd(b[i - 1], b1[i + 1]));
}
printf("%d\n", ans);
return 0;
}
| [
"variable_declaration.remove",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 875,044 | 875,045 | u433665020 | cpp |
p03061 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int gcd(int a, int b) {
int M = std::max(a, b);
int m = std::min(a, b);
if (m == 0) {
return M;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<int> v;
int a;
vector<int> g;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
if (i == 0) {
g.push_back(a);
} else {
g.push_back(gcd(g[i - 1], a));
}
}
vector<int> w = v;
vector<int> wg;
reverse(w.begin(), w.end());
for (int i = 0; i < n; i++) {
if (i == 0) {
wg.push_back(w[0]);
} else {
wg.push_back(gcd(wg[i - 1], w[i]));
}
}
int res = wg[n - 2]; // 一番右を変えたとき
for (int i = n - 2; i > 0; i--) {
int tmp = gcd(g[i - 1], wg[n - i - 2]);
res = std::max(res, tmp);
}
res = std::max(res, wg[n - 2]);
cout << res << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int gcd(int a, int b) {
int M = std::max(a, b);
int m = std::min(a, b);
if (m == 0) {
return M;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
vector<int> v;
int a;
vector<int> g;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
if (i == 0) {
g.push_back(a);
} else {
g.push_back(gcd(g[i - 1], a));
}
}
vector<int> w = v;
vector<int> wg;
reverse(w.begin(), w.end());
for (int i = 0; i < n; i++) {
if (i == 0) {
wg.push_back(w[0]);
} else {
wg.push_back(gcd(wg[i - 1], w[i]));
}
}
int res = g[n - 2]; // 一番右を変えたとき
for (int i = n - 2; i > 0; i--) {
int tmp = gcd(g[i - 1], wg[n - i - 2]);
res = std::max(res, tmp);
}
res = std::max(res, wg[n - 2]);
cout << res << endl;
}
| [
"identifier.change"
] | 875,046 | 875,047 | u713830790 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int m, int n) {
if (n > m)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> f(n), b(n);
f[0] = a[0];
b[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
f[i] = gcd(f[i - 1], a[i]);
for (int i = n - 2; i >= 0; i--)
f[i] = gcd(b[i + 1], a[i]);
int ret = max(f[n - 2], b[1]);
for (int i = 1; i < n - 1; i++)
ret = max(ret, gcd(f[i - 1], b[i + 1]));
cout << ret;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int gcd(int m, int n) {
if (n > m)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> f(n), b(n);
f[0] = a[0];
b[n - 1] = a[n - 1];
for (int i = 1; i < n; i++)
f[i] = gcd(f[i - 1], a[i]);
for (int i = n - 2; i >= 0; i--)
b[i] = gcd(b[i + 1], a[i]);
int ret = max(f[n - 2], b[1]);
for (int i = 1; i < n - 1; i++)
ret = max(ret, gcd(f[i - 1], b[i + 1]));
cout << ret;
return 0;
}
| [
"assignment.variable.change",
"identifier.change"
] | 875,050 | 875,051 | u809153881 | cpp |
p03061 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin); (LoopVariable) < (numberOFend); \
(LoopVariable)++)
#define DEFOR(LoopVariable, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin); (LoopVariable) >= (numberOFend); \
(LoopVariable)--)
#define REP(LoopVariable, numberOFend) \
for (int LoopVariable = 0; (LoopVariable) < (numberOFend); LoopVariable++)
constexpr long long int linf = numeric_limits<long long int>::max() - 5;
constexpr int inf = numeric_limits<int>::max() - 5;
constexpr long long int mod = 1000000007;
int main() {
long long int n;
cin >> n;
vector<long long int> v(n);
REP(i, n) { cin >> v[i]; }
sort(v.begin(), v.end());
long long int cannot_div_num, cannot_div_where;
DEFOR(i, v[0], 2) {
cannot_div_num = 0;
cannot_div_where = -1;
REP(j, n) {
if (v[j] % i) {
if (cannot_div_num == 0) {
cannot_div_num++;
cannot_div_where = i;
} else {
cannot_div_num++;
break;
}
}
}
if (cannot_div_num <= 1) {
cout << i << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//変数デバッグ
#define DEB(variable) cout << #variable << '=' << variable << endl
// for簡易表記(引数ミス防止)
#define FOR(LoopVariable, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin); (LoopVariable) < (numberOFend); \
(LoopVariable)++)
#define DEFOR(LoopVariable, numberOFbegin, numberOFend) \
for (int LoopVariable = (numberOFbegin); (LoopVariable) >= (numberOFend); \
(LoopVariable)--)
#define REP(LoopVariable, numberOFend) \
for (int LoopVariable = 0; (LoopVariable) < (numberOFend); LoopVariable++)
constexpr long long int linf = numeric_limits<long long int>::max() - 5;
constexpr int inf = numeric_limits<int>::max() - 5;
constexpr long long int mod = 1000000007;
int main() {
long long int n;
cin >> n;
vector<long long int> v(n);
REP(i, n) { cin >> v[i]; }
sort(v.begin(), v.end());
long long int cannot_div_num, cannot_div_where;
DEFOR(i, v[1], 2) {
cannot_div_num = 0;
cannot_div_where = -1;
REP(j, n) {
if (v[j] % i) {
if (cannot_div_num == 0) {
cannot_div_num++;
cannot_div_where = i;
} else {
cannot_div_num++;
break;
}
}
}
if (cannot_div_num <= 1) {
cout << i << endl;
return 0;
}
}
cout << 1 << endl;
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 875,052 | 875,053 | u039805629 | cpp |
p03061 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF = 1LL << 58;
const ll MOD = 1000000007;
typedef vector<pii> vpii;
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;
}
int gcd(int a, int b) {
int r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
signed main() {
int N;
vi A;
cin >> N;
A.resize(N);
REP(i, N)
cin >> A[i];
// sort(ALL(A));
vi F, B;
F.resize(N);
B.resize(N);
REP(i, N) {
if (i == 0) {
F[i] = A[i];
B[N - 1 - i] = A[N - 1 - i];
} else {
F[i] = gcd(F[i - 1], A[i]);
B[N - 1 - i] = gcd(B[N - 1 - i + 1], A[N - 1 - i]);
}
}
int ans = 0;
int tmp;
REP(i, N) {
if (i == 0)
tmp = B[1];
else if (i == N - 1)
tmp = B[N - 2];
else
tmp = gcd(F[i - 1], B[i + 1]);
chmax(ans, tmp);
}
cout << ans << endl;
// system("pause");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const ll INF = 1LL << 58;
const ll MOD = 1000000007;
typedef vector<pii> vpii;
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;
}
int gcd(int a, int b) {
int r, tmp;
/* 自然数 a > b を確認・入替 */
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
/* ユークリッドの互除法 */
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
signed main() {
int N;
vi A;
cin >> N;
A.resize(N);
REP(i, N)
cin >> A[i];
// sort(ALL(A));
vi F, B;
F.resize(N);
B.resize(N);
REP(i, N) {
if (i == 0) {
F[i] = A[i];
B[N - 1 - i] = A[N - 1 - i];
} else {
F[i] = gcd(F[i - 1], A[i]);
B[N - 1 - i] = gcd(B[N - 1 - i + 1], A[N - 1 - i]);
}
}
int ans = 0;
int tmp;
REP(i, N) {
if (i == 0)
tmp = B[1];
else if (i == N - 1)
tmp = F[N - 2];
else
tmp = gcd(F[i - 1], B[i + 1]);
chmax(ans, tmp);
}
cout << ans << endl;
// system("pause");
} | [
"assignment.value.change",
"identifier.change"
] | 875,066 | 875,067 | u913836622 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <vector>
//#include <numeric>
using namespace std;
int gcd(int a, int b) {
while (b != 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main(void) {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 2) {
cout << max(A[0], A[1]) << endl;
return 0;
}
vector<int> gcd_l(N), gcd_r(N);
gcd_l[0] = A[0];
gcd_r[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
gcd_l[i] = gcd(gcd_l[i - 1], A[i]);
gcd_r[N - 1 - i] = gcd(gcd_r[N - i], A[N - 1 - i]);
}
int ans = max(gcd_l[N - 2], gcd_r[N - 2]);
for (int i = 1, v; i < N - 1; i++) {
v = gcd(gcd_l[i - 1], gcd_r[i + 1]);
if (v > ans)
ans = v;
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
//#include <numeric>
using namespace std;
int gcd(int a, int b) {
while (b != 0) {
int c = a % b;
a = b;
b = c;
}
return a;
}
int main(void) {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 2) {
cout << max(A[0], A[1]) << endl;
return 0;
}
vector<int> gcd_l(N), gcd_r(N);
gcd_l[0] = A[0];
gcd_r[N - 1] = A[N - 1];
for (int i = 1; i < N; i++) {
gcd_l[i] = gcd(gcd_l[i - 1], A[i]);
gcd_r[N - 1 - i] = gcd(gcd_r[N - i], A[N - 1 - i]);
}
int ans = max(gcd_l[N - 2], gcd_r[1]);
for (int i = 1, v; i < N - 1; i++) {
v = gcd(gcd_l[i - 1], gcd_r[i + 1]);
if (v > ans)
ans = v;
}
cout << ans << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 875,081 | 875,082 | u464397170 | cpp |
p03061 | #include <algorithm>
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
int buf = a;
a = b;
b = buf;
}
return a == 0 ? b : gcd(a, b % a);
}
int main() {
int n;
scanf("%d", &n);
int front[n + 1], back[n + 1], a[n];
for (int i = 0; i < n; i++)
scanf("%d", a + i);
front[0] = 0;
back[n] = 0;
for (int i = 0; i < n; i++) {
front[i + 1] = gcd(front[i], a[i]);
back[n - 1 - i] = gcd(back[n - i], a[n - 1 - i]);
}
int ans = 0;
for (int i = 0; i < n - 1; i++)
ans = max(ans, gcd(front[i], back[i + 1]));
printf("%d\n", ans);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
if (a > b) {
int buf = a;
a = b;
b = buf;
}
return a == 0 ? b : gcd(a, b % a);
}
int main() {
int n;
scanf("%d", &n);
int front[n + 1], back[n + 1], a[n];
for (int i = 0; i < n; i++)
scanf("%d", a + i);
front[0] = 0;
back[n] = 0;
for (int i = 0; i < n; i++) {
front[i + 1] = gcd(front[i], a[i]);
back[n - 1 - i] = gcd(back[n - i], a[n - 1 - i]);
}
int ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, gcd(front[i], back[i + 1]));
printf("%d\n", ans);
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 875,083 | 875,084 | u956758464 | cpp |
p03061 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int n;
cin >> n;
vector<int> A(n);
vector<int> dist(n - 1);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end(), greater<int>());
for (int i = 0; i < n - 1; i++) {
dist[i] = A[i] - A[i + 1];
}
sort(dist.begin(), dist.end());
if (dist.size() <= 1) {
cout << A[0];
} else {
int M = max(dist[1], A[n - 1]);
int ans = 1;
for (int sub = M; sub >= 2; sub--) {
int flag = 0;
for (int i = 0; i < n; i++) {
if (A[i] % sub != 0) {
flag++;
}
if (flag == 2)
break;
}
if (flag <= 1) {
ans = sub;
break;
}
}
cout << ans;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int n;
cin >> n;
vector<int> A(n);
vector<int> dist(n - 1);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end(), greater<int>());
for (int i = 0; i < n - 1; i++) {
dist[i] = A[i] - A[i + 1];
}
sort(dist.begin(), dist.end());
if (dist.size() <= 1) {
cout << A[0];
} else {
int M = max(dist[1], A[n - 2]);
int ans = 1;
for (int sub = M; sub >= 2; sub--) {
int flag = 0;
for (int i = 0; i < n; i++) {
if (A[i] % sub != 0) {
flag++;
}
if (flag == 2)
break;
}
if (flag <= 1) {
ans = sub;
break;
}
}
cout << ans;
}
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 875,087 | 875,088 | u227379863 | cpp |
p03061 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#include <queue>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1e9)
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
template <typename T> int vector_finder(std::vector<T> vec, T number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
int gcd(int a, int b) {
if (b > 0) {
return gcd(b, a % b);
} else {
return a;
}
}
int N;
int main() {
cin >> N;
int A[N];
REP(i, N) { cin >> A[i]; }
int B[N];
int C[N];
B[0] = A[0];
for (int i = 1; i < N; i++) {
B[i] = gcd(B[i - 1], A[i]);
}
C[N - 1] = A[N - 1];
for (int i = N - 1; i >= 0; i--) {
C[i] = gcd(C[i + 1], A[i]);
}
int mx = 0;
REP(i, N) {
int g;
if (i == 0) {
g = C[i + 1];
} else if (i == N) {
g = B[i - 1];
} else {
g = gcd(B[i - 1], C[i + 1]);
}
if (g > mx) {
mx = g;
}
}
cout << mx << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#include <queue>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1e9)
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
template <typename T> int vector_finder(std::vector<T> vec, T number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
int gcd(int a, int b) {
if (b > 0) {
return gcd(b, a % b);
} else {
return a;
}
}
int N;
int main() {
cin >> N;
int A[N];
REP(i, N) { cin >> A[i]; }
int B[N];
int C[N];
B[0] = A[0];
for (int i = 1; i < N; i++) {
B[i] = gcd(B[i - 1], A[i]);
}
C[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--) {
C[i] = gcd(C[i + 1], A[i]);
}
int mx = 0;
REP(i, N) {
int g;
if (i == 0) {
g = C[i + 1];
} else if (i == N) {
g = B[i - 1];
} else {
g = gcd(B[i - 1], C[i + 1]);
}
if (g > mx) {
mx = g;
}
}
cout << mx << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 875,099 | 875,100 | u185294445 | cpp |
p03061 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int gcd(int a, int b) { return (b ? gcd(b, a % b) : a); }
int main() {
int n;
cin >> n;
int a[100005];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int g_l[100005], g_r[100005];
int g = a[0];
for (int i = 0; i < n; i++) {
g = gcd(g, a[i]);
g_l[i] = g;
}
g = a[n - 1];
for (int i = 0; i < n; i++) {
g = gcd(g, a[n - 1 - i]);
g_r[n - 1 - i] = g;
}
int ans = g_r[1];
for (int i = 0; i < n - 1; i++) {
ans = max(ans, gcd(g_l[i - 1], g_r[i + 1]));
}
max(ans, g_l[n - 2]);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int gcd(int a, int b) { return (b ? gcd(b, a % b) : a); }
int main() {
int n;
cin >> n;
int a[100005];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int g_l[100005], g_r[100005];
int g = a[0];
for (int i = 0; i < n; i++) {
g = gcd(g, a[i]);
g_l[i] = g;
}
g = a[n - 1];
for (int i = 0; i < n; i++) {
g = gcd(g, a[n - 1 - i]);
g_r[n - 1 - i] = g;
}
int ans = g_r[1];
for (int i = 0; i < n - 1; i++) {
ans = max(ans, gcd(g_l[i - 1], g_r[i + 1]));
}
ans = max(ans, g_l[n - 2]);
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 875,104 | 875,105 | u620735210 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.