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:1714-F | codeforces | 1714-F | Build a Tree and That Is It | https://codeforces.com/problemset/problem/1714/F | [
"constructive algorithms",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3802
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1714-E | codeforces | 1714-E | Add Modulo 10 | https://codeforces.com/problemset/problem/1714/E | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25839
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1714-D | codeforces | 1714-D | Color with Occurrences | https://codeforces.com/problemset/problem/1714/D | [
"brute force",
"data structures",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10598
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1714-C | codeforces | 1714-C | Minimum Varied Number | https://codeforces.com/problemset/problem/1714/C | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33930
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1714-B | codeforces | 1714-B | Remove Prefix | https://codeforces.com/problemset/problem/1714/B | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34839
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1714-A | codeforces | 1714-A | Everyone Loves to Sleep | https://codeforces.com/problemset/problem/1714/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 33890
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1713-F | codeforces | 1713-F | Lost Array | https://codeforces.com/problemset/problem/1713/F | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 795
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1713-E | codeforces | 1713-E | Cross Swapping | https://codeforces.com/problemset/problem/1713/E | [
"2-sat",
"data structures",
"dsu",
"greedy",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2097
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1713-D | codeforces | 1713-D | Tournament Countdown | https://codeforces.com/problemset/problem/1713/D | [
"constructive algorithms",
"greedy",
"interactive",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6354
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1713-C | codeforces | 1713-C | Build Permutation | https://codeforces.com/problemset/problem/1713/C | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19146
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1713-B | codeforces | 1713-B | Optimal Reduction | https://codeforces.com/problemset/problem/1713/B | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22987
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1713-A | codeforces | 1713-A | Traveling Salesman Problem | https://codeforces.com/problemset/problem/1713/A | [
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22948
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1712-F | codeforces | 1712-F | Triameter | https://codeforces.com/problemset/problem/1712/F | [
"binary search",
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 533
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1712-E2 | codeforces | 1712-E2 | LCM Sum (hard version) | https://codeforces.com/problemset/problem/1712/E2 | [
"brute force",
"data structures",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1707
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1712-E1 | codeforces | 1712-E1 | LCM Sum (easy version) | https://codeforces.com/problemset/problem/1712/E1 | [
"binary search",
"brute force",
"combinatorics",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2579
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1712-D | codeforces | 1712-D | Empty Graph | https://codeforces.com/problemset/problem/1712/D | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5250
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1712-C | codeforces | 1712-C | Sort Zero | https://codeforces.com/problemset/problem/1712/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21500
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1712-B | codeforces | 1712-B | Woeful Permutation | https://codeforces.com/problemset/problem/1712/B | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22541
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1712-A | codeforces | 1712-A | Wonderful Permutation | https://codeforces.com/problemset/problem/1712/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25272
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1711-B | codeforces | 1711-B | Party | https://codeforces.com/problemset/problem/1711/B | [
"brute force",
"graphs"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14766
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1711-A | codeforces | 1711-A | Perfect Permutation | https://codeforces.com/problemset/problem/1711/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26772
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1710-E | codeforces | 1710-E | Two Arrays | https://codeforces.com/problemset/problem/1710/E | [
"binary search",
"games",
"graph matchings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 601
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1710-D | codeforces | 1710-D | Recover the Tree | https://codeforces.com/problemset/problem/1710/D | [
"constructive algorithms",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 572
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1710-C | codeforces | 1710-C | XOR Triangle | https://codeforces.com/problemset/problem/1710/C | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1706
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1710-B | codeforces | 1710-B | Rain | https://codeforces.com/problemset/problem/1710/B | [
"binary search",
"brute force",
"data structures",
"geometry",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2863
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1710-A | codeforces | 1710-A | Color the Picture | https://codeforces.com/problemset/problem/1710/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12063
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1709-F | codeforces | 1709-F | Multiset of Strings | https://codeforces.com/problemset/problem/1709/F | [
"bitmasks",
"brute force",
"dp",
"fft",
"flows",
"graphs",
"math",
"meet-in-the-middle",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 735
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1709-E | codeforces | 1709-E | XOR Tree | https://codeforces.com/problemset/problem/1709/E | [
"bitmasks",
"data structures",
"dfs and similar",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 4497
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1709-D | codeforces | 1709-D | Rorororobot | https://codeforces.com/problemset/problem/1709/D | [
"binary search",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10893
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1709-C | codeforces | 1709-C | Recover an RBS | https://codeforces.com/problemset/problem/1709/C | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10856
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1709-B | codeforces | 1709-B | Also Try Minecraft | https://codeforces.com/problemset/problem/1709/B | [
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 26749
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1709-A | codeforces | 1709-A | Three Doors | https://codeforces.com/problemset/problem/1709/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32141
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1708-B | codeforces | 1708-B | Difference of GCDs | https://codeforces.com/problemset/problem/1708/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 31101
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1708-A | codeforces | 1708-A | Difference Operations | https://codeforces.com/problemset/problem/1708/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22758
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1707-F | codeforces | 1707-F | Bugaboo | https://codeforces.com/problemset/problem/1707/F | [
"bitmasks",
"constructive algorithms",
"dp",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 187
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1707-E | codeforces | 1707-E | Replace | https://codeforces.com/problemset/problem/1707/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 959
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1707-D | codeforces | 1707-D | Partial Virtual Trees | https://codeforces.com/problemset/problem/1707/D | [
"combinatorics",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1043
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1707-C | codeforces | 1707-C | DFS Trees | https://codeforces.com/problemset/problem/1707/C | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2007
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1707-B | codeforces | 1707-B | Difference Array | https://codeforces.com/problemset/problem/1707/B | [
"brute force",
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6540
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1707-A | codeforces | 1707-A | Doremy's IQ | https://codeforces.com/problemset/problem/1707/A | [
"binary search",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15865
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1706-E | codeforces | 1706-E | Qpwoeirut and Vertices | https://codeforces.com/problemset/problem/1706/E | [
"binary search",
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 4254
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1706-D2 | codeforces | 1706-D2 | Chopping Carrots (Hard Version) | https://codeforces.com/problemset/problem/1706/D2 | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1998
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1706-D1 | codeforces | 1706-D1 | Chopping Carrots (Easy Version) | https://codeforces.com/problemset/problem/1706/D1 | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7851
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1706-C | codeforces | 1706-C | Qpwoeirut And The City | https://codeforces.com/problemset/problem/1706/C | [
"dp",
"flows",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16412
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1706-B | codeforces | 1706-B | Making Towers | https://codeforces.com/problemset/problem/1706/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 17682
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1706-A | codeforces | 1706-A | Another String Minimization Problem | https://codeforces.com/problemset/problem/1706/A | [
"2-sat",
"constructive algorithms",
"greedy",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24433
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1705-F | codeforces | 1705-F | Mark and the Online Exam | https://codeforces.com/problemset/problem/1705/F | [
"bitmasks",
"constructive algorithms",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 737
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1705-E | codeforces | 1705-E | Mark and Professor Koro | https://codeforces.com/problemset/problem/1705/E | [
"binary search",
"bitmasks",
"brute force",
"combinatorics",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2578
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1705-D | codeforces | 1705-D | Mark and Lightbulbs | https://codeforces.com/problemset/problem/1705/D | [
"combinatorics",
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7299
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1705-C | codeforces | 1705-C | Mark and His Unfinished Essay | https://codeforces.com/problemset/problem/1705/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14792
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1705-B | codeforces | 1705-B | Mark the Dust Sweeper | https://codeforces.com/problemset/problem/1705/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 25971
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1705-A | codeforces | 1705-A | Mark the Photographer | https://codeforces.com/problemset/problem/1705/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26815
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-H2 | codeforces | 1704-H2 | Game of AI (hard version) | https://codeforces.com/problemset/problem/1704/H2 | [
"combinatorics",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 122
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-H1 | codeforces | 1704-H1 | Game of AI (easy version) | https://codeforces.com/problemset/problem/1704/H1 | [
"combinatorics",
"constructive algorithms",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 402
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-G | codeforces | 1704-G | Mio and Lucky Array | https://codeforces.com/problemset/problem/1704/G | [
"constructive algorithms",
"fft",
"math",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 187
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-F | codeforces | 1704-F | Colouring Game | https://codeforces.com/problemset/problem/1704/F | [
"constructive algorithms",
"dp",
"games"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1401
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-E | codeforces | 1704-E | Count Seconds | https://codeforces.com/problemset/problem/1704/E | [
"brute force",
"constructive algorithms",
"dp",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2777
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-D | codeforces | 1704-D | Magical Array | https://codeforces.com/problemset/problem/1704/D | [
"constructive algorithms",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5458
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-C | codeforces | 1704-C | Virus | https://codeforces.com/problemset/problem/1704/C | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 27943
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-B | codeforces | 1704-B | Luke is a Foodie | https://codeforces.com/problemset/problem/1704/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34069
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1704-A | codeforces | 1704-A | Two 0-1 Sequences | https://codeforces.com/problemset/problem/1704/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16781
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1703-G | codeforces | 1703-G | Good Key, Bad Key | https://codeforces.com/problemset/problem/1703/G | [
"bitmasks",
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13251
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1703-F | codeforces | 1703-F | Yet Another Problem About Pairs Satisfying an Inequality | https://codeforces.com/problemset/problem/1703/F | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 33564
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1703-E | codeforces | 1703-E | Mirror Grid | https://codeforces.com/problemset/problem/1703/E | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30710
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1703-D | codeforces | 1703-D | Double Strings | https://codeforces.com/problemset/problem/1703/D | [
"brute force",
"data structures",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 30193
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1703-C | codeforces | 1703-C | Cypher | https://codeforces.com/problemset/problem/1703/C | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42271
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1703-B | codeforces | 1703-B | ICPC Balloons | https://codeforces.com/problemset/problem/1703/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 70837
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1703-A | codeforces | 1703-A | YES or YES? | https://codeforces.com/problemset/problem/1703/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 104404
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1702-G2 | codeforces | 1702-G2 | Passable Paths (hard version) | https://codeforces.com/problemset/problem/1702/G2 | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6453
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1702-G1 | codeforces | 1702-G1 | Passable Paths (easy version) | https://codeforces.com/problemset/problem/1702/G1 | [
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6697
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1702-F | codeforces | 1702-F | Equate Multisets | https://codeforces.com/problemset/problem/1702/F | [
"constructive algorithms",
"data structures",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9717
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1702-E | codeforces | 1702-E | Split Into Two Sets | https://codeforces.com/problemset/problem/1702/E | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 19592
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1702-D | codeforces | 1702-D | Not a Cheap String | https://codeforces.com/problemset/problem/1702/D | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26396
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1702-C | codeforces | 1702-C | Train and Queries | https://codeforces.com/problemset/problem/1702/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26175
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1702-B | codeforces | 1702-B | Polycarp Writes a String from Memory | https://codeforces.com/problemset/problem/1702/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29754
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1702-A | codeforces | 1702-A | Round Down the Price | https://codeforces.com/problemset/problem/1702/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39313
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1701-F | codeforces | 1701-F | Points | https://codeforces.com/problemset/problem/1701/F | [
"combinatorics",
"data structures",
"implementation",
"math",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1251
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1701-E | codeforces | 1701-E | Text Editor | https://codeforces.com/problemset/problem/1701/E | [
"brute force",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1440
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1701-D | codeforces | 1701-D | Permutation Restoration | https://codeforces.com/problemset/problem/1701/D | [
"binary search",
"data structures",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6415
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1701-C | codeforces | 1701-C | Schedule Management | https://codeforces.com/problemset/problem/1701/C | [
"binary search",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26324
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1701-B | codeforces | 1701-B | Permutation | https://codeforces.com/problemset/problem/1701/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20961
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1701-A | codeforces | 1701-A | Grass Field | https://codeforces.com/problemset/problem/1701/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27954
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1700-F | codeforces | 1700-F | Puzzle | https://codeforces.com/problemset/problem/1700/F | [
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1128
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1700-E | codeforces | 1700-E | Serega the Pirate | https://codeforces.com/problemset/problem/1700/E | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1022
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1700-D | codeforces | 1700-D | River Locks | https://codeforces.com/problemset/problem/1700/D | [
"binary search",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7307
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1700-C | codeforces | 1700-C | Helping the Nature | https://codeforces.com/problemset/problem/1700/C | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 12465
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1700-B | codeforces | 1700-B | Palindromic Numbers | https://codeforces.com/problemset/problem/1700/B | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20222
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1700-A | codeforces | 1700-A | Optimal Path | https://codeforces.com/problemset/problem/1700/A | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23805
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1699-E | codeforces | 1699-E | Three Days Grace | https://codeforces.com/problemset/problem/1699/E | [
"data structures",
"dp",
"greedy",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1442
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1699-D | codeforces | 1699-D | Almost Triple Deletions | https://codeforces.com/problemset/problem/1699/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3678
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1699-C | codeforces | 1699-C | The Third Problem | https://codeforces.com/problemset/problem/1699/C | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10921
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1699-B | codeforces | 1699-B | Almost Ternary Matrix | https://codeforces.com/problemset/problem/1699/B | [
"bitmasks",
"constructive algorithms",
"matrices"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1699-A | codeforces | 1699-A | The Third Three Number Problem | https://codeforces.com/problemset/problem/1699/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24983
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1698-G | codeforces | 1698-G | Long Binary String | https://codeforces.com/problemset/problem/1698/G | [
"bitmasks",
"math",
"matrices",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 399
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1698-F | codeforces | 1698-F | Equal Reversal | https://codeforces.com/problemset/problem/1698/F | [
"constructive algorithms",
"graphs",
"implementation",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 792
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1698-E | codeforces | 1698-E | PermutationForces II | https://codeforces.com/problemset/problem/1698/E | [
"brute force",
"combinatorics",
"greedy",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1898
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1698-D | codeforces | 1698-D | Fixed Point Guessing | https://codeforces.com/problemset/problem/1698/D | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12868
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1698-C | codeforces | 1698-C | 3SUM Closure | https://codeforces.com/problemset/problem/1698/C | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20076
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1698-B | codeforces | 1698-B | Rising Sand | https://codeforces.com/problemset/problem/1698/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21599
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1698-A | codeforces | 1698-A | XOR Mixup | https://codeforces.com/problemset/problem/1698/A | [
"bitmasks",
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33706
} | 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.