05 2016 档案

摘要:Problem Description The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often b 阅读全文
posted @ 2016-05-31 16:43 邻家那小孩儿 阅读(98) 评论(0) 推荐(0)
摘要:Problem Description Hiking in the mountains is seldom an easy task for most people, as it is extremely easy to get lost during the trip. Recently Gree 阅读全文
posted @ 2016-05-29 20:52 邻家那小孩儿 阅读(160) 评论(0) 推荐(0)
摘要:Problem Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N 阅读全文
posted @ 2016-05-28 20:08 邻家那小孩儿 阅读(122) 评论(0) 推荐(0)
摘要:Problem Description You're in space.You want to get home.There are asteroids.You don't want to hit them. Input Input to this problem will consist of a 阅读全文
posted @ 2016-05-28 17:05 邻家那小孩儿 阅读(234) 评论(0) 推荐(0)
摘要:Problem Description A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight m 阅读全文
posted @ 2016-05-28 15:12 邻家那小孩儿 阅读(117) 评论(0) 推荐(0)
摘要:Problem Description Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位 阅读全文
posted @ 2016-05-28 13:52 邻家那小孩儿 阅读(120) 评论(0) 推荐(0)
摘要:Problem Description 呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已 阅读全文
posted @ 2016-05-27 20:36 邻家那小孩儿 阅读(150) 评论(0) 推荐(0)
摘要:Problem Description Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For examp 阅读全文
posted @ 2016-05-26 15:04 邻家那小孩儿 阅读(132) 评论(0) 推荐(0)
摘要:Problem Description 在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给定的N,求出有多少种合法的放置方法。 Input 共有若干行,每行一个正整数N≤10,表示棋盘和皇后的数量; 阅读全文
posted @ 2016-05-26 13:21 邻家那小孩儿 阅读(104) 评论(0) 推荐(0)
摘要:Problem Description A while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother 阅读全文
posted @ 2016-05-25 20:57 邻家那小孩儿 阅读(96) 评论(0) 推荐(0)
摘要:Problem Description Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square? Input The first line of input c 阅读全文
posted @ 2016-05-24 20:48 邻家那小孩儿 阅读(183) 评论(0) 推荐(0)
摘要:Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of nu 阅读全文
posted @ 2016-05-22 21:48 邻家那小孩儿 阅读(159) 评论(0) 推荐(0)
摘要:Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, an 阅读全文
posted @ 2016-05-21 22:28 邻家那小孩儿 阅读(156) 评论(0) 推荐(0)
摘要:Problem Description 还记得Gardon给小希布置的那个作业么?(上次比赛的1005)其实小希已经找回了原来的那张数表,现在她想确认一下她的答案是否正确,但是整个的答案是很庞大的表,小希只想让你把答案中最大的M个数告诉她就可以了。 给定一个包含N(N<=3000)个正整数的序列,每 阅读全文
posted @ 2016-05-21 10:10 邻家那小孩儿 阅读(204) 评论(0) 推荐(0)
摘要:Problem Description 数论中有许多猜想尚未解决,其中有一个被称为“角谷猜想”的问题,该问题在五、六十年代的美国多个著名高校中曾风行一时,这个问题是这样描述的:任何一个大于一的自然数,如果是奇数,则乘以三再加一;如果是偶数,则除以二;得出的结果继续按照前面的规则进行运算,最后必定得到 阅读全文
posted @ 2016-05-17 21:28 邻家那小孩儿 阅读(166) 评论(0) 推荐(0)
摘要:Problem Description 七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下:数字N的因子就是所有比N小又能被N整除的所有正整数,如12的因 阅读全文
posted @ 2016-05-17 20:19 邻家那小孩儿 阅读(131) 评论(0) 推荐(0)
摘要:Problem Description HDU ACM集训队的队员在暑假集训时经常要讨论自己在做题中遇到的问题.每当面临自己解决不了的问题时,他们就会围坐在一张圆形的桌子旁进行交流,经过大家的讨论后一般没有解决不了的问题,这也只有HDU ACM集训队特有的圆桌会议,有一天你也可以进来体会一下哦:), 阅读全文
posted @ 2016-05-17 18:52 邻家那小孩儿 阅读(91) 评论(0) 推荐(0)
摘要:Problem Description Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at 阅读全文
posted @ 2016-05-17 15:36 邻家那小孩儿 阅读(109) 评论(0) 推荐(0)
摘要:Problem Description RSA is one of the most powerful methods to encrypt data. The RSA algorithm is described as follow:> choose two large prime integer 阅读全文
posted @ 2016-05-14 22:58 邻家那小孩儿 阅读(165) 评论(0) 推荐(0)
摘要:Problem Description Eddy是个ACMer,他不仅喜欢做ACM题,而且对于纸牌也有一定的研究,他在无聊时研究发现,如果他有2N张牌,编号为1,2,3..n,n+1,..2n。这也是最初的牌的顺序。通过一次洗牌可以把牌的序列变为n+1,1,n+2,2,n+3,3,n+4,4..2n 阅读全文
posted @ 2016-05-14 21:52 邻家那小孩儿 阅读(312) 评论(0) 推荐(0)
摘要:Problem Description ACboy was kidnapped!! he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so 阅读全文
posted @ 2016-05-12 17:11 邻家那小孩儿 阅读(131) 评论(0) 推荐(0)
摘要:#include using namespace std; int parent(int i) { return i/2; } int left(int i) { return 2*i; } int right(int i) { return 2*i+1; } int MAX_HEAPIFY(int a[],int i,int n) { int l,r... 阅读全文
posted @ 2016-05-12 15:45 邻家那小孩儿 阅读(104) 评论(0) 推荐(0)
摘要:Problem Description In the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns 阅读全文
posted @ 2016-05-04 00:27 邻家那小孩儿 阅读(169) 评论(0) 推荐(0)
摘要:Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean 阅读全文
posted @ 2016-05-04 00:26 邻家那小孩儿 阅读(127) 评论(0) 推荐(0)
摘要:Problem Description An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a 阅读全文
posted @ 2016-05-04 00:24 邻家那小孩儿 阅读(169) 评论(0) 推荐(0)
摘要:Problem Description 完数的定义:如果一个大于1的正整数的所有因子之和等于它的本身,则称这个数是完数,比如6,28都是完数:6=1+2+3;28=1+2+4+7+14。本题的任务是判断两个正整数之间完数的个数。 Input 输入数据包含多行,第一行是一个正整数n,表示测试实例的个数 阅读全文
posted @ 2016-05-04 00:20 邻家那小孩儿 阅读(250) 评论(0) 推荐(0)
摘要:Problem Description 挂盐水的时候,如果滴起来有规律,先是滴一滴,停一下;然后滴二滴,停一下;再滴三滴,停一下...,现在有一个问题:这瓶盐水一共有VUL毫升,每一滴是D毫升,每一滴的速度是一秒(假设最后一滴不到D毫升,则花费的时间也算一秒),停一下的时间也是一秒这瓶水什么时候能挂 阅读全文
posted @ 2016-05-04 00:16 邻家那小孩儿 阅读(102) 评论(0) 推荐(0)
摘要:Problem Description 某部队进行新兵队列训练,将新兵从一开始按顺序依次编号,并排成一行横队,训练的规则如下:从头开始一至二报数,凡报到二的出列,剩下的向小序号方向靠拢,再从头开始进行一至三报数,凡报到三的出列,剩下的向小序号方向靠拢,继续从头开始进行一至二报数。。。,以后从头开始轮 阅读全文
posted @ 2016-05-03 23:02 邻家那小孩儿 阅读(162) 评论(0) 推荐(0)
摘要:Problem Description 外号叫“猪头三”的小学生在数学课上,经常遇到两车相遇或追及的方程题,经过长时间的练习,他发现了许多规律,然而他不懂计算机,他想请你帮忙编写一个计算机程序,解决他的问题。题目的描述是这样的:甲、乙两地相距L公里,A车的速度为VA公里/小时,B车的速度为VB公里/ 阅读全文
posted @ 2016-05-03 21:44 邻家那小孩儿 阅读(254) 评论(0) 推荐(0)
摘要:Problem Description 在纺织CAD系统开发过程中,经常会遇到纱线排列的问题。该问题的描述是这样的:常用纱线的品种一般不会超过25种,所以分别可以用小写字母表示不同的纱线,例如:abc表示三根纱线的排列;重复可以用数字和括号表示,例如:2(abc)表示abcabc;1(a)=1a表示 阅读全文
posted @ 2016-05-03 19:55 邻家那小孩儿 阅读(171) 评论(0) 推荐(0)