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.
hide comments
divyansh0:
2017-12-06 15:41:15
Got correct answer on ideone but got segmentation fault while submitting in spoj |
|
laskowski93:
2017-12-04 01:53:31
Managed to code this with 7 lines in c++(if you would like to make it ugly, you can write it in 3 ;) ). Ez Last edit: 2017-12-04 02:05:14 |
|
sahil070197:
2017-10-25 20:15:16
while(cin>>n)
|
|
pranav018:
2017-10-24 23:01:14
how to know the number of times we have to run our code? the number of inputs?? how to make the program run as long as the input is available in c++ Last edit: 2017-10-24 23:01:57 |
|
ravikatiyar52:
2017-10-24 12:06:53
how to know which test case is failing ? |
|
rp789:
2017-10-20 21:06:40
Be careful with the input. It's not just one test case. You have to make the program run as long as the input is available. |
|
coder_137:
2017-10-19 11:44:57
What do we do for the input?
|
|
codeshot:
2017-10-18 16:41:33
Right answer on codeblocks but wrong on ideone
|
|
kamlesh_2209:
2017-10-16 14:07:51
my first DP!! enjoyed solving it!! ac in 2nd go...
|
|
raghukul:
2017-10-05 11:08:01
time limit is very loose, AC without storing the values :P |
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 |