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:1495-B | codeforces | 1495-B | Let's Go Hiking | https://codeforces.com/problemset/problem/1495/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6419
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1495-A | codeforces | 1495-A | Diamond Miner | https://codeforces.com/problemset/problem/1495/A | [
"geometry",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18088
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1494-F | codeforces | 1494-F | Delete The Edges | https://codeforces.com/problemset/problem/1494/F | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 605
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1494-E | codeforces | 1494-E | A-Z Graph | https://codeforces.com/problemset/problem/1494/E | [
"constructive algorithms",
"data structures",
"graphs",
"hashing"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2131
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1494-D | codeforces | 1494-D | Dogeforces | https://codeforces.com/problemset/problem/1494/D | [
"constructive algorithms",
"data structures",
"dfs and similar",
"divide and conquer",
"dsu",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2949
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1494-C | codeforces | 1494-C | 1D Sokoban | https://codeforces.com/problemset/problem/1494/C | [
"binary search",
"dp",
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5814
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1494-B | codeforces | 1494-B | Berland Crossword | https://codeforces.com/problemset/problem/1494/B | [
"bitmasks",
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15569
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1494-A | codeforces | 1494-A | ABC String | https://codeforces.com/problemset/problem/1494/A | [
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23183
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1493-F | codeforces | 1493-F | Enchanted Matrix | https://codeforces.com/problemset/problem/1493/F | [
"bitmasks",
"interactive",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 536
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1493-E | codeforces | 1493-E | Enormous XOR | https://codeforces.com/problemset/problem/1493/E | [
"bitmasks",
"constructive algorithms",
"greedy",
"math",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1138
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1493-D | codeforces | 1493-D | GCD of an Array | https://codeforces.com/problemset/problem/1493/D | [
"brute force",
"data structures",
"hashing",
"implementation",
"math",
"number theory",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5989
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1493-C | codeforces | 1493-C | K-beautiful Strings | https://codeforces.com/problemset/problem/1493/C | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5049
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1493-B | codeforces | 1493-B | Planet Lapituletti | https://codeforces.com/problemset/problem/1493/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12671
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1493-A | codeforces | 1493-A | Anti-knapsack | https://codeforces.com/problemset/problem/1493/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19870
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1492-E | codeforces | 1492-E | Almost Fault-Tolerant Database | https://codeforces.com/problemset/problem/1492/E | [
"brute force",
"constructive algorithms",
"dfs and similar",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1338
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1492-D | codeforces | 1492-D | Genius's Gambit | https://codeforces.com/problemset/problem/1492/D | [
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6594
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1492-C | codeforces | 1492-C | Maximum width | https://codeforces.com/problemset/problem/1492/C | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17826
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1492-B | codeforces | 1492-B | Card Deck | https://codeforces.com/problemset/problem/1492/B | [
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21324
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1492-A | codeforces | 1492-A | Three swimmers | https://codeforces.com/problemset/problem/1492/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23545
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-I | codeforces | 1491-I | Ruler Of The Zoo | https://codeforces.com/problemset/problem/1491/I | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 114
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-H | codeforces | 1491-H | Yuezheng Ling and Dynamic Tree | https://codeforces.com/problemset/problem/1491/H | [
"data structures",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 1313
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-G | codeforces | 1491-G | Switch and Flip | https://codeforces.com/problemset/problem/1491/G | [
"constructive algorithms",
"graphs",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1111
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-F | codeforces | 1491-F | Magnets | https://codeforces.com/problemset/problem/1491/F | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1197
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-E | codeforces | 1491-E | Fib-tree | https://codeforces.com/problemset/problem/1491/E | [
"brute force",
"dfs and similar",
"divide and conquer",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-D | codeforces | 1491-D | Zookeeper and The Infinite Zoo | https://codeforces.com/problemset/problem/1491/D | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8702
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-C | codeforces | 1491-C | Pekora and Trampoline | https://codeforces.com/problemset/problem/1491/C | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8515
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-B | codeforces | 1491-B | Minimal Cost | https://codeforces.com/problemset/problem/1491/B | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14347
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1491-A | codeforces | 1491-A | K-th Largest Value | https://codeforces.com/problemset/problem/1491/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19192
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1490-G | codeforces | 1490-G | Old Floppy Drive | https://codeforces.com/problemset/problem/1490/G | [
"binary search",
"data structures",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6364
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1490-F | codeforces | 1490-F | Equalize the Array | https://codeforces.com/problemset/problem/1490/F | [
"binary search",
"data structures",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19020
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1490-E | codeforces | 1490-E | Accidental Victory | https://codeforces.com/problemset/problem/1490/E | [
"binary search",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21714
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1490-D | codeforces | 1490-D | Permutation Transformation | https://codeforces.com/problemset/problem/1490/D | [
"dfs and similar",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 22941
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1490-C | codeforces | 1490-C | Sum of Cubes | https://codeforces.com/problemset/problem/1490/C | [
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 40472
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1490-B | codeforces | 1490-B | Balanced Remainders | https://codeforces.com/problemset/problem/1490/B | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28303
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1490-A | codeforces | 1490-A | Dense Array | https://codeforces.com/problemset/problem/1490/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33570
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-J | codeforces | 1488-J | Flower Shop | https://codeforces.com/problemset/problem/1488/J | [
"*special",
"data structures",
"fft",
"math"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 49
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-I | codeforces | 1488-I | Demonic Invasion | https://codeforces.com/problemset/problem/1488/I | [
"*special",
"flows"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 51
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-H | codeforces | 1488-H | Build From Suffixes | https://codeforces.com/problemset/problem/1488/H | [
"*special",
"combinatorics",
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 77
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-G | codeforces | 1488-G | Painting Numbers | https://codeforces.com/problemset/problem/1488/G | [
"*special",
"data structures",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 137
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-F | codeforces | 1488-F | Dogecoin | https://codeforces.com/problemset/problem/1488/F | [
"*special",
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 195
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-E | codeforces | 1488-E | Palindromic Doubles | https://codeforces.com/problemset/problem/1488/E | [
"*special",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 238
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-D | codeforces | 1488-D | Problemsolving Marathon | https://codeforces.com/problemset/problem/1488/D | [
"*special",
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 361
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-C | codeforces | 1488-C | Two Policemen | https://codeforces.com/problemset/problem/1488/C | [
"*special",
"binary search",
"brute force",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 530
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-B | codeforces | 1488-B | RBS Deletion | https://codeforces.com/problemset/problem/1488/B | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 608
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1488-A | codeforces | 1488-A | From Zero To Y | https://codeforces.com/problemset/problem/1488/A | [
"*special",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 1882
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1487-G | codeforces | 1487-G | String Counting | https://codeforces.com/problemset/problem/1487/G | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 763
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1487-F | codeforces | 1487-F | Ones | https://codeforces.com/problemset/problem/1487/F | [
"dp",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 555
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1487-E | codeforces | 1487-E | Cheap Dinner | https://codeforces.com/problemset/problem/1487/E | [
"brute force",
"data structures",
"graphs",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5250
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1487-D | codeforces | 1487-D | Pythagorean Triples | https://codeforces.com/problemset/problem/1487/D | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21133
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1487-C | codeforces | 1487-C | Minimum Ties | https://codeforces.com/problemset/problem/1487/C | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15723
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1487-B | codeforces | 1487-B | Cat Cycle | https://codeforces.com/problemset/problem/1487/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31420
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1487-A | codeforces | 1487-A | Arena | https://codeforces.com/problemset/problem/1487/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27867
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1486-F | codeforces | 1486-F | Pairs of Paths | https://codeforces.com/problemset/problem/1486/F | [
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 911
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1486-E | codeforces | 1486-E | Paired Payment | https://codeforces.com/problemset/problem/1486/E | [
"binary search",
"brute force",
"constructive algorithms",
"dp",
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3715
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1486-D | codeforces | 1486-D | Max Median | https://codeforces.com/problemset/problem/1486/D | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 10710
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1486-C2 | codeforces | 1486-C2 | Guessing the Greatest (hard version) | https://codeforces.com/problemset/problem/1486/C2 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10469
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1486-C1 | codeforces | 1486-C1 | Guessing the Greatest (easy version) | https://codeforces.com/problemset/problem/1486/C1 | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 14652
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1486-B | codeforces | 1486-B | Eastern Exhibition | https://codeforces.com/problemset/problem/1486/B | [
"binary search",
"geometry",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 22023
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1486-A | codeforces | 1486-A | Shifting Stacks | https://codeforces.com/problemset/problem/1486/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 27447
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1485-F | codeforces | 1485-F | Copy or Prefix Sum | https://codeforces.com/problemset/problem/1485/F | [
"combinatorics",
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2502
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1485-E | codeforces | 1485-E | Move and Swap | https://codeforces.com/problemset/problem/1485/E | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1620
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1485-D | codeforces | 1485-D | Multiples and Power Differences | https://codeforces.com/problemset/problem/1485/D | [
"constructive algorithms",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5801
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1485-C | codeforces | 1485-C | Floor and Mod | https://codeforces.com/problemset/problem/1485/C | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11389
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1485-B | codeforces | 1485-B | Replace and Keep Sorted | https://codeforces.com/problemset/problem/1485/B | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 18127
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1485-A | codeforces | 1485-A | Add and Divide | https://codeforces.com/problemset/problem/1485/A | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 37061
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1482-H | codeforces | 1482-H | Exam | https://codeforces.com/problemset/problem/1482/H | [
"data structures",
"string suffix structures",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 849
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1482-G | codeforces | 1482-G | Vabank | https://codeforces.com/problemset/problem/1482/G | [
"binary search",
"interactive"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 365
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1482-F | codeforces | 1482-F | Useful Edges | https://codeforces.com/problemset/problem/1482/F | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1817
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1482-E | codeforces | 1482-E | Skyline Photo | https://codeforces.com/problemset/problem/1482/E | [
"data structures",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4085
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1482-D | codeforces | 1482-D | Playlist | https://codeforces.com/problemset/problem/1482/D | [
"data structures",
"dsu",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4170
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1482-C | codeforces | 1482-C | Basic Diplomacy | https://codeforces.com/problemset/problem/1482/C | [
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 10137
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1482-B | codeforces | 1482-B | Restore Modulo | https://codeforces.com/problemset/problem/1482/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9722
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1482-A | codeforces | 1482-A | Prison Break | https://codeforces.com/problemset/problem/1482/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21475
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1481-F | codeforces | 1481-F | AB Tree | https://codeforces.com/problemset/problem/1481/F | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 923
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1481-E | codeforces | 1481-E | Sorting Books | https://codeforces.com/problemset/problem/1481/E | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2538
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1481-D | codeforces | 1481-D | AB Graph | https://codeforces.com/problemset/problem/1481/D | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4973
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1481-C | codeforces | 1481-C | Fence Painting | https://codeforces.com/problemset/problem/1481/C | [
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12566
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1481-B | codeforces | 1481-B | New Colony | https://codeforces.com/problemset/problem/1481/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 20064
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1481-A | codeforces | 1481-A | Space Navigation | https://codeforces.com/problemset/problem/1481/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25913
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1480-B | codeforces | 1480-B | The Great Hero | https://codeforces.com/problemset/problem/1480/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 18067
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1480-A | codeforces | 1480-A | Yet Another String Game | https://codeforces.com/problemset/problem/1480/A | [
"games",
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27401
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1479-E | codeforces | 1479-E | School Clubs | https://codeforces.com/problemset/problem/1479/E | [
"dp",
"fft",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 476
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1479-D | codeforces | 1479-D | Odd Mineral Resource | https://codeforces.com/problemset/problem/1479/D | [
"binary search",
"bitmasks",
"brute force",
"data structures",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1481
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1479-C | codeforces | 1479-C | Continuous City | https://codeforces.com/problemset/problem/1479/C | [
"bitmasks",
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1499
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1479-B2 | codeforces | 1479-B2 | Painting the Array II | https://codeforces.com/problemset/problem/1479/B2 | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4627
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1479-B1 | codeforces | 1479-B1 | Painting the Array I | https://codeforces.com/problemset/problem/1479/B1 | [
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7612
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1479-A | codeforces | 1479-A | Searching Local Minimum | https://codeforces.com/problemset/problem/1479/A | [
"binary search",
"interactive",
"ternary search"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13522
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1478-C | codeforces | 1478-C | Nezzar and Symmetric Array | https://codeforces.com/problemset/problem/1478/C | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10828
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1478-B | codeforces | 1478-B | Nezzar and Lucky Number | https://codeforces.com/problemset/problem/1478/B | [
"brute force",
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19141
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1478-A | codeforces | 1478-A | Nezzar and Colorful Balls | https://codeforces.com/problemset/problem/1478/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28322
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1477-F | codeforces | 1477-F | Nezzar and Chocolate Bars | https://codeforces.com/problemset/problem/1477/F | [
"combinatorics",
"fft",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 387
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1477-E | codeforces | 1477-E | Nezzar and Tournaments | https://codeforces.com/problemset/problem/1477/E | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 308
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1477-D | codeforces | 1477-D | Nezzar and Hidden Permutations | https://codeforces.com/problemset/problem/1477/D | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 840
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1477-C | codeforces | 1477-C | Nezzar and Nice Beatmap | https://codeforces.com/problemset/problem/1477/C | [
"constructive algorithms",
"geometry",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2680
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1477-B | codeforces | 1477-B | Nezzar and Binary String | https://codeforces.com/problemset/problem/1477/B | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3758
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1477-A | codeforces | 1477-A | Nezzar and Board | https://codeforces.com/problemset/problem/1477/A | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6701
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1476-G | codeforces | 1476-G | Minimum Difference | https://codeforces.com/problemset/problem/1476/G | [
"data structures",
"hashing",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 1058
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1476-F | codeforces | 1476-F | Lanterns | https://codeforces.com/problemset/problem/1476/F | [
"binary search",
"data structures",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1251
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1476-E | codeforces | 1476-E | Pattern Matching | https://codeforces.com/problemset/problem/1476/E | [
"bitmasks",
"data structures",
"dfs and similar",
"graphs",
"hashing",
"sortings",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2894
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1476-D | codeforces | 1476-D | Journey | https://codeforces.com/problemset/problem/1476/D | [
"dfs and similar",
"dp",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9386
} | 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.