CF27E Number With The Given Amount Of Divisors

知识点:因子个数就是,记素数次数为 c i c_i ci​,因子个数= c i + 1 相乘 {c_{i}+1}相乘 ci​+1相乘 然后,理性思考,选出来的 c i c_i ci​应该是一个非递增的序列,如果递增的话,显然让前边的数字更大,这样整数会更小.

#include
using namespace std;
const int maxn = 1e6+5;
const int INF = 1e9+7;
typedef long long ll;
typedef pair pii;
#define all(a) (a).begin(), (a).end()
#define pb(a) push_back(a)
vector G[maxn];
//前向星
// for(int i=head[u];i!=-1;i=nxt[i]) v = to[i]
//int nxt[maxn],head[maxn],to[maxn];// head[u],cnt 初始值是-1
//int tot = -1;
//void add(int u,int v){
//	nxt[++tot] = head[u];
//	head[u] = tot;
//	to[tot] = v;
//}
#define int long long
ll f_pow(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1) res = res*a;
		b>>=1;a=a*a;
	}
	return res;
}
ll pr [] = {0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
ll ans = 1e18+7;ll n;
void dfs(ll now,ll cnt,int p,int mx){
	if(now16) return ;
	for(int i = 1;i>n;
	dfs(1LL,1,1,64);
	cout