Problems Playground
Login
Min rating
Max rating
Tag
Reset
# Problem Tags Rating Solved
412-A Poster
greedy implementation
900
411-C Kicker
*special implementation
1700
411-B Multi-core Processor
implementation
1600
411-A Password Check
*special implementation
800
409-I Feed the Golorp
*special
2400
409-H A + B Strikes Back
*special brute force constructive algorithms +2
1500
409-G On a plane
*special geometry
2200
409-F 000001
*special
1900
409-E Dome
*special
1800
409-D Big Data
*special
1700
409-C Magnum Opus
*special
1700
409-B Mysterious Language
*special
1700
409-A The Great Game
*special
1700
408-B Garland
implementation
1200
408-A Line to Cashier
implementation
900
407-E k-d-sequence
data structures
3100
407-D Largest Submatrix 3
dp hashing
2700
407-C Curious Array
brute force combinatorics implementation +1
2500
407-B Long Path
dp implementation
1600
407-A Triangle
brute force geometry implementation +1
1600
406-E Hamming Triples
implementation math two pointers
2800
406-D Hill Climbing
dfs and similar geometry trees
2200
405-E Graph Cutting
dfs and similar graphs
2300
405-D Toy Sum
greedy implementation math
1700
405-C Unusual Product
implementation math
1600
405-B Domino Effect
1100
405-A Gravity Flip
greedy implementation sortings
900
404-E Maze 1D
binary search greedy implementation
2200
404-D Minesweeper 1D
dp implementation
1900
404-C Restore Graph
dfs and similar graphs sortings
1800
404-B Marathon
implementation math
1500
404-A Valera and X
implementation
1000
403-E Two Rooted Trees
data structures implementation trees
2900
403-D Beautiful Pairs of Numbers
combinatorics dp
2300
402-E Strictly Positive Matrix
graphs math
2200
402-D Upgrading Array
dp greedy math +1
1800
402-C Searching for Graph
brute force constructive algorithms graphs
1500
402-B Trees in a Row
brute force implementation
1400
402-A Nuts
greedy math
1100
401-D Roman and Numbers
bitmasks brute force combinatorics +2
2000
401-C Team
constructive algorithms greedy implementation
1400
401-B Sereja and Contests
greedy implementation math
1200
401-A Vanya and Cards
implementation math
800
400-E Inna and Binary Logic
binary search bitmasks data structures
2100
400-D Dima and Bacteria
dsu graphs shortest paths
2000
400-C Inna and Huge Candy Matrix
implementation math
1500
400-B Inna and New Matrix of Candies
brute force implementation schedules
1200
400-A Inna and Choose Options
implementation
1000
399-B Red and Blue Balls
399-A Pages
implementation