Connection Status:
Competition Arena > CoinsExchange

CoinsExchange

SRM 351 · 2007-05-29 · by Andrew_Lazarev

SRM 351 · 2007-05-29 · by Andrew_Lazarev · Simulation
Class Name: CoinsExchange
Return Type: int
Method Name: countExchanges
Arg Types: (int, int, int, int, int, int)
Problem Statement

Problem Statement

Your character in an RPG game has G1 gold, S1 silver and B1 bronze coins. You need G2 gold, S2 silver and B2 bronze coins to buy a new armor. A bank in the game supports four types of exchange operations:

  1. the bank will give you 9 silver coins in exchange for 1 gold coin
  2. the bank will give you 1 gold coin in exchange for 11 silver coins
  3. the bank will give you 9 bronze coins in exchange for 1 silver coin
  4. the bank will give you 1 silver coin in exchange for 11 bronze coins
Return the minimal number of exchange operations required for your character to hold at least G2 gold, at least S2 silver and at least B2 bronze coins. Return -1 if the character does not have enough money for that.

Constraints

  • G1, S1, B1, G2, S2 and B2 will each be between 0 and 1,000,000, inclusive.

Statement by TopCoder, Inc. — view the original on the archive.

Examples
0)
1
0
0
0
0
81
Returns: 10

Initially, you have one gold coin. You should exchange it for 9 silver coins. After that you should exchange each of the 9 silver coins for 9 bronze coins.

1)
1
100
12
5
53
33
Returns: 7
2)
1
100
12
5
63
33
Returns: -1
3)
5
10
12
3
7
9
Returns: 0
4)
27985
26108
47060
27974
25981
54185
Returns: -1

Submissions are judged against all 250 archived test cases, of which 5 are shown here. Case numbers match the judge’s.

Coding Area

Language: C++17 · define a public class CoinsExchange with a public method int countExchanges(int G1, int S1, int B1, int G2, int S2, int B2) · 250 test cases · 2 s / 256 MB per case

Submitting as anonymous