CF 402-D 贪心

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
#define N 40003
int gcd(int a, int b)
{
if(b==0) return a;
return gcd(b, a%b);
}
int a[5500], b[5500], g[5500];
int prime
, isprime
, cnt;
int n,m;

int calc(int num)
{
int res = 0;
for(int j=1; j<=m & num>=b[j]; ++j)
if(num%b[j] == 0)
{
do{
num /= b[j];
--res;
}while(num%b[j] == 0);
}
for(int j=0; (long long)prime[j]*prime[j]<=num; ++j)
if(num%prime[j] == 0)
{
do{
++res;
num /= prime[j];
}while(num%prime[j] == 0);
}
if(num>1) res++;
return res;
}
int main ()
{
for(int i=2; i<N; ++i)
if(!isprime[i])
{
prime[cnt++] = i;
for(int j=i; j<N; j+=i)
isprime[j] = 1;
}
scanf("%d%d", &n, &m);
for(int i=1; i<=n; ++i) scanf("%d", &a[i]);
for(int i=1; i<=m; ++i) scanf("%d", &b[i]);

g[1] = a[1];
for(int i=2; i<=n; ++i) g[i] = gcd(a[i], g[i-1]);
int ans = 0;
for(int i=n, di=1; i>=1; --i)
{
g[i] /= di;
if(calc(g[i]) <= 0) di *= g[i];
a[i] /= di;
ans += calc(a[i]);
}

printf("%d\n", ans);
return 0;
}