Submit | All submissions | Best solutions | Back to list |
COINS - Bytelandian gold coins |
In Byteland they have a very strange monetary system.
Each Bytelandian gold coin has an integer number written on it. A coin n can be exchanged in a bank into three coins: n/2, n/3 and n/4. But these numbers are all rounded down (the banks have to make a profit).
You can also sell Bytelandian coins for American dollars. The exchange rate is 1:1. But you can not buy Bytelandian coins.
You have one gold coin. What is the maximum amount of American dollars you can get for it?
Input
The input will contain several test cases (not more than 10). Each testcase is a single line with a number n, 0 <= n <= 1 000 000 000. It is the number written on your coin.
Output
For each test case output a single line, containing the maximum amount of American dollars you can make.
Example
Input: 12 2 Output: 13 2
You can change 12 into 6, 4 and 3, and then change these into $6+$4+$3 = $13. If you try changing the coin 2 into 3 smaller coins, you will get 1, 0 and 0, and later you can get no more than $1 out of them. It is better just to change the 2 coin directly into $2.
Added by: | Tomek Czajka |
Date: | 2005-05-03 |
Time limit: | 9s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS PERL6 VB.NET |
Resource: | Purdue Programming Contest Training |
hide comments
|
||||||||||||||
2019-04-09 23:14:19
You can not make a dp array of size 10^9 so make dp array of size 10^6 , precompute all values of dp array.. Then make recursive call when n >10^6 with base condition n<=10^6(because you have already computed all results). |
||||||||||||||
2019-04-07 05:21:57
Use a map to memoize |
||||||||||||||
2019-04-05 14:09:14
How is the input provided? Getting "NZEC" error, |
||||||||||||||
2019-03-29 19:18:27
my first dp problem |
||||||||||||||
2019-03-23 22:37:54
for test cases-->while(cin >> n) do memo till 10^6 and then follow recursion. |
||||||||||||||
2019-03-20 16:30:22
just run for 10 test cases, it's working... don't use string and all to find no. of testcases.... |
||||||||||||||
2019-03-18 19:50:47
How to take input? I don't understand how to consider test cases. can somebody help me? Thanks! |
||||||||||||||
2019-03-18 09:28:54
I just use simple recursion, no array, no map. Got AC. And i have no idea why i dont get Stackoverflow. |
||||||||||||||
2019-03-06 11:40:56
You can use getline function and then convert the string into interger. |
||||||||||||||
2019-02-28 14:07:33
getting runtime error in Python3 but runs well in my ide Last edit: 2019-03-01 07:20:06 |