2012年3月21日

HDU 1023 Train Problem II （卡特兰数问题）

摘要： Train Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2830Accepted Submission(s): 1562Problem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing o 阅读全文

posted @ 2012-03-21 21:05 kuangbin 阅读(3716) 评论(0) 推荐(1) 编辑

卡特兰数总结

摘要： 卡特兰数又称卡塔兰数，是组合数学中一个常出现在各种计数问题中出现的数列。由以比利时的数学家欧仁·查理·卡塔兰 (1814–1894)命名。卡特兰数前几项为 （OEIS中的数列A000108）: 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904 阅读全文

posted @ 2012-03-21 21:02 kuangbin 阅读(3058) 评论(0) 推荐(1) 编辑

HDU 1015 Safecracker （枚举）

摘要： SafecrackerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3713Accepted Submission(s): 1919Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Kle 阅读全文

posted @ 2012-03-21 19:07 kuangbin 阅读(1692) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: