acm
qq_39578411
这个作者很懒,什么都没留下…
展开
-
钱币兑换问题
Problem Description在一个国家仅有1分,2分,3分硬币,将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。Input每行只有一个正整数N,N小于32768。Output对应每个输入,输出兑换方法数。Sample Input293412553Sample Output71883113137761AuthorSmallBeer(CML)Source杭电ACM集训队训练赛(...转载 2018-04-24 10:48:42 · 2065 阅读 · 0 评论 -
版权声明:转载请注明http://blog.csdn.net/blue_skyrim https://blog.csdn.net/blue_skyrim/article/details/5125389
题目描述 You have been given a circle from 0 to n - 1. If you are currently at x, you will move to (x - 1) mod n or (x + 1) mod n with equal probability. Now we want to know the expected number of steps y...转载 2018-04-21 19:50:01 · 217 阅读 · 0 评论