Задачи

Mutation#966

Тешко · Greedy algorithms

Museum#967

Средно · Dynamic programming

Distance between numbers#968

Тешко · Implementation · Brute force

Crisis#969

Лесно · Dynamic programming

Pair of points#970

Многу тешко · Greedy algorithms · Graphs

Josephus problem#971

Средно · Sorting

Sorting time#972

Лесно · Sorting · Implementation

Maximum sum on a tree#973

Лесно · Graphs · Depth-first Search

Floyd - 1#974

Лесно · Dynamic programming · Shortest paths · Graphs

Floyd#975

Многу лесно · Graphs

Floyd - existence#976

Лесно · Graphs

Is it a Tree?#977

Многу лесно · Trees · Graphs

Get a tree#978

Многу лесно · Trees · Graphs · Depth-first Search

Frame-workout 1#979

Многу лесно · Implementation · Brute force

Frame-workout 2#980

Многу лесно · Brute force · Implementation

Minimum spanning tree#981

Лесно · Graphs · Disjoint set union · Sorting · Greedy algorithms

Connectivity#982

Многу лесно · Graphs · Depth-first Search

Tree Edges Coloring#983

Лесно · Graphs

Number of cycles#984

Средно · Graphs

Scheduled Checking#985

Многу тешко · Graphs

Picking Numbers#986

Многу лесно · Dynamic programming

Nails#987

Многу лесно · Dynamic programming

Subsequence#988

Многу лесно · Dynamic programming

Ladders#989

Многу лесно · Dynamic programming

12345#990

Многу лесно · Implementation

951-975 од 9226