【UVa】12325 - Zombie's Treasure Chest
来源:互联网 发布:php程序员需要学什么 编辑:程序博客网 时间:2024/05/16 10:00
Problem here
Problem
Some brave warriors come to a lost village. They are very lucky and find a lot of treasures and a big
treasure chest, but with angry zombies.
The warriors are so brave that they decide to defeat the zombies and then bring all the treasures
back. A brutal long-drawn-out battle lasts from morning to night and the warriors find the zombies
are undead and invincible.
Of course, the treasures should not be left here. Unfortunately, the warriors cannot carry all the
treasures by the treasure chest due to the limitation of the capacity of the chest. Indeed, there are only
two types of treasures: emerald and sapphire. All of the emeralds are equal in size and value, and with
infinite quantities. So are sapphires.
Being the priest of the warriors with the magic artifact: computer, and given the size of the chest,
the value and size of each types of gem, you should compute the maximum value of treasures our
warriors could bring back.
INPUT
There are multiple test cases. The number of test cases T (T ≤ 200) is given in the first line of the
input file. For each test case, there is only one line containing five integers N, S1, V1, S2, V2, denoting
the size of the treasure chest is N and the size and value of an emerald is S1 and V1, size and value of
a sapphire is S2, V2. All integers are positive and fit in 32-bit signed integers.
OUTPUT
For each test case, output a single line containing the case number and the maximum total value of all
items that the warriors can carry with the chest.
Sample
input
2
100 1 1 2 2
100 34 34 5 3
output
Case #1: 100
Case #2: 86
Solution
整個可裝物品數 = i + (N-i*S1)/S2 //設有i個寶物1 ,有 (N-i*S1)/S2個寶物2
#include <iostream>#include <vector>using namespace std;int main(){ int T; cin >> T; for(int t = 1; t <= T; t++){ int N, s1, s2, v1, v2; cin >> N >> s1 >> v1 >> s2 >> v2; long var = 0; for(long i = 0; i <= 99999; i++){ if(s1*i <= N) var = max(var , (v1*i + (N-i*s1)/s2*v2 ) ); if(s2*i <= N) var = max(var , (v2*i + (N-i*s2)/s1*v1 ) ); } cout << "Case #" << t << ": "; cout << var << endl; } return 0;}
- UVA 12325 Zombie's Treasure Chest
- 【uva】12325 - Zombie's Treasure Chest
- UVA-12325-Zombie's Treasure Chest
- UVA - 12325 Zombie's Treasure Chest
- UVa 12325 - Zombie's Treasure Chest
- UVA 12325 Zombie's Treasure Chest
- UVA 12325 - Zombie's Treasure Chest
- UVA - 12325 Zombie's Treasure Chest
- uva 12325 - Zombie's Treasure Chest
- UVA 12325(p210)----Zombie's Treasure Chest
- 【UVa】12325 - Zombie's Treasure Chest
- uva 12325 - Zombie's Treasure Chest
- UVA 12325 Zombie's Treasure Chest
- uva 12325 Zombie's Treasure Chest
- uva 12325 Zombie's Treasure Chest
- Zombie's Treasure Chest UVA
- Zombie's Treasure Chest UVA
- 12325 Zombie's Treasure Chest
- 数据结构实验之二叉树六:哈夫曼编码
- 2-10 霍纳法则(秦九韶算法)--求多项式
- G470 deepin wifi无法开启
- 111. Minimum Depth of Binary Tree
- linux中rm命令使用详解
- 【UVa】12325 - Zombie's Treasure Chest
- c# 数据统计(将Datagridview的列数据合计)
- 【UVa】524 - Prime Ring Problem
- 第一行代码,Activity部分
- 使用Glide动态加载圆形图片和圆角图片
- Qt5设置应用程序图标
- xcode 7 打包静态库 .a 文件
- HDU 5807 分段 dp 将DAG分段进行
- 欢迎使用CSDN-markdown编辑器