| № | Название | ||
|---|---|---|---|
| A |
alpinism.in / alpinism.out
0,5 с, 256 МБ
|
|
 x64
|
| B |
cards.in / cards.out
0,5 с, 256 МБ
|
|
x84
|
| C |
system.in / system.out
0,5 с, 256 МБ
|
|
x15
|
| D |
points.in / points.out
0,5 с, 256 МБ
|
|
x65
|
| E |
balance.in / balance.out
0,5 с, 256 МБ
|
|
x16
|
| F |
polynomial.in / polynomial.out
0,5 с, 256 МБ
|
|
x57
|
| G |
greetings.in / greetings.out
1 с, 256 МБ
|
|
x18
|
| H |
simple.in / simple.out
1,5 с, 256 МБ
|
|
x17
|
| I |
prime.in / prime.out
1,5 с, 256 МБ
|
|
x66
|
| J |
squares.in / squares.out
0,5 с, 256 МБ
|
|
x23
|
| K |
language.in / language.out
0,5 с, 256 МБ
|
|
x37
|
| Вопрос | Ответ | |
|---|---|---|
|
2018-12-06 20:09:41
|
Watch out that many TLs are in fact significantly tighter on CF than what is written in statements.
|
|
|
2018-12-06 17:42:50
|
You can assume that p is a prime number.
|
|
|
2016-04-10 14:25:56
|
If there is no solution print -1
|
