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:1401-F | codeforces | 1401-F | Reverse and Swap | https://codeforces.com/problemset/problem/1401/F | [
"binary search",
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1964
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1401-E | codeforces | 1401-E | Divide Square | https://codeforces.com/problemset/problem/1401/E | [
"data structures",
"geometry",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2648
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1401-D | codeforces | 1401-D | Maximum Distributed Tree | https://codeforces.com/problemset/problem/1401/D | [
"dfs and similar",
"dp",
"greedy",
"implementation",
"math",
"number theory",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10575
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1401-C | codeforces | 1401-C | Mere Array | https://codeforces.com/problemset/problem/1401/C | [
"constructive algorithms",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 26940
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1401-B | codeforces | 1401-B | Ternary Sequence | https://codeforces.com/problemset/problem/1401/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21798
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1401-A | codeforces | 1401-A | Distance and Axis | https://codeforces.com/problemset/problem/1401/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 28681
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1400-G | codeforces | 1400-G | Mercenaries | https://codeforces.com/problemset/problem/1400/G | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"dsu",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1165
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1400-F | codeforces | 1400-F | x-prime Substrings | https://codeforces.com/problemset/problem/1400/F | [
"brute force",
"dfs and similar",
"dp",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1183
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1400-E | codeforces | 1400-E | Clear the Multiset | https://codeforces.com/problemset/problem/1400/E | [
"data structures",
"divide and conquer",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 6344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1400-D | codeforces | 1400-D | Zigzags | https://codeforces.com/problemset/problem/1400/D | [
"brute force",
"combinatorics",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 11426
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1400-C | codeforces | 1400-C | Binary String Reconstruction | https://codeforces.com/problemset/problem/1400/C | [
"2-sat",
"brute force",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 18534
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1400-B | codeforces | 1400-B | RPG Protagonist | https://codeforces.com/problemset/problem/1400/B | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1400-A | codeforces | 1400-A | String Similarity | https://codeforces.com/problemset/problem/1400/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27988
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1399-F | codeforces | 1399-F | Yet Another Segments Subset | https://codeforces.com/problemset/problem/1399/F | [
"data structures",
"dp",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1879
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1399-E2 | codeforces | 1399-E2 | Weights Division (hard version) | https://codeforces.com/problemset/problem/1399/E2 | [
"binary search",
"dfs and similar",
"greedy",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2534
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1399-E1 | codeforces | 1399-E1 | Weights Division (easy version) | https://codeforces.com/problemset/problem/1399/E1 | [
"data structures",
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6349
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1399-D | codeforces | 1399-D | Binary String To Subsequences | https://codeforces.com/problemset/problem/1399/D | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1399-C | codeforces | 1399-C | Boats Competition | https://codeforces.com/problemset/problem/1399/C | [
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 32858
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1399-B | codeforces | 1399-B | Gifts Fixing | https://codeforces.com/problemset/problem/1399/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46956
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1399-A | codeforces | 1399-A | Remove Smallest | https://codeforces.com/problemset/problem/1399/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 81154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1398-G | codeforces | 1398-G | Running Competition | https://codeforces.com/problemset/problem/1398/G | [
"bitmasks",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1286
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1398-F | codeforces | 1398-F | Controversial Rounds | https://codeforces.com/problemset/problem/1398/F | [
"binary search",
"data structures",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1398-E | codeforces | 1398-E | Two Types of Spells | https://codeforces.com/problemset/problem/1398/E | [
"binary search",
"data structures",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1398-D | codeforces | 1398-D | Colored Rectangles | https://codeforces.com/problemset/problem/1398/D | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 12576
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1398-C | codeforces | 1398-C | Good Subarrays | https://codeforces.com/problemset/problem/1398/C | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 37160
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1398-B | codeforces | 1398-B | Substring Removal Game | https://codeforces.com/problemset/problem/1398/B | [
"games",
"greedy",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25955
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1398-A | codeforces | 1398-A | Bad Triangle | https://codeforces.com/problemset/problem/1398/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28831
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1397-B | codeforces | 1397-B | Power Sequence | https://codeforces.com/problemset/problem/1397/B | [
"brute force",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15518
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1397-A | codeforces | 1397-A | Juggling Letters | https://codeforces.com/problemset/problem/1397/A | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29866
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1396-E | codeforces | 1396-E | Distance Matching | https://codeforces.com/problemset/problem/1396/E | [
"constructive algorithms",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1396-D | codeforces | 1396-D | Rainbow Rectangles | https://codeforces.com/problemset/problem/1396/D | [
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1396-C | codeforces | 1396-C | Monster Invaders | https://codeforces.com/problemset/problem/1396/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2792
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1396-B | codeforces | 1396-B | Stoned Game | https://codeforces.com/problemset/problem/1396/B | [
"brute force",
"constructive algorithms",
"games",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 13016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1396-A | codeforces | 1396-A | Multiples of Length | https://codeforces.com/problemset/problem/1396/A | [
"constructive algorithms",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16739
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1395-C | codeforces | 1395-C | Boboniu and Bit Operations | https://codeforces.com/problemset/problem/1395/C | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15265
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1395-B | codeforces | 1395-B | Boboniu Plays Chess | https://codeforces.com/problemset/problem/1395/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 16400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1395-A | codeforces | 1395-A | Boboniu Likes to Color Balls | https://codeforces.com/problemset/problem/1395/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 25547
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1394-E | codeforces | 1394-E | Boboniu and Banknote Collection | https://codeforces.com/problemset/problem/1394/E | [
"strings"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 164
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1394-D | codeforces | 1394-D | Boboniu and Jianghu | https://codeforces.com/problemset/problem/1394/D | [
"dp",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1240
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1394-C | codeforces | 1394-C | Boboniu and String | https://codeforces.com/problemset/problem/1394/C | [
"binary search",
"geometry",
"ternary search"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1224
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1394-B | codeforces | 1394-B | Boboniu Walks on Graph | https://codeforces.com/problemset/problem/1394/B | [
"brute force",
"dfs and similar",
"graphs",
"hashing"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2148
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1394-A | codeforces | 1394-A | Boboniu Chats with Du | https://codeforces.com/problemset/problem/1394/A | [
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7128
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1393-E2 | codeforces | 1393-E2 | Twilight and Ancient Scroll (harder version) | https://codeforces.com/problemset/problem/1393/E2 | [
"dp",
"hashing",
"implementation",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 445
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1393-E1 | codeforces | 1393-E1 | Twilight and Ancient Scroll (easier version) | https://codeforces.com/problemset/problem/1393/E1 | [
"dp",
"hashing",
"implementation",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 448
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1393-D | codeforces | 1393-D | Rarity and New Dress | https://codeforces.com/problemset/problem/1393/D | [
"dfs and similar",
"dp",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4195
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1393-C | codeforces | 1393-C | Pinkie Pie Eats Patty-cakes | https://codeforces.com/problemset/problem/1393/C | [
"constructive algorithms",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11061
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1393-B | codeforces | 1393-B | Applejack and Storages | https://codeforces.com/problemset/problem/1393/B | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1393-A | codeforces | 1393-A | Rainbow Dash, Fluttershy and Chess Coloring | https://codeforces.com/problemset/problem/1393/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 20841
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-I | codeforces | 1392-I | Kevin and Grid | https://codeforces.com/problemset/problem/1392/I | [
"fft",
"graphs",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-H | codeforces | 1392-H | ZS Shuffles Cards | https://codeforces.com/problemset/problem/1392/H | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-G | codeforces | 1392-G | Omkar and Pies | https://codeforces.com/problemset/problem/1392/G | [
"bitmasks",
"dfs and similar",
"dp",
"math",
"shortest paths"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 680
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-F | codeforces | 1392-F | Omkar and Landslide | https://codeforces.com/problemset/problem/1392/F | [
"binary search",
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2409
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-E | codeforces | 1392-E | Omkar and Duck | https://codeforces.com/problemset/problem/1392/E | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3755
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-D | codeforces | 1392-D | Omkar and Bed Wars | https://codeforces.com/problemset/problem/1392/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9889
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-C | codeforces | 1392-C | Omkar and Waterslide | https://codeforces.com/problemset/problem/1392/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19651
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-B | codeforces | 1392-B | Omkar and Infinity Clock | https://codeforces.com/problemset/problem/1392/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18919
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1392-A | codeforces | 1392-A | Omkar and Password | https://codeforces.com/problemset/problem/1392/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21763
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1391-E | codeforces | 1391-E | Pairs of Pairs | https://codeforces.com/problemset/problem/1391/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1936
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1391-D | codeforces | 1391-D | 505 | https://codeforces.com/problemset/problem/1391/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5779
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1391-C | codeforces | 1391-C | Cyclic Permutations | https://codeforces.com/problemset/problem/1391/C | [
"combinatorics",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16056
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1391-B | codeforces | 1391-B | Fix You | https://codeforces.com/problemset/problem/1391/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29866
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1391-A | codeforces | 1391-A | Suborrays | https://codeforces.com/problemset/problem/1391/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25080
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1389-G | codeforces | 1389-G | Directing Edges | https://codeforces.com/problemset/problem/1389/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 496
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1389-F | codeforces | 1389-F | Bicolored Segments | https://codeforces.com/problemset/problem/1389/F | [
"data structures",
"dp",
"graph matchings",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1389-E | codeforces | 1389-E | Calendar Ambiguity | https://codeforces.com/problemset/problem/1389/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3732
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1389-D | codeforces | 1389-D | Segment Intersections | https://codeforces.com/problemset/problem/1389/D | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4557
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1389-C | codeforces | 1389-C | Good String | https://codeforces.com/problemset/problem/1389/C | [
"brute force",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 20619
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1389-B | codeforces | 1389-B | Array Walk | https://codeforces.com/problemset/problem/1389/B | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 20558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1389-A | codeforces | 1389-A | LCM Problem | https://codeforces.com/problemset/problem/1389/A | [
"constructive algorithms",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 50310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1388-E | codeforces | 1388-E | Uncle Bogdan and Projections | https://codeforces.com/problemset/problem/1388/E | [
"data structures",
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 648
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1388-D | codeforces | 1388-D | Captain Flint and Treasure | https://codeforces.com/problemset/problem/1388/D | [
"data structures",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6919
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1388-C | codeforces | 1388-C | Uncle Bogdan and Country Happiness | https://codeforces.com/problemset/problem/1388/C | [
"dfs and similar",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10425
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1388-B | codeforces | 1388-B | Captain Flint and a Long Voyage | https://codeforces.com/problemset/problem/1388/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22837
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1388-A | codeforces | 1388-A | Captain Flint and Crew Recruitment | https://codeforces.com/problemset/problem/1388/A | [
"brute force",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25986
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1387-C | codeforces | 1387-C | Viruses | https://codeforces.com/problemset/problem/1387/C | [
"*special",
"dp",
"shortest paths",
"string suffix structures"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 209
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1387-B2 | codeforces | 1387-B2 | Village (Maximum) | https://codeforces.com/problemset/problem/1387/B2 | [
"*special",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1387-B1 | codeforces | 1387-B1 | Village (Minimum) | https://codeforces.com/problemset/problem/1387/B1 | [
"*special",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1901
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1387-A | codeforces | 1387-A | Graph | https://codeforces.com/problemset/problem/1387/A | [
"*special",
"binary search",
"dfs and similar",
"dp",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1386-C | codeforces | 1386-C | Joker | https://codeforces.com/problemset/problem/1386/C | [
"*special",
"bitmasks",
"data structures",
"divide and conquer",
"dsu"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 660
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1386-B | codeforces | 1386-B | Mixture | https://codeforces.com/problemset/problem/1386/B | [
"*special",
"data structures",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 141
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1386-A | codeforces | 1386-A | Colors | https://codeforces.com/problemset/problem/1386/A | [
"*special",
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1385-G | codeforces | 1385-G | Columns Swaps | https://codeforces.com/problemset/problem/1385/G | [
"2-sat",
"dfs and similar",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1838
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1385-F | codeforces | 1385-F | Removing Leaves | https://codeforces.com/problemset/problem/1385/F | [
"data structures",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2831
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1385-E | codeforces | 1385-E | Directing Edges | https://codeforces.com/problemset/problem/1385/E | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 9205
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1385-D | codeforces | 1385-D | a-Good String | https://codeforces.com/problemset/problem/1385/D | [
"bitmasks",
"brute force",
"divide and conquer",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 22097
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1385-C | codeforces | 1385-C | Make It Good | https://codeforces.com/problemset/problem/1385/C | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 28992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1385-B | codeforces | 1385-B | Restore the Permutation by Merger | https://codeforces.com/problemset/problem/1385/B | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39672
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1385-A | codeforces | 1385-A | Three Pairwise Maximums | https://codeforces.com/problemset/problem/1385/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 43526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1384-B2 | codeforces | 1384-B2 | Koa and the Beach (Hard Version) | https://codeforces.com/problemset/problem/1384/B2 | [
"constructive algorithms",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2594
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1384-B1 | codeforces | 1384-B1 | Koa and the Beach (Easy Version) | https://codeforces.com/problemset/problem/1384/B1 | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4087
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1384-A | codeforces | 1384-A | Common Prefixes | https://codeforces.com/problemset/problem/1384/A | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1383-F | codeforces | 1383-F | Special Edges | https://codeforces.com/problemset/problem/1383/F | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 438
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1383-E | codeforces | 1383-E | Strange Operation | https://codeforces.com/problemset/problem/1383/E | [
"combinatorics",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1033
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1383-D | codeforces | 1383-D | Rearrange | https://codeforces.com/problemset/problem/1383/D | [
"brute force",
"constructive algorithms",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 764
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1383-C | codeforces | 1383-C | String Transformation 2 | https://codeforces.com/problemset/problem/1383/C | [
"bitmasks",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 667
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1383-B | codeforces | 1383-B | GameGame | https://codeforces.com/problemset/problem/1383/B | [
"bitmasks",
"constructive algorithms",
"dp",
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5462
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1383-A | codeforces | 1383-A | String Transformation 1 | https://codeforces.com/problemset/problem/1383/A | [
"dsu",
"graphs",
"greedy",
"sortings",
"strings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1382-B | codeforces | 1382-B | Sequential Nim | https://codeforces.com/problemset/problem/1382/B | [
"dp",
"games"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1382-A | codeforces | 1382-A | Common Subsequence | https://codeforces.com/problemset/problem/1382/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27378
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1381-E | codeforces | 1381-E | Origami | https://codeforces.com/problemset/problem/1381/E | [
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 278
} | 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.