Contest Duration: - (local time) (100 minutes) Back to Home

Submission #5169357

Source Code Expand

Copy
```#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
（ ´_ゝ`）　/　 ⌒i
／　　　＼　 　  |　|
/　　 /￣￣￣￣/　　|
＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/

int N, A[101010];
int lft[101010], rht[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, N) cin >> A[i];

lft[0] = A[0];
rep(i, 1, N) lft[i] = gcd(lft[i - 1], A[i]);

rht[N - 1] = A[N - 1];
rrep(i, N - 2, 0) rht[i] = gcd(rht[i + 1], A[i]);

int ans = 0;
rep(i, 0, N) {
int g = 0;
if (0 < i) g = gcd(g, lft[i - 1]);
g = gcd(g, rht[i + 1]);
chmax(ans, g);
}
cout << ans << endl;
}
```

#### Submission Info

Submission Time 2019-04-28 08:54:21+0900 C - GCD on Blackboard hamayanhamayan C++14 (GCC 5.4.1) 300 1826 Byte AC 13 ms 1408 KB

#### Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
 AC × 16
 AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_01 AC 8 ms 1024 KB
testcase_02 AC 12 ms 1408 KB
testcase_03 AC 1 ms 256 KB
testcase_04 AC 13 ms 1408 KB
testcase_05 AC 8 ms 1408 KB
testcase_06 AC 12 ms 1408 KB
testcase_07 AC 1 ms 256 KB
testcase_08 AC 1 ms 256 KB
testcase_09 AC 11 ms 1408 KB
testcase_10 AC 12 ms 1408 KB
testcase_11 AC 11 ms 1408 KB
testcase_12 AC 2 ms 256 KB
testcase_13 AC 1 ms 256 KB