eolymp

Problems

Complexity
All Problems Very simple Simple Average Difficult Very difficult
game-theory
All Problems ---traveling-salesman-problem- -three- 2-sat algorithms-on-strings articulation-point backtracking beginners bellman-ford-algorithm binary-search bitwise-operators breadth-first-search bridges calculation-system catalan-numbers clique combinatorics connected-components depth-first-search dijkstra-algorithm diophantine-equations Others...
32
Queen and pawn
171 / 503
110
Game
1447 / 2401
148
Economic game "P&T" (RU)
147 / 283
308
Knicht and pawn against a Knicht
127 / 179
309
The bishop and pawn against the bishop
25 / 94
310
The letter from Prostokvashino (RU)
41 / 67
311
Maximum quantity of figures
109 / 155
312
ACM
439 / 652
334
Divide or pick up? (RU)
166 / 293
335
Game with switches
1346 / 1552
336
Only one lot? (RU)
121 / 194
337
Grandfather folded or not folded? (RU)
6 / 26
656
Игра умножения
656 / 1020
657
Playing with coins
289 / 428
658
Game strike out
99 / 162
659
Tree Games
106 / 139
660
Intelligent game Prostokvashino (RU)
229 / 290
1009
2D-Nim
203 / 216
1011
Nim
105 / 157
1014
Bones for Sharik 2
1 / 7
1015
S-Nim
31 / 42
1092
Left Mouse Button
34 / 51
1097
Nim
26 / 32
1180
Game on a Tree
39 / 75
1416
Paths on the board
80 / 146