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