题库练习 Road to Post Office
← 上一题 下一题 →

A10523 | Road to Post Office

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Vasiliy has a car and he wants to get from home to the post office. The distance which he needs to pass equals to $d$ kilometers.

Vasiliy's car is not new — it breaks after driven every $k$ kilometers and Vasiliy needs $t$ seconds to repair it. After repairing his car Vasiliy can drive again (but after $k$ kilometers it will break again, and so on). In the beginning of the trip the car is just from repair station.

To drive one kilometer on car Vasiliy spends $a$ seconds, to walk one kilometer on foot he needs $b$ seconds ( $a<b$ ).

Your task is to find minimal time after which Vasiliy will be able to reach the post office. Consider that in every moment of time Vasiliy can left his car and start to go on foot.

输入格式

The first line contains 5 positive integers $d,k,a,b,t$ ( $1<=d<=10^{12}$ ; $1<=k,a,b,t<=10^{6}$ ; $a<b$ ), where:

- $d$ — the distance from home to the post office;
- $k$ — the distance, which car is able to drive before breaking;
- $a$ — the time, which Vasiliy spends to drive 1 kilometer on his car;
- $b$ — the time, which Vasiliy spends to walk 1 kilometer on foot;
- $t$ — the time, which Vasiliy spends to repair his car.

输出格式

Print the minimal time after which Vasiliy will be able to reach the post office.

输入输出样例

输入 #1
5 2 1 4 10
输出 #1
14
输入 #2
5 2 1 4 5
输出 #2
13
C++ 编辑器
输入
输出