Probleme

Care for a chat?#3606

Foarte ușor · Brute force · Geometry

Sort by growth#3607

Foarte ușor · Prefix Sums · Sorting

Olympic Lottery#3608

Ușor · Number theory

Initial speed#3609

Foarte ușor · Math

Where to go?#3610

Mediu · Greedy algorithms · Sorting

Olympic Winning Ticket#3611

Dificil · Brute force

Marathon#3612

Dificil · Dynamic programming · String suffix structures

Olympic luggage#3613

Foarte ușor · Dynamic programming

Tourist Walk#3614

Mediu · Shortest paths · Graphs

Range Minimum Query#3615

Foarte ușor · Data Structures · Range queries

Permutations#3616

Foarte ușor · Prefix Sums · Queries

Farm#3617

Ușor · Prefix Sums

Hit and Blow#3618

Dificil · Combinatorics

Turn Left#3619

Dificil · Dijkstra algorithm · Shortest paths · Graphs

!#3620

Dificil · Number theory · Prime factorization · Math

Speed#3621

Ușor · Implementation

Spirograph#3622

Ușor · Geometry

Repeated Subsequences#3624

Ușor · Dynamic programming

Petoris#3625

Mediu · Brute force · Sorting

Pythagoraslope#3626

Foarte dificil · Geometry

Brackets Sequence#3628

Ușor · Dynamic programming

Maximum Flow A#3640

Foarte ușor · Graphs

Maximum Flow B#3641

Ușor · Graph network flows · Depth-first Search · Graphs

Edges removal#3642

Ușor · Graphs

3401-3425 din 9226