摘要:
2017-08-10 21:10:08 writer:pprp 标解: 标解中组合数是用杨辉三角求解的 杨辉三角dp法 dp[i][j]=dp[i-1][j-1]+dp[i-1][j] O(n^2)~O(1) 阅读全文
摘要:
恢复内容开始 2017-08-10 20:32:37 writer:pprp 题意如下: Recently in Teddy's hometown there is a competition named "Cow Year Blow Cow".N competitors had took part 阅读全文
摘要:
2017-08-10 20:32:37 writer:pprp 题意如下: Recently in Teddy's hometown there is a competition named "Cow Year Blow Cow".N competitors had took part in thi 阅读全文
摘要:
恢复内容开始 2017-08-10 20:00:45 writer:pprp 拆分数: 把正整数n拆分成k个正整数之和的方案数; 问题转换:将1转化为2 1、把n表示成m个正整数之和的方案数 2、把n表示成不超过m的正整数之和的方案数 两者答案相同:解释Ferrers图 用dp来做,dp[i][j] 阅读全文
摘要:
2017-08-10 19:35:32 整理者:pprp 用于计算C(m,n) % p 代码如下: 阅读全文