Codeforces-891A Pride（GCD&&思维）

A. Pride
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Examples
input
5
2 2 3 4 6
output
5
input
4
2 4 6 8
output
-1
input
3
2 6 9
output
4
Note
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.

---

题目大意：给你一个序列，每次可以选两个相邻的数，取最大公约数，然后将最大公约数替换其中一个数。问最少操作几次可以将所有数都变为1。

---

解题思路：
1，如果序列中出现num个1，那么只需要经过n-num次操作，就可以把整个序列全部变成1。
2，gcd(gcd(a,b),c) == gcd(gcd(a,b),gcd(b,c));

---

#include<bits/stdc++.h>
using namespace std;
const int MAX = 1e6+10;
const int INF = 0x3fffffff;
int a[MAX];
int gcd(int a,int b){
     return b==0?a:gcd(b,a%b);
}
int main()  
{  
    int n;
    while(scanf("%d",&n)!=EOF){
        int num=0;
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            if(a[i]==1) num++;
        }
        if(num!=0){
            cout<<n-num<<endl;
            continue;
        }
        int flag = 0;  
        for(int i=1;i<n;i++){  
            for(int j=0;j<n-i;j++){  
                a[j]=gcd(a[j],a[j+1]);  
                if(a[j]==1){  
                    cout<<i+n-1<<endl;
                    flag=1;  
                    break;  
                }   
            }  
            if(flag)  
                break;  
        }  
        if(!flag)  
            cout<<"-1"<<endl;
    } 
    return 0;  
}