uid stringlengths 9 18 | source stringclasses 2
values | native_id stringlengths 3 7 | title stringlengths 2 64 | url stringlengths 36 49 | tags listlengths 0 11 | time_limit_ms null | memory_limit_mb null | io_type stringclasses 1
value | difficulty_rating int64 800 3.5k ⌀ | stats dict | last_scraped_at stringclasses 2
values |
|---|---|---|---|---|---|---|---|---|---|---|---|
codeforces:1442-E | codeforces | 1442-E | Black, White and Grey Tree | https://codeforces.com/problemset/problem/1442/E | [
"binary search",
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 801
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1442-D | codeforces | 1442-D | Sum | https://codeforces.com/problemset/problem/1442/D | [
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1442-C | codeforces | 1442-C | Graph Transpositions | https://codeforces.com/problemset/problem/1442/C | [
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2014
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1442-B | codeforces | 1442-B | Identify the Operations | https://codeforces.com/problemset/problem/1442/B | [
"combinatorics",
"data structures",
"dsu",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5324
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1442-A | codeforces | 1442-A | Extreme Subtraction | https://codeforces.com/problemset/problem/1442/A | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9748
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1440-B | codeforces | 1440-B | Sum of Medians | https://codeforces.com/problemset/problem/1440/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30896
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1440-A | codeforces | 1440-A | Buy the String | https://codeforces.com/problemset/problem/1440/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20393
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1439-E | codeforces | 1439-E | Cheat and Win | https://codeforces.com/problemset/problem/1439/E | [
"bitmasks",
"data structures",
"games",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1439-D | codeforces | 1439-D | INOI Final Contests | https://codeforces.com/problemset/problem/1439/D | [
"combinatorics",
"dp",
"fft"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 477
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1439-C | codeforces | 1439-C | Greedy Shopping | https://codeforces.com/problemset/problem/1439/C | [
"binary search",
"data structures",
"divide and conquer",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2222
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1439-B | codeforces | 1439-B | Graph Subset Problem | https://codeforces.com/problemset/problem/1439/B | [
"constructive algorithms",
"data structures",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1655
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1439-A2 | codeforces | 1439-A2 | Binary Table (Hard Version) | https://codeforces.com/problemset/problem/1439/A2 | [
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1439-A1 | codeforces | 1439-A1 | Binary Table (Easy Version) | https://codeforces.com/problemset/problem/1439/A1 | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9818
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1438-F | codeforces | 1438-F | Olha and Igor | https://codeforces.com/problemset/problem/1438/F | [
"interactive",
"probabilities",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 804
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1438-E | codeforces | 1438-E | Yurii Can Do Everything | https://codeforces.com/problemset/problem/1438/E | [
"binary search",
"bitmasks",
"brute force",
"constructive algorithms",
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1470
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1438-D | codeforces | 1438-D | Powerful Ksenia | https://codeforces.com/problemset/problem/1438/D | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4556
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1438-C | codeforces | 1438-C | Engineer Artem | https://codeforces.com/problemset/problem/1438/C | [
"2-sat",
"chinese remainder theorem",
"constructive algorithms",
"fft",
"flows"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 11673
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1438-B | codeforces | 1438-B | Valerii Against Everyone | https://codeforces.com/problemset/problem/1438/B | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1438-A | codeforces | 1438-A | Specific Tastes of Andre | https://codeforces.com/problemset/problem/1438/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19765
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1437-G | codeforces | 1437-G | Death DBMS | https://codeforces.com/problemset/problem/1437/G | [
"data structures",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1277
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1437-F | codeforces | 1437-F | Emotional Fishermen | https://codeforces.com/problemset/problem/1437/F | [
"combinatorics",
"dp",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1625
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1437-E | codeforces | 1437-E | Make It Increasing | https://codeforces.com/problemset/problem/1437/E | [
"binary search",
"constructive algorithms",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1437-D | codeforces | 1437-D | Minimal Height Tree | https://codeforces.com/problemset/problem/1437/D | [
"graphs",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14434
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1437-C | codeforces | 1437-C | Chef Monocarp | https://codeforces.com/problemset/problem/1437/C | [
"dp",
"flows",
"graph matchings",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1437-B | codeforces | 1437-B | Reverse Binary Strings | https://codeforces.com/problemset/problem/1437/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1437-A | codeforces | 1437-A | Marketing Scheme | https://codeforces.com/problemset/problem/1437/A | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1436-F | codeforces | 1436-F | Sum Over Subsets | https://codeforces.com/problemset/problem/1436/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 641
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1436-E | codeforces | 1436-E | Complicated Computations | https://codeforces.com/problemset/problem/1436/E | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1436-D | codeforces | 1436-D | Bandit in a City | https://codeforces.com/problemset/problem/1436/D | [
"binary search",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6523
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1436-C | codeforces | 1436-C | Binary Search | https://codeforces.com/problemset/problem/1436/C | [
"binary search",
"combinatorics"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11719
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1436-B | codeforces | 1436-B | Prime Square | https://codeforces.com/problemset/problem/1436/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21747
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1436-A | codeforces | 1436-A | Reorder | https://codeforces.com/problemset/problem/1436/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23579
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1434-E | codeforces | 1434-E | A Convex Game | https://codeforces.com/problemset/problem/1434/E | [
"dsu",
"games"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 223
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1433-G | codeforces | 1433-G | Reducing Delivery Cost | https://codeforces.com/problemset/problem/1433/G | [
"brute force",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1433-F | codeforces | 1433-F | Zero Remainder Sum | https://codeforces.com/problemset/problem/1433/F | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 6774
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1433-E | codeforces | 1433-E | Two Round Dances | https://codeforces.com/problemset/problem/1433/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19907
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1433-D | codeforces | 1433-D | Districts Connection | https://codeforces.com/problemset/problem/1433/D | [
"constructive algorithms",
"dfs and similar"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30978
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1433-C | codeforces | 1433-C | Dominant Piranha | https://codeforces.com/problemset/problem/1433/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1433-B | codeforces | 1433-B | Yet Another Bookshelf | https://codeforces.com/problemset/problem/1433/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29905
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1433-A | codeforces | 1433-A | Boring Apartments | https://codeforces.com/problemset/problem/1433/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 62926
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-J | codeforces | 1431-J | Zero-XOR Array | https://codeforces.com/problemset/problem/1431/J | [
"*special",
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 51
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-I | codeforces | 1431-I | Cyclic Shifts | https://codeforces.com/problemset/problem/1431/I | [
"*special",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 52
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-H | codeforces | 1431-H | Rogue-like Game | https://codeforces.com/problemset/problem/1431/H | [
"*special",
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 77
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-G | codeforces | 1431-G | Number Deletion Game | https://codeforces.com/problemset/problem/1431/G | [
"*special",
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 204
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-F | codeforces | 1431-F | Neural Network Problem | https://codeforces.com/problemset/problem/1431/F | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 161
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-E | codeforces | 1431-E | Chess Match | https://codeforces.com/problemset/problem/1431/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 232
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-D | codeforces | 1431-D | Used Markers | https://codeforces.com/problemset/problem/1431/D | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 486
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-C | codeforces | 1431-C | Black Friday | https://codeforces.com/problemset/problem/1431/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 746
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-B | codeforces | 1431-B | Polycarp and the Language of Gods | https://codeforces.com/problemset/problem/1431/B | [
"*special",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1431-A | codeforces | 1431-A | Selling Hamburgers | https://codeforces.com/problemset/problem/1431/A | [
"*special"
] | null | null | stdin_stdout | 800 | {
"solved_count": 2161
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1430-G | codeforces | 1430-G | Yet Another DAG Problem | https://codeforces.com/problemset/problem/1430/G | [
"bitmasks",
"dfs and similar",
"dp",
"flows",
"graphs",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 878
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1430-F | codeforces | 1430-F | Realistic Gameplay | https://codeforces.com/problemset/problem/1430/F | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1430-E | codeforces | 1430-E | String Reversal | https://codeforces.com/problemset/problem/1430/E | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7356
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1430-D | codeforces | 1430-D | String Deletion | https://codeforces.com/problemset/problem/1430/D | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9365
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1430-C | codeforces | 1430-C | Numbers on Whiteboard | https://codeforces.com/problemset/problem/1430/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1430-B | codeforces | 1430-B | Barrels | https://codeforces.com/problemset/problem/1430/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1430-A | codeforces | 1430-A | Number of Apartments | https://codeforces.com/problemset/problem/1430/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21852
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-H | codeforces | 1428-H | Rotary Laser Lock | https://codeforces.com/problemset/problem/1428/H | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 127
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-G2 | codeforces | 1428-G2 | Lucky Numbers (Hard Version) | https://codeforces.com/problemset/problem/1428/G2 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 742
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-G1 | codeforces | 1428-G1 | Lucky Numbers (Easy Version) | https://codeforces.com/problemset/problem/1428/G1 | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-F | codeforces | 1428-F | Fruit Sequences | https://codeforces.com/problemset/problem/1428/F | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2614
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-E | codeforces | 1428-E | Carrots for Rabbits | https://codeforces.com/problemset/problem/1428/E | [
"binary search",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4242
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-D | codeforces | 1428-D | Bouncing Boomerangs | https://codeforces.com/problemset/problem/1428/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4743
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-C | codeforces | 1428-C | ABBB | https://codeforces.com/problemset/problem/1428/C | [
"brute force",
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-B | codeforces | 1428-B | Belted Rooms | https://codeforces.com/problemset/problem/1428/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15217
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1428-A | codeforces | 1428-A | Box is Pull | https://codeforces.com/problemset/problem/1428/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17034
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1427-H | codeforces | 1427-H | Prison Break | https://codeforces.com/problemset/problem/1427/H | [
"binary search",
"games",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 95
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1427-G | codeforces | 1427-G | One Billion Shades of Grey | https://codeforces.com/problemset/problem/1427/G | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 499
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1427-F | codeforces | 1427-F | Boring Card Game | https://codeforces.com/problemset/problem/1427/F | [
"data structures",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 402
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1427-E | codeforces | 1427-E | Xum | https://codeforces.com/problemset/problem/1427/E | [
"bitmasks",
"constructive algorithms",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1427-D | codeforces | 1427-D | Unshuffling a Deck | https://codeforces.com/problemset/problem/1427/D | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3709
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1427-C | codeforces | 1427-C | The Hard Work of Paparazzi | https://codeforces.com/problemset/problem/1427/C | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6095
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1427-B | codeforces | 1427-B | Chess Cheater | https://codeforces.com/problemset/problem/1427/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1427-A | codeforces | 1427-A | Avoiding Zero | https://codeforces.com/problemset/problem/1427/A | [
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18066
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1426-F | codeforces | 1426-F | Number of Subsequences | https://codeforces.com/problemset/problem/1426/F | [
"combinatorics",
"dp",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6189
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1426-E | codeforces | 1426-E | Rock, Paper, Scissors | https://codeforces.com/problemset/problem/1426/E | [
"brute force",
"constructive algorithms",
"flows",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8156
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1426-D | codeforces | 1426-D | Non-zero Segments | https://codeforces.com/problemset/problem/1426/D | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17645
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1426-C | codeforces | 1426-C | Increase and Copy | https://codeforces.com/problemset/problem/1426/C | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20606
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1426-B | codeforces | 1426-B | Symmetric Matrix | https://codeforces.com/problemset/problem/1426/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 21855
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1426-A | codeforces | 1426-A | Floor Number | https://codeforces.com/problemset/problem/1426/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55196
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1425-I | codeforces | 1425-I | Impressive Harvesting of The Orchard | https://codeforces.com/problemset/problem/1425/I | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 268
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1425-H | codeforces | 1425-H | Huge Boxes of Animal Toys | https://codeforces.com/problemset/problem/1425/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4407
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1425-F | codeforces | 1425-F | Flamingoes of Mystery | https://codeforces.com/problemset/problem/1425/F | [
"interactive"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7218
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1425-E | codeforces | 1425-E | Excitation of Atoms | https://codeforces.com/problemset/problem/1425/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1014
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1425-D | codeforces | 1425-D | Danger of Mad Snakes | https://codeforces.com/problemset/problem/1425/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 902
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1425-C | codeforces | 1425-C | Captain of Knights | https://codeforces.com/problemset/problem/1425/C | [
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 56
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1425-B | codeforces | 1425-B | Blue and Red of Our Faculty! | https://codeforces.com/problemset/problem/1425/B | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 361
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1425-A | codeforces | 1425-A | Arena of Greed | https://codeforces.com/problemset/problem/1425/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1424-M | codeforces | 1424-M | Ancient Language | https://codeforces.com/problemset/problem/1424/M | [
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 616
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1424-G | codeforces | 1424-G | Years | https://codeforces.com/problemset/problem/1424/G | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6708
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-N | codeforces | 1423-N | BubbleSquare Tokens | https://codeforces.com/problemset/problem/1423/N | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 172
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-M | codeforces | 1423-M | Milutin's Plums | https://codeforces.com/problemset/problem/1423/M | [
"interactive"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 325
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-L | codeforces | 1423-L | Light switches | https://codeforces.com/problemset/problem/1423/L | [
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 589
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-K | codeforces | 1423-K | Lonely Numbers | https://codeforces.com/problemset/problem/1423/K | [
"binary search",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5463
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-J | codeforces | 1423-J | Bubble Cup hypothesis | https://codeforces.com/problemset/problem/1423/J | [
"bitmasks",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 893
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-I | codeforces | 1423-I | Lookup Tables | https://codeforces.com/problemset/problem/1423/I | [
"bitmasks"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 158
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-H | codeforces | 1423-H | Virus | https://codeforces.com/problemset/problem/1423/H | [
"data structures",
"divide and conquer",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 629
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-G | codeforces | 1423-G | Growing flowers | https://codeforces.com/problemset/problem/1423/G | [
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 262
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-F | codeforces | 1423-F | Coins | https://codeforces.com/problemset/problem/1423/F | [
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 449
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1423-E | codeforces | 1423-E | 5G Antenna Towers | https://codeforces.com/problemset/problem/1423/E | [
"geometry"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 98
} | 2026-06-01T05:00:40.145500+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.