自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(40)
  • 收藏
  • 关注

原创 SQL 文档快查手册

SQL TOP       限制返回结果集中的记录条数              SELECT TOP n FROM [查询条件]       查询结果集中的指定百分比的记录数              SELECT TOP n PERCENT 列名表> FROM 表名> [查询条件]SQL LIKE       LIKE操作符用于再WHERE子句中搜索列中的指定模式

2017-08-03 18:15:11 271

原创 专题四 Problem S

Problem DescriptionBackground Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs

2016-07-06 23:50:18 290

原创 Problem H

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 G

2016-07-05 21:49:21 242

原创 专题四 Problem D

Problem Description某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当N为0时,输入结束,该用

2016-07-04 08:53:07 250

原创 专题四 Problem B

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 pictu

2016-07-02 20:13:41 231

原创 专题四 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 connec

2016-07-02 10:45:46 259

原创 ACM程序设计报告

ACM程序设计报告- -王浩 14级计算机4班 通过十六周的acm程序设计实习,感受颇深,acm不仅仅是对编程能力的锻炼,更是对逻辑思维能力的提升。从第一专题到第四专题,stl,贪心算法,搜索,背包,动态规划,图论,最小生成树等等,这些知识都是之前在各门课中接触到过的,但是在acm中,我对算法有了一个新的认识,也对之前学的知识有了更深入的认识。对acm的认识是从大一开始的,当时在东

2016-06-27 22:18:11 1424

原创 第四专题 Problem J

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 n

2016-06-27 17:45:09 268

原创 第四专题 Problem K

Problem Description虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒假就快到了,这么一大段时

2016-06-24 22:47:56 252

原创 第四专题 Problem F

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-22 22:37:47 232

原创 第四专题 Problem E

Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。现得到城镇道路统计表,表中列出了任意两城镇间修建道路的费用,以及该道路是否已经修通的状态。现请你编写程序,计算出全省畅通需要的最低成本。 Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 1当N

2016-06-19 11:13:50 244

原创 第四专题 Problem C

Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路?  Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是城镇数目N ( 注意:两个城市之

2016-06-12 11:09:03 234

原创 1019 Problem S

Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Softwar

2016-05-30 09:46:19 209

原创 1023 Problem W

Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了他得

2016-05-25 20:09:33 240

原创 1017 Problem Q

Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave

2016-05-22 11:13:34 175

原创 1003 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-19 19:57:31 266

原创 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 yo

2016-05-14 16:36:33 224

原创 1012 Problem L

Problem Description在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数.例如n=3时,为2× 3方格,骨牌的铺放方案有三种,如下图: Input输入数据由多行组成,每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n (0 Output对于每个测试实例,请输出铺放方案的总数,每个实例的输出占一行。

2016-05-12 21:30:37 276

原创 1016 Problem P

Problem Description在一无限大的二维平面中,我们做如下假设:1、  每次只能移动一格;2、  不能向后走(假设你的目的地是“向上”,那么你可以向左走,可以向右走,也可以向上走,但是不可以向下走);3、  走过的格子立即塌陷无法再走第二次;求走n步不同的方案数(2种走法只要有一步不一样,即被认为是不同的方案)。 

2016-05-12 20:42:07 235

原创 1011 Problem K

Problem Description有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房,不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。其中,蜂房的结构如下所示。 Input输入数据的第一行是一个整数N,表示测试实例的个数,然后是N 行数据,每行包含两个整数a和b(0 Output对于每个测试实例,请输出蜜蜂从蜂房a爬到蜂房b的可能路线数,每个实例的输出占

2016-05-12 11:33:51 426

原创 1015 problem O

这题敲完一下就通过了,比较水,是十进制转化为二进制的题。对二取余,倒序输出,存到数组里,每次从高到低输出就可以了。以下是源码:#include using namespace std;int main(){    int n;    int a[1000];    while(cin>>n){        int j=0;        if(n==0

2016-05-08 22:58:09 192

原创 1013 Problem M

第一年有一头母牛,第二年年初还是有一头可以生母牛的母牛,第三年有两头母牛,第三年就有三头母牛,从第四年开始,第一年生的母牛就可以生小母牛了,第五年开始,第二年生的母牛就可以生小母牛了。。。。从第三年开始,母牛的数量就是前一年的母牛数量加上前三年的母牛数量,因为三年前的小牛到今年就可以生小牛了,而今年的母牛数量是前一年的母牛数量。源码是:#include using na

2016-05-05 11:58:05 235

原创 1010 Problem J

这题一个台阶时,是1,两个台阶时也是1,三个到三个以上台阶以后,就是它的前两个台阶的和。因为到第i个台阶之时,有两种情况,最后一步走了一个或两个台阶,所以在走了一个台阶时,是前一个的数量,走了两个台阶时,是前两个的数量。。以下是源码:#include using namespace std;int main(){   int n,i,a[41],m;    cin>>n;

2016-05-04 11:48:32 290

原创 1014 Problem N

这题完全理解成了一个数学题,1条折线会分成两块,2两条会分成7块,n条会分成2×n*n-1块#includeusing namespace std;int main(){   int i,j,n;   cin>>n;   for(i=0;i   {    cin>>j;    int m;    m=2*j*j-j+1;    cout   }

2016-05-03 21:08:26 205

原创 1006 Problem F

Problem F Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 44   Accepted Submission(s) : 33Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样

2016-05-03 20:35:57 238

原创 1019 N皇后问题

Problem Description在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给定的N,求出有多少种合法的放置方法。 Input共有若干行,每行一个正整数N≤10,表示棋盘和皇后的数量;如果N=0,表示结束。 Output共有若干行,每行一个正整数,表示

2016-04-24 16:12:19 249

原创 1026 Sudoku Killer

Problem Description自从2006年3月10日至11日的首届数独世界锦标赛以后,数独这项游戏越来越受到人们的喜爱和重视。据说,在2008北京奥运会上,会将数独列为一个单独的项目进行比赛,冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留念的机会。所以全球人民前仆后继,为了奖品日夜训练茶饭不思。当然也包括初学者linle,

2016-04-23 21:17:08 167

原创 1023 Another Eight Puzzle

Problem DescriptionFill the following 8 circles with digits 1~8,with each number exactly once . Conntcted circles cannot be filled with two consecutive numbers.There are 17 pairs of connected cicles

2016-04-23 19:29:01 234

原创 1015 Knight Moves

Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n

2016-04-23 19:15:39 262

原创 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.W

2016-04-23 09:51:06 222

原创 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.W

2016-04-23 09:46:58 200

原创 1011

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 a

2016-04-23 09:41:13 149

原创 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 the

2016-04-21 21:24:49 309

原创 1005 Turn the corner

Problem Description Mr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street he is currently in has a width x, the street he wants to turn to ha

2016-04-21 21:21:36 303

原创 1004 Toxophily

Problem DescriptionThe recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climbing, and so on.We all like toxophily.

2016-04-21 09:53:12 216

原创 1002 Strange fuction

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 first line

2016-04-21 09:49:53 263

原创 1001 Can you solve this equation?

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 contain

2016-04-20 20:49:06 228

原创 1017 非常可乐

Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是

2016-04-20 20:46:41 224

原创 1008 猜数字

1008猜数字Problem DescriptionA有1数m,B来猜.B每猜一次,A就说"太大","太小"或"对了" 。 问B猜n次可以猜到的最大数。  Input第1行是整数T,表示有T组数据,下面有T行 每行一个整数n (1 ≤ n ≤ 30)  Output猜n次

2016-04-17 11:13:52 403

原创 1004 Problem E 今年暑假不AC

Problem E Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 258   Accepted Submission(s) : 78Problem Description“今年暑假不AC?”“是的。”“那你干什么呢?”

2016-03-27 13:05:44 264

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除