22529_CurrencyExchange

2022-5-16 18:22| 发布者: Hocassian| 查看: 21| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506530850400-Problem List-采集的数据-后羿采集器.html

Pro.ID

22529

Title

Currency Exchange

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22529

AC

0

Submit

1

Ratio

0.00%

时间&空间限制

  • Time Limit: 1000/500 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others)
  • 描述

    When Issac Bernand Miller takes a trip to another country, say to France, he exchanges his US dollars for French francs. The exchange rate is a real number such that when multiplied by the number of dollars gives the number of francs. For example, if the exchange rate for US dollars to French francs is 4.81724, then 10 dollars is exchanged for 48.1724 francs. Of course, you can only get hundredth of a franc, so the actual amount you get is rounded to the nearest hundredth. (We'll round .005 up to .01.) All exchanges of money between any two countries are rounded to the nearest hundredth.

    Sometimes Issac's trips take him to many countries and he exchanges money from one foreign country for that of another. When he finally arrives back home, he exchanges his money back for US dollars. This has got Issac thinking about how much if his unspent US dollars is lost (or gained!) to these exchange rartes. You'll compute how much money Issac ends up with if he exchanges it many times. You'll always start with US dollars and you'll always end with US dollars.

    输入

    The first 5 lines of input will be the exchange rates between 5 countries, numbered 1 through 5. Line i will five the exchange rate from country i to each of the 5 countries. Thus the j-th entry of line i will give the exchange rate from the currency of country i to the currency of country j. the exchange rate form country i to itself will always be 1 and country 1 will be the US. Each of the next lines will indicate a trip and be of the form

    N c1 c2 ... cn m

    Where 1 ≤ n ≤ 10 and c1, ..., cn are integers from 2 through 5 indicating the order in which Issac visits the countries. (A value of n = 0 indicates end of input, in which case there will be no more numbers on the line.) So, his trip will be 1 → c1c2 → ... → cn → 1. the real number m will be the amount of US dollars at the start of the trip.

    The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

    输出

    Description

    When Issac Bernand Miller takes a trip to another country, say to France, he exchanges his US dollars for French francs. The exchange rate is a real number such that when multiplied by the number of dollars gives the number of francs. For example, if the exchange rate for US dollars to French francs is 4.81724, then 10 dollars is exchanged for 48.1724 francs. Of course, you can only get hundredth of a franc, so the actual amount you get is rounded to the nearest hundredth. (We'll round .005 up to .01.) All exchanges of money between any two countries are rounded to the nearest hundredth.

    Sometimes Issac's trips take him to many countries and he exchanges money from one foreign country for that of another. When he finally arrives back home, he exchanges his money back for US dollars. This has got Issac thinking about how much if his unspent US dollars is lost (or gained!) to these exchange rartes. You'll compute how much money Issac ends up with if he exchanges it many times. You'll always start with US dollars and you'll always end with US dollars.

    Input

    The first 5 lines of input will be the exchange rates between 5 countries, numbered 1 through 5. Line i will five the exchange rate from country i to each of the 5 countries. Thus the j-th entry of line i will give the exchange rate from the currency of country i to the currency of country j. the exchange rate form country i to itself will always be 1 and country 1 will be the US. Each of the next lines will indicate a trip and be of the form

    N c1 c2 ... cn m

    Where 1 ≤ n ≤ 10 and c1, ..., cn are integers from 2 through 5 indicating the order in which Issac visits the countries. (A value of n = 0 indicates end of input, in which case there will be no more numbers on the line.) So, his trip will be 1 → c1c2 → ... → cn → 1. the real number m will be the amount of US dollars at the start of the trip.

    The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

    Output

    Each trip will generate one line of output giving the amount of US dollars upon his return home from the trip. The amount should be fiven to the nearest cent, and should be displayed in the usual form with cents given to the right of the decimal point, as shown in the sample output. If the amount is less than one dollar, the output should have a zero in the dollars place.

    The output format consists of N output blocks. There is a blank line between output blocks.

    Sample Input

    1 1.57556 1.10521 0.691426 7.25005
    0.634602 1 0.701196 0.43856 4.59847
    0.904750 1.42647 1 0.625627 6.55957
    1.44616 2.28059 1.59840 1 10.4843
    0.137931 0.217555 0.152449 0.0953772 1
    3 2 4 5 20.00
    1 3 100.00
    6 2 3 4 2 4 3 120.03
    0

    Sample Output

    19.98
    99.99
    120.01

    Source

    样例输入

    1 1.57556 1.10521 0.691426 7.25005
    0.634602 1 0.701196 0.43856 4.59847
    0.904750 1.42647 1 0.625627 6.55957
    1.44616 2.28059 1.59840 1 10.4843
    0.137931 0.217555 0.152449 0.0953772 1
    3 2 4 5 20.00
    1 3 100.00
    6 2 3 4 2 4 3 120.03
    0

    样例输出

    19.98
    99.99
    120.01

    作者


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部