- 博客(4)
- 收藏
- 关注
原创 Codeforces Round #449 (Div. 2) D(思维)
DescriptionThis is an interactive problem. Refer to the Interaction section below for better understanding.Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.I
2017-12-04 18:14:20 190
原创 Codeforces Round #449 div2 C(递归求解)
DescriptionWhat are you doing at the end of the world? Are you busy? Will you save us? Nephren is playing a game with little leprechauns.She gives them an infinite array of strings, f0… ∞.f0 is “What
2017-12-03 21:46:36 241
原创 51nod 1383 整数分解为2的幂(递推)
Description任何正整数都能分解成2的幂,给定整数N,求N的此类划分方法的数量!由于方案数量较大,输出Mod 1000000007的结果。 比如N = 7时,共有6种划分方法。7=1+1+1+1+1+1+1 =1+1+1+1+1+2 =1+1+1+2+2 =1+2+2+2 =1+1+1+4 =1+2+4Input输入一个数N(1 <= N <= 10^6)Ou
2017-12-02 21:22:32 206
原创 51nod 1639 绑鞋带(递推)
Description有n根鞋带混在一起,现在重复n次以下操作:随机抽出两个鞋带头,把它们绑在一起。可以想象,这n次之后將不再有单独的鞋带头,n条鞋带系成了一些环。那么有多大概率刚好所有这些鞋带只形成了一个环?Input仅一行,包含一个整数n (2<=n<=1000)。Output输出一行,为刚好成环的概率。Input示例2 Output示例0.666667 解题思路假设ans[i-1]为i-1根
2017-12-02 20:49:52 216
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人