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:618-D | codeforces | 618-D | Hamiltonian Spanning Tree | https://codeforces.com/problemset/problem/618/D | [
"dfs and similar",
"dp",
"graph matchings",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:618-C | codeforces | 618-C | Constellation | https://codeforces.com/problemset/problem/618/C | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4684
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:618-B | codeforces | 618-B | Guess the Permutation | https://codeforces.com/problemset/problem/618/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8330
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:618-A | codeforces | 618-A | Slime Combining | https://codeforces.com/problemset/problem/618/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8822
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:617-E | codeforces | 617-E | XOR and Favorite Number | https://codeforces.com/problemset/problem/617/E | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 10707
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:617-D | codeforces | 617-D | Polyline | https://codeforces.com/problemset/problem/617/D | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:617-C | codeforces | 617-C | Watering Flowers | https://codeforces.com/problemset/problem/617/C | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5257
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:617-B | codeforces | 617-B | Chocolate | https://codeforces.com/problemset/problem/617/B | [
"combinatorics"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 20114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:617-A | codeforces | 617-A | Elephant | https://codeforces.com/problemset/problem/617/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 251442
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:616-F | codeforces | 616-F | Expensive Strings | https://codeforces.com/problemset/problem/616/F | [
"data structures",
"sortings",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 730
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:616-E | codeforces | 616-E | Sum of Remainders | https://codeforces.com/problemset/problem/616/E | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:616-D | codeforces | 616-D | Longest k-Good Segment | https://codeforces.com/problemset/problem/616/D | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12482
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:616-C | codeforces | 616-C | The Labyrinth | https://codeforces.com/problemset/problem/616/C | [
"dfs and similar"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6739
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:616-B | codeforces | 616-B | Dinner with Emma | https://codeforces.com/problemset/problem/616/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 13197
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:616-A | codeforces | 616-A | Comparing Two Long Integers | https://codeforces.com/problemset/problem/616/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 10861
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:615-E | codeforces | 615-E | Hexagons | https://codeforces.com/problemset/problem/615/E | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:615-D | codeforces | 615-D | Multipliers | https://codeforces.com/problemset/problem/615/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:615-C | codeforces | 615-C | Running Track | https://codeforces.com/problemset/problem/615/C | [
"dp",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2465
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:615-B | codeforces | 615-B | Longtail Hedgehog | https://codeforces.com/problemset/problem/615/B | [
"dp",
"graphs"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:615-A | codeforces | 615-A | Bulbs | https://codeforces.com/problemset/problem/615/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20606
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:614-B | codeforces | 614-B | Gena's Code | https://codeforces.com/problemset/problem/614/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7304
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:614-A | codeforces | 614-A | Link/Cut Tree | https://codeforces.com/problemset/problem/614/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7812
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:613-E | codeforces | 613-E | Puzzle Lover | https://codeforces.com/problemset/problem/613/E | [
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:613-D | codeforces | 613-D | Kingdom and its Cities | https://codeforces.com/problemset/problem/613/D | [
"dfs and similar",
"divide and conquer",
"dp",
"graphs",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 4092
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:613-C | codeforces | 613-C | Necklace | https://codeforces.com/problemset/problem/613/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1083
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:613-B | codeforces | 613-B | Skills | https://codeforces.com/problemset/problem/613/B | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:613-A | codeforces | 613-A | Peter and Snow Blower | https://codeforces.com/problemset/problem/613/A | [
"binary search",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:612-F | codeforces | 612-F | Simba on the Circle | https://codeforces.com/problemset/problem/612/F | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:612-E | codeforces | 612-E | Square Root of Permutation | https://codeforces.com/problemset/problem/612/E | [
"combinatorics",
"constructive algorithms",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:612-D | codeforces | 612-D | The Union of k-Segments | https://codeforces.com/problemset/problem/612/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4386
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:612-C | codeforces | 612-C | Replace To Make Regular Bracket Sequence | https://codeforces.com/problemset/problem/612/C | [
"data structures",
"expression parsing",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:612-B | codeforces | 612-B | HDD is Outdated Technology | https://codeforces.com/problemset/problem/612/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:612-A | codeforces | 612-A | The Text Splitting | https://codeforces.com/problemset/problem/612/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7851
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:611-H | codeforces | 611-H | New Year and Forgotten Tree | https://codeforces.com/problemset/problem/611/H | [
"constructive algorithms",
"flows",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 701
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:611-G | codeforces | 611-G | New Year and Cake | https://codeforces.com/problemset/problem/611/G | [
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 464
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:611-F | codeforces | 611-F | New Year and Cleaning | https://codeforces.com/problemset/problem/611/F | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 523
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:611-E | codeforces | 611-E | New Year and Three Musketeers | https://codeforces.com/problemset/problem/611/E | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 912
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:611-D | codeforces | 611-D | New Year and Ancient Prophecy | https://codeforces.com/problemset/problem/611/D | [
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:611-C | codeforces | 611-C | New Year and Domino | https://codeforces.com/problemset/problem/611/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9073
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:611-B | codeforces | 611-B | New Year and Old Property | https://codeforces.com/problemset/problem/611/B | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11117
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:611-A | codeforces | 611-A | New Year and Days | https://codeforces.com/problemset/problem/611/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:610-E | codeforces | 610-E | Alphabet Permutations | https://codeforces.com/problemset/problem/610/E | [
"data structures",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1035
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:610-D | codeforces | 610-D | Vika and Segments | https://codeforces.com/problemset/problem/610/D | [
"constructive algorithms",
"data structures",
"geometry",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:610-C | codeforces | 610-C | Harmony Analysis | https://codeforces.com/problemset/problem/610/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2983
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:610-B | codeforces | 610-B | Vika and Squares | https://codeforces.com/problemset/problem/610/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8358
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:610-A | codeforces | 610-A | Pasha and Stick | https://codeforces.com/problemset/problem/610/A | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27723
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:609-F | codeforces | 609-F | Frogs and mosquitoes | https://codeforces.com/problemset/problem/609/F | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:609-E | codeforces | 609-E | Minimum spanning tree for each edge | https://codeforces.com/problemset/problem/609/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 10374
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:609-D | codeforces | 609-D | Gadgets for dollars and pounds | https://codeforces.com/problemset/problem/609/D | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3185
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:609-C | codeforces | 609-C | Load Balancing | https://codeforces.com/problemset/problem/609/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7420
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:609-B | codeforces | 609-B | The Best Gift | https://codeforces.com/problemset/problem/609/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:609-A | codeforces | 609-A | USB Flash Drives | https://codeforces.com/problemset/problem/609/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19508
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:608-B | codeforces | 608-B | Hamming Distance Sum | https://codeforces.com/problemset/problem/608/B | [
"combinatorics",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7481
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:608-A | codeforces | 608-A | Saitama Destroys Hotel | https://codeforces.com/problemset/problem/608/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9944
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:607-E | codeforces | 607-E | Cross Sum | https://codeforces.com/problemset/problem/607/E | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:607-D | codeforces | 607-D | Power Tree | https://codeforces.com/problemset/problem/607/D | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 647
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:607-C | codeforces | 607-C | Marbles | https://codeforces.com/problemset/problem/607/C | [
"hashing",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 846
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:607-B | codeforces | 607-B | Zuma | https://codeforces.com/problemset/problem/607/B | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 16494
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:607-A | codeforces | 607-A | Chain Reaction | https://codeforces.com/problemset/problem/607/A | [
"binary search",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:606-B | codeforces | 606-B | Testing Robots | https://codeforces.com/problemset/problem/606/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2835
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:606-A | codeforces | 606-A | Magic Spheres | https://codeforces.com/problemset/problem/606/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8251
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:605-E | codeforces | 605-E | Intergalaxy Trips | https://codeforces.com/problemset/problem/605/E | [
"probabilities",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1548
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:605-D | codeforces | 605-D | Board Game | https://codeforces.com/problemset/problem/605/D | [
"data structures",
"dfs and similar"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 906
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:605-C | codeforces | 605-C | Freelancer's Dreams | https://codeforces.com/problemset/problem/605/C | [
"geometry"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:605-B | codeforces | 605-B | Lazy Student | https://codeforces.com/problemset/problem/605/B | [
"constructive algorithms",
"data structures",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3855
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:605-A | codeforces | 605-A | Sorting Railway Cars | https://codeforces.com/problemset/problem/605/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:604-B | codeforces | 604-B | More Cowbell | https://codeforces.com/problemset/problem/604/B | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:604-A | codeforces | 604-A | Uncowed Forces | https://codeforces.com/problemset/problem/604/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9391
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:603-E | codeforces | 603-E | Pastoral Oddities | https://codeforces.com/problemset/problem/603/E | [
"data structures",
"divide and conquer",
"dsu",
"math",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1549
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:603-D | codeforces | 603-D | Ruminations on Ruminants | https://codeforces.com/problemset/problem/603/D | [
"geometry",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:603-C | codeforces | 603-C | Lieges of Legendre | https://codeforces.com/problemset/problem/603/C | [
"games",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:603-B | codeforces | 603-B | Moodular Arithmetic | https://codeforces.com/problemset/problem/603/B | [
"combinatorics",
"dfs and similar",
"dsu",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:603-A | codeforces | 603-A | Alternative Thinking | https://codeforces.com/problemset/problem/603/A | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8267
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:602-B | codeforces | 602-B | Approximating a Constant Range | https://codeforces.com/problemset/problem/602/B | [
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12160
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:602-A | codeforces | 602-A | Two Bases | https://codeforces.com/problemset/problem/602/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8804
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:601-E | codeforces | 601-E | A Museum Robbery | https://codeforces.com/problemset/problem/601/E | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1150
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:601-D | codeforces | 601-D | Acyclic Organic Compounds | https://codeforces.com/problemset/problem/601/D | [
"data structures",
"dfs and similar",
"dsu",
"hashing",
"strings",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:601-C | codeforces | 601-C | Kleofáš and the n-thlon | https://codeforces.com/problemset/problem/601/C | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1427
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:601-B | codeforces | 601-B | Lipshitz Sequence | https://codeforces.com/problemset/problem/601/B | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2433
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:601-A | codeforces | 601-A | The Two Routes | https://codeforces.com/problemset/problem/601/A | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13989
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:600-F | codeforces | 600-F | Edge coloring of bipartite graph | https://codeforces.com/problemset/problem/600/F | [
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1159
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:600-E | codeforces | 600-E | Lomsat gelral | https://codeforces.com/problemset/problem/600/E | [
"data structures",
"dfs and similar",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 18628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:600-D | codeforces | 600-D | Area of Two Circles' Intersection | https://codeforces.com/problemset/problem/600/D | [
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2729
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:600-C | codeforces | 600-C | Make Palindrome | https://codeforces.com/problemset/problem/600/C | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7127
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:600-B | codeforces | 600-B | Queries about less or equal elements | https://codeforces.com/problemset/problem/600/B | [
"binary search",
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 39738
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:600-A | codeforces | 600-A | Extract Numbers | https://codeforces.com/problemset/problem/600/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:599-E | codeforces | 599-E | Sandy and Nuts | https://codeforces.com/problemset/problem/599/E | [
"bitmasks",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 765
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:599-D | codeforces | 599-D | Spongebob and Squares | https://codeforces.com/problemset/problem/599/D | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2731
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:599-C | codeforces | 599-C | Day at the Beach | https://codeforces.com/problemset/problem/599/C | [
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5095
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:599-B | codeforces | 599-B | Spongebob and Joke | https://codeforces.com/problemset/problem/599/B | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:599-A | codeforces | 599-A | Patrick and Shopping | https://codeforces.com/problemset/problem/599/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31550
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:598-F | codeforces | 598-F | Cut Length | https://codeforces.com/problemset/problem/598/F | [
"geometry"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:598-E | codeforces | 598-E | Chocolate Bar | https://codeforces.com/problemset/problem/598/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6153
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:598-D | codeforces | 598-D | Igor In the Museum | https://codeforces.com/problemset/problem/598/D | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13317
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:598-C | codeforces | 598-C | Nearest vectors | https://codeforces.com/problemset/problem/598/C | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 5437
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:598-B | codeforces | 598-B | Queries on a String | https://codeforces.com/problemset/problem/598/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12242
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:598-A | codeforces | 598-A | Tricky Sum | https://codeforces.com/problemset/problem/598/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 32423
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:597-C | codeforces | 597-C | Subsequences | https://codeforces.com/problemset/problem/597/C | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6703
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:597-B | codeforces | 597-B | Restaurant | https://codeforces.com/problemset/problem/597/B | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5695
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:597-A | codeforces | 597-A | Divisibility | https://codeforces.com/problemset/problem/597/A | [
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4940
} | 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.