- 博客(46)
- 资源 (2)
- 问答 (3)
- 收藏
- 关注
RSS订阅原创 课程练习四-problemQ
Problem DescriptionXX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的“舒适度”有特殊要求，即乘坐过程中最高速度与最低速度的差越小乘坐越舒服 ,(理解为SARS的限速要求，flycar必须瞬
2016-07-04 16:02:34
308
原创 课程练习四-problemR
Problem DescriptionRecognizing junk mails is a tough task. The method used here consists of two steps:1) Extract the common characteristics from the incoming email.2) Use a filter matching the set
2016-07-04 08:54:42
275
原创 课程练习四-problem V
Problem DescriptionFive hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gather all of the dragon balls together. His co
2016-07-03 22:20:58
342
原创 课程练习四-problemW
Problem DescriptionIn 12th Zhejiang College Students Games 2007, there was a new stadium built in Zhejiang Normal University. It was a modern stadium which could hold thousands of people. The audi
2016-07-02 12:31:16
257
原创 课程练习四-ProblemJ
Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even
2016-06-30 12:55:10
362
原创 课程练习四-ProblemH
Problem DescriptionIn graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. The maximal pseudoforests of G are the pseudoforest subgraphs of
2016-06-30 12:45:08
201
原创 课程练习四-problemF
Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes
2016-06-29 22:36:02
482
原创 课程练习四-ProblemB
Problem DescriptionEddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest picture
2016-06-29 22:32:30
232
原创 课程练习四—problem A
Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are conn
2016-06-29 22:19:04
273
原创 课程练习三--总结
dp 问题，主要是找递推公式，其实找到递推公式解题就简单了，问题是很难找递推公式。dp的难题是真有难度，完全无思路，当然这些训练题还是较简单的。
2016-05-30 22:43:32
196
原创 课程练习三-1015-problem O
Problem DescriptionGive you a number on base ten,you should output it on base two.(0 < n < 1000) InputFor each case there is a postive number n on base ten, end of file.
2016-05-23 12:13:35
298
原创 课程练习三-1014-problem N
Problem Description我们看到过很多直线分割平面的题目，今天的这个题目稍微有些变化，我们要求的是n条折线分割平面的最大数目。比如，一条折线可以将平面分成两部分，两条折线最多可以将平面分成7部分，具体如下所示。 Input输入数据的第一行是一个整数C,表示测试实例的个数，然后是C 行数据，每行包含一个整数n(0 Output
2016-05-23 11:26:37
218
原创 课程练习三-1013-problem M
Problem Description有一头母牛，它每年年初生一头小母牛。每头小母牛从第四个年头开始，每年年初也生一头小母牛。请编程实现在第n年的时候，共有多少头母牛？ Input输入数据由多个测试实例组成，每个测试实例占一行，包括一个整数n(0n=0表示输入数据的结束，不做处理。 Output对于每个测试实例，输出在第n年的时候母牛
2016-05-23 11:07:42
280
原创 课程练习三-1012-problem L
Problem Description在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数.例如n=3时,为2× 3方格，骨牌的铺放方案有三种,如下图： Input输入数据由多行组成，每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n (0 Output对于每个测试实例，请输出铺放方案的总数
2016-05-23 10:40:30
190
原创 课程练习三-1011-problem K
Problem Description有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房，不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。其中，蜂房的结构如下所示。 （本来图没有显示出来，百度的）Input输入数据的第一行是一个整数N,表示测试实例的个数，然后是N 行数据，每行包含两个整数a和b(0 Output对于每个测
2016-05-22 23:24:46
238
原创 课程练习三-1010-Problem J
Problem Description有一楼梯共M级，刚开始时你在第一级，若每次只能跨上一级或二级，要走上第M级，共有多少种走法？ Input输入数据首先包含一个整数N，表示测试实例的个数，然后是N行数据，每行包含一个整数M（1 Output对于每个测试实例，请输出不同走法的数量 Sample Input2
2016-05-22 22:51:43
204
原创 课程练习三-1008-problem H
Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了！可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却再次面临命运大迷宫的考验，这是魔王lemon设下的又一个机关。要知道，不论何人，若在迷宫中被困1小时以上，则必死无疑！可怜的yifenfei为了去救MM，义无返顾地跳进了迷宫。让我们一起帮帮执着的他吧！命运大迷宫可以看成是一个两维的方格阵列，如下图所示
2016-05-22 22:34:17
296
原创 课程练习三-1007-problem G
Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏，虽然在游戏中
2016-05-22 13:34:22
266
原创 课程练习三-1006-problem F
Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个DP的题目，你能AC吗? Input输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是一个整数N(1
2016-05-21 22:53:24
233
原创 课程练习三-1005-problem E
Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with s
2016-05-19 23:49:07
359
原创 课程练习三-1004-problem D
Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the fir
2016-05-19 13:34:26
268
原创 课程练习三-1003-problem C
Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to
2016-05-19 09:17:39
302
原创 课程练习三-1002-problem B
Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2
2016-05-18 23:28:46
293
原创 课程练习三-1009-problem I
Problem DescriptionQueues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life. There are many people lined up at the lunch
2016-05-18 12:12:05
514
原创 课程练习三-1001-problem A
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5
2016-04-27 22:12:13
872
原创 课程练习二-总结
对于bfs、dfs搜索的题目，很多可以套模板，然后进行判断、减枝就OK了。二分、三分，也是可以套模板，有一个嵌套三分的那题不错。搜索，算法之根本，感觉很多题的题目说不明白（不严谨），还是中文的题目好（不是像1010这种，什么翻译啊），不喜欢ACM；他要是能出多国语言的题目最好了。
2016-04-24 21:43:49
201
原创 课程练习二-1016-Red and Black
Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adja
2016-04-24 21:18:34
218
原创 课程练习二-1010-Catch him
Problem Description在美式足球中，四分卫负责指挥整只球队的进攻战术和跑位，以及给接球员传球的任务。四分卫是一只球队进攻组最重要的球员，而且一般身体都相对比较弱小，所以通常球队会安排5-7名大汉来保护他，其中站在四分卫前方、排成一线的5名球员称为进攻锋线，他们通常都是135公斤左右的壮汉。对防守方来说，攻击对手的四分卫当然是最直接的限制对手进攻的方法。如果效果好，就可以在对
2016-04-24 20:12:46
343
原创 课程练习二-1011-Oil Deposits
Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates
2016-04-24 16:05:17
190
原创 课程练习二-1006-Line belt
Problem DescriptionIn a two-dimensional plane there are two line belts, there are two segments AB and CD, lxhgww's speed on AB is P and on CD is Q, he can move with the speed R on other area on th
2016-04-23 21:38:53
289
2
原创 课程练习二-1003-pie
Problem DescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming t
2016-04-21 21:34:57
329
原创 课程练习二-1014 A strange lift
Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down
2016-04-21 10:36:41
208
原创 课程练习二-1013-A strange lift
Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down
2016-04-21 10:15:03
316
原创 课程练习二-1017非常可乐
Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S （S<101）毫升 (正好装满一瓶) ，它们三个之间可以相互倒可乐 (
2016-04-20 20:32:20
416
原创 课程练习二-1009连连看
Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学的意见，连线不能从外面绕过去的，但事实上这是错的。现在已经酿成大祸，就只
2016-04-17 23:12:40
241
原创 课程练习二-1008 猜数字
A有1数m，B来猜.B每猜一次，A就说"太大"，"太小"或"对了" 。 问B猜n次可以猜到的最大数。 Input第1行是整数T,表示有T组数据，下面有T行 每行一个整数n (1 ≤ n ≤ 30) Output猜n次可以猜到的最大数 Sample Input
2016-04-17 21:06:30
348
原创 课程练习二-1001
Problem DescriptionNow,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try your lucky. InputThe first line of the input
2016-04-07 20:36:59
252
原创 课程练习二-1002
Problem DescriptionNow, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100)Can you find the minimum value when x is between 0 and 100. InputThe fi
2016-04-07 20:21:05
351
原创 课程练习一-Problem Q
Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give a
2016-04-01 12:43:58
297
原创 课程练习一Problem M
Problem DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the practica
2016-04-01 12:21:39
258
TA创建的收藏夹 TA关注的收藏夹
TA关注的人