Задачи
Wormly#2458
Тешко · Greedy algorithms · Prefix Sums · Implementation
Winnie-the-Pooh's Anniversary#2459
Многу лесно · Strings
Suffix path#2460
Лесно · Strings
Censorship#2461
Лесно · Strings
Inexact match#2462
Лесно · Strings
Period of a string#2463
Многу лесно · Strings
Buzzing Professor#2464
Лесно · Strings
The smallest cyclic shift#2465
Лесно · Strings
Viruses#2466
Многу лесно · Strings
KINA is not abbreviation#2467
Многу лесно · Strings
Palindrome Factory#2468
Лесно · Strings
Refrain#2469
Тешко · Suffix Array
Checking for an undirected graph#2470
Многу лесно · Graphs
From adjacency matrix to the list of edges#2471
Многу лесно · Implementation
Operations on graph#2472
Многу лесно · Graphs
Index#2475
Многу тешко · Graphs
Friends and Enemies#2476
Лесно · Graphs
Strange Tournament#2477
Многу тешко · Graphs
Faces of a Planar Graph#2478
Лесно · Graphs
Parentheses Balance#2479
Многу лесно · Strings
Hamiltonian cycle in a complete graph#2480
Средно · Graphs
Linear Device#2481
Многу тешко · Graphs
Prune#2482
Средно · Graphs
Word cutting#2483
Тешко · Brute force · Strings