Problemi

Molto facile · Brute force

Molto facile · Math

Molto difficile · Dynamic programming · Prefix Sums

Molto facile · Implementation

Molto facile · Brute force

Facile · Math

Facile · Sorting

Molto facile · Implementation

Media · Prefix Sums · Binary Search

Difficile · Data Structures · Fenwick Tree · Segment Tree · Greedy algorithms

Media · Number theory · Strings

Difficile · Segment Tree · Range queries · Prefix Sums

Molto difficile · Dynamic programming · Trees · Depth-first Search · Greedy algorithms · Data Structures

Molto facile · Implementation

Media · Implementation

Facile · Brute force · Bitwise Operations

Media · Math · Number theory

Molto facile · Brute force

Molto facile · Sorting

Facile · Graphs · Binary Search

Facile · Strings · Prefix Function

Difficile · Greedy algorithms · Sorting · Data Structures · Constructive Algorithms

Molto difficile · Trees · Combinatorics · Math · Dynamic programming

Molto difficile · String suffix structures · Hashing · Data Structures · Trees · Strings

Difficile · Constructive Algorithms · Bitwise Operations