[BZOJ2257] [Jsoi2009] bottle and fuel (math)

Title: http://www.lydsy.com:808/JudgeOnline/problem.php?id=2257

Analysis:

1, first consider the determination of the minimum volume under the bottle is how much

① assumes that only two bottles are v1,v2, and the smallest size is their greatest common divisor

②, the smallest volume of n bottles is the greatest common divisor of the n bottles.

2, so the topic becomes the n number of the k number, so that the K number of greatest common divisor maximum

As for this factor, which can be enumerated from the large to the small, the number of times that this factor occurs is known to enumerate to the first factor >=k

[BZOJ2257] [Jsoi2009] bottle and fuel (math)