Codeforces Round #446 (Div. 2) C Pride

推规律

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 2000 + 7, maxd = (1<<18)-1, mod = 1000003;
const int INF = 0x7f7f7f7f;

int n;
int a[maxn];

int gcd(int a, int b) {
    return b == 0 ? (a) : (gcd(b, a%b));
}

int main() {

    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
    }
    int ans = INF;
    int cnt = 0;
    for(int i = 1; i <= n; ++i) {
        if(a[i] == 1) cnt++;
    }
    if(cnt) {
        cout << (n-cnt) << endl;
        return 0;
    }
    for(int i = 1; i <= n; ++i) {
        int t = 0;
        for(int j = i; j <= n; ++j) {
            t = gcd(t, a[j]);
            if(t == 1) {
                ans = min(ans, j-i);
                if(ans <= 1) break;
            }
        }
    }
    if(ans == INF) puts("-1");
    else printf("%d\n", ans+n-1);

    return 0;
}