2013年7月14日

Codeforces Round #191 (Div. 2) B. Hungry Sequence(素数筛选法)

摘要: . Hungry Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisti 阅读全文

posted @ 2013-07-14 21:34 铁树银花 阅读(389) 评论(0) 推荐(0) 编辑

Codeforces Round #191 (Div. 2) A. Flipping Game(简单)

摘要: A. Flipping Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub got bored, so he invented a game to be played on paper.He writes n integers a1, a2, ..., an. Each of those integers can be either 0 or 1. He's allowed to do exactly one move 阅读全文

posted @ 2013-07-14 20:57 铁树银花 阅读(486) 评论(0) 推荐(0) 编辑

导航