编程介的小学生
2019-01-19 23:20
采纳率: 15.6%
浏览 312

人是组织架构的问题,遍历多叉树得到代理人的统计,使用C语言怎么计算

Problem Description
War is cruel .Every one has a boss except LvBu. LvBu want to rally the troops to make his army stronger .
The rule is: everyone may have 0~2 deputy generals and must have only one boss(except LvBu).Everyone has his own level(all levels are different),and his deputy generals' level must less than his. You can assume no one is more levelful than LvBu.
For example , LvBu's level is 4,ChenGong's level is 3,ZhangLiao's level is 2 and GaoShun's level is 1.So,We can make five way :

Now ,give you the number of generals in LvBu's army.Please tell me the number of possible methods?
The answer might be very large. Output your answers mod k.

Input
Each line contains two integers n and k, indicating the number of LvBu's generals (including LvBu).
1<= n <= 1000;2<=k<=1,000,000,000

Output
For each case, output an answer mod k.

Sample Input
1 10007
2 10007
3 10007
4 10007

Sample Output
1
1
2
5

1条回答 默认 最新

相关推荐 更多相似问题