剑圣VS神牛-CSDN博客

原创 hdu 4565 So Easy!

Where a, b, n, m are positive integers.┌x┐is the ceil of x. For example, ┌3.14┐=4. You are to calculate Sn.　　You, a top coder, say: So easy! Input　　There are several test cases, e

2013-08-16 16:12:08 875

原创 hdu 4491 Windmill Animation

A windmill animation works as follows:A two-dimensional set of points, no three of which lie on a line is chosen. Then one of the points is chosen (as the first pivot) and a line is drawn through th

2013-08-13 15:16:55 844

原创 hdu 4487 Maximum Random Walk

Consider the classic random walk: at each step, you have a 1/2 chance of taking a step to the left and a 1/2 chance of taking a step to the right. Your expected position after a period of time is zero

2013-08-12 19:55:23 1260

原创 (poj 1475) Pushing Boxes

Imagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move north, south, east or west one cell at a step. These moves are ca

2013-08-05 17:21:56 882

原创 hdu 4268 Alice and Bob

Alice and Bob's game never ends. Today, they introduce a new game. In this game, both of them have N different rectangular cards respectively. Alice wants to use his cards to cover Bob's. The card A c

2013-07-25 21:53:12 813

原创 hdu 4467 Graph

hdu 4467 Graph P. T. Tigris is a student currently studying graph theory. One day, when he was studying hard, GS appeared around the corner shyly and came up with a problem:Given a graph with n nodes and m undirec

2013-07-22 23:56:48 1372 1

原创 Yet Another Multiple Problem (hdu 4474)

There are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highly challenging. That’s why we call it “Yet Another Multiple Problem”.In this p

2013-07-22 09:46:31 1154

原创 Software Industry Revolution

Making revolutions in the software industry is not an easy task. That’s why this problem is about something else. Stanescu has just invented a new super-cool way to develop software. It is similar to

2013-07-19 10:17:40 892

原创 The Robbery

In the downtown of Bucharest there is a very big bank with a very big vault. Inside the vault there are N very big boxes numbered from 1 to N. Inside the box with number k there are k very big diamond

2013-07-18 21:46:43 852

原创 Division

Little D is really interested in the theorem of sets recently. There’s a problem that confused him a long time. Let T be a set of integers. Let the MIN be the minimum integer in T and MAX be the m

2013-07-17 10:40:06 757

原创 Tree Construction

Consider a two-dimensional space with a set of points (xi, yi) that satisfy xi yj for all i < j. We want to have them all connected by a directed tree whose edges go toward either right (x positive)

2013-07-17 10:14:42 766

原创 Cut the Sequence

Given an integer sequence { an } of length N, you are to cut the sequence into several parts every one of which is a consecutive subsequence of the original sequence. Every part must satisfy that the

2013-07-17 09:41:16 936

原创 Trade

Recently, lxhgww is addicted to stock, he finds some regular patterns after a few days' study.He forecasts the next T days' stock market. On the i'th day, you can buy one stock with the price APi or

2013-07-16 23:16:25 743

原创 Subsequence

There is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum element of the subseque

2013-07-16 22:45:37 674

原创 Sleeping

ZZZ is an enthusiastic ACMer and he spends lots of time on training. He always stays up late for training. He needs enough time to sleep, and hates skipping classes. So he always sleeps in the class.

2013-07-16 22:33:13 673

原创 Tree Cutting

DescriptionAfter Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 Bessie, feeling vindictive, decided to sabotage Farmer John's network by cutting

2013-07-15 11:05:00 704

原创 Post Office

DescriptionThere is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coordi

2013-07-14 21:00:24 1229

原创聪明的打字员

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription阿兰是某机密部门的打字员，她现在接到一个任务：需要在一天之内输入几百个长度固定为6的密码。当然，她希望输入的过程中敲击键盘的总次数越少越好。不幸的是，出于保密的需要，该部门用

2013-07-07 14:34:25 1120 1

原创炮兵阵地

Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平原（用"P"表示），如下图。在每一格平原地形上最多可以布置一支炮兵部队（山地上不能够部署炮兵部队）；一支炮兵部队在地图上的攻击范围如图中黑色区域所示：如果在地图中的灰色所标识的平原上部署一支炮兵部队，则图中的黑色的网格表

2013-07-05 17:44:25 905

原创 Relocation

Emma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping them relocate. To move the furniture, they only

2013-07-04 00:43:19 895

感悟