| № | Название | ||
|---|---|---|---|
| C |
стандартный ввод/вывод
1 с, 256 МБ
|
|
|
| D |
стандартный ввод/вывод
1 с, 256 МБ
|
|
|
| E |
стандартный ввод/вывод
1 с, 256 МБ
|
|
|
| F |
стандартный ввод/вывод
1 с, 256 МБ
|
|
|
| G |
стандартный ввод/вывод
1 с, 256 МБ
|
|
|
| H |
стандартный ввод/вывод
1 с, 256 МБ
|
|
|
| I |
стандартный ввод/вывод
1 с, 256 МБ
|
|
|
| J |
стандартный ввод/вывод
1 с, 256 МБ
|
|
|
| K |
стандартный ввод/вывод
3 с, 256 МБ
|
|
|
| Вопрос | Ответ | |
|---|---|---|
|
2020-10-24 03:25:16
|
There is a slight misprint in this problem. Assume that there are 101 houses instead of 100, where the 101st house will give w^100 candies. You will have cubes of size 1, w, w^2, ..., w^100.
|
|
|
2020-10-24 02:42:34
|
We are currently fixing the misprint that says spooky numbers can only be positive, since 0 is spooky as well. Please use the sample data as a guideline for solving the problem.
|
|
|
2020-10-24 02:38:58
|
Задача E. Spooky Numbers ***** The problem statement claims that any positive number divisible by 2, 3, or 5 is spooky. Why is the answer for the first sample case `0` and not `-1`, since zero is not positive? |
Sorry, that was a misprint! It should say nonnegative instead of positive.
|