这是一道关于计算硬币排列问题的算法题目，要求确定在随机放置的n个硬币中，有多少种情况会出现连续m个硬币正面朝上的情况。使用动态规划方法（dp）解决，通过状态转移方程找到符合条件的硬币序列数量。
题面：
Coins
Problem Description:
Duoxida buys a bottle of MaiDong from a vending machine and the machine give her n coins back. She places them in a line randomly showing head face or tail face on. And Duoxida wants to know how many situations that m continuous coins head face on among all possible situations. Two situations are considered different if and only if there is at least one position that the coins' faces are different.
Input
The first line contains a integer T(no more than 20) which represents the number of test cases.
In each test case, a line contains two integers n and m.()
Output
For each test case, output the result modulo
最低0.47元/天 解锁文章
扫一扫
1660
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
