Probleme

Triangulation#5958

Ușor · Geometry · Brute force

Circles#5959

Foarte dificil · Geometry · Data Structures · SQRT Decomposition · Randomized algorithms

Broken#5960

Ușor · Geometry · Math

Bridges#5961

Foarte dificil · Convex Hull · Geometry · Data Structures · Divide and Conquer

Voronoi Diagram#5962

Foarte dificil · Geometry · Data Structures · Divide and Conquer

Bean Harvest#5963

Dificil · Prefix Sums · Segment Tree

Reverse collection of beans#5964

Mediu · Implementation · String suffix structures

The Great Bean Gathering#5965

Foarte dificil · Binary Search

Comparison of Continued Fractions#5966

Dificil · Implementation · Math

Comparison of Periodic Continued Fractions#5967

Dificil · Math · Number theory · Matrix

Quadratic Irrationality Representation#5968

Dificil · Math · Number theory

Adding Continued Fractions#5969

Mediu · String suffix structures

F(4)-decomposition#5970

Foarte dificil · Number theory · Math · Constructive Algorithms

McCulloch's Machine#5971

Foarte dificil · Implementation

Out of the line!#5973

Foarte ușor · Dynamic programming

Olympic system#5974

Foarte dificil · Dynamic programming

Triplets - 2#5975

Mediu · Math · Brute force

How many increasing - 2#5976

Ușor · Dynamic programming

What is the template?#5977

Ușor · Implementation

How many templates?#5978

Dificil · Dynamic programming

What word?#5979

Ușor · Math · Combinatorics · Strings

How to seat?#5980

Foarte dificil · Combinatorics · Dynamic programming

Process the expression#5981

Dificil · Expression parsing · Math

The Most Mobile - 2#5982

Dificil · Sorting

5201-5225 din 9226