CodeForces - 892C(gcd)

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.

Example

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时,则gcd(1,s[i])最优。如果没有1,要凑出一个1.
gcd(gcd(a,b),gcd(b,c))=gcd(gcd(a,b),c)=gcd(a,gcd(b,c))

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <functional>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int MAXN=1e6+10;
const int MAX=1e6+10;
const double eps=1e-6;


int n;
int s[MAX];

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

int main(){
    #ifdef ONLINE_JUDGE
    #else
    freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    #endif

    int ans=0,cnt=0;
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%d",&s[i]);
        if(s[i]==1)
            cnt++;
    }
    if(cnt!=0){
        cout<<n-cnt<<endl;
        return 0;
    }
    int id=-1,juge=0;
    for(int i=1;i<n;i++){
        for(int j=1;j<n;j++){
            int temp=gcd(s[j],s[j+1]);
            s[j]=temp;
            if(temp==1){
                id=i;juge=1;
                break;
            }
        }
        if(juge)    break;
    }
    if(id==-1)  cout<<-1<<endl;
    else    cout<<id+n-1<<endl;

    return 0;   
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值