Probleme

Circular Railway#4666

Foarte dificil · Graphs · Greedy algorithms

SETI#4667

Foarte dificil · Suffix Array · String suffix structures

2-3 Trees#4668

Foarte ușor · Dynamic programming

Search in the row#4669

Foarte ușor · Strings

Periods of Words#4670

Ușor · Prefix Function · Strings

Substring#4671

Foarte ușor · Strings

Word Count#4672

Foarte ușor · Graphs · String suffix structures · Depth-first Search

Palindrome. It is a palindrome.#4673

Foarte ușor · String suffix structures

Interesting language#4674

Dificil · Strings

Number of palindromes#4676

Mediu · Brute force

Program for a Program#4678

Ușor · Implementation

Mountain Holidays#4679

Foarte ușor · Math · Suffix Array

Divisors#4680

Ușor · Math

Desktop#4681

Dificil · Breadth-first Search · Graphs · Geometry · Sorting

Exam#4682

Dificil · Graph matchings · Greedy algorithms · Constructive Algorithms

Search for a string#4683

Ușor · Strings · Implementation

Lucky ticket#4684

Foarte dificil · Brute force

Distance#4685

Ușor · Geometry · Brute force

Two templates#4686

Ușor · Dynamic programming

Tram#4687

Foarte ușor · Graphs

Median Weight Bead#4688

Mediu · Graphs · Shortest paths

Adventure#4699

Foarte dificil · Greedy algorithms

Boxes#4701

Mediu · Greedy algorithms · Sorting

Lovely Elephants#4715

Foarte ușor · Math

4301-4325 din 9226