Discussion @ 1053. Pinocchio @ Timus Online Judge

Simeon Kostenski Has anyone solved this? (Please HELP). Explain me the problem, please [4] // Problem 1053. Pinocchio 22 Apr 2001 23:23

Can anyone explain me the problem. Minimal
numbers????????????????? What on earth is that. I have gone
throuh he webboard but found nothing answering my question.
I just can't understand where the mistake is. In my
program? I don't know. But either the example or the
algorithm explained is absolutely wrong. Tell me please :)

Ilya Semenov (NSU) Yes, the example was incorrect, nevertheless the algorithm is clear and it's quite easy to understand what do they want from you. Think while and u will understand that the problem in fact has a very [3] // Problem 1053. Pinocchio 24 Apr 2001 10:22

heh... I didn't got the clue when I have been solving it,
my program of course solved it OK, but it worked 500ms
while other's programs worked 20-30 ms :)

CEBKA It is very simple alghorithm [2] // Problem 1053. Pinocchio 11 Dec 2001 23:20

>Only find NOD of all pairs of numbers
>2 and 4 has NOD 2 e.t.c.

asadujjaman Re: It is very simple alghorithm [1] // Problem 1053. Pinocchio 8 Jul 2007 01:08

What the hell is a NOD on earth!!!
Can someone explain?

Alexander Georgiev Re: It is very simple alghorithm // Problem 1053. Pinocchio 8 Jul 2007 20:41

NOD = GCD (Greatest Common Divisor) (I think)
I guess it is from russian (for example in bulgarian it is NOD too, and the languages are close)

Discussion of Problem 1053. Pinocchio