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:777-A | codeforces | 777-A | Shell Game | https://codeforces.com/problemset/problem/777/A | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10915
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:776-G | codeforces | 776-G | Sherlock and the Encrypted Data | https://codeforces.com/problemset/problem/776/G | [
"bitmasks",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 368
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:776-F | codeforces | 776-F | Sherlock's bet to Moriarty | https://codeforces.com/problemset/problem/776/F | [
"constructive algorithms",
"data structures",
"divide and conquer",
"geometry",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 512
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:776-E | codeforces | 776-E | The Holmes Children | https://codeforces.com/problemset/problem/776/E | [
"math",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:776-D | codeforces | 776-D | The Door Problem | https://codeforces.com/problemset/problem/776/D | [
"2-sat",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6278
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:776-C | codeforces | 776-C | Molly's Chemicals | https://codeforces.com/problemset/problem/776/C | [
"binary search",
"brute force",
"data structures",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6258
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:776-B | codeforces | 776-B | Sherlock and his girlfriend | https://codeforces.com/problemset/problem/776/B | [
"constructive algorithms",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 25990
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:776-A | codeforces | 776-A | A Serial Killer | https://codeforces.com/problemset/problem/776/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12910
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:775-A | codeforces | 775-A | University Schedule | https://codeforces.com/problemset/problem/775/A | [
"*special"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 0
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-L | codeforces | 774-L | Bars | https://codeforces.com/problemset/problem/774/L | [
"*special",
"binary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 390
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-K | codeforces | 774-K | Stepan and Vowels | https://codeforces.com/problemset/problem/774/K | [
"*special",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1397
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-J | codeforces | 774-J | Stepan's Series | https://codeforces.com/problemset/problem/774/J | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 436
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-I | codeforces | 774-I | Composing Of String | https://codeforces.com/problemset/problem/774/I | [
"*special",
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-H | codeforces | 774-H | Repairing Of String | https://codeforces.com/problemset/problem/774/H | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 276
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-G | codeforces | 774-G | Perfectionist Arkadiy | https://codeforces.com/problemset/problem/774/G | [
"*special",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 199
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-F | codeforces | 774-F | Pens And Days Of Week | https://codeforces.com/problemset/problem/774/F | [
"*special",
"binary search",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 154
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-E | codeforces | 774-E | Big Number and Remainder | https://codeforces.com/problemset/problem/774/E | [
"*special",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 262
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-D | codeforces | 774-D | Lie or Truth | https://codeforces.com/problemset/problem/774/D | [
"*special",
"constructive algorithms",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2114
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-C | codeforces | 774-C | Maximum Number | https://codeforces.com/problemset/problem/774/C | [
"*special",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 4386
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-B | codeforces | 774-B | Significant Cups | https://codeforces.com/problemset/problem/774/B | [
"*special",
"binary search",
"data structures",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 295
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:774-A | codeforces | 774-A | Amusement Park | https://codeforces.com/problemset/problem/774/A | [
"*special",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:773-F | codeforces | 773-F | Test Data Generation | https://codeforces.com/problemset/problem/773/F | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 219
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:773-E | codeforces | 773-E | Blog Post Rating | https://codeforces.com/problemset/problem/773/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 509
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:773-D | codeforces | 773-D | Perishable Roads | https://codeforces.com/problemset/problem/773/D | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 801
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:773-C | codeforces | 773-C | Prairie Partition | https://codeforces.com/problemset/problem/773/C | [
"binary search",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 997
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:773-B | codeforces | 773-B | Dynamic Problem Scoring | https://codeforces.com/problemset/problem/773/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1217
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:773-A | codeforces | 773-A | Success Rate | https://codeforces.com/problemset/problem/773/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4792
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:772-E | codeforces | 772-E | Verifying Kingdom | https://codeforces.com/problemset/problem/772/E | [
"binary search",
"divide and conquer",
"interactive",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 220
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:772-D | codeforces | 772-D | Varying Kibibits | https://codeforces.com/problemset/problem/772/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 763
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:772-C | codeforces | 772-C | Vulnerable Kerbals | https://codeforces.com/problemset/problem/772/C | [
"constructive algorithms",
"dp",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1455
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:772-B | codeforces | 772-B | Volatile Kite | https://codeforces.com/problemset/problem/772/B | [
"geometry"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3493
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:772-A | codeforces | 772-A | Voltage Keepsake | https://codeforces.com/problemset/problem/772/A | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5012
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:771-F | codeforces | 771-F | Bear and Isomorphic Points | https://codeforces.com/problemset/problem/771/F | [
"geometry",
"two pointers"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 89
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:771-E | codeforces | 771-E | Bear and Rectangle Strips | https://codeforces.com/problemset/problem/771/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 621
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:771-D | codeforces | 771-D | Bear and Company | https://codeforces.com/problemset/problem/771/D | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1633
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:771-C | codeforces | 771-C | Bear and Tree Jumps | https://codeforces.com/problemset/problem/771/C | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3558
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:771-B | codeforces | 771-B | Bear and Different Names | https://codeforces.com/problemset/problem/771/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:771-A | codeforces | 771-A | Bear and Friendship Condition | https://codeforces.com/problemset/problem/771/A | [
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17839
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:770-D | codeforces | 770-D | Draw Brackets! | https://codeforces.com/problemset/problem/770/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1631
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:770-C | codeforces | 770-C | Online Courses In BSU | https://codeforces.com/problemset/problem/770/C | [
"*special",
"dfs and similar",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2943
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:770-B | codeforces | 770-B | Maximize Sum of Digits | https://codeforces.com/problemset/problem/770/B | [
"*special",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3072
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:770-A | codeforces | 770-A | New Password | https://codeforces.com/problemset/problem/770/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 21800
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:769-D | codeforces | 769-D | k-Interesting Pairs Of Integers | https://codeforces.com/problemset/problem/769/D | [
"*special",
"bitmasks",
"brute force",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2562
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:769-C | codeforces | 769-C | Cycle In Maze | https://codeforces.com/problemset/problem/769/C | [
"*special",
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:769-B | codeforces | 769-B | News About Credit | https://codeforces.com/problemset/problem/769/B | [
"*special",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3446
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:769-A | codeforces | 769-A | Year of University Entrance | https://codeforces.com/problemset/problem/769/A | [
"*special",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 6444
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:768-G | codeforces | 768-G | The Winds of Winter | https://codeforces.com/problemset/problem/768/G | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:768-F | codeforces | 768-F | Barrels and boxes | https://codeforces.com/problemset/problem/768/F | [
"brute force",
"combinatorics",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1129
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:768-E | codeforces | 768-E | Game of Stones | https://codeforces.com/problemset/problem/768/E | [
"bitmasks",
"dp",
"games"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:768-D | codeforces | 768-D | Jon and Orbs | https://codeforces.com/problemset/problem/768/D | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3443
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:768-C | codeforces | 768-C | Jon Snow and his Favourite Number | https://codeforces.com/problemset/problem/768/C | [
"brute force",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:768-B | codeforces | 768-B | Code For 1 | https://codeforces.com/problemset/problem/768/B | [
"constructive algorithms",
"dfs and similar",
"divide and conquer"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7011
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:768-A | codeforces | 768-A | Oath of the Night's Watch | https://codeforces.com/problemset/problem/768/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30951
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:767-E | codeforces | 767-E | Change-free | https://codeforces.com/problemset/problem/767/E | [
"greedy"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1072
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:767-D | codeforces | 767-D | Cartons of milk | https://codeforces.com/problemset/problem/767/D | [
"binary search",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2415
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:767-C | codeforces | 767-C | Garland | https://codeforces.com/problemset/problem/767/C | [
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4653
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:767-B | codeforces | 767-B | The Queue | https://codeforces.com/problemset/problem/767/B | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2250
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:767-A | codeforces | 767-A | Snacktower | https://codeforces.com/problemset/problem/767/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 22760
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:766-E | codeforces | 766-E | Mahmoud and a xor trip | https://codeforces.com/problemset/problem/766/E | [
"bitmasks",
"constructive algorithms",
"data structures",
"dfs and similar",
"dp",
"math",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3507
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:766-D | codeforces | 766-D | Mahmoud and a Dictionary | https://codeforces.com/problemset/problem/766/D | [
"data structures",
"dfs and similar",
"dp",
"dsu",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3939
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:766-C | codeforces | 766-C | Mahmoud and a Message | https://codeforces.com/problemset/problem/766/C | [
"brute force",
"dp",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:766-B | codeforces | 766-B | Mahmoud and a Triangle | https://codeforces.com/problemset/problem/766/B | [
"constructive algorithms",
"geometry",
"greedy",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 38509
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:766-A | codeforces | 766-A | Mahmoud and Longest Uncommon Subsequence | https://codeforces.com/problemset/problem/766/A | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 34786
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:765-G | codeforces | 765-G | Math, math everywhere | https://codeforces.com/problemset/problem/765/G | [
"brute force",
"dp",
"math",
"meet-in-the-middle",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 116
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:765-F | codeforces | 765-F | Souvenirs | https://codeforces.com/problemset/problem/765/F | [
"data structures"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 2586
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:765-E | codeforces | 765-E | Tree Folding | https://codeforces.com/problemset/problem/765/E | [
"dfs and similar",
"dp",
"greedy",
"implementation",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1336
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:765-D | codeforces | 765-D | Artsem and Saunders | https://codeforces.com/problemset/problem/765/D | [
"constructive algorithms",
"dsu",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2600
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:765-C | codeforces | 765-C | Table Tennis Game 2 | https://codeforces.com/problemset/problem/765/C | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7437
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:765-B | codeforces | 765-B | Code obfuscation | https://codeforces.com/problemset/problem/765/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7557
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:765-A | codeforces | 765-A | Neverending competitions | https://codeforces.com/problemset/problem/765/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9582
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:764-B | codeforces | 764-B | Timofey and cubes | https://codeforces.com/problemset/problem/764/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12718
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:764-A | codeforces | 764-A | Taymyr is calling you | https://codeforces.com/problemset/problem/764/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17150
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:763-E | codeforces | 763-E | Timofey and our friends animals | https://codeforces.com/problemset/problem/763/E | [
"data structures",
"divide and conquer",
"dsu"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 553
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:763-D | codeforces | 763-D | Timofey and a flat tree | https://codeforces.com/problemset/problem/763/D | [
"data structures",
"graphs",
"hashing",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 648
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:763-C | codeforces | 763-C | Timofey and remoduling | https://codeforces.com/problemset/problem/763/C | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 782
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:763-B | codeforces | 763-B | Timofey and rectangles | https://codeforces.com/problemset/problem/763/B | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3065
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:763-A | codeforces | 763-A | Timofey and a tree | https://codeforces.com/problemset/problem/763/A | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:762-F | codeforces | 762-F | Tree nesting | https://codeforces.com/problemset/problem/762/F | [
"combinatorics",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 480
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:762-E | codeforces | 762-E | Radio stations | https://codeforces.com/problemset/problem/762/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1651
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:762-D | codeforces | 762-D | Maximum path | https://codeforces.com/problemset/problem/762/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1819
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:762-C | codeforces | 762-C | Two strings | https://codeforces.com/problemset/problem/762/C | [
"binary search",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3000
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:762-B | codeforces | 762-B | USB vs. PS/2 | https://codeforces.com/problemset/problem/762/B | [
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10672
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:762-A | codeforces | 762-A | k-th divisor | https://codeforces.com/problemset/problem/762/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26081
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:761-F | codeforces | 761-F | Dasha and Photos | https://codeforces.com/problemset/problem/761/F | [
"brute force",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 524
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:761-E | codeforces | 761-E | Dasha and Puzzle | https://codeforces.com/problemset/problem/761/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:761-D | codeforces | 761-D | Dasha and Very Difficult Problem | https://codeforces.com/problemset/problem/761/D | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4217
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:761-C | codeforces | 761-C | Dasha and Password | https://codeforces.com/problemset/problem/761/C | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6041
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:761-B | codeforces | 761-B | Dasha and friends | https://codeforces.com/problemset/problem/761/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7058
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:761-A | codeforces | 761-A | Dasha and Stairs | https://codeforces.com/problemset/problem/761/A | [
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15157
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:760-B | codeforces | 760-B | Frodo and pillows | https://codeforces.com/problemset/problem/760/B | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7829
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:760-A | codeforces | 760-A | Petr and a calendar | https://codeforces.com/problemset/problem/760/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8657
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:758-F | codeforces | 758-F | Geometrical Progression | https://codeforces.com/problemset/problem/758/F | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 715
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:758-E | codeforces | 758-E | Broken Tree | https://codeforces.com/problemset/problem/758/E | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:758-D | codeforces | 758-D | Ability To Convert | https://codeforces.com/problemset/problem/758/D | [
"constructive algorithms",
"dp",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2940
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:758-C | codeforces | 758-C | Unfair Poll | https://codeforces.com/problemset/problem/758/C | [
"binary search",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:758-B | codeforces | 758-B | Blown Garland | https://codeforces.com/problemset/problem/758/B | [
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10741
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:758-A | codeforces | 758-A | Holiday Of Equality | https://codeforces.com/problemset/problem/758/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 75714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:757-G | codeforces | 757-G | Can Bash Save the Day? | https://codeforces.com/problemset/problem/757/G | [
"data structures",
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 651
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:757-F | codeforces | 757-F | Team Rocket Rises Again | https://codeforces.com/problemset/problem/757/F | [
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1446
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:757-E | codeforces | 757-E | Bash Plays with Functions | https://codeforces.com/problemset/problem/757/E | [
"brute force",
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1556
} | 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.