2015年09月_Mr丶Gao

原创 HDU 5491.The Next【2015 ACM/ICPC Asia Regional Hefei Online】【方法】【9月30】

The NextProblem DescriptionLet L denote the number of 1s in integer D’s binary representation. Given two integers S1 and S2, we call D a WYH number if S1≤L≤S2.With a given D, we

2015-09-30 21:24:25 442

原创 HDU 5477.A Sweet Journey【2015 ACM/ICPC Asia Regional Shanghai Online】【9月26】

A Sweet JourneyProblem DescriptionMaster Di plans to take his girlfriend for a travel by bike. Their journey, which can be seen as a line segment of length L, is a road of swamps and flats.

2015-09-26 20:19:37 562

原创 HDU 5475.An easy problem【思路】【2015 ACM/ICPC Asia Regional Shanghai Online】【9月26】

An easy problemProblem DescriptionOne day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first, X = 1. This calculator o

2015-09-26 19:39:21 710

原创 HDU 1023.Train Problem II【大卡特兰数】【9月25】

Train Problem IIProblem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders

2015-09-25 16:31:08 527

原创 HDU 5461.Largest Point【2015 ACM/ICPC Asia Regional Shenyang Online】【排序】9月19

Largest PointProblem DescriptionGiven the sequence A with n integers t1,t2,⋯,tn. Given the integral coefficients a and b. The fact that select two elements ti and tj of A and i≠j to ma

2015-09-19 20:28:41 442

原创 HDU 5455.Fang Fang【2015 ACM/ICPC Asia Regional Shenyang Online】【字符串处理】9月19

Fang FangProblem DescriptionFang Fang says she wants to be remembered.I promise her. We define the sequence F of strings.F0 = ‘‘f",F1 = ‘‘ff",F2 = ‘‘cff",Fn = Fn−1 + ‘‘f", for n

2015-09-19 19:30:28 494

原创 HDU 1010.Tempter of the Bone【DFS+奇偶性剪枝】9月19

Tempter of the BoneProblem 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 fee

2015-09-19 11:10:47 402

原创 HDU 5441.Travel【2015 ACM/ICPC Asia Regional Changchun Online】【并查集】9月18

TravelProblem DescriptionJack likes to travel around the world, but he doesn’t like to wait. Now, he is traveling in the Undirected Kingdom. There are n cities and m bidirectional roads

2015-09-18 11:52:12 512

原创 HDU 5444.Elven Postman【2015 ACM/ICPC Asia Regional Changchun Online】【二叉树建立与遍历】9月14

Elven PostmanProblem DescriptionElves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. Also, t

2015-09-14 20:25:15 584

原创 HDU 5437.Alisha’s Party【2015 ACM/ICPC Asia Regional Changchun Online】【优先队列】9月14

Alisha’s PartyProblem DescriptionPrincess Alisha invites her friends to come to her birthday party. Each of her friends will bring a gift of some value v, and all of them will come at a di

2015-09-14 19:51:44 418

原创 HDU 5438.Ponds【2015 ACM/ICPC Asia Regional Changchun Online】【DFS】9月13

PondsProblem DescriptionBetty owns a lot of ponds, some of them are connected with other ponds by pipes, and there will not be more than one pipe between two ponds. Each pond has a value v.

2015-09-13 16:42:30 693

原创 HDU 1007.Quoit Design【分治法】【投机取巧（枚举）】【9月9】【16年8月12更新分治法】

Quoit DesignProblem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field

2015-09-09 11:15:35 489

原创 HDU 1065.I Think I Need a Houseboat【数学题】【9月1】

I Think I Need a HouseboatProblem DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that

2015-09-01 14:15:53 952

原创 HDU 1064.Financial Management【超级无敌大水题】【9月1】

Financial ManagementProblem DescriptionLarry graduated this year and finally has a job. He’s making a lot of money, but somehow never seems to have enough. Larry has decided that he needs to

2015-09-01 13:29:35 966 1

Mr丶Gao