本文主要是介绍Codeforces Round #364 (Div. 1) A B C D E，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
E题好艰难。
唉，补完去搞midterm了。
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent a bus, which has seats for k people (it means that it can't fit more than kpeople at the same time) and the speed equal to v2. In order to avoid seasick, each of the pupils want to get into the bus no more than once.
Determine the minimum time required for all n pupils to reach the place of excursion. Consider that the embarkation and disembarkation of passengers, as well as the reversal of the bus, take place immediately and this time can be neglected.
The first line of the input contains five positive integers n, l, v1, v2 and k (1 ≤ n ≤ 10 000, 1 ≤ l ≤ 109, 1 ≤ v1 < v2 ≤ 10
这篇关于Codeforces Round #364 (Div. 1) A B C D E的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
