Problems
Care for a chat?#3606
Very easy · Brute force · Geometry
Sort by growth#3607
Very easy · Prefix Sums · Sorting
Olympic Lottery#3608
Easy · Number theory
Initial speed#3609
Very easy · Math
Where to go?#3610
Medium · Greedy algorithms · Sorting
Olympic Winning Ticket#3611
Hard · Brute force
Marathon#3612
Hard · Dynamic programming · String suffix structures
Olympic luggage#3613
Very easy · Dynamic programming
Tourist Walk#3614
Medium · Shortest paths · Graphs
Range Minimum Query#3615
Very easy · Data Structures · Range queries
Permutations#3616
Very easy · Prefix Sums · Queries
Farm#3617
Easy · Prefix Sums
Hit and Blow#3618
Hard · Combinatorics
Turn Left#3619
Hard · Dijkstra algorithm · Shortest paths · Graphs
!#3620
Hard · Number theory · Prime factorization · Math
Speed#3621
Easy · Implementation
Spirograph#3622
Easy · Geometry
Mysterious Dungeons#3623
Easy · Graphs
Repeated Subsequences#3624
Easy · Dynamic programming
Petoris#3625
Medium · Brute force · Sorting
Pythagoraslope#3626
Very hard · Geometry
Brackets Sequence#3628
Easy · Dynamic programming
Maximum Flow A#3640
Very easy · Graphs
Maximum Flow B#3641
Easy · Graph network flows · Depth-first Search · Graphs
Edges removal#3642
Easy · Graphs