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:1056-E | codeforces | 1056-E | Check Transcription | https://codeforces.com/problemset/problem/1056/E | [
"brute force",
"data structures",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2943
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1056-D | codeforces | 1056-D | Decorate Apple Tree | https://codeforces.com/problemset/problem/1056/D | [
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6841
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1056-C | codeforces | 1056-C | Pick Heroes | https://codeforces.com/problemset/problem/1056/C | [
"greedy",
"implementation",
"interactive",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2594
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1056-B | codeforces | 1056-B | Divide Candies | https://codeforces.com/problemset/problem/1056/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4570
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1056-A | codeforces | 1056-A | Determine Line | https://codeforces.com/problemset/problem/1056/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 7412
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1055-G | codeforces | 1055-G | Jellyfish Nightmare | https://codeforces.com/problemset/problem/1055/G | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 195
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1055-F | codeforces | 1055-F | Tree and XOR | https://codeforces.com/problemset/problem/1055/F | [
"strings",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 689
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1055-E | codeforces | 1055-E | Segments on the Line | https://codeforces.com/problemset/problem/1055/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 959
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1055-D | codeforces | 1055-D | Refactoring | https://codeforces.com/problemset/problem/1055/D | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 676
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1055-C | codeforces | 1055-C | Lucky Days | https://codeforces.com/problemset/problem/1055/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2065
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1055-B | codeforces | 1055-B | Alice and Hairdresser | https://codeforces.com/problemset/problem/1055/B | [
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5616
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1055-A | codeforces | 1055-A | Metro | https://codeforces.com/problemset/problem/1055/A | [
"graphs"
] | null | null | stdin_stdout | 900 | {
"solved_count": 13770
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1054-H | codeforces | 1054-H | Epic Convolution | https://codeforces.com/problemset/problem/1054/H | [
"chinese remainder theorem",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 333
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1054-G | codeforces | 1054-G | New Road Network | https://codeforces.com/problemset/problem/1054/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 961
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1054-F | codeforces | 1054-F | Electric Scheme | https://codeforces.com/problemset/problem/1054/F | [
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 435
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1054-E | codeforces | 1054-E | Chips Puzzle | https://codeforces.com/problemset/problem/1054/E | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 519
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1054-D | codeforces | 1054-D | Changing Array | https://codeforces.com/problemset/problem/1054/D | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2448
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1054-C | codeforces | 1054-C | Candies Distribution | https://codeforces.com/problemset/problem/1054/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4517
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1054-B | codeforces | 1054-B | Appending Mex | https://codeforces.com/problemset/problem/1054/B | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7125
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1054-A | codeforces | 1054-A | Elevator or Stairs? | https://codeforces.com/problemset/problem/1054/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9653
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1053-E | codeforces | 1053-E | Euler tour | https://codeforces.com/problemset/problem/1053/E | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 251
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1051-G | codeforces | 1051-G | Distinctification | https://codeforces.com/problemset/problem/1051/G | [
"data structures",
"dsu",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 558
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1051-F | codeforces | 1051-F | The Shortest Statement | https://codeforces.com/problemset/problem/1051/F | [
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3913
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1051-E | codeforces | 1051-E | Vasya and Big Integers | https://codeforces.com/problemset/problem/1051/E | [
"binary search",
"data structures",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1318
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1051-D | codeforces | 1051-D | Bicolorings | https://codeforces.com/problemset/problem/1051/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8296
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1051-C | codeforces | 1051-C | Vasya and Multisets | https://codeforces.com/problemset/problem/1051/C | [
"brute force",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9996
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1051-B | codeforces | 1051-B | Relatively Prime Pairs | https://codeforces.com/problemset/problem/1051/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19086
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1051-A | codeforces | 1051-A | Vasya And Password | https://codeforces.com/problemset/problem/1051/A | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8947
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1047-B | codeforces | 1047-B | Cover Points | https://codeforces.com/problemset/problem/1047/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18942
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1047-A | codeforces | 1047-A | Little C Loves 3 I | https://codeforces.com/problemset/problem/1047/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21468
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1046-I | codeforces | 1046-I | Say Hello | https://codeforces.com/problemset/problem/1046/I | [
"geometry"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 606
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1046-F | codeforces | 1046-F | Splitting money | https://codeforces.com/problemset/problem/1046/F | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3147
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1046-C | codeforces | 1046-C | Space Formula | https://codeforces.com/problemset/problem/1046/C | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3411
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-J | codeforces | 1045-J | Moonwalk challenge | https://codeforces.com/problemset/problem/1045/J | [
"data structures",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 236
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-I | codeforces | 1045-I | Palindrome Pairs | https://codeforces.com/problemset/problem/1045/I | [
"hashing",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5657
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-H | codeforces | 1045-H | Self-exploration | https://codeforces.com/problemset/problem/1045/H | [
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 460
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-G | codeforces | 1045-G | AI robots | https://codeforces.com/problemset/problem/1045/G | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2055
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-F | codeforces | 1045-F | Shady Lady | https://codeforces.com/problemset/problem/1045/F | [
"geometry",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 145
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-E | codeforces | 1045-E | Ancient civilizations | https://codeforces.com/problemset/problem/1045/E | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 261
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-D | codeforces | 1045-D | Interstellar battle | https://codeforces.com/problemset/problem/1045/D | [
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 903
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-C | codeforces | 1045-C | Hyperspace Highways | https://codeforces.com/problemset/problem/1045/C | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 865
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-B | codeforces | 1045-B | Space Isaac | https://codeforces.com/problemset/problem/1045/B | [
"hashing",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 628
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1045-A | codeforces | 1045-A | Last chance | https://codeforces.com/problemset/problem/1045/A | [
"data structures",
"flows",
"graph matchings",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 611
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1044-F | codeforces | 1044-F | DFS | https://codeforces.com/problemset/problem/1044/F | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 726
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1044-E | codeforces | 1044-E | Grid Sort | https://codeforces.com/problemset/problem/1044/E | [
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 150
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1044-D | codeforces | 1044-D | Deduction Queries | https://codeforces.com/problemset/problem/1044/D | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1240
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1044-C | codeforces | 1044-C | Optimal Polygon Perimeter | https://codeforces.com/problemset/problem/1044/C | [
"dp",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1436
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1044-B | codeforces | 1044-B | Intersecting Subtrees | https://codeforces.com/problemset/problem/1044/B | [
"dfs and similar",
"interactive",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1723
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1044-A | codeforces | 1044-A | The Tower is Going Home | https://codeforces.com/problemset/problem/1044/A | [
"binary search",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3098
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1043-G | codeforces | 1043-G | Speckled Band | https://codeforces.com/problemset/problem/1043/G | [
"data structures",
"divide and conquer",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 330
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1043-F | codeforces | 1043-F | Make It One | https://codeforces.com/problemset/problem/1043/F | [
"bitmasks",
"combinatorics",
"dp",
"math",
"number theory",
"shortest paths"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3200
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1043-E | codeforces | 1043-E | Train Hard, Win Easy | https://codeforces.com/problemset/problem/1043/E | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3483
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1043-D | codeforces | 1043-D | Mysterious Crime | https://codeforces.com/problemset/problem/1043/D | [
"brute force",
"combinatorics",
"math",
"meet-in-the-middle",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4795
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1043-C | codeforces | 1043-C | Smallest Word | https://codeforces.com/problemset/problem/1043/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1043-B | codeforces | 1043-B | Lost Array | https://codeforces.com/problemset/problem/1043/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6581
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1043-A | codeforces | 1043-A | Elections | https://codeforces.com/problemset/problem/1043/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11339
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1042-F | codeforces | 1042-F | Leaf Sets | https://codeforces.com/problemset/problem/1042/F | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1608
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1042-E | codeforces | 1042-E | Vasya and Magic Matrix | https://codeforces.com/problemset/problem/1042/E | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2145
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1042-D | codeforces | 1042-D | Petya and Array | https://codeforces.com/problemset/problem/1042/D | [
"data structures",
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7662
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1042-C | codeforces | 1042-C | Array Product | https://codeforces.com/problemset/problem/1042/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5000
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1042-B | codeforces | 1042-B | Vitamins | https://codeforces.com/problemset/problem/1042/B | [
"bitmasks",
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19668
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1042-A | codeforces | 1042-A | Benches | https://codeforces.com/problemset/problem/1042/A | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14221
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1041-F | codeforces | 1041-F | Ray in the tube | https://codeforces.com/problemset/problem/1041/F | [
"data structures",
"divide and conquer",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1681
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1041-E | codeforces | 1041-E | Tree Reconstruction | https://codeforces.com/problemset/problem/1041/E | [
"constructive algorithms",
"data structures",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3912
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1041-D | codeforces | 1041-D | Glider | https://codeforces.com/problemset/problem/1041/D | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6491
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1041-C | codeforces | 1041-C | Coffee Break | https://codeforces.com/problemset/problem/1041/C | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10358
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1041-B | codeforces | 1041-B | Buying a TV Set | https://codeforces.com/problemset/problem/1041/B | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15174
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1041-A | codeforces | 1041-A | Heist | https://codeforces.com/problemset/problem/1041/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27084
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1040-B | codeforces | 1040-B | Shashlik Cooking | https://codeforces.com/problemset/problem/1040/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8004
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1040-A | codeforces | 1040-A | Palindrome Dance | https://codeforces.com/problemset/problem/1040/A | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10271
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1039-E | codeforces | 1039-E | Summer Oenothera Exhibition | https://codeforces.com/problemset/problem/1039/E | [
"data structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 324
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1039-D | codeforces | 1039-D | You Are Given a Tree | https://codeforces.com/problemset/problem/1039/D | [
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2508
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1039-C | codeforces | 1039-C | Network Safety | https://codeforces.com/problemset/problem/1039/C | [
"dfs and similar",
"dsu",
"graphs",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1536
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1039-B | codeforces | 1039-B | Subway Pursuit | https://codeforces.com/problemset/problem/1039/B | [
"binary search",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2619
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1039-A | codeforces | 1039-A | Timetable | https://codeforces.com/problemset/problem/1039/A | [
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 894
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1038-F | codeforces | 1038-F | Wrap Around | https://codeforces.com/problemset/problem/1038/F | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 581
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1038-E | codeforces | 1038-E | Maximum Matching | https://codeforces.com/problemset/problem/1038/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1167
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1038-D | codeforces | 1038-D | Slime | https://codeforces.com/problemset/problem/1038/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8974
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1038-C | codeforces | 1038-C | Gambling | https://codeforces.com/problemset/problem/1038/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9885
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1038-B | codeforces | 1038-B | Non-Coprime Partition | https://codeforces.com/problemset/problem/1038/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14971
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1038-A | codeforces | 1038-A | Equality | https://codeforces.com/problemset/problem/1038/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15772
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1037-H | codeforces | 1037-H | Security | https://codeforces.com/problemset/problem/1037/H | [
"data structures",
"string suffix structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1371
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1037-G | codeforces | 1037-G | A Game on Strings | https://codeforces.com/problemset/problem/1037/G | [
"games"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 390
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1037-F | codeforces | 1037-F | Maximum Reduction | https://codeforces.com/problemset/problem/1037/F | [
"combinatorics",
"data structures",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1317
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1037-E | codeforces | 1037-E | Trips | https://codeforces.com/problemset/problem/1037/E | [
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3188
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1037-D | codeforces | 1037-D | Valid BFS? | https://codeforces.com/problemset/problem/1037/D | [
"dfs and similar",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 20084
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1037-C | codeforces | 1037-C | Equalize | https://codeforces.com/problemset/problem/1037/C | [
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20263
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1037-B | codeforces | 1037-B | Reach Median | https://codeforces.com/problemset/problem/1037/B | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 10952
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1037-A | codeforces | 1037-A | Packets | https://codeforces.com/problemset/problem/1037/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11895
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1036-G | codeforces | 1036-G | Sources and Sinks | https://codeforces.com/problemset/problem/1036/G | [
"bitmasks",
"brute force",
"dfs and similar"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 478
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1036-F | codeforces | 1036-F | Relatively Prime Powers | https://codeforces.com/problemset/problem/1036/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1901
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1036-E | codeforces | 1036-E | Covered Points | https://codeforces.com/problemset/problem/1036/E | [
"fft",
"geometry",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1803
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1036-D | codeforces | 1036-D | Vasya and Arrays | https://codeforces.com/problemset/problem/1036/D | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10829
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1036-C | codeforces | 1036-C | Classy Numbers | https://codeforces.com/problemset/problem/1036/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 14445
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1036-B | codeforces | 1036-B | Diagonal Walking v.2 | https://codeforces.com/problemset/problem/1036/B | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6009
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1036-A | codeforces | 1036-A | Function Height | https://codeforces.com/problemset/problem/1036/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10686
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1034-E | codeforces | 1034-E | Little C Loves 3 III | https://codeforces.com/problemset/problem/1034/E | [
"bitmasks",
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 828
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1034-D | codeforces | 1034-D | Intervals of Intervals | https://codeforces.com/problemset/problem/1034/D | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 618
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1034-C | codeforces | 1034-C | Region Separation | https://codeforces.com/problemset/problem/1034/C | [
"combinatorics",
"dp",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1149
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:1034-B | codeforces | 1034-B | Little C Loves 3 II | https://codeforces.com/problemset/problem/1034/B | [
"brute force",
"constructive algorithms",
"flows",
"graph matchings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2334
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.