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:519-B | codeforces | 519-B | A and B and Compilation Errors | https://codeforces.com/problemset/problem/519/B | [
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 43894
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:519-A | codeforces | 519-A | A and B and Chess | https://codeforces.com/problemset/problem/519/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 20181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:518-F | codeforces | 518-F | Pasha and Pipe | https://codeforces.com/problemset/problem/518/F | [
"binary search",
"brute force",
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 418
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:518-E | codeforces | 518-E | Arthur and Questions | https://codeforces.com/problemset/problem/518/E | [
"greedy",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:518-D | codeforces | 518-D | Ilya and Escalator | https://codeforces.com/problemset/problem/518/D | [
"combinatorics",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:518-C | codeforces | 518-C | Anya and Smartphone | https://codeforces.com/problemset/problem/518/C | [
"constructive algorithms",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:518-B | codeforces | 518-B | Tanya and Postcard | https://codeforces.com/problemset/problem/518/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:518-A | codeforces | 518-A | Vitaly and Strings | https://codeforces.com/problemset/problem/518/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9548
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:516-E | codeforces | 516-E | Drazil and His Happy Friends | https://codeforces.com/problemset/problem/516/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 606
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:516-D | codeforces | 516-D | Drazil and Morning Exercise | https://codeforces.com/problemset/problem/516/D | [
"dfs and similar",
"dp",
"dsu",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:515-E | codeforces | 515-E | Drazil and Park | https://codeforces.com/problemset/problem/515/E | [
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2462
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:515-D | codeforces | 515-D | Drazil and Tiles | https://codeforces.com/problemset/problem/515/D | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3014
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:515-C | codeforces | 515-C | Drazil and Factorial | https://codeforces.com/problemset/problem/515/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28797
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:515-B | codeforces | 515-B | Drazil and His Happy Friends | https://codeforces.com/problemset/problem/515/B | [
"brute force",
"dsu",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7772
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:515-A | codeforces | 515-A | Drazil and Date | https://codeforces.com/problemset/problem/515/A | [
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 22043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:514-E | codeforces | 514-E | Darth Vader and Tree | https://codeforces.com/problemset/problem/514/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1748
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:514-D | codeforces | 514-D | R2D2 and Droid Army | https://codeforces.com/problemset/problem/514/D | [
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:514-C | codeforces | 514-C | Watto and Mechanism | https://codeforces.com/problemset/problem/514/C | [
"binary search",
"data structures",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 8221
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:514-B | codeforces | 514-B | Han Solo and Lazer Gun | https://codeforces.com/problemset/problem/514/B | [
"brute force",
"data structures",
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 22697
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:514-A | codeforces | 514-A | Chewbaсca and Number | https://codeforces.com/problemset/problem/514/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 72065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-G3 | codeforces | 513-G3 | Inversions problem | https://codeforces.com/problemset/problem/513/G3 | [
"dp"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 291
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-G2 | codeforces | 513-G2 | Inversions problem | https://codeforces.com/problemset/problem/513/G2 | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 727
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-G1 | codeforces | 513-G1 | Inversions problem | https://codeforces.com/problemset/problem/513/G1 | [
"brute force",
"dfs and similar",
"dp",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1849
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-F2 | codeforces | 513-F2 | Scaygerboss | https://codeforces.com/problemset/problem/513/F2 | [
"flows"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 413
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-F1 | codeforces | 513-F1 | Scaygerboss | https://codeforces.com/problemset/problem/513/F1 | [
"flows"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 359
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-E2 | codeforces | 513-E2 | Subarray Cuts | https://codeforces.com/problemset/problem/513/E2 | [
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 653
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-E1 | codeforces | 513-E1 | Subarray Cuts | https://codeforces.com/problemset/problem/513/E1 | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-D2 | codeforces | 513-D2 | Constrained Tree | https://codeforces.com/problemset/problem/513/D2 | [
"constructive algorithms",
"data structures"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-D1 | codeforces | 513-D1 | Constrained Tree | https://codeforces.com/problemset/problem/513/D1 | [
"dfs and similar"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 650
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-C | codeforces | 513-C | Second price auction | https://codeforces.com/problemset/problem/513/C | [
"bitmasks",
"probabilities"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1673
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-B2 | codeforces | 513-B2 | Permutations | https://codeforces.com/problemset/problem/513/B2 | [
"bitmasks",
"divide and conquer",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2931
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-B1 | codeforces | 513-B1 | Permutations | https://codeforces.com/problemset/problem/513/B1 | [
"brute force"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3834
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:513-A | codeforces | 513-A | Game | https://codeforces.com/problemset/problem/513/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21877
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:512-E | codeforces | 512-E | Fox And Polygon | https://codeforces.com/problemset/problem/512/E | [
"constructive algorithms",
"divide and conquer"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 574
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:512-D | codeforces | 512-D | Fox And Travelling | https://codeforces.com/problemset/problem/512/D | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1137
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:510-E | codeforces | 510-E | Fox And Dinner | https://codeforces.com/problemset/problem/510/E | [
"flows"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2434
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:510-D | codeforces | 510-D | Fox And Jumping | https://codeforces.com/problemset/problem/510/D | [
"bitmasks",
"brute force",
"dp",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:510-C | codeforces | 510-C | Fox And Names | https://codeforces.com/problemset/problem/510/C | [
"dfs and similar",
"graphs",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 22410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:510-B | codeforces | 510-B | Fox And Two Dots | https://codeforces.com/problemset/problem/510/B | [
"dfs and similar"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16339
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:510-A | codeforces | 510-A | Fox And Snake | https://codeforces.com/problemset/problem/510/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 106855
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:509-F | codeforces | 509-F | Progress Monitoring | https://codeforces.com/problemset/problem/509/F | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:509-E | codeforces | 509-E | Pretty Song | https://codeforces.com/problemset/problem/509/E | [
"math",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1884
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:509-D | codeforces | 509-D | Restoring Numbers | https://codeforces.com/problemset/problem/509/D | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 815
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:509-C | codeforces | 509-C | Sums of Digits | https://codeforces.com/problemset/problem/509/C | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2405
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:509-B | codeforces | 509-B | Painting Pebbles | https://codeforces.com/problemset/problem/509/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9995
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:509-A | codeforces | 509-A | Maximum in Table | https://codeforces.com/problemset/problem/509/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 44267
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:508-E | codeforces | 508-E | Arthur and Brackets | https://codeforces.com/problemset/problem/508/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1960
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:508-D | codeforces | 508-D | Tanya and Password | https://codeforces.com/problemset/problem/508/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 4269
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:508-C | codeforces | 508-C | Anya and Ghosts | https://codeforces.com/problemset/problem/508/C | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4677
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:508-B | codeforces | 508-B | Anton and currency you all know | https://codeforces.com/problemset/problem/508/B | [
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 24024
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:508-A | codeforces | 508-A | Pasha and Pixels | https://codeforces.com/problemset/problem/508/A | [
"brute force"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8461
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:507-E | codeforces | 507-E | Breaking Good | https://codeforces.com/problemset/problem/507/E | [
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3258
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:507-D | codeforces | 507-D | The Maths Lecture | https://codeforces.com/problemset/problem/507/D | [
"dp",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2139
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:507-C | codeforces | 507-C | Guess Your Way Out! | https://codeforces.com/problemset/problem/507/C | [
"implementation",
"math",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4566
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:507-B | codeforces | 507-B | Amr and Pins | https://codeforces.com/problemset/problem/507/B | [
"geometry",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26740
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:507-A | codeforces | 507-A | Amr and Music | https://codeforces.com/problemset/problem/507/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21869
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:506-E | codeforces | 506-E | Mr. Kitayuta's Gift | https://codeforces.com/problemset/problem/506/E | [
"combinatorics",
"dp",
"matrices",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 921
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:506-D | codeforces | 506-D | Mr. Kitayuta's Colorful Graph | https://codeforces.com/problemset/problem/506/D | [
"brute force",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 2552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:505-E | codeforces | 505-E | Mr. Kitayuta vs. Bamboos | https://codeforces.com/problemset/problem/505/E | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1566
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:505-D | codeforces | 505-D | Mr. Kitayuta's Technology | https://codeforces.com/problemset/problem/505/D | [
"dfs and similar"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2936
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:505-C | codeforces | 505-C | Mr. Kitayuta, the Treasure Hunter | https://codeforces.com/problemset/problem/505/C | [
"dfs and similar",
"dp",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7344
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:505-B | codeforces | 505-B | Mr. Kitayuta's Colorful Graph | https://codeforces.com/problemset/problem/505/B | [
"dfs and similar",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15031
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:505-A | codeforces | 505-A | Mr. Kitayuta's Gift | https://codeforces.com/problemset/problem/505/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 6931
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:504-E | codeforces | 504-E | Misha and LCP on Tree | https://codeforces.com/problemset/problem/504/E | [
"binary search",
"dfs and similar",
"hashing",
"string suffix structures",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 1069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:504-D | codeforces | 504-D | Misha and XOR | https://codeforces.com/problemset/problem/504/D | [
"bitmasks"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 349
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:501-E | codeforces | 501-E | Misha and Palindrome Degree | https://codeforces.com/problemset/problem/501/E | [
"binary search",
"combinatorics",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 951
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:501-D | codeforces | 501-D | Misha and Permutations Summation | https://codeforces.com/problemset/problem/501/D | [
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2725
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:501-C | codeforces | 501-C | Misha and Forest | https://codeforces.com/problemset/problem/501/C | [
"constructive algorithms",
"data structures",
"greedy",
"sortings",
"trees"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6068
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:501-B | codeforces | 501-B | Misha and Changing Handles | https://codeforces.com/problemset/problem/501/B | [
"data structures",
"dsu",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 19532
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:501-A | codeforces | 501-A | Contest | https://codeforces.com/problemset/problem/501/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24337
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:500-G | codeforces | 500-G | New Year Running | https://codeforces.com/problemset/problem/500/G | [
"number theory",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 169
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:500-F | codeforces | 500-F | New Year Shopping | https://codeforces.com/problemset/problem/500/F | [
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 831
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:500-E | codeforces | 500-E | New Year Domino | https://codeforces.com/problemset/problem/500/E | [
"data structures",
"dp",
"dsu"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1588
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:500-D | codeforces | 500-D | New Year Santa Network | https://codeforces.com/problemset/problem/500/D | [
"combinatorics",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3282
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:500-C | codeforces | 500-C | New Year Book Reading | https://codeforces.com/problemset/problem/500/C | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6042
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:500-B | codeforces | 500-B | New Year Permutation | https://codeforces.com/problemset/problem/500/B | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 9632
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:500-A | codeforces | 500-A | New Year Transportation | https://codeforces.com/problemset/problem/500/A | [
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 63168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:499-B | codeforces | 499-B | Lecture | https://codeforces.com/problemset/problem/499/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 45043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:499-A | codeforces | 499-A | Watching a movie | https://codeforces.com/problemset/problem/499/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14738
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:498-E | codeforces | 498-E | Stairs and Lines | https://codeforces.com/problemset/problem/498/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 570
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:498-D | codeforces | 498-D | Traffic Jams in the Land | https://codeforces.com/problemset/problem/498/D | [
"data structures",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1247
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:498-C | codeforces | 498-C | Array and Operations | https://codeforces.com/problemset/problem/498/C | [
"flows",
"graph matchings",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4229
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:498-B | codeforces | 498-B | Name That Tune | https://codeforces.com/problemset/problem/498/B | [
"dp",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1301
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:498-A | codeforces | 498-A | Crazy Town | https://codeforces.com/problemset/problem/498/A | [
"geometry"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6901
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:497-E | codeforces | 497-E | Subsequences Return | https://codeforces.com/problemset/problem/497/E | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:497-D | codeforces | 497-D | Gears | https://codeforces.com/problemset/problem/497/D | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 249
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:496-E | codeforces | 496-E | Distributing Parts | https://codeforces.com/problemset/problem/496/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1760
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:496-D | codeforces | 496-D | Tennis Game | https://codeforces.com/problemset/problem/496/D | [
"binary search"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:496-C | codeforces | 496-C | Removing Columns | https://codeforces.com/problemset/problem/496/C | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 8165
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:496-B | codeforces | 496-B | Secret Combination | https://codeforces.com/problemset/problem/496/B | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6211
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:496-A | codeforces | 496-A | Minimum Difficulty | https://codeforces.com/problemset/problem/496/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17199
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:495-B | codeforces | 495-B | Modular Equations | https://codeforces.com/problemset/problem/495/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8314
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:495-A | codeforces | 495-A | Digital Counter | https://codeforces.com/problemset/problem/495/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8979
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:494-E | codeforces | 494-E | Sharti | https://codeforces.com/problemset/problem/494/E | [
"data structures",
"games"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 377
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:494-D | codeforces | 494-D | Birthday | https://codeforces.com/problemset/problem/494/D | [
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 670
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:494-C | codeforces | 494-C | Helping People | https://codeforces.com/problemset/problem/494/C | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 960
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:494-B | codeforces | 494-B | Obsessive String | https://codeforces.com/problemset/problem/494/B | [
"dp",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3179
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:494-A | codeforces | 494-A | Treasure | https://codeforces.com/problemset/problem/494/A | [
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6553
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:493-E | codeforces | 493-E | Vasya and Polynomial | https://codeforces.com/problemset/problem/493/E | [
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 517
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:493-D | codeforces | 493-D | Vasya and Chess | https://codeforces.com/problemset/problem/493/D | [
"constructive algorithms",
"games",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10231
} | 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.