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:926-J | codeforces | 926-J | Segments | https://codeforces.com/problemset/problem/926/J | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 709
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-I | codeforces | 926-I | A Vital Problem | https://codeforces.com/problemset/problem/926/I | [] | null | null | stdin_stdout | 1,700 | {
"solved_count": 818
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-H | codeforces | 926-H | Endless Roses Most Beautiful | https://codeforces.com/problemset/problem/926/H | [] | null | null | stdin_stdout | 2,200 | {
"solved_count": 298
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-G | codeforces | 926-G | Large Bouquets | https://codeforces.com/problemset/problem/926/G | [] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1767
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-F | codeforces | 926-F | Mobile Communications | https://codeforces.com/problemset/problem/926/F | [] | null | null | stdin_stdout | 2,000 | {
"solved_count": 347
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-E | codeforces | 926-E | Merge Equal Elements | https://codeforces.com/problemset/problem/926/E | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1110
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-D | codeforces | 926-D | Choose Place | https://codeforces.com/problemset/problem/926/D | [] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1048
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-C | codeforces | 926-C | Is This a Zebra? | https://codeforces.com/problemset/problem/926/C | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2117
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-B | codeforces | 926-B | Add Points | https://codeforces.com/problemset/problem/926/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2099
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:926-A | codeforces | 926-A | 2-3-numbers | https://codeforces.com/problemset/problem/926/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4279
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:925-F | codeforces | 925-F | Parametric Circulation | https://codeforces.com/problemset/problem/925/F | [
"binary search",
"flows"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 326
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:925-E | codeforces | 925-E | May Holidays | https://codeforces.com/problemset/problem/925/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:925-D | codeforces | 925-D | Aztec Catacombs | https://codeforces.com/problemset/problem/925/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 582
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:925-C | codeforces | 925-C | Big Secret | https://codeforces.com/problemset/problem/925/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1462
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:925-B | codeforces | 925-B | Resource Distribution | https://codeforces.com/problemset/problem/925/B | [
"binary search",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2364
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:925-A | codeforces | 925-A | Stairs and Elevators | https://codeforces.com/problemset/problem/925/A | [
"binary search"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3966
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:924-F | codeforces | 924-F | Minimal Subset Difference | https://codeforces.com/problemset/problem/924/F | [
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 462
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:924-E | codeforces | 924-E | Wardrobe | https://codeforces.com/problemset/problem/924/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:924-D | codeforces | 924-D | Contact ATC | https://codeforces.com/problemset/problem/924/D | [] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1016
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:924-C | codeforces | 924-C | Riverside Curio | https://codeforces.com/problemset/problem/924/C | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4370
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:924-B | codeforces | 924-B | Three-level Laser | https://codeforces.com/problemset/problem/924/B | [
"binary search",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5670
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:924-A | codeforces | 924-A | Mystical Mosaic | https://codeforces.com/problemset/problem/924/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5263
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:923-F | codeforces | 923-F | Public Service | https://codeforces.com/problemset/problem/923/F | [
"constructive algorithms",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 158
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:923-E | codeforces | 923-E | Perpetual Subtraction | https://codeforces.com/problemset/problem/923/E | [
"fft",
"math",
"matrices"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 648
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:923-D | codeforces | 923-D | Picking Strings | https://codeforces.com/problemset/problem/923/D | [
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1476
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:923-C | codeforces | 923-C | Perfect Security | https://codeforces.com/problemset/problem/923/C | [
"data structures",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4944
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:923-B | codeforces | 923-B | Producing Snow | https://codeforces.com/problemset/problem/923/B | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7859
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:923-A | codeforces | 923-A | Primal Sport | https://codeforces.com/problemset/problem/923/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5509
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:922-F | codeforces | 922-F | Divisibility | https://codeforces.com/problemset/problem/922/F | [
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 783
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:922-E | codeforces | 922-E | Birds | https://codeforces.com/problemset/problem/922/E | [
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2602
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:922-D | codeforces | 922-D | Robot Vacuum Cleaner | https://codeforces.com/problemset/problem/922/D | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4997
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:922-C | codeforces | 922-C | Cave Painting | https://codeforces.com/problemset/problem/922/C | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7800
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:922-B | codeforces | 922-B | Magic Forest | https://codeforces.com/problemset/problem/922/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9800
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:922-A | codeforces | 922-A | Cloning Toys | https://codeforces.com/problemset/problem/922/A | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12883
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-14 | codeforces | 921-14 | Labyrinth-14 | https://codeforces.com/problemset/problem/921/14 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-13 | codeforces | 921-13 | Labyrinth-13 | https://codeforces.com/problemset/problem/921/13 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-12 | codeforces | 921-12 | Labyrinth-12 | https://codeforces.com/problemset/problem/921/12 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-11 | codeforces | 921-11 | Labyrinth-11 | https://codeforces.com/problemset/problem/921/11 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-10 | codeforces | 921-10 | Labyrinth-10 | https://codeforces.com/problemset/problem/921/10 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-09 | codeforces | 921-09 | Labyrinth-9 | https://codeforces.com/problemset/problem/921/09 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-08 | codeforces | 921-08 | Labyrinth-8 | https://codeforces.com/problemset/problem/921/08 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-07 | codeforces | 921-07 | Labyrinth-7 | https://codeforces.com/problemset/problem/921/07 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-06 | codeforces | 921-06 | Labyrinth-6 | https://codeforces.com/problemset/problem/921/06 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-05 | codeforces | 921-05 | Labyrinth-5 | https://codeforces.com/problemset/problem/921/05 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-04 | codeforces | 921-04 | Labyrinth-4 | https://codeforces.com/problemset/problem/921/04 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-03 | codeforces | 921-03 | Labyrinth-3 | https://codeforces.com/problemset/problem/921/03 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-02 | codeforces | 921-02 | Labyrinth-2 | https://codeforces.com/problemset/problem/921/02 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:921-01 | codeforces | 921-01 | Labyrinth-1 | https://codeforces.com/problemset/problem/921/01 | [] | null | null | stdin_stdout | 3,200 | {
"solved_count": 0
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:920-G | codeforces | 920-G | List Of Integers | https://codeforces.com/problemset/problem/920/G | [
"binary search",
"bitmasks",
"brute force",
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2106
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:920-F | codeforces | 920-F | SUM and REPLACE | https://codeforces.com/problemset/problem/920/F | [
"brute force",
"data structures",
"dsu",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 9445
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:920-E | codeforces | 920-E | Connected Components? | https://codeforces.com/problemset/problem/920/E | [
"data structures",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 8220
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:920-D | codeforces | 920-D | Tanks | https://codeforces.com/problemset/problem/920/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 850
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:920-C | codeforces | 920-C | Swap Adjacent Elements | https://codeforces.com/problemset/problem/920/C | [
"dfs and similar",
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10164
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:920-B | codeforces | 920-B | Tea Queue | https://codeforces.com/problemset/problem/920/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8458
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:920-A | codeforces | 920-A | Water The Garden | https://codeforces.com/problemset/problem/920/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8294
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:919-F | codeforces | 919-F | A Game With Numbers | https://codeforces.com/problemset/problem/919/F | [
"games",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 475
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:919-E | codeforces | 919-E | Congruence Equation | https://codeforces.com/problemset/problem/919/E | [
"chinese remainder theorem",
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2613
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:919-D | codeforces | 919-D | Substring | https://codeforces.com/problemset/problem/919/D | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13344
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:919-C | codeforces | 919-C | Seat Arrangements | https://codeforces.com/problemset/problem/919/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9527
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:919-B | codeforces | 919-B | Perfect Number | https://codeforces.com/problemset/problem/919/B | [
"binary search",
"brute force",
"dp",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 32531
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:919-A | codeforces | 919-A | Supermarket | https://codeforces.com/problemset/problem/919/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17098
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:918-B | codeforces | 918-B | Radio Station | https://codeforces.com/problemset/problem/918/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20995
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:918-A | codeforces | 918-A | Eleven | https://codeforces.com/problemset/problem/918/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18538
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:917-E | codeforces | 917-E | Upside Down | https://codeforces.com/problemset/problem/917/E | [
"data structures",
"string suffix structures",
"strings",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 199
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:917-D | codeforces | 917-D | Stranger Trees | https://codeforces.com/problemset/problem/917/D | [
"dp",
"math",
"matrices",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1548
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:917-C | codeforces | 917-C | Pollywog | https://codeforces.com/problemset/problem/917/C | [
"combinatorics",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 494
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:917-B | codeforces | 917-B | MADMAX | https://codeforces.com/problemset/problem/917/B | [
"dfs and similar",
"dp",
"games",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4097
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:917-A | codeforces | 917-A | The Monster | https://codeforces.com/problemset/problem/917/A | [
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3702
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:916-E | codeforces | 916-E | Jamie and Tree | https://codeforces.com/problemset/problem/916/E | [
"data structures",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2307
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:916-D | codeforces | 916-D | Jamie and To-do List | https://codeforces.com/problemset/problem/916/D | [
"data structures",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 642
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:916-C | codeforces | 916-C | Jamie and Interesting Graph | https://codeforces.com/problemset/problem/916/C | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5644
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:916-B | codeforces | 916-B | Jamie and Binary Sequence (changed after round) | https://codeforces.com/problemset/problem/916/B | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2063
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:916-A | codeforces | 916-A | Jamie and Alarm Snooze | https://codeforces.com/problemset/problem/916/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9873
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:915-G | codeforces | 915-G | Coprime Arrays | https://codeforces.com/problemset/problem/915/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1571
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:915-F | codeforces | 915-F | Imbalance Value of a Tree | https://codeforces.com/problemset/problem/915/F | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 3408
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:915-E | codeforces | 915-E | Physical Education Lessons | https://codeforces.com/problemset/problem/915/E | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 6116
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:915-D | codeforces | 915-D | Almost Acyclic Graph | https://codeforces.com/problemset/problem/915/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4266
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:915-C | codeforces | 915-C | Permute Digits | https://codeforces.com/problemset/problem/915/C | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7668
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:915-B | codeforces | 915-B | Browser | https://codeforces.com/problemset/problem/915/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 8559
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:915-A | codeforces | 915-A | Garden | https://codeforces.com/problemset/problem/915/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16276
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:914-H | codeforces | 914-H | Ember and Storm's Tree Game | https://codeforces.com/problemset/problem/914/H | [
"combinatorics",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 353
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:914-G | codeforces | 914-G | Sum the Fibonacci | https://codeforces.com/problemset/problem/914/G | [
"bitmasks",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1293
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:914-F | codeforces | 914-F | Substrings in a String | https://codeforces.com/problemset/problem/914/F | [
"bitmasks",
"brute force",
"data structures",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 2700
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:914-E | codeforces | 914-E | Palindromes in a Tree | https://codeforces.com/problemset/problem/914/E | [
"bitmasks",
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2117
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:914-D | codeforces | 914-D | Bash and a Tough Math Puzzle | https://codeforces.com/problemset/problem/914/D | [
"data structures",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6876
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:914-C | codeforces | 914-C | Travelling Salesman and Special Numbers | https://codeforces.com/problemset/problem/914/C | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4495
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:914-B | codeforces | 914-B | Conan and Agasa play a Card Game | https://codeforces.com/problemset/problem/914/B | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9162
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:914-A | codeforces | 914-A | Perfect Squares | https://codeforces.com/problemset/problem/914/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 16144
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:913-H | codeforces | 913-H | Don't Exceed | https://codeforces.com/problemset/problem/913/H | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 308
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:913-G | codeforces | 913-G | Power Substring | https://codeforces.com/problemset/problem/913/G | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 302
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:913-F | codeforces | 913-F | Strongly Connected Tournament | https://codeforces.com/problemset/problem/913/F | [
"dp",
"graphs",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 853
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:913-E | codeforces | 913-E | Logical Expression | https://codeforces.com/problemset/problem/913/E | [
"bitmasks",
"dp",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 935
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:913-D | codeforces | 913-D | Too Easy Problems | https://codeforces.com/problemset/problem/913/D | [
"binary search",
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5210
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:913-C | codeforces | 913-C | Party Lemonade | https://codeforces.com/problemset/problem/913/C | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8678
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:913-B | codeforces | 913-B | Christmas Spruce | https://codeforces.com/problemset/problem/913/B | [
"implementation",
"trees"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20239
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:913-A | codeforces | 913-A | Modular Exponentiation | https://codeforces.com/problemset/problem/913/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24844
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:912-E | codeforces | 912-E | Prime Gift | https://codeforces.com/problemset/problem/912/E | [
"binary search",
"dfs and similar",
"math",
"meet-in-the-middle",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2322
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:912-D | codeforces | 912-D | Fishes | https://codeforces.com/problemset/problem/912/D | [
"data structures",
"graphs",
"greedy",
"probabilities",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2208
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:912-C | codeforces | 912-C | Perun, Ult! | https://codeforces.com/problemset/problem/912/C | [
"brute force",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 626
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:912-B | codeforces | 912-B | New Year's Eve | https://codeforces.com/problemset/problem/912/B | [
"bitmasks",
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14492
} | 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.