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
170 / 489
110
Game
1388 / 2300
148
Economic game "P&T" (RU)
147 / 283
308
Knicht and pawn against a Knicht
126 / 175
309
The bishop and pawn against the bishop
25 / 92
310
The letter from Prostokvashino (RU)
39 / 65
311
Maximum quantity of figures
109 / 155
312
ACM
429 / 640
334
Divide or pick up? (RU)
161 / 282
335
Game with switches
1323 / 1527
336
Only one lot? (RU)
105 / 176
337
Grandfather folded or not folded? (RU)
6 / 26
656
Игра умножения
622 / 970
657
Playing with coins
285 / 413
658
Game strike out
99 / 162
659
Tree Games
104 / 136
660
Intelligent game Prostokvashino (RU)
173 / 204
1009
2D-Nim
176 / 189
1011
Nim
105 / 156
1014
Bones for Sharik 2
1 / 7
1015
S-Nim
29 / 40
1092
Left Mouse Button
34 / 51
1097
Nim
26 / 32
1180
Game on a Tree
39 / 70
1416
Paths on the board
80 / 146