Обсуждение @ 1023. Пуговицы @ Timus Online Judge

xMagGTU Дмитрий Тишкин GPRS why this code correct and more than, so fast? [3] // Задача 1023. Пуговицы 19 май 2007 23:54

var i,k:longint;
begin
read(k);
i:=k div 3;
while(k mod i<>0) do
i:=k div(k div i +1);
write(k div i-1);
end.

Edited by author 19.05.2007 23:58

Nickolas Kakà Re: why this code correct and more than, so fast? [1] // Задача 1023. Пуговицы 6 апр 2008 20:25

So fabulous.

AlexeyPechenin Re: why this code correct and more than, so fast? // Задача 1023. Пуговицы 4 окт 2008 20:21

Excellent... After you found maximal divider of K you can found minimal devider of K.... Excellent solution...

Gora Re: why this code correct and more than, so fast? // Задача 1023. Пуговицы 27 апр 2011 02:00

Explain this solution, please.
I'm a beginning programmer, so I can't understand.

Обсуждение задачи 1023. Пуговицы