Problemi
Wormly#2458
Difficile · Greedy algorithms · Prefix Sums · Implementation
Winnie-the-Pooh's Anniversary#2459
Molto facile · Strings
Suffix path#2460
Facile · Strings
Censorship#2461
Facile · Strings
Inexact match#2462
Facile · Strings
Period of a string#2463
Molto facile · Strings
Buzzing Professor#2464
Facile · Strings
The smallest cyclic shift#2465
Facile · Strings
Viruses#2466
Molto facile · Strings
KINA is not abbreviation#2467
Molto facile · Strings
Palindrome Factory#2468
Facile · Strings
Refrain#2469
Difficile · Suffix Array
Checking for an undirected graph#2470
Molto facile · Graphs
From adjacency matrix to the list of edges#2471
Molto facile · Implementation
Operations on graph#2472
Molto facile · Graphs
Index#2475
Molto difficile · Graphs
Friends and Enemies#2476
Facile · Graphs
Strange Tournament#2477
Molto difficile · Graphs
Faces of a Planar Graph#2478
Facile · Graphs
Parentheses Balance#2479
Molto facile · Strings
Hamiltonian cycle in a complete graph#2480
Media · Graphs
Linear Device#2481
Molto difficile · Graphs
Prune#2482
Media · Graphs
Word cutting#2483
Difficile · Brute force · Strings