| № | Название | ||
|---|---|---|---|
| C |
стандартный ввод/вывод
1 с, 256 МБ
|
|
 x66
|
| D |
стандартный ввод/вывод
2 с, 256 МБ
|
|
x46
|
| E |
стандартный ввод/вывод
1 с, 256 МБ
|
|
x37
|
| F |
стандартный ввод/вывод
1 с, 256 МБ
|
|
x14
|
| G |
стандартный ввод/вывод
1 с, 256 МБ
|
|
x5
|
| H |
стандартный ввод/вывод
2 с, 256 МБ
|
|
x14
|
| I |
стандартный ввод/вывод
10 с, 256 МБ
|
|
x10
|
| J |
стандартный ввод/вывод
4 с, 256 МБ
|
|
x8
|
| K |
стандартный ввод/вывод
4 с, 256 МБ
|
|
x2
|
| Вопрос | Ответ | |
|---|---|---|
|
2020-11-07 03:30:24
|
Any wrong submissions will be ignored, sorry for the issues.
|
|
|
2020-11-07 03:29:57
|
There's a slight issue with the bounds that is being updated right now, the upper bound for the tacos, costs, and counts (t, c, c) are all 10^4. The upper bound for the number of exchanges is 10^5.
|
|
|
2020-11-07 03:24:00
|
Note that the question isn't asking about what is possible to prove, it's asking what implications are not already proved by the implications that Aditya already has.
|
