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:375-C | codeforces | 375-C | Circling Round Treasures | https://codeforces.com/problemset/problem/375/C | [
"bitmasks",
"shortest paths"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 681
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:375-B | codeforces | 375-B | Maximum Submatrix 2 | https://codeforces.com/problemset/problem/375/B | [
"data structures",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5466
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:375-A | codeforces | 375-A | Divisible by Seven | https://codeforces.com/problemset/problem/375/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5397
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:374-E | codeforces | 374-E | Inna and Babies | https://codeforces.com/problemset/problem/374/E | [
"binary search",
"data structures",
"dsu",
"geometry",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 246
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:374-D | codeforces | 374-D | Inna and Sequence | https://codeforces.com/problemset/problem/374/D | [
"binary search",
"data structures",
"dp",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1039
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:374-C | codeforces | 374-C | Inna and Dima | https://codeforces.com/problemset/problem/374/C | [
"dfs and similar",
"dp",
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3041
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:374-B | codeforces | 374-B | Inna and Nine | https://codeforces.com/problemset/problem/374/B | [
"combinatorics",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3519
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:374-A | codeforces | 374-A | Inna and Pink Pony | https://codeforces.com/problemset/problem/374/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3130
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:373-B | codeforces | 373-B | Making Sequences is Fun | https://codeforces.com/problemset/problem/373/B | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2819
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:373-A | codeforces | 373-A | Collecting Beats is Fun | https://codeforces.com/problemset/problem/373/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11562
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:372-E | codeforces | 372-E | Drawing Circles is Fun | https://codeforces.com/problemset/problem/372/E | [
"combinatorics",
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 290
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:372-D | codeforces | 372-D | Choosing Subtree is Fun | https://codeforces.com/problemset/problem/372/D | [
"binary search",
"data structures",
"dfs and similar",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1190
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:372-C | codeforces | 372-C | Watching Fireworks is Fun | https://codeforces.com/problemset/problem/372/C | [
"data structures",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5157
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:372-B | codeforces | 372-B | Counting Rectangles is Fun | https://codeforces.com/problemset/problem/372/B | [
"brute force",
"divide and conquer",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2867
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:372-A | codeforces | 372-A | Counting Kangaroos is Fun | https://codeforces.com/problemset/problem/372/A | [
"binary search",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15887
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:371-E | codeforces | 371-E | Subway Innovation | https://codeforces.com/problemset/problem/371/E | [
"greedy",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1476
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:371-D | codeforces | 371-D | Vessels | https://codeforces.com/problemset/problem/371/D | [
"data structures",
"dsu",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6801
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:371-C | codeforces | 371-C | Hamburgers | https://codeforces.com/problemset/problem/371/C | [
"binary search",
"brute force"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 36485
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:371-B | codeforces | 371-B | Fox Dividing Cheese | https://codeforces.com/problemset/problem/371/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12691
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:371-A | codeforces | 371-A | K-Periodic Array | https://codeforces.com/problemset/problem/371/A | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 6743
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:370-E | codeforces | 370-E | Summer Reading | https://codeforces.com/problemset/problem/370/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 351
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:370-D | codeforces | 370-D | Broken Monitor | https://codeforces.com/problemset/problem/370/D | [
"brute force",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 723
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:370-C | codeforces | 370-C | Mittens | https://codeforces.com/problemset/problem/370/C | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1752
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:370-B | codeforces | 370-B | Berland Bingo | https://codeforces.com/problemset/problem/370/B | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2700
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:370-A | codeforces | 370-A | Rook, Bishop and King | https://codeforces.com/problemset/problem/370/A | [
"graphs",
"math",
"shortest paths"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12261
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:369-E | codeforces | 369-E | Valera and Queries | https://codeforces.com/problemset/problem/369/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2934
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:369-D | codeforces | 369-D | Valera and Fools | https://codeforces.com/problemset/problem/369/D | [
"dfs and similar",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1330
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:369-C | codeforces | 369-C | Valera and Elections | https://codeforces.com/problemset/problem/369/C | [
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12290
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:369-B | codeforces | 369-B | Valera and Contest | https://codeforces.com/problemset/problem/369/B | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 6924
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:369-A | codeforces | 369-A | Valera and Plates | https://codeforces.com/problemset/problem/369/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12345
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:368-B | codeforces | 368-B | Sereja and Suffixes | https://codeforces.com/problemset/problem/368/B | [
"data structures",
"dp"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 51239
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:368-A | codeforces | 368-A | Sereja and Coat Rack | https://codeforces.com/problemset/problem/368/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 8064
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:367-E | codeforces | 367-E | Sereja and Intervals | https://codeforces.com/problemset/problem/367/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1453
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:367-D | codeforces | 367-D | Sereja and Sets | https://codeforces.com/problemset/problem/367/D | [
"bitmasks",
"dfs and similar"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 720
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:367-C | codeforces | 367-C | Sereja and the Arrangement of Numbers | https://codeforces.com/problemset/problem/367/C | [
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1955
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:367-B | codeforces | 367-B | Sereja ans Anagrams | https://codeforces.com/problemset/problem/367/B | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2740
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:367-A | codeforces | 367-A | Sereja and Algorithm | https://codeforces.com/problemset/problem/367/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4570
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:366-E | codeforces | 366-E | Dima and Magic Guitar | https://codeforces.com/problemset/problem/366/E | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 876
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:366-D | codeforces | 366-D | Dima and Trap Graph | https://codeforces.com/problemset/problem/366/D | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"shortest paths",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1773
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:366-C | codeforces | 366-C | Dima and Salad | https://codeforces.com/problemset/problem/366/C | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6174
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:366-B | codeforces | 366-B | Dima and To-do List | https://codeforces.com/problemset/problem/366/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7199
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:366-A | codeforces | 366-A | Dima and Guards | https://codeforces.com/problemset/problem/366/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4849
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:365-B | codeforces | 365-B | The Fibonacci Segment | https://codeforces.com/problemset/problem/365/B | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15472
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:365-A | codeforces | 365-A | Good Number | https://codeforces.com/problemset/problem/365/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 23419
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:364-E | codeforces | 364-E | Empty Rectangles | https://codeforces.com/problemset/problem/364/E | [
"divide and conquer",
"two pointers"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 742
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:364-D | codeforces | 364-D | Ghd | https://codeforces.com/problemset/problem/364/D | [
"brute force",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 2627
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:364-C | codeforces | 364-C | Beautiful Set | https://codeforces.com/problemset/problem/364/C | [
"brute force",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 656
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:364-B | codeforces | 364-B | Free Market | https://codeforces.com/problemset/problem/364/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1279
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:364-A | codeforces | 364-A | Matrix | https://codeforces.com/problemset/problem/364/A | [
"combinatorics",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4993
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:363-E | codeforces | 363-E | Two Circles | https://codeforces.com/problemset/problem/363/E | [
"brute force",
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 255
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:363-D | codeforces | 363-D | Renting Bikes | https://codeforces.com/problemset/problem/363/D | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4401
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:363-C | codeforces | 363-C | Fixing Typos | https://codeforces.com/problemset/problem/363/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 14230
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:363-B | codeforces | 363-B | Fence | https://codeforces.com/problemset/problem/363/B | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 70380
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:363-A | codeforces | 363-A | Soroban | https://codeforces.com/problemset/problem/363/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11541
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:362-E | codeforces | 362-E | Petya and Pipes | https://codeforces.com/problemset/problem/362/E | [
"flows",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 934
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:362-D | codeforces | 362-D | Fools and Foolproof Roads | https://codeforces.com/problemset/problem/362/D | [
"data structures",
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1117
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:362-C | codeforces | 362-C | Insertion Sort | https://codeforces.com/problemset/problem/362/C | [
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2040
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:362-B | codeforces | 362-B | Petya and Staircases | https://codeforces.com/problemset/problem/362/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14828
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:362-A | codeforces | 362-A | Two Semiknights Meet | https://codeforces.com/problemset/problem/362/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2822
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:361-B | codeforces | 361-B | Levko and Permutation | https://codeforces.com/problemset/problem/361/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8861
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:361-A | codeforces | 361-A | Levko and Table | https://codeforces.com/problemset/problem/361/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17944
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:360-E | codeforces | 360-E | Levko and Game | https://codeforces.com/problemset/problem/360/E | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 847
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:360-D | codeforces | 360-D | Levko and Sets | https://codeforces.com/problemset/problem/360/D | [
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 526
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:360-C | codeforces | 360-C | Levko and Strings | https://codeforces.com/problemset/problem/360/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1277
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:360-B | codeforces | 360-B | Levko and Array | https://codeforces.com/problemset/problem/360/B | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3656
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:360-A | codeforces | 360-A | Levko and Array Recovery | https://codeforces.com/problemset/problem/360/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2147
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:359-E | codeforces | 359-E | Neatness | https://codeforces.com/problemset/problem/359/E | [
"constructive algorithms",
"dfs and similar"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 557
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:359-D | codeforces | 359-D | Pair of Numbers | https://codeforces.com/problemset/problem/359/D | [
"binary search",
"brute force",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 5885
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:359-C | codeforces | 359-C | Prime Number | https://codeforces.com/problemset/problem/359/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3619
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:359-B | codeforces | 359-B | Permutation | https://codeforces.com/problemset/problem/359/B | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8808
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:359-A | codeforces | 359-A | Table | https://codeforces.com/problemset/problem/359/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9205
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:358-E | codeforces | 358-E | Dima and Kicks | https://codeforces.com/problemset/problem/358/E | [
"brute force",
"dsu",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 448
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:358-D | codeforces | 358-D | Dima and Hares | https://codeforces.com/problemset/problem/358/D | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4570
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:358-C | codeforces | 358-C | Dima and Containers | https://codeforces.com/problemset/problem/358/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2346
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:358-B | codeforces | 358-B | Dima and Text Messages | https://codeforces.com/problemset/problem/358/B | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3915
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:358-A | codeforces | 358-A | Dima and Continuous Line | https://codeforces.com/problemset/problem/358/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8187
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:357-B | codeforces | 357-B | Flag Day | https://codeforces.com/problemset/problem/357/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 8598
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:357-A | codeforces | 357-A | Group of Students | https://codeforces.com/problemset/problem/357/A | [
"brute force",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7777
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:356-E | codeforces | 356-E | Xenia and String Problem | https://codeforces.com/problemset/problem/356/E | [
"dp",
"hashing",
"implementation",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 605
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:356-D | codeforces | 356-D | Bags and Coins | https://codeforces.com/problemset/problem/356/D | [
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1144
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:356-C | codeforces | 356-C | Compartments | https://codeforces.com/problemset/problem/356/C | [
"combinatorics",
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1418
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:356-B | codeforces | 356-B | Xenia and Hamming | https://codeforces.com/problemset/problem/356/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2115
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:356-A | codeforces | 356-A | Knight Tournament | https://codeforces.com/problemset/problem/356/A | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 17199
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:355-B | codeforces | 355-B | Vasya and Public Transport | https://codeforces.com/problemset/problem/355/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4931
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:355-A | codeforces | 355-A | Vasya and Digital Root | https://codeforces.com/problemset/problem/355/A | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 9887
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:354-E | codeforces | 354-E | Lucky Number Representation | https://codeforces.com/problemset/problem/354/E | [
"constructive algorithms",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 935
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:354-D | codeforces | 354-D | Transferring Pyramid | https://codeforces.com/problemset/problem/354/D | [
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 529
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:354-C | codeforces | 354-C | Vasya and Beautiful Arrays | https://codeforces.com/problemset/problem/354/C | [
"brute force",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3390
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:354-B | codeforces | 354-B | Game with Strings | https://codeforces.com/problemset/problem/354/B | [
"bitmasks",
"dp",
"games"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 529
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:354-A | codeforces | 354-A | Vasya and Robot | https://codeforces.com/problemset/problem/354/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5680
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:353-E | codeforces | 353-E | Antichain | https://codeforces.com/problemset/problem/353/E | [
"dp",
"graph matchings",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 702
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:353-D | codeforces | 353-D | Queue | https://codeforces.com/problemset/problem/353/D | [
"constructive algorithms",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3221
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:353-C | codeforces | 353-C | Find Maximum | https://codeforces.com/problemset/problem/353/C | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5298
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:353-B | codeforces | 353-B | Two Heaps | https://codeforces.com/problemset/problem/353/B | [
"combinatorics",
"constructive algorithms",
"greedy",
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2446
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:353-A | codeforces | 353-A | Domino | https://codeforces.com/problemset/problem/353/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 20169
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:352-B | codeforces | 352-B | Jeff and Periods | https://codeforces.com/problemset/problem/352/B | [
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18384
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:352-A | codeforces | 352-A | Jeff and Digits | https://codeforces.com/problemset/problem/352/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 29009
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:351-E | codeforces | 351-E | Jeff and Permutation | https://codeforces.com/problemset/problem/351/E | [
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1836
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:351-D | codeforces | 351-D | Jeff and Removing Periods | https://codeforces.com/problemset/problem/351/D | [
"data structures"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1420
} | 2026-08-10T02:20:32.917453+00:00 |
codeforces:351-C | codeforces | 351-C | Jeff and Brackets | https://codeforces.com/problemset/problem/351/C | [
"dp",
"matrices"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 665
} | 2026-08-10T02:20:32.917453+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.