|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||117||65||61||58.095%|
Typically, droughts are classified into “abnormally dry”, “moderate drought”, “severe drought”, “extreme drought”, and “exceptional drought”. The current drought is so “exceptional” in most of California that there have been discussions of adding one or more steps to the scale. But really, that will only delay the problem. Any system of discrete labels is not completely scalable. As computer scientists, you know that the answer is to build a naming system that allows you to just add more and more syllables. So how about “mega drought”, “mega mega drought”, “mega mega mega drought”, and so on? You can extend it arbitrarily. Here, you’ll write a program that finds the right number of “mega” to add.
You will be given two numbers: the amount of rain that was expected, and the amount of rain that actually occurred. If the former is less than the latter, we have no drought. If the expected rain is more than the actual rain, but not by a factor of more than 5, we just have a “drought”. If the expected rain is more by a factor of strictly more than 5, but not by a factor of more than 25, we have a “mega drought”. If it is more by a factor of strictly more than 25, but not by a factor more than 125, we have a “mega mega drought”. And so on — for each factor of 5, you add another “mega”.
The first line is the number K of input data sets, followed by the K data sets, each of the following form:
Each data set has two integer numbers 0 ≤ E, A ≤ 1, 000, 000, with A > 0, the expected and actual amount of rain.
For each data set, output “Data Set x:” on a line by itself, where x is its number.
Then output a string describing the type of drought that is going on (“no drought”, “drought”, “mega drought”, “mega mega drought”, etc.).
Each data set should be followed by a blank line.
3 100 100 12375 99 10 2
Data Set 1: no drought Data Set 2: mega mega drought Data Set 3: drought