随笔分类 -  闲杂题...

HDU 3788 ZOJ问题
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=3788上HDU看到滚动条‘浙大研究生复试上机考试’最近热议的话题是考研的分数下来了。想直接找工作的我,也在犹豫的边缘,挑了了道题做了一下。代码写的挫死了..o(╯□╰)o1. zoj ac2.xxxzojxxx zoj左右两边的o的数量一样多3.azbojac 其中它是由xxzojxx一次递归而来的.假设为ozojo(a=1, b=1, c=1)递归而来的,那么一次是ozojo -->ozoojoo --> ozooojooo可以发现numa是不变的。numb每次+1,那么变换次数为numb-1。 阅读全文
posted @ 2013-02-23 15:18 crying_Dream 阅读(365) 评论(0) 推荐(0)
HDU 4259 Double Dealing 【离散数学】
摘要:Problem DescriptionTake a deck of n unique cards. Deal the entire deck out to k players in the usual way: the top card to player 1, the next to player 2, the kth to player k, the k+1st to player 1, and so on. Then pick up the cards – place player 1′s cards on top, then player 2, and so on, so that p 阅读全文
posted @ 2012-08-25 19:53 crying_Dream 阅读(445) 评论(0) 推荐(0)
POJ 1019 Number Sequence【数论】
摘要:DescriptionA single positive integer i is given. Write a program to find the digit located in the position i in the sequence of number groups S1S2...Sk. Each group Sk consists of a sequence of positive integer numbers ranging from 1 to k, written one after another.For example, the first 80 digits of 阅读全文
posted @ 2012-08-17 22:12 crying_Dream 阅读(410) 评论(0) 推荐(0)
HDU 4091 Zombie’s Treasure Chest 【杂题】%
摘要:Problem Description Some brave warriors come to a lost village. They are very lucky and find a lot of treasures and a big treasure chest, but with angry zombies. The warriors are so brave that they decide to defeat the zombies and then bring all the treasures back. A brutal long-drawn-out battle la. 阅读全文
posted @ 2012-08-17 16:38 crying_Dream 阅读(479) 评论(0) 推荐(0)