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: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": 826
} | 2026-06-01T05:00:40.145500+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": 1714
} | 2026-06-01T05:00:40.145500+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": 9593
} | 2026-06-01T05:00:40.145500+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": 14382
} | 2026-06-01T05:00:40.145500+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": 21765
} | 2026-06-01T05:00:40.145500+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": 937
} | 2026-06-01T05:00:40.145500+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": 894
} | 2026-06-01T05:00:40.145500+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": 2421
} | 2026-06-01T05:00:40.145500+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": 5022
} | 2026-06-01T05:00:40.145500+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": 22776
} | 2026-06-01T05:00:40.145500+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": 15296
} | 2026-06-01T05:00:40.145500+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": 40799
} | 2026-06-01T05:00:40.145500+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": 582
} | 2026-06-01T05:00:40.145500+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": 687
} | 2026-06-01T05:00:40.145500+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": 474
} | 2026-06-01T05:00:40.145500+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": 1152
} | 2026-06-01T05:00:40.145500+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": 6117
} | 2026-06-01T05:00:40.145500+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": 13198
} | 2026-06-01T05:00:40.145500+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": 12333
} | 2026-06-01T05:00:40.145500+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": 278
} | 2026-06-01T05:00:40.145500+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": 498
} | 2026-06-01T05:00:40.145500+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": 2192
} | 2026-06-01T05:00:40.145500+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": 2513
} | 2026-06-01T05:00:40.145500+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": 3377
} | 2026-06-01T05:00:40.145500+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": 10158
} | 2026-06-01T05:00:40.145500+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": 22989
} | 2026-06-01T05:00:40.145500+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": 17858
} | 2026-06-01T05:00:40.145500+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": 18852
} | 2026-06-01T05:00:40.145500+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": 1411
} | 2026-06-01T05:00:40.145500+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": 1087
} | 2026-06-01T05:00:40.145500+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": 15017
} | 2026-06-01T05:00:40.145500+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": 31431
} | 2026-06-01T05:00:40.145500+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": 64745
} | 2026-06-01T05:00:40.145500+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": 72587
} | 2026-06-01T05:00:40.145500+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": 64533
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1373-G | codeforces | 1373-G | Pawns | https://codeforces.com/problemset/problem/1373/G | [
"data structures",
"divide and conquer",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 924
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1373-F | codeforces | 1373-F | Network Coverage | https://codeforces.com/problemset/problem/1373/F | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1885
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1373-E | codeforces | 1373-E | Sum of Digits | https://codeforces.com/problemset/problem/1373/E | [
"brute force",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2963
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1373-D | codeforces | 1373-D | Maximum Sum on Even Positions | https://codeforces.com/problemset/problem/1373/D | [
"divide and conquer",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 17743
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1373-C | codeforces | 1373-C | Pluses and Minuses | https://codeforces.com/problemset/problem/1373/C | [
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 19403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1373-B | codeforces | 1373-B | 01 Game | https://codeforces.com/problemset/problem/1373/B | [
"games"
] | null | null | stdin_stdout | 900 | {
"solved_count": 53476
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1373-A | codeforces | 1373-A | Donut Shops | https://codeforces.com/problemset/problem/1373/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29565
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1372-F | codeforces | 1372-F | Omkar and Modes | https://codeforces.com/problemset/problem/1372/F | [
"binary search",
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 498
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1372-E | codeforces | 1372-E | Omkar and Last Floor | https://codeforces.com/problemset/problem/1372/E | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1435
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1372-D | codeforces | 1372-D | Omkar and Circle | https://codeforces.com/problemset/problem/1372/D | [
"brute force",
"dp",
"games",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5728
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1372-C | codeforces | 1372-C | Omkar and Baseball | https://codeforces.com/problemset/problem/1372/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19119
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1372-B | codeforces | 1372-B | Omkar and Last Class of Math | https://codeforces.com/problemset/problem/1372/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 36775
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1372-A | codeforces | 1372-A | Omkar and Completion | https://codeforces.com/problemset/problem/1372/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1371-F | codeforces | 1371-F | Raging Thunder | https://codeforces.com/problemset/problem/1371/F | [
"data structures",
"divide and conquer",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 693
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1371-E2 | codeforces | 1371-E2 | Asterism (Hard Version) | https://codeforces.com/problemset/problem/1371/E2 | [
"binary search",
"combinatorics",
"dp",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2517
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1371-E1 | codeforces | 1371-E1 | Asterism (Easy Version) | https://codeforces.com/problemset/problem/1371/E1 | [
"binary search",
"brute force",
"combinatorics",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5535
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1371-D | codeforces | 1371-D | Grid-00100 | https://codeforces.com/problemset/problem/1371/D | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13727
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1371-C | codeforces | 1371-C | A Cookie for You | https://codeforces.com/problemset/problem/1371/C | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1371-B | codeforces | 1371-B | Magical Calendar | https://codeforces.com/problemset/problem/1371/B | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19617
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1371-A | codeforces | 1371-A | Magical Sticks | https://codeforces.com/problemset/problem/1371/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1370-F2 | codeforces | 1370-F2 | The Hidden Pair (Hard Version) | https://codeforces.com/problemset/problem/1370/F2 | [
"binary search",
"dfs and similar",
"graphs",
"interactive",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1683
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1370-F1 | codeforces | 1370-F1 | The Hidden Pair (Easy Version) | https://codeforces.com/problemset/problem/1370/F1 | [
"binary search",
"dfs and similar",
"graphs",
"interactive",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1800
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1370-E | codeforces | 1370-E | Binary Subsequence Rotation | https://codeforces.com/problemset/problem/1370/E | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5229
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1370-D | codeforces | 1370-D | Odd-Even Subsequence | https://codeforces.com/problemset/problem/1370/D | [
"binary search",
"dp",
"dsu",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 10983
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1370-C | codeforces | 1370-C | Number Game | https://codeforces.com/problemset/problem/1370/C | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 27231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1370-B | codeforces | 1370-B | GCD Compression | https://codeforces.com/problemset/problem/1370/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25137
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1370-A | codeforces | 1370-A | Maximum GCD | https://codeforces.com/problemset/problem/1370/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 65201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1369-F | codeforces | 1369-F | BareLee | https://codeforces.com/problemset/problem/1369/F | [
"dfs and similar",
"dp",
"games"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 719
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1369-E | codeforces | 1369-E | DeadLee | https://codeforces.com/problemset/problem/1369/E | [
"data structures",
"dfs and similar",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2461
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1369-D | codeforces | 1369-D | TediousLee | https://codeforces.com/problemset/problem/1369/D | [
"dp",
"graphs",
"greedy",
"math",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 9248
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1369-C | codeforces | 1369-C | RationalLee | https://codeforces.com/problemset/problem/1369/C | [
"greedy",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 20940
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1369-B | codeforces | 1369-B | AccurateLee | https://codeforces.com/problemset/problem/1369/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1369-A | codeforces | 1369-A | FashionabLee | https://codeforces.com/problemset/problem/1369/A | [
"geometry",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 39203
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-H2 | codeforces | 1368-H2 | Breadboard Capacity (hard version) | https://codeforces.com/problemset/problem/1368/H2 | [] | null | null | stdin_stdout | 3,500 | {
"solved_count": 282
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-H1 | codeforces | 1368-H1 | Breadboard Capacity (easy version) | https://codeforces.com/problemset/problem/1368/H1 | [
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-G | codeforces | 1368-G | Shifting Dominoes | https://codeforces.com/problemset/problem/1368/G | [
"data structures",
"geometry",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 678
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-F | codeforces | 1368-F | Lamps on a Circle | https://codeforces.com/problemset/problem/1368/F | [
"games",
"implementation",
"interactive",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1107
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-E | codeforces | 1368-E | Ski Accidents | https://codeforces.com/problemset/problem/1368/E | [
"constructive algorithms",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2369
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-D | codeforces | 1368-D | AND, OR and square sum | https://codeforces.com/problemset/problem/1368/D | [
"bitmasks",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13945
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-C | codeforces | 1368-C | Even Picture | https://codeforces.com/problemset/problem/1368/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14047
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-B | codeforces | 1368-B | Codeforces Subsequences | https://codeforces.com/problemset/problem/1368/B | [
"brute force",
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21551
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1368-A | codeforces | 1368-A | C+= | https://codeforces.com/problemset/problem/1368/A | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 46521
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1367-F2 | codeforces | 1367-F2 | Flying Sort (Hard Version) | https://codeforces.com/problemset/problem/1367/F2 | [
"binary search",
"data structures",
"dp",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1367-F1 | codeforces | 1367-F1 | Flying Sort (Easy Version) | https://codeforces.com/problemset/problem/1367/F1 | [
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3635
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1367-E | codeforces | 1367-E | Necklace Assembly | https://codeforces.com/problemset/problem/1367/E | [
"brute force",
"dfs and similar",
"dp",
"graphs",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5907
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1367-D | codeforces | 1367-D | Task On The Board | https://codeforces.com/problemset/problem/1367/D | [
"constructive algorithms",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 8875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1367-C | codeforces | 1367-C | Social Distance | https://codeforces.com/problemset/problem/1367/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 25237
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1367-B | codeforces | 1367-B | Even Array | https://codeforces.com/problemset/problem/1367/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 64307
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1367-A | codeforces | 1367-A | Short Substrings | https://codeforces.com/problemset/problem/1367/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 68050
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1366-G | codeforces | 1366-G | Construct the String | https://codeforces.com/problemset/problem/1366/G | [
"data structures",
"dp",
"strings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 619
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1366-F | codeforces | 1366-F | Jog Around The Graph | https://codeforces.com/problemset/problem/1366/F | [
"binary search",
"dp",
"geometry",
"graphs"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 896
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1366-E | codeforces | 1366-E | Two Arrays | https://codeforces.com/problemset/problem/1366/E | [
"binary search",
"brute force",
"combinatorics",
"constructive algorithms",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1366-D | codeforces | 1366-D | Two Divisors | https://codeforces.com/problemset/problem/1366/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 12436
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1366-C | codeforces | 1366-C | Palindromic Paths | https://codeforces.com/problemset/problem/1366/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14277
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1366-B | codeforces | 1366-B | Shuffle | https://codeforces.com/problemset/problem/1366/B | [
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1366-A | codeforces | 1366-A | Shovels and Swords | https://codeforces.com/problemset/problem/1366/A | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 33082
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1365-G | codeforces | 1365-G | Secure Password | https://codeforces.com/problemset/problem/1365/G | [
"bitmasks",
"combinatorics",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1421
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1365-F | codeforces | 1365-F | Swaps Again | https://codeforces.com/problemset/problem/1365/F | [
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4766
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1365-E | codeforces | 1365-E | Maximum Subsequence Value | https://codeforces.com/problemset/problem/1365/E | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1365-D | codeforces | 1365-D | Solve The Maze | https://codeforces.com/problemset/problem/1365/D | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 20990
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1365-C | codeforces | 1365-C | Rotation Matching | https://codeforces.com/problemset/problem/1365/C | [
"constructive algorithms",
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1365-B | codeforces | 1365-B | Trouble Sort | https://codeforces.com/problemset/problem/1365/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1365-A | codeforces | 1365-A | Matrix Game | https://codeforces.com/problemset/problem/1365/A | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25102
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1364-E | codeforces | 1364-E | X-OR | https://codeforces.com/problemset/problem/1364/E | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1579
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1364-D | codeforces | 1364-D | Ehab's Last Corollary | https://codeforces.com/problemset/problem/1364/D | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4993
} | 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.