Problemat

Mutation#966

E vështirë · Greedy algorithms

Museum#967

Mesatare · Dynamic programming

Distance between numbers#968

E vështirë · Implementation · Brute force

Crisis#969

E lehtë · Dynamic programming

Pair of points#970

Shumë e vështirë · Greedy algorithms · Graphs

Josephus problem#971

Mesatare · Sorting

Sorting time#972

E lehtë · Sorting · Implementation

Maximum sum on a tree#973

E lehtë · Graphs · Depth-first Search

Floyd - 1#974

E lehtë · Dynamic programming · Shortest paths · Graphs

Floyd#975

Shumë e lehtë · Graphs

Floyd - existence#976

E lehtë · Graphs

Is it a Tree?#977

Shumë e lehtë · Trees · Graphs

Get a tree#978

Shumë e lehtë · Trees · Graphs · Depth-first Search

Frame-workout 1#979

Shumë e lehtë · Implementation · Brute force

Frame-workout 2#980

Shumë e lehtë · Brute force · Implementation

Minimum spanning tree#981

E lehtë · Graphs · Disjoint set union · Sorting · Greedy algorithms

Connectivity#982

Shumë e lehtë · Graphs · Depth-first Search

Tree Edges Coloring#983

E lehtë · Graphs

Number of cycles#984

Mesatare · Graphs

Scheduled Checking#985

Shumë e vështirë · Graphs

Picking Numbers#986

Shumë e lehtë · Dynamic programming

Nails#987

Shumë e lehtë · Dynamic programming

Subsequence#988

Shumë e lehtë · Dynamic programming

Ladders#989

Shumë e lehtë · Dynamic programming

12345#990

Shumë e lehtë · Implementation

951-975 nga 9226