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:1257-F | codeforces | 1257-F | Make Them Similar | https://codeforces.com/problemset/problem/1257/F | [
"bitmasks",
"brute force",
"hashing",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2520
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1257-E | codeforces | 1257-E | The Contest | https://codeforces.com/problemset/problem/1257/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4737
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1257-D | codeforces | 1257-D | Yet Another Monster Killing Problem | https://codeforces.com/problemset/problem/1257/D | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8389
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1257-C | codeforces | 1257-C | Dominated Subarray | https://codeforces.com/problemset/problem/1257/C | [
"greedy",
"implementation",
"sortings",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17535
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1257-B | codeforces | 1257-B | Magic Stick | https://codeforces.com/problemset/problem/1257/B | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22962
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1257-A | codeforces | 1257-A | Two Rival Students | https://codeforces.com/problemset/problem/1257/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21792
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1256-F | codeforces | 1256-F | Equalizing Two Strings | https://codeforces.com/problemset/problem/1256/F | [
"constructive algorithms",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3847
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1256-E | codeforces | 1256-E | Yet Another Division Into Teams | https://codeforces.com/problemset/problem/1256/E | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4854
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1256-D | codeforces | 1256-D | Binary String Minimizing | https://codeforces.com/problemset/problem/1256/D | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12947
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1256-C | codeforces | 1256-C | Platforms Jumping | https://codeforces.com/problemset/problem/1256/C | [
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7440
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1256-B | codeforces | 1256-B | Minimize the Permutation | https://codeforces.com/problemset/problem/1256/B | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 13897
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1256-A | codeforces | 1256-A | Payment Without Change | https://codeforces.com/problemset/problem/1256/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 33029
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1255-C | codeforces | 1255-C | League of Leesins | https://codeforces.com/problemset/problem/1255/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7336
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1255-B | codeforces | 1255-B | Fridge Lockers | https://codeforces.com/problemset/problem/1255/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12738
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1255-A | codeforces | 1255-A | Changing Volume | https://codeforces.com/problemset/problem/1255/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18179
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1254-E | codeforces | 1254-E | Send Tree to Charlie | https://codeforces.com/problemset/problem/1254/E | [
"combinatorics",
"dfs and similar",
"dsu",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 488
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1254-D | codeforces | 1254-D | Tree Queries | https://codeforces.com/problemset/problem/1254/D | [
"data structures",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1791
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1254-C | codeforces | 1254-C | Point Ordering | https://codeforces.com/problemset/problem/1254/C | [
"constructive algorithms",
"geometry",
"interactive",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1841
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1254-B2 | codeforces | 1254-B2 | Send Boxes to Alice (Hard Version) | https://codeforces.com/problemset/problem/1254/B2 | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3584
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1254-B1 | codeforces | 1254-B1 | Send Boxes to Alice (Easy Version) | https://codeforces.com/problemset/problem/1254/B1 | [
"constructive algorithms",
"greedy",
"math",
"number theory",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5132
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1254-A | codeforces | 1254-A | Feeding Chicken | https://codeforces.com/problemset/problem/1254/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5796
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1253-F | codeforces | 1253-F | Cheap Robot | https://codeforces.com/problemset/problem/1253/F | [
"binary search",
"dsu",
"graphs",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2523
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1253-E | codeforces | 1253-E | Antenna Coverage | https://codeforces.com/problemset/problem/1253/E | [
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3225
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1253-D | codeforces | 1253-D | Harmonious Graph | https://codeforces.com/problemset/problem/1253/D | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10760
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1253-C | codeforces | 1253-C | Sweets Eating | https://codeforces.com/problemset/problem/1253/C | [
"dp",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15752
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1253-B | codeforces | 1253-B | Silly Mistake | https://codeforces.com/problemset/problem/1253/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11822
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1253-A | codeforces | 1253-A | Single Push | https://codeforces.com/problemset/problem/1253/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 19658
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-L | codeforces | 1252-L | Road Construction | https://codeforces.com/problemset/problem/1252/L | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 681
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-K | codeforces | 1252-K | Addition Robot | https://codeforces.com/problemset/problem/1252/K | [
"data structures",
"math",
"matrices"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2149
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-J | codeforces | 1252-J | Tiling Terrace | https://codeforces.com/problemset/problem/1252/J | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 827
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-I | codeforces | 1252-I | Mission Possible | https://codeforces.com/problemset/problem/1252/I | [] | null | null | stdin_stdout | 3,000 | {
"solved_count": 63
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-H | codeforces | 1252-H | Twin Buildings | https://codeforces.com/problemset/problem/1252/H | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3010
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-G | codeforces | 1252-G | Performance Review | https://codeforces.com/problemset/problem/1252/G | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1603
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-F | codeforces | 1252-F | Regular Forestation | https://codeforces.com/problemset/problem/1252/F | [
"hashing",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1117
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-E | codeforces | 1252-E | Songwriter | https://codeforces.com/problemset/problem/1252/E | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1411
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-D | codeforces | 1252-D | Find String in a Grid | https://codeforces.com/problemset/problem/1252/D | [
"data structures",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 548
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-C | codeforces | 1252-C | Even Path | https://codeforces.com/problemset/problem/1252/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4060
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-B | codeforces | 1252-B | Cleaning Robots | https://codeforces.com/problemset/problem/1252/B | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 633
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1252-A | codeforces | 1252-A | Copying Homework | https://codeforces.com/problemset/problem/1252/A | [] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6132
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1251-F | codeforces | 1251-F | Red-White Fence | https://codeforces.com/problemset/problem/1251/F | [
"combinatorics",
"fft"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1115
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1251-E2 | codeforces | 1251-E2 | Voting (Hard Version) | https://codeforces.com/problemset/problem/1251/E2 | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1251-E1 | codeforces | 1251-E1 | Voting (Easy Version) | https://codeforces.com/problemset/problem/1251/E1 | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2694
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1251-D | codeforces | 1251-D | Salary Changing | https://codeforces.com/problemset/problem/1251/D | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6939
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1251-C | codeforces | 1251-C | Minimize The Integer | https://codeforces.com/problemset/problem/1251/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14921
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1251-B | codeforces | 1251-B | Binary Palindromes | https://codeforces.com/problemset/problem/1251/B | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11744
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1251-A | codeforces | 1251-A | Broken Keyboard | https://codeforces.com/problemset/problem/1251/A | [
"brute force",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21955
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-N | codeforces | 1250-N | Wires | https://codeforces.com/problemset/problem/1250/N | [
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1867
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-M | codeforces | 1250-M | SmartGarden | https://codeforces.com/problemset/problem/1250/M | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 408
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-L | codeforces | 1250-L | Divide The Students | https://codeforces.com/problemset/problem/1250/L | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4820
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-K | codeforces | 1250-K | Projectors | https://codeforces.com/problemset/problem/1250/K | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-J | codeforces | 1250-J | The Parade | https://codeforces.com/problemset/problem/1250/J | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3478
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-I | codeforces | 1250-I | Show Must Go On | https://codeforces.com/problemset/problem/1250/I | [
"binary search",
"brute force",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 243
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-H | codeforces | 1250-H | Happy Birthday | https://codeforces.com/problemset/problem/1250/H | [
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4382
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-G | codeforces | 1250-G | Discarding Game | https://codeforces.com/problemset/problem/1250/G | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 833
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-F | codeforces | 1250-F | Data Center | https://codeforces.com/problemset/problem/1250/F | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8554
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-E | codeforces | 1250-E | The Coronation | https://codeforces.com/problemset/problem/1250/E | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 957
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-D | codeforces | 1250-D | Conference Problem | https://codeforces.com/problemset/problem/1250/D | [
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 316
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-C | codeforces | 1250-C | Trip to Saint Petersburg | https://codeforces.com/problemset/problem/1250/C | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1511
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-B | codeforces | 1250-B | The Feast and the Bus | https://codeforces.com/problemset/problem/1250/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2861
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1250-A | codeforces | 1250-A | Berstagram | https://codeforces.com/problemset/problem/1250/A | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4521
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-F | codeforces | 1249-F | Maximum Weight Subset | https://codeforces.com/problemset/problem/1249/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2967
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-E | codeforces | 1249-E | By Elevator or Stairs? | https://codeforces.com/problemset/problem/1249/E | [
"dp",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11544
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-D2 | codeforces | 1249-D2 | Too Many Segments (hard version) | https://codeforces.com/problemset/problem/1249/D2 | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6041
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-D1 | codeforces | 1249-D1 | Too Many Segments (easy version) | https://codeforces.com/problemset/problem/1249/D1 | [
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5629
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-C2 | codeforces | 1249-C2 | Good Numbers (hard version) | https://codeforces.com/problemset/problem/1249/C2 | [
"binary search",
"greedy",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13989
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-C1 | codeforces | 1249-C1 | Good Numbers (easy version) | https://codeforces.com/problemset/problem/1249/C1 | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 16777
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-B2 | codeforces | 1249-B2 | Books Exchange (hard version) | https://codeforces.com/problemset/problem/1249/B2 | [
"dfs and similar",
"dsu",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18874
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-B1 | codeforces | 1249-B1 | Books Exchange (easy version) | https://codeforces.com/problemset/problem/1249/B1 | [
"dsu",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22773
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1249-A | codeforces | 1249-A | Yet Another Dividing into Teams | https://codeforces.com/problemset/problem/1249/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23906
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1248-D1 | codeforces | 1248-D1 | The World Is Just a Programming Task (Easy Version) | https://codeforces.com/problemset/problem/1248/D1 | [
"brute force",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2581
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1248-B | codeforces | 1248-B | Grow The Tree | https://codeforces.com/problemset/problem/1248/B | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18242
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1248-A | codeforces | 1248-A | Integer Points | https://codeforces.com/problemset/problem/1248/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15210
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1246-F | codeforces | 1246-F | Cursor Distance | https://codeforces.com/problemset/problem/1246/F | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 221
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1245-F | codeforces | 1245-F | Daniel and Spring Cleaning | https://codeforces.com/problemset/problem/1245/F | [
"bitmasks",
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2474
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1245-E | codeforces | 1245-E | Hyakugoku and Ladders | https://codeforces.com/problemset/problem/1245/E | [
"dp",
"probabilities",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1413
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1245-D | codeforces | 1245-D | Shichikuji and Power Grid | https://codeforces.com/problemset/problem/1245/D | [
"dsu",
"graphs",
"greedy",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10730
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1245-C | codeforces | 1245-C | Constanze's Machine | https://codeforces.com/problemset/problem/1245/C | [
"dp"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20566
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1245-B | codeforces | 1245-B | Restricted RPS | https://codeforces.com/problemset/problem/1245/B | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14653
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1245-A | codeforces | 1245-A | Good ol' Numbers Coloring | https://codeforces.com/problemset/problem/1245/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15085
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1244-G | codeforces | 1244-G | Running in Pairs | https://codeforces.com/problemset/problem/1244/G | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1586
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1244-F | codeforces | 1244-F | Chips | https://codeforces.com/problemset/problem/1244/F | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1672
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1244-E | codeforces | 1244-E | Minimizing Difference | https://codeforces.com/problemset/problem/1244/E | [
"binary search",
"constructive algorithms",
"greedy",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 7117
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1244-D | codeforces | 1244-D | Paint the Tree | https://codeforces.com/problemset/problem/1244/D | [
"brute force",
"constructive algorithms",
"dp",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8487
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1244-C | codeforces | 1244-C | The Football Season | https://codeforces.com/problemset/problem/1244/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8579
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1244-B | codeforces | 1244-B | Rooms and Staircases | https://codeforces.com/problemset/problem/1244/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17988
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1244-A | codeforces | 1244-A | Pens and Pencils | https://codeforces.com/problemset/problem/1244/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20247
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1243-B2 | codeforces | 1243-B2 | Character Swap (Hard Version) | https://codeforces.com/problemset/problem/1243/B2 | [
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7454
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1243-B1 | codeforces | 1243-B1 | Character Swap (Easy Version) | https://codeforces.com/problemset/problem/1243/B1 | [
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15486
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1243-A | codeforces | 1243-A | Maximum Square | https://codeforces.com/problemset/problem/1243/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16489
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1242-E | codeforces | 1242-E | Planar Perimeter | https://codeforces.com/problemset/problem/1242/E | [
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 176
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1242-D | codeforces | 1242-D | Number Discovery | https://codeforces.com/problemset/problem/1242/D | [
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 255
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1242-C | codeforces | 1242-C | Sum Balance | https://codeforces.com/problemset/problem/1242/C | [
"bitmasks",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2018
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1242-B | codeforces | 1242-B | 0-1 MST | https://codeforces.com/problemset/problem/1242/B | [
"dfs and similar",
"dsu",
"graphs",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9989
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1242-A | codeforces | 1242-A | Tile Painting | https://codeforces.com/problemset/problem/1242/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13398
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1240-F | codeforces | 1240-F | Football | https://codeforces.com/problemset/problem/1240/F | [
"graphs"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 419
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1239-F | codeforces | 1239-F | Swiper, no swiping! | https://codeforces.com/problemset/problem/1239/F | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 329
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1239-E | codeforces | 1239-E | Turtle | https://codeforces.com/problemset/problem/1239/E | [
"dp",
"implementation"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1352
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1239-D | codeforces | 1239-D | Catowice City | https://codeforces.com/problemset/problem/1239/D | [
"2-sat",
"dfs and similar",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2842
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1239-C | codeforces | 1239-C | Queue in the Train | https://codeforces.com/problemset/problem/1239/C | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1841
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1239-B | codeforces | 1239-B | The World Is Just a Programming Task (Hard Version) | https://codeforces.com/problemset/problem/1239/B | [
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1201
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.