当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
3240：Counting Binary Trees
题目描述
There are 5 distinct binary trees of 3 nodes:
Let T(n) be the number of distinct non-empty binary trees of no more than n nodes, your task is to calculate T(n) mod m.
Let T(n) be the number of distinct non-empty binary trees of no more than n nodes, your task is to calculate T(n) mod m.
输入解释
The input contains at most 10 test cases. Each case contains two integers n and m (1 <= n <= 100,000, 1 <= m <= 109) on a single line. The input ends with n = m = 0.
输出解释
For each test case, print T(n) mod m.
输入样例
3 100 4 10 0 0
输出样例
8 2
来自杭电HDUOJ的附加信息
| Recommend | zhonglihua |
最后修改于 2020-10-25T23:01:33+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 6000/3000MS(Java/Others) | 32768/32768K(Java/Others) |
登陆或注册以提交代码