Meseleler

Sphere#1969

Örän kyn · Graphs · Shortest paths

David Copperfield is resting#1970

Örän ýeňil · Implementation

Fateful Chess Puzzle#1971

Örän ýeňil · Combinatorics

Splitting#1972

Orta · Number theory

Rollback#1973

Örän ýeňil · Segment Tree · Prefix Sums · Queries

Random Acts of Kindness Day#1974

Örän ýeňil · Math · Implementation

The tightly bound son of the mountains#1975

Kyn · Graphs · Shortest paths

Programming is an art!#1976

Örän kyn · Greedy algorithms

Organizational Problems: A Topic for a Dissertation?#1978

Ýeňil · Graphs · Graph network flows

Railroad#1979

Orta · Graphs · Depth-first Search · Graph matchings

Shadow Protocol#1980

Örän ýeňil · Chinese remainder theorem

Mushroom#1981

Örän ýeňil · Dynamic programming

Highways#1982

Orta · Graphs

Ricefield#1983

Örän ýeňil · Implementation

Fractions#1984

Ýeňil · Math · Combinatorics

Primes Anna#1985

Orta · Number theory · Implementation

Anna and the palindrome#1986

Orta · Strings · Brute force

The Next Permutation#1987

Örän ýeňil · Implementation

The largest increasing subsequence#1988

Ýeňil · Dynamic programming

Maximum matching#1989

Orta · Graph matchings · Graphs · Breadth-first Search · Depth-first Search

Domino 2#1990

Örän ýeňil · Graphs

Maximum flow#1991

Örän ýeňil · Graphs

Dividing the graph#1992

Ýeňil · Graphs

Weighing#1993

Örän ýeňil · Math

1926-1950 / 9226