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: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": 30050
} | 2026-08-10T02:20:32.917453+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": 22701
} | 2026-08-10T02:20:32.917453+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": 186
} | 2026-08-10T02:20:32.917453+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": 950
} | 2026-08-10T02:20:32.917453+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": 1021
} | 2026-08-10T02:20:32.917453+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": 1973
} | 2026-08-10T02:20:32.917453+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": 6477
} | 2026-08-10T02:20:32.917453+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": 15690
} | 2026-08-10T02:20:32.917453+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": 4008
} | 2026-08-10T02:20:32.917453+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": 1974
} | 2026-08-10T02:20:32.917453+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": 7803
} | 2026-08-10T02:20:32.917453+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": 16272
} | 2026-08-10T02:20:32.917453+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": 17635
} | 2026-08-10T02:20:32.917453+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": 24348
} | 2026-08-10T02:20:32.917453+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": 721
} | 2026-08-10T02:20:32.917453+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": 2527
} | 2026-08-10T02:20:32.917453+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": 7235
} | 2026-08-10T02:20:32.917453+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": 14684
} | 2026-08-10T02:20:32.917453+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": 25829
} | 2026-08-10T02:20:32.917453+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": 26721
} | 2026-08-10T02:20:32.917453+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": 119
} | 2026-08-10T02:20:32.917453+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": 399
} | 2026-08-10T02:20:32.917453+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": 183
} | 2026-08-10T02:20:32.917453+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": 1366
} | 2026-08-10T02:20:32.917453+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": 2734
} | 2026-08-10T02:20:32.917453+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": 5416
} | 2026-08-10T02:20:32.917453+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": 26697
} | 2026-08-10T02:20:32.917453+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": 32344
} | 2026-08-10T02:20:32.917453+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": 16746
} | 2026-08-10T02:20:32.917453+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": 13018
} | 2026-08-10T02:20:32.917453+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": 32182
} | 2026-08-10T02:20:32.917453+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": 29429
} | 2026-08-10T02:20:32.917453+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": 29733
} | 2026-08-10T02:20:32.917453+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": 41470
} | 2026-08-10T02:20:32.917453+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": 68595
} | 2026-08-10T02:20:32.917453+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": 100743
} | 2026-08-10T02:20:32.917453+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": 6180
} | 2026-08-10T02:20:32.917453+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": 6558
} | 2026-08-10T02:20:32.917453+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": 9600
} | 2026-08-10T02:20:32.917453+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": 18860
} | 2026-08-10T02:20:32.917453+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": 26246
} | 2026-08-10T02:20:32.917453+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": 25620
} | 2026-08-10T02:20:32.917453+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": 29590
} | 2026-08-10T02:20:32.917453+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": 38910
} | 2026-08-10T02:20:32.917453+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": 1213
} | 2026-08-10T02:20:32.917453+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": 1415
} | 2026-08-10T02:20:32.917453+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": 6326
} | 2026-08-10T02:20:32.917453+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": 25175
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1701-B | codeforces | 1701-B | Permutation | https://codeforces.com/problemset/problem/1701/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20881
} | 2026-08-10T02:20:32.917453+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": 27714
} | 2026-08-10T02:20:32.917453+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": 1114
} | 2026-08-10T02:20:32.917453+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": 1014
} | 2026-08-10T02:20:32.917453+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": 7158
} | 2026-08-10T02:20:32.917453+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": 12308
} | 2026-08-10T02:20:32.917453+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": 20083
} | 2026-08-10T02:20:32.917453+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": 23749
} | 2026-08-10T02:20:32.917453+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": 1428
} | 2026-08-10T02:20:32.917453+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": 3620
} | 2026-08-10T02:20:32.917453+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": 10838
} | 2026-08-10T02:20:32.917453+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": 22011
} | 2026-08-10T02:20:32.917453+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": 24924
} | 2026-08-10T02:20:32.917453+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": 397
} | 2026-08-10T02:20:32.917453+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": 784
} | 2026-08-10T02:20:32.917453+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": 1874
} | 2026-08-10T02:20:32.917453+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": 12540
} | 2026-08-10T02:20:32.917453+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": 19947
} | 2026-08-10T02:20:32.917453+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": 21550
} | 2026-08-10T02:20:32.917453+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": 33351
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1697-F | codeforces | 1697-F | Too Many Constraints | https://codeforces.com/problemset/problem/1697/F | [
"2-sat",
"constructive algorithms",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 820
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1697-E | codeforces | 1697-E | Coloring | https://codeforces.com/problemset/problem/1697/E | [
"brute force",
"combinatorics",
"constructive algorithms",
"dp",
"geometry",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1482
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1697-D | codeforces | 1697-D | Guess The String | https://codeforces.com/problemset/problem/1697/D | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5060
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1697-C | codeforces | 1697-C | awoo's Favorite Problem | https://codeforces.com/problemset/problem/1697/C | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15928
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1697-B | codeforces | 1697-B | Promo | https://codeforces.com/problemset/problem/1697/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 31422
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1697-A | codeforces | 1697-A | Parkway Walk | https://codeforces.com/problemset/problem/1697/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26840
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1696-H | codeforces | 1696-H | Maximum Product? | https://codeforces.com/problemset/problem/1696/H | [
"brute force",
"combinatorics",
"dp",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 219
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1696-G | codeforces | 1696-G | Fishingprince Plays With Array Again | https://codeforces.com/problemset/problem/1696/G | [
"brute force",
"data structures",
"geometry",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 452
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1696-F | codeforces | 1696-F | Tree Recovery | https://codeforces.com/problemset/problem/1696/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1169
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1696-E | codeforces | 1696-E | Placing Jinas | https://codeforces.com/problemset/problem/1696/E | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5028
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1696-D | codeforces | 1696-D | Permutation Graph | https://codeforces.com/problemset/problem/1696/D | [
"binary search",
"constructive algorithms",
"data structures",
"divide and conquer",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6069
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1696-C | codeforces | 1696-C | Fishingprince Plays With Array | https://codeforces.com/problemset/problem/1696/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12683
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1696-B | codeforces | 1696-B | NIT Destroys the Universe | https://codeforces.com/problemset/problem/1696/B | [
"greedy"
] | null | null | stdin_stdout | 900 | {
"solved_count": 39411
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1696-A | codeforces | 1696-A | NIT orz! | https://codeforces.com/problemset/problem/1696/A | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20438
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1695-E | codeforces | 1695-E | Ambiguous Dominoes | https://codeforces.com/problemset/problem/1695/E | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 543
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1695-D2 | codeforces | 1695-D2 | Tree Queries (Hard Version) | https://codeforces.com/problemset/problem/1695/D2 | [
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2336
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1695-D1 | codeforces | 1695-D1 | Tree Queries (Easy Version) | https://codeforces.com/problemset/problem/1695/D1 | [
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2503
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1695-C | codeforces | 1695-C | Zero Path | https://codeforces.com/problemset/problem/1695/C | [
"brute force",
"data structures",
"dp",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14577
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1695-B | codeforces | 1695-B | Circle Game | https://codeforces.com/problemset/problem/1695/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 20173
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1695-A | codeforces | 1695-A | Subrectangle Guess | https://codeforces.com/problemset/problem/1695/A | [
"games"
] | null | null | stdin_stdout | 800 | {
"solved_count": 16852
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1694-B | codeforces | 1694-B | Paranoid String | https://codeforces.com/problemset/problem/1694/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20809
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1694-A | codeforces | 1694-A | Creep | https://codeforces.com/problemset/problem/1694/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23626
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1693-F | codeforces | 1693-F | I Might Be Wrong | https://codeforces.com/problemset/problem/1693/F | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 638
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1693-E | codeforces | 1693-E | Outermost Maximums | https://codeforces.com/problemset/problem/1693/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 565
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1693-D | codeforces | 1693-D | Decinc Dividing | https://codeforces.com/problemset/problem/1693/D | [
"brute force",
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1179
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1693-C | codeforces | 1693-C | Keshi in Search of AmShZ | https://codeforces.com/problemset/problem/1693/C | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3275
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1693-B | codeforces | 1693-B | Fake Plastic Trees | https://codeforces.com/problemset/problem/1693/B | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9735
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1693-A | codeforces | 1693-A | Directional Increase | https://codeforces.com/problemset/problem/1693/A | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17588
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1692-H | codeforces | 1692-H | Gambling | https://codeforces.com/problemset/problem/1692/H | [
"data structures",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10023
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1692-G | codeforces | 1692-G | 2^Sort | https://codeforces.com/problemset/problem/1692/G | [
"data structures",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28013
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1692-F | codeforces | 1692-F | 3SUM | https://codeforces.com/problemset/problem/1692/F | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 27995
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:1692-E | codeforces | 1692-E | Binary Deque | https://codeforces.com/problemset/problem/1692/E | [
"binary search",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 35798
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.