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:854-B | codeforces | 854-B | Maxim Buys an Apartment | https://codeforces.com/problemset/problem/854/B | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8617
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:854-A | codeforces | 854-A | Fraction | https://codeforces.com/problemset/problem/854/A | [
"brute force",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 14675
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:853-E | codeforces | 853-E | Lada Malina | https://codeforces.com/problemset/problem/853/E | [
"data structures",
"geometry"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 90
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:853-D | codeforces | 853-D | Michael and Charging Stations | https://codeforces.com/problemset/problem/853/D | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 729
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:853-C | codeforces | 853-C | Boredom | https://codeforces.com/problemset/problem/853/C | [
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1873
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:853-B | codeforces | 853-B | Jury Meeting | https://codeforces.com/problemset/problem/853/B | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2769
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:853-A | codeforces | 853-A | Planning | https://codeforces.com/problemset/problem/853/A | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6225
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-I | codeforces | 852-I | Dating | https://codeforces.com/problemset/problem/852/I | [
"brute force",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 789
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-H | codeforces | 852-H | Bob and stages | https://codeforces.com/problemset/problem/852/H | [
"dp",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 218
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-G | codeforces | 852-G | Bathroom terminal | https://codeforces.com/problemset/problem/852/G | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1469
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-F | codeforces | 852-F | Product transformation | https://codeforces.com/problemset/problem/852/F | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 671
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-E | codeforces | 852-E | Casinos and travel | https://codeforces.com/problemset/problem/852/E | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1242
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-D | codeforces | 852-D | Exploration plan | https://codeforces.com/problemset/problem/852/D | [
"binary search",
"flows",
"graph matchings",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1307
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-C | codeforces | 852-C | Property | https://codeforces.com/problemset/problem/852/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 684
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-B | codeforces | 852-B | Neural Network country | https://codeforces.com/problemset/problem/852/B | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1803
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:852-A | codeforces | 852-A | Digits | https://codeforces.com/problemset/problem/852/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 447
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:851-B | codeforces | 851-B | Arpa and an exam about geometry | https://codeforces.com/problemset/problem/851/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5922
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:851-A | codeforces | 851-A | Arpa and a research in Mexican wave | https://codeforces.com/problemset/problem/851/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10358
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:850-F | codeforces | 850-F | Rainbow Balls | https://codeforces.com/problemset/problem/850/F | [
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 887
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:850-E | codeforces | 850-E | Random Elections | https://codeforces.com/problemset/problem/850/E | [
"bitmasks",
"brute force",
"divide and conquer",
"fft",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 577
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:850-D | codeforces | 850-D | Tournament Construction | https://codeforces.com/problemset/problem/850/D | [
"constructive algorithms",
"dp",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 543
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:850-C | codeforces | 850-C | Arpa and a game with Mojtaba | https://codeforces.com/problemset/problem/850/C | [
"bitmasks",
"dp",
"games"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2011
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:850-B | codeforces | 850-B | Arpa and a list of numbers | https://codeforces.com/problemset/problem/850/B | [
"implementation",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2228
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:850-A | codeforces | 850-A | Five Dimensional Points | https://codeforces.com/problemset/problem/850/A | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3406
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:849-B | codeforces | 849-B | Tell Your World | https://codeforces.com/problemset/problem/849/B | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4059
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:849-A | codeforces | 849-A | Odds and Ends | https://codeforces.com/problemset/problem/849/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9813
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:848-E | codeforces | 848-E | Days of Floral Colours | https://codeforces.com/problemset/problem/848/E | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 315
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:848-D | codeforces | 848-D | Shake It! | https://codeforces.com/problemset/problem/848/D | [
"combinatorics",
"dp",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 508
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:848-C | codeforces | 848-C | Goodbye Souvenir | https://codeforces.com/problemset/problem/848/C | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1661
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:848-B | codeforces | 848-B | Rooter's Song | https://codeforces.com/problemset/problem/848/B | [
"constructive algorithms",
"data structures",
"geometry",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2020
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:848-A | codeforces | 848-A | From Y to Y | https://codeforces.com/problemset/problem/848/A | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5361
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-M | codeforces | 847-M | Weather Tomorrow | https://codeforces.com/problemset/problem/847/M | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6875
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-L | codeforces | 847-L | Berland SU Computer Network | https://codeforces.com/problemset/problem/847/L | [
"constructive algorithms",
"dfs and similar",
"graphs",
"hashing",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 364
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-K | codeforces | 847-K | Travel Cards | https://codeforces.com/problemset/problem/847/K | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1934
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-J | codeforces | 847-J | Students Initiation | https://codeforces.com/problemset/problem/847/J | [
"binary search",
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 813
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-I | codeforces | 847-I | Noise Level | https://codeforces.com/problemset/problem/847/I | [
"dfs and similar",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1663
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-H | codeforces | 847-H | Load Testing | https://codeforces.com/problemset/problem/847/H | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2626
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-G | codeforces | 847-G | University Classes | https://codeforces.com/problemset/problem/847/G | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 7754
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-F | codeforces | 847-F | Berland Elections | https://codeforces.com/problemset/problem/847/F | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1049
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-E | codeforces | 847-E | Packmen | https://codeforces.com/problemset/problem/847/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3901
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-D | codeforces | 847-D | Dog Show | https://codeforces.com/problemset/problem/847/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1433
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-C | codeforces | 847-C | Sum of Nestings | https://codeforces.com/problemset/problem/847/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2606
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-B | codeforces | 847-B | Preparing for Merge Sort | https://codeforces.com/problemset/problem/847/B | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6499
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:847-A | codeforces | 847-A | Union of Doubly Linked Lists | https://codeforces.com/problemset/problem/847/A | [
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4031
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:846-F | codeforces | 846-F | Random Query | https://codeforces.com/problemset/problem/846/F | [
"data structures",
"math",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2738
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:846-E | codeforces | 846-E | Chemistry in Berland | https://codeforces.com/problemset/problem/846/E | [
"dfs and similar",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1067
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:846-D | codeforces | 846-D | Monitor | https://codeforces.com/problemset/problem/846/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2877
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:846-C | codeforces | 846-C | Four Segments | https://codeforces.com/problemset/problem/846/C | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3001
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:846-B | codeforces | 846-B | Math Show | https://codeforces.com/problemset/problem/846/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2854
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:846-A | codeforces | 846-A | Curriculum Vitae | https://codeforces.com/problemset/problem/846/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4767
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:845-G | codeforces | 845-G | Shortest Path Problem? | https://codeforces.com/problemset/problem/845/G | [
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2258
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:845-F | codeforces | 845-F | Guards In The Storehouse | https://codeforces.com/problemset/problem/845/F | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 824
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:845-E | codeforces | 845-E | Fire in the City | https://codeforces.com/problemset/problem/845/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 715
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:845-D | codeforces | 845-D | Driving Test | https://codeforces.com/problemset/problem/845/D | [
"data structures",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2595
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:845-C | codeforces | 845-C | Two TVs | https://codeforces.com/problemset/problem/845/C | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14740
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:845-B | codeforces | 845-B | Luba And The Ticket | https://codeforces.com/problemset/problem/845/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5586
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:845-A | codeforces | 845-A | Chess Tourney | https://codeforces.com/problemset/problem/845/A | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8528
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:844-B | codeforces | 844-B | Rectangles | https://codeforces.com/problemset/problem/844/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9349
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:844-A | codeforces | 844-A | Diversity | https://codeforces.com/problemset/problem/844/A | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 12322
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:843-E | codeforces | 843-E | Maximum Flow | https://codeforces.com/problemset/problem/843/E | [
"flows",
"graphs"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 679
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:843-D | codeforces | 843-D | Dynamic Shortest Path | https://codeforces.com/problemset/problem/843/D | [
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 1236
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:843-C | codeforces | 843-C | Upgrading Tree | https://codeforces.com/problemset/problem/843/C | [
"constructive algorithms",
"dfs and similar",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 417
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:843-B | codeforces | 843-B | Interactive LowerBound | https://codeforces.com/problemset/problem/843/B | [
"brute force",
"interactive",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2648
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:843-A | codeforces | 843-A | Sorting by Subsequences | https://codeforces.com/problemset/problem/843/A | [
"dfs and similar",
"dsu",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6005
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:842-E | codeforces | 842-E | Nikita and game | https://codeforces.com/problemset/problem/842/E | [
"binary search",
"dfs and similar",
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 526
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:842-D | codeforces | 842-D | Vitya and Strange Lesson | https://codeforces.com/problemset/problem/842/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4639
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:842-C | codeforces | 842-C | Ilya And The Tree | https://codeforces.com/problemset/problem/842/C | [
"dfs and similar",
"graphs",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3826
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:842-B | codeforces | 842-B | Gleb And Pizza | https://codeforces.com/problemset/problem/842/B | [
"geometry"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11071
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:842-A | codeforces | 842-A | Kirill And The Game | https://codeforces.com/problemset/problem/842/A | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11340
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:841-B | codeforces | 841-B | Godsend | https://codeforces.com/problemset/problem/841/B | [
"games",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 13297
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:841-A | codeforces | 841-A | Generous Kefa | https://codeforces.com/problemset/problem/841/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 14198
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:840-E | codeforces | 840-E | In a Trap | https://codeforces.com/problemset/problem/840/E | [
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 862
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:840-D | codeforces | 840-D | Destiny | https://codeforces.com/problemset/problem/840/D | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 4212
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:840-C | codeforces | 840-C | On the Bench | https://codeforces.com/problemset/problem/840/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2194
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:840-B | codeforces | 840-B | Leha and another game about graph | https://codeforces.com/problemset/problem/840/B | [
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2886
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:840-A | codeforces | 840-A | Leha and Function | https://codeforces.com/problemset/problem/840/A | [
"combinatorics",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7595
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:839-E | codeforces | 839-E | Mother of Dragons | https://codeforces.com/problemset/problem/839/E | [
"brute force",
"graphs",
"math",
"meet-in-the-middle"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1063
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:839-D | codeforces | 839-D | Winter is here | https://codeforces.com/problemset/problem/839/D | [
"combinatorics",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3689
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:839-C | codeforces | 839-C | Journey | https://codeforces.com/problemset/problem/839/C | [
"dfs and similar",
"dp",
"graphs",
"probabilities",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 21038
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:839-B | codeforces | 839-B | Game of the Rows | https://codeforces.com/problemset/problem/839/B | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3446
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:839-A | codeforces | 839-A | Arya and Bran | https://codeforces.com/problemset/problem/839/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15053
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:838-F | codeforces | 838-F | Expected Earnings | https://codeforces.com/problemset/problem/838/F | [] | null | null | stdin_stdout | 2,800 | {
"solved_count": 165
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:838-E | codeforces | 838-E | Convex Countour | https://codeforces.com/problemset/problem/838/E | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 449
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:838-D | codeforces | 838-D | Airplane Arrangements | https://codeforces.com/problemset/problem/838/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1203
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:838-C | codeforces | 838-C | Future Failure | https://codeforces.com/problemset/problem/838/C | [
"dp",
"games"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 448
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:838-B | codeforces | 838-B | Diverging Directions | https://codeforces.com/problemset/problem/838/B | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1156
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:838-A | codeforces | 838-A | Binary Blocks | https://codeforces.com/problemset/problem/838/A | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1082
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:837-G | codeforces | 837-G | Functions On The Segments | https://codeforces.com/problemset/problem/837/G | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1002
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:837-F | codeforces | 837-F | Prefix Sums | https://codeforces.com/problemset/problem/837/F | [
"binary search",
"brute force",
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1102
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:837-E | codeforces | 837-E | Vasya's Function | https://codeforces.com/problemset/problem/837/E | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2202
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:837-D | codeforces | 837-D | Round Subset | https://codeforces.com/problemset/problem/837/D | [
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 8082
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:837-C | codeforces | 837-C | Two Seals | https://codeforces.com/problemset/problem/837/C | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4624
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:837-B | codeforces | 837-B | Flag of Berland | https://codeforces.com/problemset/problem/837/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4416
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:837-A | codeforces | 837-A | Text Volume | https://codeforces.com/problemset/problem/837/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 10201
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:835-F | codeforces | 835-F | Roads in the Kingdom | https://codeforces.com/problemset/problem/835/F | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1344
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:835-E | codeforces | 835-E | The penguin's game | https://codeforces.com/problemset/problem/835/E | [
"binary search",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1410
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:835-D | codeforces | 835-D | Palindromic characteristics | https://codeforces.com/problemset/problem/835/D | [
"brute force",
"dp",
"hashing",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4854
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:835-C | codeforces | 835-C | Star sky | https://codeforces.com/problemset/problem/835/C | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9570
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:835-B | codeforces | 835-B | The number on the board | https://codeforces.com/problemset/problem/835/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11458
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:835-A | codeforces | 835-A | Key races | https://codeforces.com/problemset/problem/835/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21973
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.