大数
youranstray
这个作者很懒,什么都没留下…
展开
-
poj1503 Integer Inquiry
题目描述: Description One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbe原创 2012-08-31 21:25:42 · 159 阅读 · 0 评论 -
卡特兰数(2)
原博客:http://www.cnblogs.com/buptLizer/archive/2011/10/23/2222027.html 卡特兰数: 1 通项公式:h(n)=C(n,2n)/(n+1)=(2n)!/((n!)*(n+1)!) 2递推公式:h(n)=((4*n-2)/(n+1))*h(n-1); h(n)=h(0)*h(n-1转载 2012-09-04 09:43:47 · 1508 阅读 · 0 评论 -
HDU1134——Game of Connections
题目描述: Problem Description This is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, ... , 2n - 1, 2n consecutively in clockwise order on the ground to form a circle, and原创 2012-09-03 22:49:12 · 683 阅读 · 0 评论