Asteroids
Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of >>继续阅读
poj1422
maksyuki 发表于 oj 分类，标签: 图论-二分图最大匹配, 图论-最小路径覆盖
20
1月
2016
Air Raid
Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never reach the same intersection i.e. >>继续阅读
poj1466
maksyuki 发表于 oj 分类，标签: 图论-二分图最大匹配, 图论-最大点独立
20
1月
2016
Girls and Boys
In the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically involved" is defined between one girl and one boy. For the study reasons it is necessary to find >>继续阅读
zoj1654
maksyuki 发表于 oj 分类，标签: 图论-二分图最大匹配
19
1月
2016
Place the Robots
Robert is a famous engineer. One day he was given a task by his boss. The background of the task was the following: Given a map consisting of square blocks. There were three kinds of blocks: Wall, Grass, >>继续阅读
hdu4417
maksyuki 发表于 oj 分类，标签: 数值-二分\三分\折半枚举, 数据结构-划分树
15
1月
2016
Super Mario
Problem Description
Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is >>继续阅读
hdu4251
14
1月
2016
The Famous ICPC Team Again
Problem Description
When Mr. B, Mr. G and Mr. M were preparing for the 2012 ACM-ICPC World Final Contest, Mr. B had collected a large set of contest problems for their daily training. When they decided to take training, >>继续阅读
poj2104
10
1月
2016
K-th Number
You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment.
That is, given an array a[1...n] of different integer numbers, your program must answer a series of questions >>继续阅读
poj2182
16
12月
2015
Lost Cows
N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many beers before dinner. When it was time to line up for th >>继续阅读
codeforces 55D
05
12月
2015
Beautiful numbers
Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argue with >>继续阅读
hdu4389
05
12月
2015
X mod f(x)
Problem Description
Here is a function f(x): int f ( int x ) { if ( x == 0 ) return 0; return f ( x / 10 ) + x % 10;} Now, you want to know, in a given interval [A, B] (1 <= A <= B <= 109), how many integer x that mod f(x) equ >>继续阅读
hdu3652
04
12月
2015
B-number
Problem Description
A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers, but 143 and 2639 are not. Your task >>继续阅读
hdu2639
03
12月
2015
Bone Collector II
Problem Description
The title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't matter,I will give you a link: >>继续阅读
hdu5115
03
12月
2015
Dire Wolf
Problem Description
Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, >>继续阅读
hdu1078
02
12月
2015
FatMouse and Cheese
Problem Description
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid location >>继续阅读
poj3616
02
12月
2015
Milking Time
Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0..N-1) so that she produces as much milk as possible. >>继续阅读
