Comments
|
0
What if in problem C instead of finding one multiple of K we just find all of them using your algorithm and then we say that answer is the greatest common divisor of them? |
|
On anup.kalbalia →
Invitation to CodeChef’s 3rd Anniversary March 2012 Algorithm Challenge, 3 months ago
0
By the way, what is this “new forum” the banner talk about? I don’t see any changes in tasks’ comment area, so maybe you could give us a link to see this forum? |
|
+19
All problem statements are empty =(
|
|
+5
Amazing! Both idea and implementation are superb! The only thing I am thinking about: it's very easy to edit your script so that it works in rooms as well. Wouldn't it be considered as a cheat in competitions because you can, for example, just ignore all java solutions if you don't know java?
|
|
0
Is site offline only for me right now?
|
|
+3
Have you tried generating some first values and then searching this sequence on oeis.org? I'm quite sure that you will find it there(if formula in closed form exists).
|
|
0
Sorry, in the first formula above, n should be x, m is y and r is z.
|
|
0
The answer is: where |
|
0
Thank you for this useful article. I didn't know about far:view feature even though I have been using FAR for 1 year. However, all these far:view, far:edit and other commands don't work when you set "Execute command " in "File association" menu. Do you know any workaround for this issue?
|
|
0
If I'm not mistaken, here is what you need: http://en.wikipedia.org/wiki/Kirchhoff's_theorem .
|
|
0
Can anyone tell me what can be bug with WA 6 in problem C? |