10.27模拟赛T2

愚蠢的朴素dp比较好写，注意到唯一的瓶颈就在于状态太大，考虑离散

不能整除k的因子可以过滤掉，然后把因子放进map里面，reverse_iterator遍历一遍用朴素dp方程

$$dp[i][j]=dp[i-1][j]$$

$$dp[i][j]+=dp[i-1][j/u]$$

就好了

Code:

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <map>
#include <algorithm>
#define qy 1000000007
#define MAXN 100000
using namespace std;
typedef map <int, int> Map;

Map factor;
Map :: reverse_iterator it;
int n, k;

inline int read () {
	register int s = 0, w = 1;
	register char ch = getchar ();
	while (! isdigit (ch)) {if (ch == '-') w = -1; ch = getchar ();}
	while (isdigit (ch)) {s = (s << 3) + (s << 1) + (ch ^ 48); ch = getchar ();}
	return s * w;
}

inline void getfactor (int k) {
	for (register int i = 1; i <= floor (sqrt (k)); i++) 
		if (k % i == 0) factor[i] = factor[k / i] = 0;
}

int main () {
	int T = read ();
	for (register int I = 1; I <= T; I++) {
		n = read (), k = read (), factor.clear ();
		getfactor (k), factor[1] = 1;
		for (register int i = 1; i <= n; i++) {
			int x = read (); if (k % x) continue;
			for (it = factor.rbegin (); it != factor.rend (); it++)
				if (it -> first >= x && it -> first % x == 0)
					it -> second = (it -> second + factor[it -> first / x]) % qy;
		}
		printf ("%d\n", factor[k]);
	}
	return 0;
}