Обсуждение @ 1705. Зайцы-бандиты @ Timus Online Judge

Online Judge

Задачи

Авторы

Соревнования

Обсуждение задачи 1705. Зайцы-бандиты

Anonymous I don't understand the problem statement. [2] // Задача 1705. Зайцы-бандиты 26 апр 2009 01:52

Just as title. Would somebody explain it to me without spoiling the problem?

Nikita Re: I don't understand the problem statement. [1] // Задача 1705. Зайцы-бандиты 26 апр 2009 03:52

You have to find the minimum number k, which satisfy the condition (n div k) = (n div (k + 1)). Number n is given by the input.

Anonymous Re: I don't understand the problem statement. // Задача 1705. Зайцы-бандиты 26 апр 2009 21:57

Thank you so much.