Problemi

Facile · Constructive Algorithms · Brute force

Media · Bitwise Operations · Divide and Conquer · Combinatorics · Sorting

Molto difficile · Sorting · Binary Search · Prefix Sums · Greedy algorithms

Molto difficile · Number theory · Prime factorization · Binary Search · Prefix Sums

Facile · Greedy algorithms · Sorting

Media · Hashing

Difficile · Bitwise Operations · Greedy algorithms · Two pointers · Prefix Sums

Molto difficile · Prefix Sums · Math · Queries

Molto difficile · Trees · Greedy algorithms · Segment Tree · Data Structures · Range queries · Sorting

Media · Breadth-first Search · Graphs

Difficile · Greedy algorithms · Priority Queue · Data Structures

Media · Combinatorics · Dynamic programming

Difficile · Trees · Graphs · Greedy algorithms

Facile · Math · Combinatorics · Hashing

Media · Constructive Algorithms · Combinatorics

Difficile · Dynamic programming · SQRT Decomposition · Prefix Sums · Greedy algorithms

Molto difficile · Segment Tree · Fenwick Tree · Binary Search · Data Structures · Prefix Sums

Molto difficile · Divide and Conquer · Sorting · Prefix Sums · Data Structures

Molto facile · Implementation

Media · Constructive Algorithms · Combinatorics · Math

Media · Prefix Sums · Hashing

Media · Sorting · Binary Search · Prefix Sums

Media · Greedy algorithms · Math · Constructive Algorithms · Sorting

Facile · Number theory · Prime factorization

Difficile · Combinatorics · Math · Greedy algorithms · Prefix Sums