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
run4glory:
2019-01-17 21:10:05
I dont get it, how can I know how many test cases there are and when my loop has to stop? I'm solving my first problem here |
|
ausr:
2019-01-15 23:14:13
from collections import defaultdict |
|
indsonu:
2019-01-09 11:59:35
hey i m new to this site can sb tell what is AC? |
|
suraj_13:
2019-01-04 14:06:25
It's advisable to use dynamic array.
|
|
yogesh_n:
2019-01-04 10:37:29
I submitted solution , but it is showing wrong answer but not showing what is wrong . But in visual studio IDE , it is working fine . Can somebody help me . |
|
chotukv:
2018-12-28 11:09:04
How the input ends? |
|
ankitpriyarup:
2018-12-23 12:12:52
Costed me 3 TLE because of silly mistake XD |
|
rishb27:
2018-12-19 08:13:29
Recursion works as height is function log N not N because we are dividing input each time by 2,3,4.. |
|
chinmay_sharma:
2018-12-08 12:49:09
how many test cases is required ?
|
|
onlyforcoding:
2018-12-06 12:29:49
@midoriya just shut up. Keep that to yourself. |
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 |