摘要: 描述 The magician shuffles a small pack of cards, holds it face down and performs the following procedure: This impressive trick works if the magician k 阅读全文
posted @ 2013-06-03 21:48 1002liu 阅读(280) 评论(0) 推荐(0) 编辑
摘要: Problem Description A sequence Sn is defined as:Where a, b, n, m are positive integers.┌x┐is the ceil of x. For example, ┌3.14┐=4. You are to calculate Sn. You, a top coder, say: So easy! Input ... 阅读全文
posted @ 2013-06-03 17:49 1002liu 阅读(236) 评论(0) 推荐(0) 编辑
摘要: Problem Description 邮局最近推出了一套纪念邮票,这套邮票共有N张,邮票面值各不相同,按编号顺序为1分,2分,...,N分。小杭是个集邮爱好者,他很喜欢这套邮票,可惜现在他身上只有M分,并不够把全套都买下。他希望尽量买,最好刚好花光所有钱。作为一个集邮爱好者,小杭也不想买的邮票编号断断续续。所以小杭打算买面值a分至b分的b-a+1张连续的邮票,且总价值刚好为M分。你的任务是求出所... 阅读全文
posted @ 2013-06-03 17:45 1002liu 阅读(238) 评论(0) 推荐(0) 编辑
摘要: Problem Description DNA (Deoxyribonucleic acid) is founded in every living creature as the storage medium for genetic information. It is comprised of subunits called nucleotides that are strung togeth... 阅读全文
posted @ 2013-06-03 17:42 1002liu 阅读(336) 评论(0) 推荐(0) 编辑
摘要: Problem Description Max is the king of the universe, he rules billions of planets. In each planet, there may be several residents. Residents of Max's kingdom will never die, so some of them may be as ... 阅读全文
posted @ 2013-06-03 17:40 1002liu 阅读(190) 评论(0) 推荐(0) 编辑
摘要: Problem Description 小艾和小牛在上数学课的时候觉得非常的无聊,于是他们想出了一个新的游戏,小牛写下N位的数字,小艾的任务就是在去除了K位后得到一个最大的数。 Input 第一行输入一个N和一个K( 1 2 int p[500005]; 3 char sp[500005]; 4 int main() { 5 int n,k,i,head,cnt; 6 ... 阅读全文
posted @ 2013-06-03 17:38 1002liu 阅读(143) 评论(0) 推荐(0) 编辑
摘要: Problem Description Hunan cuisine is really wonderful! But if you don’t like spicy food, you will feel terrible since it can be hard for you to find any food without hot pepper here. Big Fan is a st... 阅读全文
posted @ 2013-06-03 00:04 1002liu 阅读(194) 评论(0) 推荐(0) 编辑