| Title |
User |
Message |
Date Posted |
| Re: Help me with test case 10 |
jargon |
You're making a mistake in your end conditions. Edit: Here's another hint for you: you're going out of bounds. |
Oct 10, 2015 - 8:08:37 pm UTC |
| Help me with test case 10 |
competitivecoder |
Guys I am getting WA for just one case i.e 10 making 110/120.Can you please tell me what acutally answer for this case. |
Oct 09, 2015 - 1:46:27 pm UTC |
| Re: ... |
Alex |
For the past few months, running time measurements for programs have been abnormally slow and unpredictable. This is a known issue with the server that we just have to cope with for now. If it ever ge... |
Mar 14, 2014 - 7:25:02 pm UTC |
| ... |
helios26 |
Why is my Pascal solution faster than my C++ solution? They're practically identical. |
Mar 14, 2014 - 3:38:20 pm UTC |
| Re: output |
jargon |
See my note below. |
May 19, 2012 - 1:54:44 pm UTC |
| output |
michael137 |
It could be possible there is no amount of coins that can make change for x |
May 19, 2012 - 5:07:15 am UTC |
| Re: Re: can the coins added together be bigger than x as long as it is the least |
bobbyg212009 |
thx...more |
Apr 20, 2011 - 2:58:28 am UTC |
| Re: can the coins added together be bigger than x as long as it is the least num |
ilovepi |
You may assume they will be smaller than 100000. (Use a longint). Did you even read Yves's comment? It will tell you all you need to know. N is at max 100. A denomination is at most 1000. 100*1000=10... |
Apr 18, 2011 - 1:07:08 am UTC |
| can the coins added together be bigger than x as long as it is the least number |
bobbyg212009 |
can the coins added together be bigger than x as long as it is the least number |
Apr 18, 2011 - 1:02:46 am UTC |
| Note |
jargon |
1 |
Apr 08, 2011 - 8:25:33 pm UTC |
