Problemi

Molto facile · Math

Molto facile · Implementation

Facile · Hashing

Molto facile · Sorting · Hashing

Facile · Sorting · Data Structures

Molto facile · Implementation

Molto facile · Implementation

Molto difficile · Bitmasks · Dynamic programming · Graph matchings · Combinatorics

Facile · Depth-first Search

Molto difficile · Dynamic programming · Strings · Greedy algorithms · Prefix Function

Molto difficile · Data Structures · Disjoint set union · Graphs · Divide and Conquer · Segment Tree

Facile · Breadth-first Search

Difficile · Geometry · Trees · Constructive Algorithms · Depth-first Search · Sorting

Facile · Prefix Sums

Difficile · Dynamic programming · Prefix Sums

Media · String suffix structures · Strings

Molto difficile · Divide and Conquer · Sparse Table · Binary Search · Range queries · Number theory

Molto facile · Graphs

Difficile · Number theory · Math · Prefix Sums

Media · Greedy algorithms · Bitwise Operations

Molto difficile · Strings · Prefix Function · Matrix · Dynamic programming

Molto facile · Strings · Brute force

Facile · Implementation

Difficile · Graphs · Greedy algorithms · Sorting