Fox And Jumping（0-1背包）

原题链接
B. Fox And Jumping
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

Examples
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就可以前往任意你想去的地方

#include <cstdio>
#include <iostream>
#include <map>
#include <cstring>
#include <algorithm>
using namespace std;
map<int,int> dp;//创建一个map类型的结构，用来存储所有可能的公约数以及得到该公约数的最小花费数,否则如果哈希列举最大公约数的话会存不下这么大的数组
//a[i]=c;i是某个可能的最小公约数，c是花费
int gcd(int a,int b){//传入的时候不用保证a>=b都可以
    return b==0 ? a:gcd(b,a%b);
}
int l[303],c[303];
int main(){
        int n;
        cin >> n;
        for(int i=0;i<n;i++)
                scanf("%d",&l[i]);
        for(int i=0;i<n;i++)
                scanf("%d",&c[i]);
        dp.clear();
        dp[0]=0;//因为无论哪个数和0求公约数都会使这个数存进map型的dp中去
        map<int,int>::iterator it;
        for(int i=0;i<n;i++){//保证给出的这n个数字全都已经算过了
                for(it=dp.begin();it!=dp.end();it++){
                        int t=it->first;//找到其中的一个公约数，它的映射已经接近最优解了
                        int tt=gcd(t,l[i]);//将当前的数字与该公约数求公约数
                        if(dp.count(tt))//如果新的公约数已经出现过了那么就更新下得到这个公约数的最小费用
                                dp[tt]=min(dp[tt],it->second + c[i]);
                        else//如果没有出现过那么现在就会出现了
                                dp[tt]=it->second + c[i];
                }
        }
        if(!dp[1]) printf("-1\n");
        else printf("%d\n",dp[1]);
        return 0;
}