COCI '18 Contest 4 #5 Akvizna

View as PDF

Submit solution

Points: 30 (partial)
Time limit: 0.75s
Memory limit: 256M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

1 vs. 100 is a quiz that we could follow on TVs a few years ago. For the purposes of this task, we will slightly simplify the quiz rules.

The contestant answers questions and has to throw out 100 people who compete against him. Everyone responds to the same question in each round and those who answer the question wrong are thrown out. The amount of money that a competitor who manages to throw out all 100 opponents gets is equal to the sum of money won per round. In each round, all opponents are worth equally and all opponents combined are worth 100\,000 kunas (Croatian currency). The amount earned in a round is equal to the sum of the values of people who have been thrown out in that round. For example, if there are 10 opponents at some point, each of them is worth 10\,000 kunas, and the contestant will get 30\,000 kunas if he or she manages to throw out 3 opponents in that round.

Let's say that the quiz is called 1 vs. N (i.e. the competitor competes against N people) and that Mirko M. managed to throw all the opponents in exactly K rounds. What is the maximum amount he could have won?


In the only line there are the integer numbers N (1 \le N \le 100\,000) and K (1 \le K \le N), the numbers from the task description.


Print the maximum possible amount that Mirko M. could have won divided by 100\,000.

Your answer will be considered correct if relative or absolute difference from the official answer is at most 10^{-8}.


In the sample tests totally worth 15% of the points it will be true that N \le 100.

In the sample tests totally worth an additional 35% points it will be true that N \le 3\,000.

Sample Input 1

5 3

Sample Output 1


Explanation for Sample Output 1

Mirko M. played against five players that he threw out in three rounds.

In order to win the maximum possible amount, firstly, he had to throw out three opponents and then two more times one at a time.

In that case, the amount won is equal to (3/5 + 1/2 + 1/1) \cdot 100\,000 = 2.1 \cdot 100\,000 = 210\,000 kunas.

Sample Input 2

10 10

Sample Output 2


Sample Input 3

100 10

Sample Output 3



There are no comments at the moment.