Выбрать соревнование | Задачи | Послать решение | Результаты проверки | Статистика по задачам | Вопросы и ответы | Результаты соревнования | Состояние сервера | Изменить данные | Управление командой | Помощь |

Комбинаторика, теория Пойа

Олимпиадные задачи на английском языке

Олимпиадные задачи на английском языке

31/03/2007 | Тренировка (задачи ACM ICPC SE RC 2002) (B) |

*Ограничения: время – 2s/4s, память – 32MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод*

Послать решение Blockly Посылки Темы Где Обсудить (0)

King ACM 2002 received some clear ground and some money through inheritance. Terms of the will and testament require the heir to build `n` towns. He was also required to build the least quantity of two-way roads between the towns such that one could travel from any town to any other town **even if one road was closed under repair**. Carefully, all such roads must be constructed as geometrically straight lines. Further, the condition that a traveller be able to get from one town to another (even with one road closed) needs to be satisfied by traversing the roads as straight lines in their entirety – not stopping partway along one road to switch to another. Because of rich soil in those lands, the future inhabitants of the place have decided to produce beer. On the crossroads (a crossroad is merey the intersection of two or more roads) the king plans to build beer stands (one stand per a crossroad). So, if three or four (or twenty) roads intersect in a single point, theres still only one appropriate place for a beer stand. The King must choose locations for the towns and the roads. You need to advise him so that he builds as many beer stands as possible.

The first line of input contains the number of test cases. For each case there is a line containing a single integer `n` `(1\ ≤\ n\ ≤\ 32767)`. This represents the number of towns to be built.

For each `n`, print a line containing the maximum number of beer stands possible to build.

Sample Input

3 3 4 5

Sample Output

0 1 5