In the measurements it is written that when 1 response 1 2 3. But in the condition said "If there are several solutions, display, where a minimum. If such multiple, display, where the minimum of b and so on". So the correct answer should be 1 1 2.

(В промерах написано, что при 1 ответ 1 2 3. Но в условии сказано "Если решений несколько, вывести то, где a минимально. Если и таких несколько, вывести то, где минимально b и т.д". Поэтому правильный ответ должен быть 1 1 2.)

Edited by author 09.11.2014 17:33

Nuff said

WHYYYYY
if u have same problem
solution is 3 4 5

I remember once going to see him when he was ill at Putney. I had ridden in taxi cab number 1729 and remarked that the number seemed to me rather a dull one, and that I hoped it was not an unfavourable omen. "No," he replied, "it is a very interesting number; it is the smallest number expressible as the sum of two cubes in two different ways." G.H.Hardy
1729 = 1^3 + 12^3 = 9^3 + 10^3

See on hint in author of the problem.
One more hint:
Use wiki if you know nothing about Mr. Pierre

Edited by author 22.03.2016 02:06

search wikipedia for FERMAT'S LAST THEOREM and you will come to know everything about this problem.(1349 Farm)

Edited by author 01.11.2011 15:24

in sample for n=1  ->  1 2 3,

solve for n=1  ->  1 1 2 !!!

who right?

why my clever solution is wa5 and my stupid sol is acc?

Look at the author's name...)))



---------------------------------
Sorry, for my bad English...

... Three different *postitve* integers (a, b and c) ...

[Code deleted]

I have AC, but I can't prove it.

Edited by moderator 02.10.2021 16:15