【bzoj 1025】游戏

传送门~

解题思路

每个元素相当于一个入度、初读均为一的点，他们构成若干个环，且环大小之和为n。
于是问题转化成求所有和为n的序列可能的lcm有多少种。
可以证明，对于任意数$x$=$p1$^$a1*p2$^$a2*$…$*pn$^$an$，
若x为可行解之一，则必有：$p1$^$a1$+$p2$^$a2$+…+$pn$^$an<=n$
于是可以Dp，先预处理所有质数，$f[i][j]$表示前$i$个质数，和为$j$的方案数.
代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#define ll long long
using namespace std;
ll prime[205]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
ll f[205][1005];
ll n,ans;
int main(){
    scanf("%lld",&n);
    f[0][0]=1;
    for(ll i=1;i<=168;i++)
     for(ll j=0;j<=n;j++){
        f[i][j]=f[i-1][j];  
        for(ll k=prime[i];j-k>=0;k*=prime[i]) f[i][j]+=f[i-1][j-k];
     }

    for(ll i=0;i<=n;i++) ans+=f[168][i];
    printf("%lld",ans);
    return 0;
}