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: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": 16452
} | 2026-11-02T05:37:07.883505+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": 25775
} | 2026-11-02T05:37:07.883505+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": 186
} | 2026-11-02T05:37:07.883505+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": 1334
} | 2026-11-02T05:37:07.883505+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": 1300
} | 2026-11-02T05:37:07.883505+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": 2198
} | 2026-11-02T05:37:07.883505+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": 7196
} | 2026-11-02T05:37:07.883505+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": 572
} | 2026-11-02T05:37:07.883505+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": 538
} | 2026-11-02T05:37:07.883505+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": 4266
} | 2026-11-02T05:37:07.883505+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": 11151
} | 2026-11-02T05:37:07.883505+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": 17551
} | 2026-11-02T05:37:07.883505+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": 20884
} | 2026-11-02T05:37:07.883505+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": 336
} | 2026-11-02T05:37:07.883505+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": 1243
} | 2026-11-02T05:37:07.883505+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": 805
} | 2026-11-02T05:37:07.883505+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": 2747
} | 2026-11-02T05:37:07.883505+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": 3990
} | 2026-11-02T05:37:07.883505+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": 10089
} | 2026-11-02T05:37:07.883505+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": 19836
} | 2026-11-02T05:37:07.883505+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": 18997
} | 2026-11-02T05:37:07.883505+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": 21877
} | 2026-11-02T05:37:07.883505+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": 2131
} | 2026-11-02T05:37:07.883505+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": 5954
} | 2026-11-02T05:37:07.883505+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": 16281
} | 2026-11-02T05:37:07.883505+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": 30408
} | 2026-11-02T05:37:07.883505+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": 25224
} | 2026-11-02T05:37:07.883505+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": 586
} | 2026-11-02T05:37:07.883505+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": 1353
} | 2026-11-02T05:37:07.883505+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": 3787
} | 2026-11-02T05:37:07.883505+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": 4609
} | 2026-11-02T05:37:07.883505+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": 21024
} | 2026-11-02T05:37:07.883505+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": 21716
} | 2026-11-02T05:37:07.883505+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": 52484
} | 2026-11-02T05:37:07.883505+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": 675
} | 2026-11-02T05:37:07.883505+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": 7050
} | 2026-11-02T05:37:07.883505+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": 10566
} | 2026-11-02T05:37:07.883505+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": 22941
} | 2026-11-02T05:37:07.883505+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": 26132
} | 2026-11-02T05:37:07.883505+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": 278
} | 2026-11-02T05:37:07.883505+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": 1423
} | 2026-11-02T05:37:07.883505+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": 2015
} | 2026-11-02T05:37:07.883505+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": 1016
} | 2026-11-02T05:37:07.883505+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": 720
} | 2026-11-02T05:37:07.883505+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": 213
} | 2026-11-02T05:37:07.883505+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": 374
} | 2026-11-02T05:37:07.883505+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": 2138
} | 2026-11-02T05:37:07.883505+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": 3010
} | 2026-11-02T05:37:07.883505+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": 10025
} | 2026-11-02T05:37:07.883505+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": 23460
} | 2026-11-02T05:37:07.883505+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": 29525
} | 2026-11-02T05:37:07.883505+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": 40129
} | 2026-11-02T05:37:07.883505+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": 44613
} | 2026-11-02T05:37:07.883505+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": 2656
} | 2026-11-02T05:37:07.883505+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": 4147
} | 2026-11-02T05:37:07.883505+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": 19919
} | 2026-11-02T05:37:07.883505+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": 462
} | 2026-11-02T05:37:07.883505+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": 1191
} | 2026-11-02T05:37:07.883505+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": 872
} | 2026-11-02T05:37:07.883505+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": 735
} | 2026-11-02T05:37:07.883505+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": 5867
} | 2026-11-02T05:37:07.883505+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": 11461
} | 2026-11-02T05:37:07.883505+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": 26659
} | 2026-11-02T05:37:07.883505+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": 27609
} | 2026-11-02T05:37:07.883505+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": 368
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1381-D | codeforces | 1381-D | The Majestic Brown Tree Snake | https://codeforces.com/problemset/problem/1381/D | [
"dfs and similar",
"dp",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 843
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1381-C | codeforces | 1381-C | Mastermind | https://codeforces.com/problemset/problem/1381/C | [
"constructive algorithms",
"graph matchings",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1755
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1381-B | codeforces | 1381-B | Unmerge | https://codeforces.com/problemset/problem/1381/B | [
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9786
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1381-A2 | codeforces | 1381-A2 | Prefix Flip (Hard Version) | https://codeforces.com/problemset/problem/1381/A2 | [
"constructive algorithms",
"data structures",
"implementation",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 14612
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1381-A1 | codeforces | 1381-A1 | Prefix Flip (Easy Version) | https://codeforces.com/problemset/problem/1381/A1 | [
"constructive algorithms",
"data structures",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 22070
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1380-G | codeforces | 1380-G | Circular Dungeon | https://codeforces.com/problemset/problem/1380/G | [
"greedy",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1036
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1380-F | codeforces | 1380-F | Strange Addition | https://codeforces.com/problemset/problem/1380/F | [
"data structures",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 963
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1380-E | codeforces | 1380-E | Merging Towers | https://codeforces.com/problemset/problem/1380/E | [
"data structures",
"dsu",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2480
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1380-D | codeforces | 1380-D | Berserk And Fireball | https://codeforces.com/problemset/problem/1380/D | [
"constructive algorithms",
"greedy",
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5128
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1380-C | codeforces | 1380-C | Create The Teams | https://codeforces.com/problemset/problem/1380/C | [
"brute force",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 23253
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1380-B | codeforces | 1380-B | Universal Solution | https://codeforces.com/problemset/problem/1380/B | [
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15429
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1380-A | codeforces | 1380-A | Three Indices | https://codeforces.com/problemset/problem/1380/A | [
"brute force",
"data structures"
] | null | null | stdin_stdout | 900 | {
"solved_count": 44997
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1379-F2 | codeforces | 1379-F2 | Chess Strikes Back (hard version) | https://codeforces.com/problemset/problem/1379/F2 | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 665
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1379-F1 | codeforces | 1379-F1 | Chess Strikes Back (easy version) | https://codeforces.com/problemset/problem/1379/F1 | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 765
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1379-E | codeforces | 1379-E | Inverse Genealogy | https://codeforces.com/problemset/problem/1379/E | [
"constructive algorithms",
"divide and conquer",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 601
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1379-D | codeforces | 1379-D | New Passenger Trams | https://codeforces.com/problemset/problem/1379/D | [
"binary search",
"brute force",
"data structures",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1182
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1379-C | codeforces | 1379-C | Choosing flowers | https://codeforces.com/problemset/problem/1379/C | [
"binary search",
"brute force",
"data structures",
"dfs and similar",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6285
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1379-B | codeforces | 1379-B | Dubious Cyrpto | https://codeforces.com/problemset/problem/1379/B | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13282
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1379-A | codeforces | 1379-A | Acacius and String | https://codeforces.com/problemset/problem/1379/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 12723
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-I | codeforces | 1375-I | Cubic Lattice | https://codeforces.com/problemset/problem/1375/I | [
"geometry",
"math",
"matrices",
"number theory"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 284
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-H | codeforces | 1375-H | Set Merging | https://codeforces.com/problemset/problem/1375/H | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 561
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-G | codeforces | 1375-G | Tree Modification | https://codeforces.com/problemset/problem/1375/G | [
"brute force",
"constructive algorithms",
"dfs and similar",
"graph matchings",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2378
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-F | codeforces | 1375-F | Integer Game | https://codeforces.com/problemset/problem/1375/F | [
"constructive algorithms",
"games",
"interactive",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2611
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-E | codeforces | 1375-E | Inversion SwapSort | https://codeforces.com/problemset/problem/1375/E | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 3567
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-D | codeforces | 1375-D | Replace by MEX | https://codeforces.com/problemset/problem/1375/D | [
"brute force",
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 10404
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-C | codeforces | 1375-C | Element Extermination | https://codeforces.com/problemset/problem/1375/C | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 23448
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-B | codeforces | 1375-B | Neighbor Grid | https://codeforces.com/problemset/problem/1375/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17968
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1375-A | codeforces | 1375-A | Sign Flipping | https://codeforces.com/problemset/problem/1375/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 18947
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1374-F | codeforces | 1374-F | Cyclic Shifts Sorting | https://codeforces.com/problemset/problem/1374/F | [
"brute force",
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1444
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1374-E2 | codeforces | 1374-E2 | Reading Books (hard version) | https://codeforces.com/problemset/problem/1374/E2 | [
"data structures",
"greedy",
"implementation",
"sortings",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1151
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1374-E1 | codeforces | 1374-E1 | Reading Books (easy version) | https://codeforces.com/problemset/problem/1374/E1 | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15300
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1374-D | codeforces | 1374-D | Zero Remainder Array | https://codeforces.com/problemset/problem/1374/D | [
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 33718
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1374-C | codeforces | 1374-C | Move Brackets | https://codeforces.com/problemset/problem/1374/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 69711
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1374-B | codeforces | 1374-B | Multiply by 2, divide by 6 | https://codeforces.com/problemset/problem/1374/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 79138
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:1374-A | codeforces | 1374-A | Required Remainder | https://codeforces.com/problemset/problem/1374/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 66882
} | 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.