Probleme

Help the Museum#6853

Dificil · Breadth-first Search · Graphs · Shortest paths

How Many Days Are There?#6854

Foarte dificil · Implementation

Cut out#6855

Dificil · Geometry · Ternary search · Combinatorics

Cocktail#6856

Foarte dificil · Geometry

Increasing subsequences#6857

Foarte dificil · Dynamic programming

Map Generator#6858

Ușor · Graphs · Probabilities

Map Generator returns (MG-II)#6859

Ușor · Dynamic programming

Trigonometric optimization#6860

Foarte dificil · Optimization

Supersquare#6861

Foarte dificil · Math · Brute force

"Roman" corridor#6863

Ușor · Graphs · Dynamic programming

Parabolic teleports#6864

Dificil · Dijkstra algorithm · Geometry · Optimization

Magic pyramid#6865

Foarte dificil · Brute force · Graphs

ABC for blind#6875

Mediu · Combinatorics · Number theory

Works#6880

Ușor · Math · Constructive Algorithms

Collatz Conjecture#6897

Foarte ușor · Implementation · Brute force

Smart File Name Sorting#6898

Mediu · Strings · Sorting

RNA Molecules#6899

Foarte dificil · Dynamic programming

Pirates#6900

Dificil · Graph network flows · Graphs · Shortest paths

Shuffling Strings#6901

Ușor · Implementation · Strings

Guess Number#6902

Dificil · Dynamic programming · Combinatorics

Subset Sum#6903

Mediu · Dynamic programming

Minesweeper#6904

Foarte dificil · Graphs

Tunb Airline#6905

Foarte dificil · Geometry · Optimization · Ternary search

Fortune Team#6906

Foarte ușor · Greedy algorithms

5801-5825 din 9226