codeforce 829C

Pride

Prev Submit Status Statistics Next
You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd denotes the greatest common divisor.

What is the minimum number of operations you need to make all of the elements equal to 1?

Input
The first line of the input contains one integer n (1 ≤ n ≤ 2000) — the number of elements in the array.

The second line contains n space separated integers a1, a2, …, an (1 ≤ ai ≤ 109) — the elements of the array.

Output
Print -1, if it is impossible to turn all numbers to 1. Otherwise, print the minimum number of operations needed to make all numbers equal to 1.

Sample Input
Input
5
2 2 3 4 6
Output
5
Input
4
2 4 6 8
Output
-1
Input
3
2 6 9
Output
4
Hint
In the first sample you can turn all numbers to 1 using the following 5 moves:

[2, 2, 3, 4, 6].
[2, 1, 3, 4, 6]
[2, 1, 3, 1, 6]
[2, 1, 1, 1, 6]
[1, 1, 1, 1, 6]
[1, 1, 1, 1, 1]
We can prove that in this case it is not possible to make all numbers one using less than 5 moves.
写c都想到找一还是懒了看了别人实现
题意:
取连个连续的数字求GCD,替换其中一个数字,求把所有数字变成1的最小操作数;
解;
找1

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll gcd(ll x,ll y)
{
    return x%y==0?y:gcd(y,x%y);
}
int main()
{
    ll a[2222],i,j,n;
    while(cin>>n)
    {
        ll cnt=0;
        for(i=0;i<n;i++)
        {
            scanf("%lld",a+i);
            if(a[i]==1)
                cnt++;
        }
        if(cnt)
        {
            printf("%lld\n",n-cnt);
        }
        else
        {
            cnt=0;
            ll mm=(ll)1e18;
            for(i=0;i<n;i++)
            {
                cnt=0;
                ll tmp=a[i];
                for(j=i+1;j<n;j++)
                {
                    tmp=gcd(tmp,a[j]);
                    if(tmp==1)
                    {
                        mm=min(j-i,mm);
                        break;
                    }
                }
            }
            if(mm==(ll)1e18)
                puts("-1");
            else
            printf("%lld\n",mm+n-1);
        }
    }
    return 0;
}