2013年8月3日

hdu 1016

摘要: Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note: the number of first circle should always be 1.Inputn (0 2 using namespace std; 3 int mark[20]; 4. 阅读全文

posted @ 2013-08-03 22:05 明天的未来 阅读(128) 评论(0) 推荐(0)

hdu 1010

摘要: Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to get out of this maze.The maze was a recta 阅读全文

posted @ 2013-08-03 21:55 明天的未来 阅读(155) 评论(0) 推荐(0)

导航