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:416-B | codeforces | 416-B | Art Union | https://codeforces.com/problemset/problem/416/B | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9429
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:416-A | codeforces | 416-A | Guess a number! | https://codeforces.com/problemset/problem/416/A | [
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10094
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:415-B | codeforces | 415-B | Mashmokh and Tokens | https://codeforces.com/problemset/problem/415/B | [
"binary search",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6704
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:415-A | codeforces | 415-A | Mashmokh and Lights | https://codeforces.com/problemset/problem/415/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9608
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:414-E | codeforces | 414-E | Mashmokh's Designed Problem | https://codeforces.com/problemset/problem/414/E | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 211
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:414-D | codeforces | 414-D | Mashmokh and Water Tanks | https://codeforces.com/problemset/problem/414/D | [
"binary search",
"data structures",
"greedy",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 749
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:414-C | codeforces | 414-C | Mashmokh and Reverse Operation | https://codeforces.com/problemset/problem/414/C | [
"combinatorics",
"divide and conquer"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2364
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:414-B | codeforces | 414-B | Mashmokh and ACM | https://codeforces.com/problemset/problem/414/B | [
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 29499
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:414-A | codeforces | 414-A | Mashmokh and Numbers | https://codeforces.com/problemset/problem/414/A | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10580
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:413-E | codeforces | 413-E | Maze 2D | https://codeforces.com/problemset/problem/413/E | [
"data structures",
"divide and conquer"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 853
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:413-D | codeforces | 413-D | 2048 | https://codeforces.com/problemset/problem/413/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 912
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:413-C | codeforces | 413-C | Jeopardy! | https://codeforces.com/problemset/problem/413/C | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2686
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:413-B | codeforces | 413-B | Spyke Chatting | https://codeforces.com/problemset/problem/413/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 1848
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:413-A | codeforces | 413-A | Data Recovery | https://codeforces.com/problemset/problem/413/A | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 2975
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:412-E | codeforces | 412-E | E-mail Addresses | https://codeforces.com/problemset/problem/412/E | [
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 941
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:412-D | codeforces | 412-D | Giving Awards | https://codeforces.com/problemset/problem/412/D | [
"dfs and similar"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:412-C | codeforces | 412-C | Pattern | https://codeforces.com/problemset/problem/412/C | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4227
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:412-B | codeforces | 412-B | Network Configuration | https://codeforces.com/problemset/problem/412/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 6379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:412-A | codeforces | 412-A | Poster | https://codeforces.com/problemset/problem/412/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 4992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:411-C | codeforces | 411-C | Kicker | https://codeforces.com/problemset/problem/411/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1298
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:411-B | codeforces | 411-B | Multi-core Processor | https://codeforces.com/problemset/problem/411/B | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1414
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:411-A | codeforces | 411-A | Password Check | https://codeforces.com/problemset/problem/411/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8132
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-I | codeforces | 409-I | Feed the Golorp | https://codeforces.com/problemset/problem/409/I | [
"*special"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 155
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-H | codeforces | 409-H | A + B Strikes Back | https://codeforces.com/problemset/problem/409/H | [
"*special",
"brute force",
"constructive algorithms",
"dsu",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-G | codeforces | 409-G | On a plane | https://codeforces.com/problemset/problem/409/G | [
"*special",
"geometry"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 564
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-F | codeforces | 409-F | 000001 | https://codeforces.com/problemset/problem/409/F | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2173
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-E | codeforces | 409-E | Dome | https://codeforces.com/problemset/problem/409/E | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 618
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-D | codeforces | 409-D | Big Data | https://codeforces.com/problemset/problem/409/D | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1806
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-C | codeforces | 409-C | Magnum Opus | https://codeforces.com/problemset/problem/409/C | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-B | codeforces | 409-B | Mysterious Language | https://codeforces.com/problemset/problem/409/B | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1429
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:409-A | codeforces | 409-A | The Great Game | https://codeforces.com/problemset/problem/409/A | [
"*special"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2628
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:408-B | codeforces | 408-B | Garland | https://codeforces.com/problemset/problem/408/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10319
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:408-A | codeforces | 408-A | Line to Cashier | https://codeforces.com/problemset/problem/408/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:407-E | codeforces | 407-E | k-d-sequence | https://codeforces.com/problemset/problem/407/E | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:407-D | codeforces | 407-D | Largest Submatrix 3 | https://codeforces.com/problemset/problem/407/D | [
"dp",
"hashing"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 805
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:407-C | codeforces | 407-C | Curious Array | https://codeforces.com/problemset/problem/407/C | [
"brute force",
"combinatorics",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:407-B | codeforces | 407-B | Long Path | https://codeforces.com/problemset/problem/407/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:407-A | codeforces | 407-A | Triangle | https://codeforces.com/problemset/problem/407/A | [
"brute force",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5177
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:406-E | codeforces | 406-E | Hamming Triples | https://codeforces.com/problemset/problem/406/E | [
"implementation",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 273
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:406-D | codeforces | 406-D | Hill Climbing | https://codeforces.com/problemset/problem/406/D | [
"dfs and similar",
"geometry",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1287
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:405-E | codeforces | 405-E | Graph Cutting | https://codeforces.com/problemset/problem/405/E | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1626
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:405-D | codeforces | 405-D | Toy Sum | https://codeforces.com/problemset/problem/405/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3290
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:405-C | codeforces | 405-C | Unusual Product | https://codeforces.com/problemset/problem/405/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4939
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:405-B | codeforces | 405-B | Domino Effect | https://codeforces.com/problemset/problem/405/B | [] | null | null | stdin_stdout | 1,100 | {
"solved_count": 6118
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:405-A | codeforces | 405-A | Gravity Flip | https://codeforces.com/problemset/problem/405/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 127392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:404-E | codeforces | 404-E | Maze 1D | https://codeforces.com/problemset/problem/404/E | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 642
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:404-D | codeforces | 404-D | Minesweeper 1D | https://codeforces.com/problemset/problem/404/D | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2478
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:404-C | codeforces | 404-C | Restore Graph | https://codeforces.com/problemset/problem/404/C | [
"dfs and similar",
"graphs",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5816
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:404-B | codeforces | 404-B | Marathon | https://codeforces.com/problemset/problem/404/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3053
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:404-A | codeforces | 404-A | Valera and X | https://codeforces.com/problemset/problem/404/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26264
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:403-E | codeforces | 403-E | Two Rooted Trees | https://codeforces.com/problemset/problem/403/E | [
"data structures",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 242
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:403-D | codeforces | 403-D | Beautiful Pairs of Numbers | https://codeforces.com/problemset/problem/403/D | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1234
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:402-E | codeforces | 402-E | Strictly Positive Matrix | https://codeforces.com/problemset/problem/402/E | [
"graphs",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2332
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:402-D | codeforces | 402-D | Upgrading Array | https://codeforces.com/problemset/problem/402/D | [
"dp",
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2794
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:402-C | codeforces | 402-C | Searching for Graph | https://codeforces.com/problemset/problem/402/C | [
"brute force",
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6382
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:402-B | codeforces | 402-B | Trees in a Row | https://codeforces.com/problemset/problem/402/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4000
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:402-A | codeforces | 402-A | Nuts | https://codeforces.com/problemset/problem/402/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4887
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:401-D | codeforces | 401-D | Roman and Numbers | https://codeforces.com/problemset/problem/401/D | [
"bitmasks",
"brute force",
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4593
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:401-C | codeforces | 401-C | Team | https://codeforces.com/problemset/problem/401/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21795
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:401-B | codeforces | 401-B | Sereja and Contests | https://codeforces.com/problemset/problem/401/B | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4604
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:401-A | codeforces | 401-A | Vanya and Cards | https://codeforces.com/problemset/problem/401/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17451
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:400-E | codeforces | 400-E | Inna and Binary Logic | https://codeforces.com/problemset/problem/400/E | [
"binary search",
"bitmasks",
"data structures"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1045
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:400-D | codeforces | 400-D | Dima and Bacteria | https://codeforces.com/problemset/problem/400/D | [
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:400-C | codeforces | 400-C | Inna and Huge Candy Matrix | https://codeforces.com/problemset/problem/400/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3013
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:400-B | codeforces | 400-B | Inna and New Matrix of Candies | https://codeforces.com/problemset/problem/400/B | [
"brute force",
"implementation",
"schedules"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8619
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:400-A | codeforces | 400-A | Inna and Choose Options | https://codeforces.com/problemset/problem/400/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:399-B | codeforces | 399-B | Red and Blue Balls | https://codeforces.com/problemset/problem/399/B | [] | null | null | stdin_stdout | null | {
"solved_count": 1885
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:399-A | codeforces | 399-A | Pages | https://codeforces.com/problemset/problem/399/A | [
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 4233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:398-E | codeforces | 398-E | Sorting Permutations | https://codeforces.com/problemset/problem/398/E | [] | null | null | stdin_stdout | null | {
"solved_count": 124
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:398-D | codeforces | 398-D | Instant Messanger | https://codeforces.com/problemset/problem/398/D | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 1309
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:398-C | codeforces | 398-C | Tree and Array | https://codeforces.com/problemset/problem/398/C | [
"constructive algorithms"
] | null | null | stdin_stdout | null | {
"solved_count": 221
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:398-B | codeforces | 398-B | Painting The Wall | https://codeforces.com/problemset/problem/398/B | [
"dp",
"probabilities"
] | null | null | stdin_stdout | null | {
"solved_count": 1199
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:398-A | codeforces | 398-A | Cards | https://codeforces.com/problemset/problem/398/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 965
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:397-B | codeforces | 397-B | On Corruption and Numbers | https://codeforces.com/problemset/problem/397/B | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 835
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:397-A | codeforces | 397-A | On Segment's Own Points | https://codeforces.com/problemset/problem/397/A | [
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 2725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:396-E | codeforces | 396-E | On Iteration of One Well-Known Function | https://codeforces.com/problemset/problem/396/E | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 167
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:396-D | codeforces | 396-D | On Sum of Number of Inversions in Permutations | https://codeforces.com/problemset/problem/396/D | [
"combinatorics",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 465
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:396-C | codeforces | 396-C | On Changing Tree | https://codeforces.com/problemset/problem/396/C | [
"data structures",
"graphs",
"trees"
] | null | null | stdin_stdout | null | {
"solved_count": 1813
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:396-B | codeforces | 396-B | On Sum of Fractions | https://codeforces.com/problemset/problem/396/B | [
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 1193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:396-A | codeforces | 396-A | On Number of Decompositions into Multipliers | https://codeforces.com/problemset/problem/396/A | [
"combinatorics",
"math",
"number theory"
] | null | null | stdin_stdout | null | {
"solved_count": 1633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:394-E | codeforces | 394-E | Lightbulb for Minister | https://codeforces.com/problemset/problem/394/E | [
"geometry"
] | null | null | stdin_stdout | null | {
"solved_count": 133
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:394-D | codeforces | 394-D | Physical Education and Buns | https://codeforces.com/problemset/problem/394/D | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 299
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:394-C | codeforces | 394-C | Dominoes | https://codeforces.com/problemset/problem/394/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 559
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:394-B | codeforces | 394-B | Very Beautiful Number | https://codeforces.com/problemset/problem/394/B | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 624
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:394-A | codeforces | 394-A | Counting Sticks | https://codeforces.com/problemset/problem/394/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | null | {
"solved_count": 2739
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:393-B | codeforces | 393-B | Three matrices | https://codeforces.com/problemset/problem/393/B | [] | null | null | stdin_stdout | null | {
"solved_count": 2073
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:393-A | codeforces | 393-A | Nineteen | https://codeforces.com/problemset/problem/393/A | [] | null | null | stdin_stdout | null | {
"solved_count": 6995
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:392-E | codeforces | 392-E | Deleting Substrings | https://codeforces.com/problemset/problem/392/E | [] | null | null | stdin_stdout | null | {
"solved_count": 188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:392-D | codeforces | 392-D | Three Arrays | https://codeforces.com/problemset/problem/392/D | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 235
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:392-C | codeforces | 392-C | Yet Another Number Sequence | https://codeforces.com/problemset/problem/392/C | [
"combinatorics",
"math",
"matrices"
] | null | null | stdin_stdout | null | {
"solved_count": 680
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:392-B | codeforces | 392-B | Tower of Hanoi | https://codeforces.com/problemset/problem/392/B | [
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 1056
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:392-A | codeforces | 392-A | Blocked Points | https://codeforces.com/problemset/problem/392/A | [
"math"
] | null | null | stdin_stdout | null | {
"solved_count": 1010
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:391-F3 | codeforces | 391-F3 | Stock Trading | https://codeforces.com/problemset/problem/391/F3 | [] | null | null | stdin_stdout | null | {
"solved_count": 120
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:391-F2 | codeforces | 391-F2 | Stock Trading | https://codeforces.com/problemset/problem/391/F2 | [
"greedy"
] | null | null | stdin_stdout | null | {
"solved_count": 121
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:391-F1 | codeforces | 391-F1 | Stock Trading | https://codeforces.com/problemset/problem/391/F1 | [
"dp"
] | null | null | stdin_stdout | null | {
"solved_count": 225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:391-E2 | codeforces | 391-E2 | Three Trees | https://codeforces.com/problemset/problem/391/E2 | [] | null | null | stdin_stdout | null | {
"solved_count": 187
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:391-E1 | codeforces | 391-E1 | Three Trees | https://codeforces.com/problemset/problem/391/E1 | [] | null | null | stdin_stdout | null | {
"solved_count": 136
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:391-D2 | codeforces | 391-D2 | Supercollider | https://codeforces.com/problemset/problem/391/D2 | [
"data structures"
] | null | null | stdin_stdout | null | {
"solved_count": 218
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:391-D1 | codeforces | 391-D1 | Supercollider | https://codeforces.com/problemset/problem/391/D1 | [
"brute force"
] | null | null | stdin_stdout | null | {
"solved_count": 293
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:391-C3 | codeforces | 391-C3 | The Tournament | https://codeforces.com/problemset/problem/391/C3 | [] | null | null | stdin_stdout | null | {
"solved_count": 179
} | 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.