CF510 D

题意：n个数中任取几个数，使之GCD = 1，且权值最小

思路：暴力。。 这种方法挺好。。 学习了。。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#include<string.h>
#include<numeric>
#include<cmath>
#include<stdlib.h>
#include<vector>
#include<stack>
#include<set>
#define FOR(x, b, e)  for(int x=b;x<=(e);x++)
#define REP(x, n)     for(int x=0;x<(n);x++)
#define INF 1e7
#define MAXN 100010
#define maxn 1000010
#define Mod 1000007
#define N 110
using namespace std;
typedef long long LL;

int main()
{
    int n, tmp;
    cin >> n;
    vector<int> l, c;
    REP(i, n) {
        cin >> tmp;
        l.push_back(tmp);
    }
    REP(i, n) {
        cin >> tmp;
        c.push_back(tmp);
    }
    map<int, int> Gcd;
    Gcd[0] = 0;
    REP(i, n) {
        for (map<int, int> :: iterator it = Gcd.begin();it != Gcd.end(); ++ it) {
            int g = __gcd((*it).first,l[i]);
            Gcd[g] = min(Gcd[g] ? Gcd[g]:1<<29, (*it).second + c[i]);
        }
    }
    if (Gcd[1] == 0) 
        cout << -1 << endl;
    else 
        cout << Gcd[1] << endl;
    return 0;
}