摘要：
"hdu 4658 Integer Partition" 题意 n分拆成若干个正整数的和，每个正整数出现小于k次，分拆方案有多少。（ti){f=0;break;} if(j%2)B[i]=(B[i]+B[i w])%mod; else B[i]=(B[i] B[i w]+mod)%mod; } wh 阅读全文
摘要：
"hdu 5628 Clarke and math" 题意 Given f(i),1≤i≤n, calculate $\displaystyle g(i) = \sum_{i_1 \mid i} \sum_{i_2 \mid i_1} \sum_{i_3 \mid i_2} \cdots \sum_ 阅读全文