uva 10090 marbles

最新推荐文章于 2020-02-03 22:25:37 发布

chengouxuan

最新推荐文章于 2020-02-03 22:25:37 发布

阅读量623

点赞数

分类专栏： ACM 文章标签： n2 each input algorithm integer c

本文链接：https://blog.csdn.net/chengouxuan/article/details/6839986

版权

该问题描述了一个需要以最低成本购买两种不同类型的盒子来存储大理石的情况。类型1的盒子每个成本c1，能装n1个大理石，类型2的盒子每个成本c2，能装n2个。输入包含多个测试用例，每个用例给出大理石数量n，以及两种盒子的成本和容量。输出应提供一种解决方案，即每种类型盒子所需的数量，如果存在，则保证盒子被填满且成本最低。如果不存在解决方案，则输出"failed"。

摘要由CSDN通过智能技术生成

Problem F

Marbles

Input: standard input

Output: standard output

I have some (say, n) marbles (small glass balls) and I am going to buy some boxes to store them. The boxes are of two types:

Type 1: each box costs c₁ Taka and can hold exactly n₁ marbles

Type 2: each box costs c₂ Taka and can hold exactly n₂ marbles

I want each of the used boxes to be filled to its capacity and also to minimize the total cost of buying them. Since I find it difficult for me to figure out how to distribute my marbles among the boxes, I seek your help. I want your program to be efficient also.

Input

The input file may contain multiple test cases. Each test case begins with a line containing the integer n (1 <= n <= 2,000,000,000). The second line contains c₁ and n₁, and the third line contains c₂ and n₂. Here, c₁, c₂, <