acm培训课件特殊的数.pptxVIP

ACM程序设计杭州电子科技大学 刘春英acm@劳动节，劳动你 了吗？每周一星（9）：/userstatus.php?user=kewenyucky-/userstatus.php?user=keweny牙 第十讲特殊的数（Special Number）Fibonacci NumberThe series begins with 0 and 1. After that, use the simple rule: Add the last two numbers to get the next. 0 , 1 , 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,... Leonardo Fibonacci 1175-1250 Where this came from? Key Words:1225; Pisa;Fibonacci Frederick II;Math Competition.JanuaryFebruaryMarchAprilMay、June…???The number series is——1、1、2、3、5…This is fibonacci number！Some other picturesFibonacci Golden SectionFibonacci plantsFibonacci plantsFibonacci plantsFibonacci plantssunflowers （向日葵）Question: 编程实现这类递归问题时应该注意什么问题？空间 换 时间！！Catalan numbeDOJ/showproblem.php?pid=1134_1134: Game of Connections Catalan Number Catalan numbers (1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, ...)(1814—1894 Belgium)Catalan数有哪些应用?1. 多边形的三角剖分数目 4 sides, 2 ways5 sides, 5 ways6 sides, 14 ways7 sides, 42 ways:2. 加括号的方式数目3 numbers: (1 (2 3)) ((1 2) 3)4 numbers: (1 (2 (3 4))) (1 ((2 3) 4)) ((1 2) (3 4)) ((1 (2 3)) 4) (((1 2) 3) 4) (1 (2 (3 (4 5)))) (1 (2 ((3 4) 5))) (1 ((2 3) (4 5))) (1 ((2 (3 4)) 5)) (1 (((2 3) 4) 5)) ((1 2) (3 (4 5))) ((1 2) ((3 4) 5)) ((1 (2 3)) (4 5)) ((1 (2 (3 4))) 5) ((1 ((2 3) 4)) 5) (((1 2) 3) (4 5)) (((1 2) (3 4)) 5) (((1 (2 3)) 4) 5) ((((1 2) 3) 4) 5) 3.the number of rooted, trivalent trees with n+1 nodes 3 nodes:4 nodes:5 nodes: 4. the number of paths of length 2n through an n-by-n grid that do not rise above the main diagonal 2 x 2 grid:3 x 3 grid: 4 x 4 grid: 5. 不同形态二叉树的数目 There are 5 binary trees with 3 nodes.6. 其它应用（1）The number of ways 2n people, seated round a table, can shake hands in n pairs, without their arms crossing. （2）The self-convolving sequence, c[0]=1, c[n+1] = c[0]c[n] + c[1]c[n-1] + ... + c[n]c[0] (3) The recurring sequence c[0]=1, (n+2)c[n+1] = (4n+2)c[n], (n=0). (4)Another disguise is the number of w