Codeforces Round #290 D. Fox And Jumping

点击打开链接

D. Fox And Jumping

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.

There are also n cards, each card has 2 attributes: length li and cost ci. If she pays ci dollars then she can apply i-th card. After applying i-th card she becomes able to make jumps of length li, i. e. from cell x to cell (x - li) or cell (x + li).

She wants to be able to jump to any cell on the tape (possibly, visiting some intermediate cells). For achieving this goal, she wants to buy some cards, paying as little money as possible.

If this is possible, calculate the minimal cost.

Input

The first line contains an integer n (1 ≤ n ≤ 300), number of cards.

The second line contains n numbers li (1 ≤ li ≤ 109), the jump lengths of cards.

The third line contains n numbers ci (1 ≤ ci ≤ 105), the costs of cards.

Output

If it is impossible to buy some cards and become able to jump to any cell, output -1. Otherwise output the minimal cost of buying such set of cards.

Sample test(s)

input

3
100 99 9900
1 1 1

output

2

input

5
10 20 30 40 50
1 1 1 1 1

output

-1

input

7
15015 10010 6006 4290 2730 2310 1
1 1 1 1 1 1 10

output

6

input

8
4264 4921 6321 6984 2316 8432 6120 1026
4264 4921 6321 6984 2316 8432 6120 1026

output

7237

Note

In first sample test, buying one card is not enough: for example, if you buy a card with length 100, you can't jump to any cell whose index is not a multiple of 100. The best way is to buy first and second card, that will make you be able to jump to any cell.

In the second sample test, even if you buy all cards, you can't jump to any cell whose index is not a multiple of 10, so you should output -1.

在一个数轴上，你可以买一些卡片，每个卡片都有一个距离值（可像左跳也可向右跳）和一个花费，要求买任意卡片使你可以到达数轴上任意点，求最小花费。

要到达任意点，即找出几个卡片能够跳1步，也就是这几个卡片的最大公约数是1，然后从能够构成最大公约数为1的卡片中找出花费最小的。

//124 ms	140 KB
#include<stdio.h>
#include<map>
#define ll long long
using namespace std;
ll l[307],c[307];
map<ll,ll>mp;
ll gcd(ll a,ll b)
{
    return b==0?a:gcd(b,a%b);
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0; i<n; i++)
            scanf("%lld",&l[i]);
        for(int i=0; i<n; i++)
            scanf("%lld",&c[i]);
        mp.clear();
        mp[0]=0;
        map<ll,ll>::iterator it;
        for(int i=0;i<n; i++)//保证这个n个数只出现一次
        {
            for(it=mp.begin(); it!=mp.end(); it++)//遍历所有情况
            {
                int tt=it->first;
                ll a=gcd(tt,l[i]);
                if(mp.count(a))mp[a]=min(mp[a],it->second+c[i]);//如果出现过，取最小值
                else mp[a]=it->second+c[i];//如果没有出现过
            }
        }
        if(!mp[1])printf("-1\n");
        else printf("%lld\n",mp[1]);
    }
}