hdu-5933----hdu-5943

hdu-5933

Ideas:

Greed, the first requirement of the sum is a multiple of k, and the requirements of adjacent, indicating the adjacent piece if it is a multiple of sum/k, then in-situ cutting so as to make the least number of operations;

hdu-5934

Ideas:

Strong connected components, can find the strong connected components after the contraction point, and then the selection of 0 of the detonation is the smallest;

hdu-5935

Ideas:

Greedy, demand speed increases, then from the back to the greedy, record the maximum speed of the numerator and denominator, to avoid accuracy error;

hdu-5938

Ideas:

Water problem, within a long long range, violence can be;

hdu-5943

Ideas:

Binary matching, you can find the disjoint interval if there are two primes no, and 1e9 of the prime number interval not more than 500, so then there are two matching, I match incredibly write the maximum flow;

Code address: I'm here.

hdu-5933----hdu-5943