Problemi

Difficile · Greedy algorithms · Fenwick Tree · Data Structures · Prefix Sums

Molto difficile · Constructive Algorithms · Greedy algorithms · Graphs · Math

Molto difficile · 2-SAT · Binary Search · Segment Tree · Data Structures · Prefix Sums · Graphs

Molto difficile · Meet-in-the-middle · Graphs · Trees · Depth-first Search · Bitmasks · Greedy algorithms · Constructive Algorithms

Facile · Implementation

Media · Math · Constructive Algorithms

Molto facile · Implementation

Difficile · Math · Combinatorics

Media · Brute force · Number theory

Media · Dynamic programming · Combinatorics

Media · Math · Greedy algorithms

Molto difficile · Dynamic programming · Prefix Sums · Stacks · Combinatorics

Facile · Hashing · Implementation

Media · Greedy algorithms · Sorting · Number theory

Difficile · Prefix Sums · Binary Search · Fenwick Tree · Sorting

Difficile · Bitmasks · Bitwise Operations · Dynamic programming · Breadth-first Search

Molto difficile · Dynamic programming · Combinatorics · Number theory · Prefix Sums

Molto facile · 2-SAT

Molto difficile · Two pointers · Prefix Sums · Greedy algorithms

Molto difficile · Dynamic programming · Sorting · Segment Tree · Data Structures

Molto difficile · Segment Tree · Data Structures · Greedy algorithms · Combinatorics

Molto difficile · Greedy algorithms · Sorting · Constructive Algorithms

Difficile · Constructive Algorithms · Math

Molto difficile · Dynamic programming · Greedy algorithms · Strings · Constructive Algorithms

Molto difficile · Bitwise Operations