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:1108-B | codeforces | 1108-B | Divisors of Two Integers | https://codeforces.com/problemset/problem/1108/B | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25269
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1108-A | codeforces | 1108-A | Two distinct points | https://codeforces.com/problemset/problem/1108/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23382
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1107-G | codeforces | 1107-G | Vasya and Maximum Profit | https://codeforces.com/problemset/problem/1107/G | [
"binary search",
"constructive algorithms",
"data structures",
"dp",
"dsu"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1255
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1107-F | codeforces | 1107-F | Vasya and Endless Credits | https://codeforces.com/problemset/problem/1107/F | [
"dp",
"flows",
"graph matchings",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 956
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1107-E | codeforces | 1107-E | Vasya and Binary String | https://codeforces.com/problemset/problem/1107/E | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1107-D | codeforces | 1107-D | Compression | https://codeforces.com/problemset/problem/1107/D | [
"dp",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3905
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1107-C | codeforces | 1107-C | Brutality | https://codeforces.com/problemset/problem/1107/C | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11041
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1107-B | codeforces | 1107-B | Digital root | https://codeforces.com/problemset/problem/1107/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17779
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1107-A | codeforces | 1107-A | Digits Sequence Dividing | https://codeforces.com/problemset/problem/1107/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12796
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1106-F | codeforces | 1106-F | Lunar New Year and a Recursive Sequence | https://codeforces.com/problemset/problem/1106/F | [
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1187
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1106-E | codeforces | 1106-E | Lunar New Year and Red Envelopes | https://codeforces.com/problemset/problem/1106/E | [
"data structures",
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2824
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1106-D | codeforces | 1106-D | Lunar New Year and a Wander | https://codeforces.com/problemset/problem/1106/D | [
"data structures",
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19916
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1106-C | codeforces | 1106-C | Lunar New Year and Number Division | https://codeforces.com/problemset/problem/1106/C | [
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15962
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1106-B | codeforces | 1106-B | Lunar New Year and Food Ordering | https://codeforces.com/problemset/problem/1106/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7004
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1106-A | codeforces | 1106-A | Lunar New Year and Cross Counting | https://codeforces.com/problemset/problem/1106/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12897
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1105-E | codeforces | 1105-E | Helping Hiasat | https://codeforces.com/problemset/problem/1105/E | [
"bitmasks",
"brute force",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1918
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1105-D | codeforces | 1105-D | Kilani and the Game | https://codeforces.com/problemset/problem/1105/D | [
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4428
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1105-C | codeforces | 1105-C | Ayoub and Lost Array | https://codeforces.com/problemset/problem/1105/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11428
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1105-B | codeforces | 1105-B | Zuhair and Strings | https://codeforces.com/problemset/problem/1105/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10567
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1105-A | codeforces | 1105-A | Salem and Sticks | https://codeforces.com/problemset/problem/1105/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11572
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1104-B | codeforces | 1104-B | Game with string | https://codeforces.com/problemset/problem/1104/B | [
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16924
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1104-A | codeforces | 1104-A | Splitting into digits | https://codeforces.com/problemset/problem/1104/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15913
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1103-E | codeforces | 1103-E | Radix sum | https://codeforces.com/problemset/problem/1103/E | [
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 284
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1103-D | codeforces | 1103-D | Professional layer | https://codeforces.com/problemset/problem/1103/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 495
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1103-C | codeforces | 1103-C | Johnny Solving | https://codeforces.com/problemset/problem/1103/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 957
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1103-B | codeforces | 1103-B | Game with modulo | https://codeforces.com/problemset/problem/1103/B | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3536
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1103-A | codeforces | 1103-A | Grid game | https://codeforces.com/problemset/problem/1103/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1102-F | codeforces | 1102-F | Elongated Matrix | https://codeforces.com/problemset/problem/1102/F | [
"binary search",
"bitmasks",
"brute force",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2378
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1102-E | codeforces | 1102-E | Monotonic Renumeration | https://codeforces.com/problemset/problem/1102/E | [
"combinatorics",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6972
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1102-D | codeforces | 1102-D | Balanced Ternary String | https://codeforces.com/problemset/problem/1102/D | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8571
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1102-C | codeforces | 1102-C | Doors Breaking and Repairing | https://codeforces.com/problemset/problem/1102/C | [
"games"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14194
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1102-B | codeforces | 1102-B | Array K-Coloring | https://codeforces.com/problemset/problem/1102/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1102-A | codeforces | 1102-A | Integer Sequence Dividing | https://codeforces.com/problemset/problem/1102/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26692
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1101-G | codeforces | 1101-G | (Zero XOR Subset)-less | https://codeforces.com/problemset/problem/1101/G | [
"math",
"matrices"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1101-F | codeforces | 1101-F | Trucks and Cities | https://codeforces.com/problemset/problem/1101/F | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1645
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1101-E | codeforces | 1101-E | Polycarp's New Job | https://codeforces.com/problemset/problem/1101/E | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8264
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1101-D | codeforces | 1101-D | GCD Counting | https://codeforces.com/problemset/problem/1101/D | [
"data structures",
"dfs and similar",
"dp",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5449
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1101-C | codeforces | 1101-C | Division and Union | https://codeforces.com/problemset/problem/1101/C | [
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12215
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1101-B | codeforces | 1101-B | Accordion | https://codeforces.com/problemset/problem/1101/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11126
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1101-A | codeforces | 1101-A | Minimum Integer | https://codeforces.com/problemset/problem/1101/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18846
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1100-F | codeforces | 1100-F | Ivan and Burgers | https://codeforces.com/problemset/problem/1100/F | [
"data structures",
"divide and conquer",
"greedy",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1100-E | codeforces | 1100-E | Andrew and Taxi | https://codeforces.com/problemset/problem/1100/E | [
"binary search",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2672
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1100-D | codeforces | 1100-D | Dasha and Chess | https://codeforces.com/problemset/problem/1100/D | [
"constructive algorithms",
"games",
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 916
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1100-C | codeforces | 1100-C | NN and the Optical Illusion | https://codeforces.com/problemset/problem/1100/C | [
"binary search",
"geometry",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10949
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1100-B | codeforces | 1100-B | Build a Contest | https://codeforces.com/problemset/problem/1100/B | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11803
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1100-A | codeforces | 1100-A | Roman and Browser | https://codeforces.com/problemset/problem/1100/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10724
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1099-F | codeforces | 1099-F | Cookies | https://codeforces.com/problemset/problem/1099/F | [
"binary search",
"data structures",
"dfs and similar",
"dp",
"games",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1052
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1099-C | codeforces | 1099-C | Postcard | https://codeforces.com/problemset/problem/1099/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10443
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1099-B | codeforces | 1099-B | Squares and Segments | https://codeforces.com/problemset/problem/1099/B | [
"binary search",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11485
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1099-A | codeforces | 1099-A | Snowball | https://codeforces.com/problemset/problem/1099/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13359
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1098-F | codeforces | 1098-F | Ж-function | https://codeforces.com/problemset/problem/1098/F | [
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 281
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1098-E | codeforces | 1098-E | Fedya the Potter | https://codeforces.com/problemset/problem/1098/E | [
"binary search",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 274
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1098-D | codeforces | 1098-D | Eels | https://codeforces.com/problemset/problem/1098/D | [
"data structures"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 883
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1098-C | codeforces | 1098-C | Construct a tree | https://codeforces.com/problemset/problem/1098/C | [
"binary search",
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1162
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1098-B | codeforces | 1098-B | Nice table | https://codeforces.com/problemset/problem/1098/B | [
"brute force",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1798
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1098-A | codeforces | 1098-A | Sum in the tree | https://codeforces.com/problemset/problem/1098/A | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1097-H | codeforces | 1097-H | Mateusz and an Infinite Sequence | https://codeforces.com/problemset/problem/1097/H | [
"bitmasks",
"brute force",
"dp",
"strings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 140
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1097-G | codeforces | 1097-G | Vladislav and a Great Legend | https://codeforces.com/problemset/problem/1097/G | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1059
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1097-F | codeforces | 1097-F | Alex and a TV Show | https://codeforces.com/problemset/problem/1097/F | [
"bitmasks",
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1477
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1097-E | codeforces | 1097-E | Egor and an RPG game | https://codeforces.com/problemset/problem/1097/E | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 536
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1097-D | codeforces | 1097-D | Makoto and a Blackboard | https://codeforces.com/problemset/problem/1097/D | [
"dp",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3200
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1097-C | codeforces | 1097-C | Yuhao and a Parenthesis | https://codeforces.com/problemset/problem/1097/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1097-B | codeforces | 1097-B | Petr and a Combination Lock | https://codeforces.com/problemset/problem/1097/B | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 36291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1097-A | codeforces | 1097-A | Gennady and a Card Game | https://codeforces.com/problemset/problem/1097/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43993
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1096-G | codeforces | 1096-G | Lucky Tickets | https://codeforces.com/problemset/problem/1096/G | [
"divide and conquer",
"dp",
"fft"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1990
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1096-F | codeforces | 1096-F | Inversion Expectation | https://codeforces.com/problemset/problem/1096/F | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2075
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1096-E | codeforces | 1096-E | The Top Scorer | https://codeforces.com/problemset/problem/1096/E | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1285
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1096-D | codeforces | 1096-D | Easy Problem | https://codeforces.com/problemset/problem/1096/D | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9464
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1096-C | codeforces | 1096-C | Polygon for the Angle | https://codeforces.com/problemset/problem/1096/C | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7248
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1096-B | codeforces | 1096-B | Substring Removal | https://codeforces.com/problemset/problem/1096/B | [
"combinatorics",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11739
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1096-A | codeforces | 1096-A | Find Divisible | https://codeforces.com/problemset/problem/1096/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19660
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1095-F | codeforces | 1095-F | Make It Connected | https://codeforces.com/problemset/problem/1095/F | [
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7631
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1095-E | codeforces | 1095-E | Almost Regular Bracket Sequence | https://codeforces.com/problemset/problem/1095/E | [
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4492
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1095-D | codeforces | 1095-D | Circular Dance | https://codeforces.com/problemset/problem/1095/D | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8106
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1095-C | codeforces | 1095-C | Powers Of Two | https://codeforces.com/problemset/problem/1095/C | [
"bitmasks",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 19702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1095-B | codeforces | 1095-B | Array Stabilization | https://codeforces.com/problemset/problem/1095/B | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24423
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1095-A | codeforces | 1095-A | Repeating Cipher | https://codeforces.com/problemset/problem/1095/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 36667
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1093-G | codeforces | 1093-G | Multidimensional Queries | https://codeforces.com/problemset/problem/1093/G | [
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2228
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1093-F | codeforces | 1093-F | Vasya and Array | https://codeforces.com/problemset/problem/1093/F | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1365
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1093-E | codeforces | 1093-E | Intersection of Permutations | https://codeforces.com/problemset/problem/1093/E | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1870
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1093-D | codeforces | 1093-D | Beautiful Graph | https://codeforces.com/problemset/problem/1093/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11430
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1093-C | codeforces | 1093-C | Mishka and the Last Exam | https://codeforces.com/problemset/problem/1093/C | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9726
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1093-B | codeforces | 1093-B | Letters Rearranging | https://codeforces.com/problemset/problem/1093/B | [
"constructive algorithms",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17756
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1093-A | codeforces | 1093-A | Dice Rolling | https://codeforces.com/problemset/problem/1093/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18378
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1092-F | codeforces | 1092-F | Tree with Maximum Cost | https://codeforces.com/problemset/problem/1092/F | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10997
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1092-E | codeforces | 1092-E | Minimal Diameter Forest | https://codeforces.com/problemset/problem/1092/E | [
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1994
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1092-D2 | codeforces | 1092-D2 | Great Vova Wall (Version 2) | https://codeforces.com/problemset/problem/1092/D2 | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1092-D1 | codeforces | 1092-D1 | Great Vova Wall (Version 1) | https://codeforces.com/problemset/problem/1092/D1 | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5711
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1092-C | codeforces | 1092-C | Prefixes and Suffixes | https://codeforces.com/problemset/problem/1092/C | [
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6359
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1092-B | codeforces | 1092-B | Teams Forming | https://codeforces.com/problemset/problem/1092/B | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1092-A | codeforces | 1092-A | Uniform String | https://codeforces.com/problemset/problem/1092/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17311
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1091-H | codeforces | 1091-H | New Year and the Tricolore Recreation | https://codeforces.com/problemset/problem/1091/H | [
"games"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 499
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1091-G | codeforces | 1091-G | New Year and the Factorisation Collaboration | https://codeforces.com/problemset/problem/1091/G | [
"interactive",
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 227
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1091-F | codeforces | 1091-F | New Year and the Mallard Expedition | https://codeforces.com/problemset/problem/1091/F | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 892
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1091-E | codeforces | 1091-E | New Year and the Acquaintance Estimation | https://codeforces.com/problemset/problem/1091/E | [
"binary search",
"data structures",
"graphs",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1089
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1091-D | codeforces | 1091-D | New Year and the Permutation Concatenation | https://codeforces.com/problemset/problem/1091/D | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7501
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1091-C | codeforces | 1091-C | New Year and the Sphere Transmission | https://codeforces.com/problemset/problem/1091/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1091-B | codeforces | 1091-B | New Year and the Treasure Geolocation | https://codeforces.com/problemset/problem/1091/B | [
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11018
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1091-A | codeforces | 1091-A | New Year and the Christmas Ornament | https://codeforces.com/problemset/problem/1091/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18573
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1090-M | codeforces | 1090-M | The Pleasant Walk | https://codeforces.com/problemset/problem/1090/M | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7194
} | 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.