영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
A factory that manufactures refrigerators needs to deliver a large shipment of n fridges to a supermarket. The factory has two trucks at its disposal.
- Truck A costs p_a kr/trip and can carry k_a fridges at a time.
- Truck B costs p_b kr/trip and can carry k_b fridges at a time.
Your task is to write a program that, given the five variables above, determines how many trips each truck should make in order to minimize the total transport cost.
Input
The input consists of the five integers p_a, k_a, p_b, k_b (500 ≤ p_a, p_b ≤ 2000, 10 ≤ k_a, k_b ≤ 50) and n (1 ≤ n ≤ 1000) on a single line, separated by spaces.
Output
Print three integers: the number of trips truck A should make, the number of trips truck B should make, and the total cost in kronor. For all given test cases, it is guaranteed that the answer is unique.
Scoring
Your solution will be tested on a set of test groups. To earn points for a group, you must pass all test cases in that group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 33 | Only truck A needs to make trips in an optimal solution. |
| 2 | 67 | No additional constraints. |
예제
예제 1
960 13 995 14 150
4 7 10805