摘要: C - Crazy Calendar Time Limit:4000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1393 C - Crazy Calendar Submit St 阅读全文
posted @ 2016-04-20 22:00 Ritchie丶 阅读(249) 评论(0) 推荐(0)
摘要: 这题没名字 这题没名字 Problem:I Time Limit:2000ms Memory Limit:65535K Problem:I Time Limit:2000ms Memory Limit:65535K Problem:I Problem:I Time Limit:2000ms Time 阅读全文
posted @ 2016-04-17 17:56 Ritchie丶 阅读(190) 评论(0) 推荐(0)
摘要: Function1 Function1 Problem:F Time Limit:1000ms Memory Limit:65535K Problem:F Time Limit:1000ms Memory Limit:65535K Problem:F Problem:F Time Limit:100 阅读全文
posted @ 2016-04-17 17:52 Ritchie丶 阅读(170) 评论(0) 推荐(0)
摘要: HK HK Problem:B Time Limit:2000ms Memory Limit:65535K Problem:B Time Limit:2000ms Memory Limit:65535K Problem:B Problem:B Time Limit:2000ms Time Limit 阅读全文
posted @ 2016-04-17 17:48 Ritchie丶 阅读(235) 评论(0) 推荐(0)
摘要: D - Partitioning Game Time Limit:4000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status D - Partitioning Game Submit Status Description 阅读全文
posted @ 2016-04-15 20:54 Ritchie丶 阅读(451) 评论(0) 推荐(0)
摘要: G - Game of Hyper Knights Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status G - Game of Hyper Knights Submit Status Des 阅读全文
posted @ 2016-04-15 20:42 Ritchie丶 阅读(601) 评论(0) 推荐(0)
摘要: F - Again Stone Game Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status F - Again Stone Game Submit Status Description A 阅读全文
posted @ 2016-04-15 20:27 Ritchie丶 阅读(363) 评论(0) 推荐(0)
摘要: A - Matrix Game Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status A - Matrix Game Submit Status Description Given an m 阅读全文
posted @ 2016-04-15 11:20 Ritchie丶 阅读(319) 评论(0) 推荐(0)
摘要: LightOJ1253 :Misere Nim LightOJ1253 :Misere Nim 时间限制:1000MS 内存限制:32768KByte 64位IO格式:%lld & %llu 描述 Alice and Bob are playing game of Misère Nim. Misèr 阅读全文
posted @ 2016-04-13 21:52 Ritchie丶 阅读(365) 评论(0) 推荐(0)
摘要: 尼姆博奕(Nimm Game):有三堆各若干个物品,两个人轮流从某一堆取任意多的物品,规定每次至少取一个,多者不限,最后取光者得胜。 这种情况最有意思,它与二进制有密切关系,我们用(a,b,c)表示某种局势,首先(0,0,0)显然是奇异局势,无论谁面对奇异局势,都必然失败。第二种奇异局势是(0,n, 阅读全文
posted @ 2016-04-13 21:30 Ritchie丶 阅读(520) 评论(0) 推荐(0)