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:862-E | codeforces | 862-E | Mahmoud and Ehab and the function | https://codeforces.com/problemset/problem/862/E | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2394
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:862-D | codeforces | 862-D | Mahmoud and Ehab and the binary string | https://codeforces.com/problemset/problem/862/D | [
"binary search",
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2104
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:862-C | codeforces | 862-C | Mahmoud and Ehab and the xor | https://codeforces.com/problemset/problem/862/C | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4593
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:862-B | codeforces | 862-B | Mahmoud and Ehab and the bipartiteness | https://codeforces.com/problemset/problem/862/B | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 28749
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:862-A | codeforces | 862-A | Mahmoud and Ehab and the MEX | https://codeforces.com/problemset/problem/862/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10841
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:860-E | codeforces | 860-E | Arkady and a Nobody-men | https://codeforces.com/problemset/problem/860/E | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 564
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:859-G | codeforces | 859-G | Circle of Numbers | https://codeforces.com/problemset/problem/859/G | [
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 328
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:859-F | codeforces | 859-F | Ordering T-Shirts | https://codeforces.com/problemset/problem/859/F | [
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 285
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:859-E | codeforces | 859-E | Desk Disorder | https://codeforces.com/problemset/problem/859/E | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2187
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:859-D | codeforces | 859-D | Third Month Insanity | https://codeforces.com/problemset/problem/859/D | [
"dp",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1165
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:859-C | codeforces | 859-C | Pie Rules | https://codeforces.com/problemset/problem/859/C | [
"dp",
"games"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6318
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:859-B | codeforces | 859-B | Lazy Security Guard | https://codeforces.com/problemset/problem/859/B | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8047
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:859-A | codeforces | 859-A | Declined Finalists | https://codeforces.com/problemset/problem/859/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8742
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:858-F | codeforces | 858-F | Wizard's Tour | https://codeforces.com/problemset/problem/858/F | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2237
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:858-E | codeforces | 858-E | Tests Renumeration | https://codeforces.com/problemset/problem/858/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 557
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:858-D | codeforces | 858-D | Polycarp's phone book | https://codeforces.com/problemset/problem/858/D | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4450
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:858-C | codeforces | 858-C | Did you mean... | https://codeforces.com/problemset/problem/858/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5930
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:858-B | codeforces | 858-B | Which floor? | https://codeforces.com/problemset/problem/858/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4142
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:858-A | codeforces | 858-A | k-rounding | https://codeforces.com/problemset/problem/858/A | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9475
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:856-F | codeforces | 856-F | To Play or not to Play | https://codeforces.com/problemset/problem/856/F | [
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 134
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:856-E | codeforces | 856-E | Satellites | https://codeforces.com/problemset/problem/856/E | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 181
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:856-D | codeforces | 856-D | Masha and Cactus | https://codeforces.com/problemset/problem/856/D | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 636
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:856-C | codeforces | 856-C | Eleventh Birthday | https://codeforces.com/problemset/problem/856/C | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 767
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:856-B | codeforces | 856-B | Similar Words | https://codeforces.com/problemset/problem/856/B | [
"dp",
"hashing",
"strings",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 679
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:856-A | codeforces | 856-A | Set Theory | https://codeforces.com/problemset/problem/856/A | [
"brute force",
"constructive algorithms"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1666
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:855-G | codeforces | 855-G | Harry Vs Voldemort | https://codeforces.com/problemset/problem/855/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 482
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:855-F | codeforces | 855-F | Nagini | https://codeforces.com/problemset/problem/855/F | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 711
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:855-E | codeforces | 855-E | Salazar Slytherin's Locket | https://codeforces.com/problemset/problem/855/E | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2331
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:855-D | codeforces | 855-D | Rowena Ravenclaw's Diadem | https://codeforces.com/problemset/problem/855/D | [
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 648
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:855-C | codeforces | 855-C | Helga Hufflepuff's Cup | https://codeforces.com/problemset/problem/855/C | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2530
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:855-B | codeforces | 855-B | Marvolo Gaunt's Ring | https://codeforces.com/problemset/problem/855/B | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10109
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:855-A | codeforces | 855-A | Tom Riddle's Diary | https://codeforces.com/problemset/problem/855/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29245
} | 2026-11-02T05:37:07.883505+00:00 |
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": 8648
} | 2026-11-02T05:37:07.883505+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": 14784
} | 2026-11-02T05:37:07.883505+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": 92
} | 2026-11-02T05:37:07.883505+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": 733
} | 2026-11-02T05:37:07.883505+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": 1879
} | 2026-11-02T05:37:07.883505+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": 2790
} | 2026-11-02T05:37:07.883505+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": 6277
} | 2026-11-02T05:37:07.883505+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": 823
} | 2026-11-02T05:37:07.883505+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": 224
} | 2026-11-02T05:37:07.883505+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": 1482
} | 2026-11-02T05:37:07.883505+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": 676
} | 2026-11-02T05:37:07.883505+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": 1267
} | 2026-11-02T05:37:07.883505+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": 1332
} | 2026-11-02T05:37:07.883505+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": 687
} | 2026-11-02T05:37:07.883505+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": 1832
} | 2026-11-02T05:37:07.883505+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": 450
} | 2026-11-02T05:37:07.883505+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": 5948
} | 2026-11-02T05:37:07.883505+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": 10403
} | 2026-11-02T05:37:07.883505+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": 915
} | 2026-11-02T05:37:07.883505+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": 580
} | 2026-11-02T05:37:07.883505+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": 548
} | 2026-11-02T05:37:07.883505+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": 2043
} | 2026-11-02T05:37:07.883505+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": 2245
} | 2026-11-02T05:37:07.883505+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": 3425
} | 2026-11-02T05:37:07.883505+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": 4096
} | 2026-11-02T05:37:07.883505+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": 9871
} | 2026-11-02T05:37:07.883505+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": 317
} | 2026-11-02T05:37:07.883505+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": 511
} | 2026-11-02T05:37:07.883505+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": 1706
} | 2026-11-02T05:37:07.883505+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": 2028
} | 2026-11-02T05:37:07.883505+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": 5377
} | 2026-11-02T05:37:07.883505+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": 6922
} | 2026-11-02T05:37:07.883505+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": 370
} | 2026-11-02T05:37:07.883505+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": 1958
} | 2026-11-02T05:37:07.883505+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": 821
} | 2026-11-02T05:37:07.883505+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": 1689
} | 2026-11-02T05:37:07.883505+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": 2646
} | 2026-11-02T05:37:07.883505+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": 7840
} | 2026-11-02T05:37:07.883505+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": 1056
} | 2026-11-02T05:37:07.883505+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": 4041
} | 2026-11-02T05:37:07.883505+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": 1446
} | 2026-11-02T05:37:07.883505+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": 2628
} | 2026-11-02T05:37:07.883505+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": 6588
} | 2026-11-02T05:37:07.883505+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": 4132
} | 2026-11-02T05:37:07.883505+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": 2793
} | 2026-11-02T05:37:07.883505+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": 1074
} | 2026-11-02T05:37:07.883505+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": 2895
} | 2026-11-02T05:37:07.883505+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": 3050
} | 2026-11-02T05:37:07.883505+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": 2868
} | 2026-11-02T05:37:07.883505+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": 4798
} | 2026-11-02T05:37:07.883505+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": 2338
} | 2026-11-02T05:37:07.883505+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": 878
} | 2026-11-02T05:37:07.883505+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": 720
} | 2026-11-02T05:37:07.883505+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": 2600
} | 2026-11-02T05:37:07.883505+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": 15391
} | 2026-11-02T05:37:07.883505+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": 5792
} | 2026-11-02T05:37:07.883505+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": 8572
} | 2026-11-02T05:37:07.883505+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": 9479
} | 2026-11-02T05:37:07.883505+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": 12382
} | 2026-11-02T05:37:07.883505+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": 691
} | 2026-11-02T05:37:07.883505+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": 1258
} | 2026-11-02T05:37:07.883505+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": 423
} | 2026-11-02T05:37:07.883505+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": 2681
} | 2026-11-02T05:37:07.883505+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": 6038
} | 2026-11-02T05:37:07.883505+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": 535
} | 2026-11-02T05:37:07.883505+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": 4790
} | 2026-11-02T05:37:07.883505+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": 3852
} | 2026-11-02T05:37:07.883505+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": 11133
} | 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.