1000个数字,给出1e9的k,问你其中选数字序列使得乘积为k的种类
dp[k]乘积为k的种类
看似是很大的,其实只需要看k的因子就好.
乘法 <-> 因子 算是个套路吧
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#ifdef noob
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
#else
#define debug(...)
#endif
using namespace std;
typedef long long LL;
const int MAXN = 2e5 + 17;
const int MOD = 1e9 + 7;
LL a[MAXN];
int main()
{
#ifdef noob
freopen("Input.txt","r", stdin);
freopen("Output.txt", "w", stdout);
#endif
int t;
cin>>t;
while(t--)
{
int n,k;
cin>>n>>k;
for (int i = 0; i < n; ++i)
{
cin>>a[i];
}
vector<LL > vec;
for (int i = 1; i*i <= k; ++i)
{
if(k%i==0)
{
vec.push_back(i);
if((k/i)!=i) vec.push_back(k/i);
}
}
sort(vec.begin(),vec.end());
map<LL,LL > mp;
for(auto i : vec)
mp[i] = 0;
// mp[1] = 1;
for (int i = 0; i < n; ++i)
{
for (int j = vec.size()-1; j > -1; --j)
{
int p = vec[j];
if(p%a[i]==0)
mp[p] = (mp[p]+mp[p/a[i]])%MOD;
}
mp[a[i]]++;
debug(i);
for(auto j: mp)
{
debug(j.first);
debug(j.second);
}
}
debug(mp[k]);
cout<<mp[k]<<endl;
}
return 0;
}