# Pride （思维）

## Pride

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.

code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int gcd(int a,int b){
if(b == 0) return a;
else return gcd(b,a%b);
}
int main(){
int n;
int a[5200];
scanf("%d",&n);
int cnt = 0;
for(int i = 1; i <= n; i++){
scanf("%d",&a[i]);
if(a[i] == 1) cnt++;
}
if(cnt){
cout << n-cnt << endl;
return 0;
}
int mint = 99999999;
for(int i = 1; i <= n; i++){
int x = a[i];
cnt = 0;
for(int j = i+1; j <= n; j++){
cnt++;
x = gcd(x,a[j]);
if(x == 1) break;
}
if(x == 1)
mint = min(mint,cnt);
}
if(mint == 99999999)
cout << "-1" << endl;
else
cout << n-1+mint << endl;
return 0;
}


#### Pride and Prejudice .pdf

2012年02月17日 1.08MB 下载

#### cf891A Pride 题解

2017-11-18 12:00:37

#### Codeforces 892C.Pride

2017-11-18 15:42:27

#### Codeforces 892 C. Pride （枚举）

2017-11-18 11:17:52

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

2017-11-30 12:24:08

#### 【思维】Codeforces892C Pride

2017-11-25 12:45:45

#### poj1828-Monkeys' Pride

2011-08-15 23:53:51

#### CodeForces - 892C Pride GCD

2017-11-24 10:06:43

#### Pride and Prejudice 43-45

2007年07月27日 7.87MB 下载

#### codeforces 891-A. Pride Codeforces Round #446 (Div. 2) C. Pride

2017-11-18 02:02:56