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
impulse:
2011-06-16 11:23:31
geez, i got tle 3 times and now AC just because while (scanf()!=EOF)..., thank for @Santiago Palacio comment.. |
|
Prashant Gupta:
2011-06-16 08:07:58
Getting NZEC again and again help please ! |
|
sandeep aggrawal:
2011-06-15 13:55:33
Is unsigned long long int is sufficient for the answer??
|
|
Santiago Palacio:
2011-05-03 06:28:37
Can i use while(!EOF) in c++? and, does every answer fit in an unsigned long long int?
|
|
albertg:
2011-04-29 07:23:27
For 3 output is 3. |
|
Rocker3011:
2011-04-23 02:13:51
hey i don´t get it, this doesn´t have any stopping input condition? |
|
Termvader:
2011-04-03 03:22:47
I am getting the same answer (4243218150) for 1000000000 but still the solution checker tells me wrong answer
|
|
mostafa alaa mohammed:
2011-02-05 23:05:39
can any one tell me if input is 3 what is the output
|
|
:D:
2009-09-23 10:56:15
The imput terminates on EOF. 0 is a valid test case and 10 is a maximum number of test cases not the exact number. |
|
Team101:
2009-03-25 01:32:48
Input:
|
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 |