描述：
Now that the Loonie is hovering about par with the Greenback, you have decided to use your $1000 entrance scholarship to engage in currency speculation. So you gaze into a crystal ball which predicts the closing exchange rate between Canadian and U.S. dollars for each of the next several days. On any given day, you can switch all of your money from Canadian to U.S. dollars, or vice versa, at the prevailing exchange rate, less a 3% commission, less any fraction of a cent.
Assuming your crystal ball is correct, what's the maximum amount of money you can have, in Canadian dollars, when you're done?
输入：
The input contains a number of test cases, followed by a line containing 0. Each test case begins with 0 <d ≤ 365, the number of days that your crystal ball can predict. d lines follow, giving the price of a U.S. dollar in Canadian dollars, as a real number.
输出：
For each test case, output a line giving the maximum amount of money, in Canadian dollars and cents, that it is possible to have at the end of the last prediction, assuming you may exchange money on any subset of the predicted days, in order.
样例输入：
3
1.0500
0.9300
0.9900
2
1.0500
1.1000
0
样例输出：
1001.60
1000.00
汇率
描述：
现在，卢尼是徘徊于美钞左右的，你已决定使用你的 1000 元入学奖学金从事货币投机。于是你盯着一个水晶球，里面预测着未来几天每天加元和美元的收盘汇率。在任何一天，你可以把你所有的钱从加拿大换成美元，反之亦然，以当时的汇率，少 3 %的佣金，少一美分的零头。
假设你的水晶球是正确的，那么当你完成任务后，你最多可以有多少钱，换成加元？
输入：
输入包含多个测试用例，后面是包含 0 的一行。每个测试包含0。0< d ≤ 365 ,您的水晶球可以预测的天数. d 条线随后,以加元表示美元的价格,作为实数。输出：
对于每个测试用例，输出一行给出最大金额的货币，以加元和美分计,最后一个预测的结尾可能会出现假设您可以按顺序在预测日期的任意子集兑换货币。
样例输入：
3
1.0500
0.9300
0.9900
2
1.0500
1.1000
0
样例输出：
1001.60
1000.00
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
