Problemi

Maximum Sum#2911

Facile · Segment Tree · Prefix Sums · Queries

Glass Beads#2912

Molto facile · Strings

XOR pairs#2915

Facile · Binary Search

Translating pebbles#2918

Facile · Greedy algorithms

Is this the left heap?#2919

Facile · Binary Search · Data Structures

Height of the left tree#2920

Media · Data Structures · Math · Binary Search

The Right Path of the Left Tree#2921

Molto facile · Binary Search

Union of rectangles 2#2922

Molto facile · Sorting · Geometry

Tree#2923

Molto facile · Trees

Tree in a Segment#2924

Facile · Depth-first Search · Trees · Queries

Strings in the Tree#2925

Difficile · Graphs · String suffix structures

Combined rectangles#2926

Molto facile · Geometry · Sorting

Union of Sets#2927

Molto facile · Sorting

Non-prefix codes#2928

Facile · Greedy algorithms

Rain#2929

Facile · Geometry · Dynamic programming

The square of a number of units#2930

Difficile · Brute force

Dima and the Famous Tourist#2931

Facile · Graphs · Shortest paths

Dima and lines#2932

Molto facile · Implementation · String suffix structures · Data Structures

Dima and the Computer Game#2933

Molto facile · Geometry

Dima and Percentages#2935

Facile · Probabilities · Strings

Dima & module#2936

Difficile · Number theory · Bitwise Operations · Math

Maksym and the Time Machine#2937

Facile · Segment Tree · Implementation

Dima and the Time Machine#2938

Molto facile · Segment Tree · Prefix Sums

Dima and array 1#2939

Facile · Segment Tree · Implementation

2776-2800 di 9226