Fox And Jumping

 1 #include<cstdio>
 2 #include<map>
 3 #include<iostream>
 4 #define LL long long
 5 using namespace std;
 6 int n;
 7 int a[305];
 8 int b[305];
 9 map<int,int> dp;
10 map<int,int>::iterator it;
11 int gcd(int a,int b){
12     return b==0?a:gcd(b,a%b);
13 }
14 int main(void){
15     scanf("%d",&n);
16     for(int i=0;i<n;++i)scanf("%d",a+i);
17     for(int i=0;i<n;++i)scanf("%d",b+i);
18     for(int i=0;i<n;++i){
19         if(dp.count(a[i]))dp[a[i]]=min(dp[a[i]],b[i]);
20         else dp[a[i]]=b[i];
21         for(it=dp.begin();it!=dp.end();++it){
22             int temp=gcd(a[i],it->first);
23             if(dp.count(temp))dp[temp]=min(dp[temp],dp[a[i]]+it->second);
24             else dp[temp]=dp[a[i]]+it->second;
25         }
26     }
27     if(dp.count(1))printf("%d\n",dp[1]);
28     else printf("-1\n");
29 }