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:272-B | codeforces | 272-B | Dima and Sequence | https://codeforces.com/problemset/problem/272/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4281
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:272-A | codeforces | 272-A | Dima and Friends | https://codeforces.com/problemset/problem/272/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 27563
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:271-E | codeforces | 271-E | Three Horses | https://codeforces.com/problemset/problem/271/E | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 595
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:271-D | codeforces | 271-D | Good Substrings | https://codeforces.com/problemset/problem/271/D | [
"data structures",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 13906
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:271-C | codeforces | 271-C | Secret | https://codeforces.com/problemset/problem/271/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3128
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:271-B | codeforces | 271-B | Prime Matrix | https://codeforces.com/problemset/problem/271/B | [
"binary search",
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15315
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:271-A | codeforces | 271-A | Beautiful Year | https://codeforces.com/problemset/problem/271/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 176524
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:270-B | codeforces | 270-B | Multithreading | https://codeforces.com/problemset/problem/270/B | [
"data structures",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4435
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:270-A | codeforces | 270-A | Fancy Fence | https://codeforces.com/problemset/problem/270/A | [
"geometry",
"implementation",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 50659
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:269-E | codeforces | 269-E | String Theory | https://codeforces.com/problemset/problem/269/E | [
"geometry",
"math",
"strings"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 118
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:269-D | codeforces | 269-D | Maximum Waterfall | https://codeforces.com/problemset/problem/269/D | [
"data structures",
"dp",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 491
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:269-C | codeforces | 269-C | Flawed Flow | https://codeforces.com/problemset/problem/269/C | [
"constructive algorithms",
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1808
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:269-B | codeforces | 269-B | Greenhouse Effect | https://codeforces.com/problemset/problem/269/B | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6970
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:269-A | codeforces | 269-A | Magical Boxes | https://codeforces.com/problemset/problem/269/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3688
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:268-E | codeforces | 268-E | Playlist | https://codeforces.com/problemset/problem/268/E | [
"math",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1133
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:268-D | codeforces | 268-D | Wall Bars | https://codeforces.com/problemset/problem/268/D | [
"dp"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 574
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:268-C | codeforces | 268-C | Beautiful Sets of Points | https://codeforces.com/problemset/problem/268/C | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14617
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:268-B | codeforces | 268-B | Buttons | https://codeforces.com/problemset/problem/268/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 35709
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:268-A | codeforces | 268-A | Games | https://codeforces.com/problemset/problem/268/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 103618
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:267-C | codeforces | 267-C | Berland Traffic | https://codeforces.com/problemset/problem/267/C | [
"math",
"matrices"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 249
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:267-B | codeforces | 267-B | Dominoes | https://codeforces.com/problemset/problem/267/B | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 750
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:267-A | codeforces | 267-A | Subtractions | https://codeforces.com/problemset/problem/267/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9461
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:266-E | codeforces | 266-E | More Queries to Array... | https://codeforces.com/problemset/problem/266/E | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1052
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:266-D | codeforces | 266-D | BerDonalds | https://codeforces.com/problemset/problem/266/D | [
"graphs",
"math",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 981
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:266-C | codeforces | 266-C | Below the Diagonal | https://codeforces.com/problemset/problem/266/C | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1427
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:266-B | codeforces | 266-B | Queue at the School | https://codeforces.com/problemset/problem/266/B | [
"constructive algorithms",
"graph matchings",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 800 | {
"solved_count": 164904
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:266-A | codeforces | 266-A | Stones on the Table | https://codeforces.com/problemset/problem/266/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 241630
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:265-B | codeforces | 265-B | Roadside Trees (Simplified Edition) | https://codeforces.com/problemset/problem/265/B | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17911
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:265-A | codeforces | 265-A | Colorful Stones (Simplified Edition) | https://codeforces.com/problemset/problem/265/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 42482
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:264-E | codeforces | 264-E | Roadside Trees | https://codeforces.com/problemset/problem/264/E | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 469
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:264-D | codeforces | 264-D | Colorful Stones | https://codeforces.com/problemset/problem/264/D | [
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 451
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:264-C | codeforces | 264-C | Choosing Balls | https://codeforces.com/problemset/problem/264/C | [
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3263
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:264-B | codeforces | 264-B | Good Sequences | https://codeforces.com/problemset/problem/264/B | [
"dp",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 11970
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:264-A | codeforces | 264-A | Escape from Stones | https://codeforces.com/problemset/problem/264/A | [
"constructive algorithms",
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11782
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:263-E | codeforces | 263-E | Rhombus | https://codeforces.com/problemset/problem/263/E | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 440
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:263-D | codeforces | 263-D | Cycle in Graph | https://codeforces.com/problemset/problem/263/D | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4460
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:263-C | codeforces | 263-C | Circle of Numbers | https://codeforces.com/problemset/problem/263/C | [
"brute force",
"dfs and similar",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1130
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:263-B | codeforces | 263-B | Squares | https://codeforces.com/problemset/problem/263/B | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9751
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:263-A | codeforces | 263-A | Beautiful Matrix | https://codeforces.com/problemset/problem/263/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 314777
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:262-B | codeforces | 262-B | Roma and Changing Signs | https://codeforces.com/problemset/problem/262/B | [
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 12291
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:262-A | codeforces | 262-A | Roma and Lucky Numbers | https://codeforces.com/problemset/problem/262/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 22079
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:261-E | codeforces | 261-E | Maxim and Calculator | https://codeforces.com/problemset/problem/261/E | [
"brute force",
"dp",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 438
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:261-D | codeforces | 261-D | Maxim and Increasing Subsequence | https://codeforces.com/problemset/problem/261/D | [
"dp"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 708
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:261-C | codeforces | 261-C | Maxim and Matrix | https://codeforces.com/problemset/problem/261/C | [
"constructive algorithms",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 828
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:261-B | codeforces | 261-B | Maxim and Restaurant | https://codeforces.com/problemset/problem/261/B | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1595
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:261-A | codeforces | 261-A | Maxim and Discounts | https://codeforces.com/problemset/problem/261/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5588
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:260-E | codeforces | 260-E | Dividing Kingdom | https://codeforces.com/problemset/problem/260/E | [
"binary search",
"brute force",
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 501
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:260-D | codeforces | 260-D | Black and White Tree | https://codeforces.com/problemset/problem/260/D | [
"constructive algorithms",
"dsu",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1660
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:260-C | codeforces | 260-C | Balls and Boxes | https://codeforces.com/problemset/problem/260/C | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3222
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:260-B | codeforces | 260-B | Ancient Prophesy | https://codeforces.com/problemset/problem/260/B | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4071
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:260-A | codeforces | 260-A | Adding Digits | https://codeforces.com/problemset/problem/260/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16542
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:259-B | codeforces | 259-B | Little Elephant and Magic Square | https://codeforces.com/problemset/problem/259/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14684
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:259-A | codeforces | 259-A | Little Elephant and Chess | https://codeforces.com/problemset/problem/259/A | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 10016
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:258-E | codeforces | 258-E | Little Elephant and Tree | https://codeforces.com/problemset/problem/258/E | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1309
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:258-D | codeforces | 258-D | Little Elephant and Broken Sorting | https://codeforces.com/problemset/problem/258/D | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1412
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:258-C | codeforces | 258-C | Little Elephant and LCM | https://codeforces.com/problemset/problem/258/C | [
"binary search",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1945
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:258-B | codeforces | 258-B | Little Elephant and Elections | https://codeforces.com/problemset/problem/258/B | [
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1597
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:258-A | codeforces | 258-A | Little Elephant and Bits | https://codeforces.com/problemset/problem/258/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 26400
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:257-E | codeforces | 257-E | Greedy Elevator | https://codeforces.com/problemset/problem/257/E | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 343
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:257-D | codeforces | 257-D | Sum | https://codeforces.com/problemset/problem/257/D | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1712
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:257-C | codeforces | 257-C | View Angle | https://codeforces.com/problemset/problem/257/C | [
"brute force",
"geometry",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4698
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:257-B | codeforces | 257-B | Playing Cubes | https://codeforces.com/problemset/problem/257/B | [
"games",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7744
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:257-A | codeforces | 257-A | Sockets | https://codeforces.com/problemset/problem/257/A | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 6902
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:256-E | codeforces | 256-E | Lucky Arrays | https://codeforces.com/problemset/problem/256/E | [
"data structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 709
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:256-D | codeforces | 256-D | Liars and Serge | https://codeforces.com/problemset/problem/256/D | [
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 279
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:255-E | codeforces | 255-E | Furlo and Rublo and Game | https://codeforces.com/problemset/problem/255/E | [
"games",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 972
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:255-D | codeforces | 255-D | Mr. Bender and Square | https://codeforces.com/problemset/problem/255/D | [
"binary search",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2170
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:255-C | codeforces | 255-C | Almost Arithmetical Progression | https://codeforces.com/problemset/problem/255/C | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5028
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:255-B | codeforces | 255-B | Code Parsing | https://codeforces.com/problemset/problem/255/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5447
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:255-A | codeforces | 255-A | Greg's Workout | https://codeforces.com/problemset/problem/255/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31127
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:254-E | codeforces | 254-E | Dormitory | https://codeforces.com/problemset/problem/254/E | [
"dp",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 722
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:254-D | codeforces | 254-D | Rats | https://codeforces.com/problemset/problem/254/D | [
"brute force",
"dfs and similar",
"graphs",
"implementation",
"shortest paths"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 645
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:254-C | codeforces | 254-C | Anagram | https://codeforces.com/problemset/problem/254/C | [
"greedy",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1601
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:254-B | codeforces | 254-B | Jury Size | https://codeforces.com/problemset/problem/254/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2266
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:254-A | codeforces | 254-A | Cards with Numbers | https://codeforces.com/problemset/problem/254/A | [
"constructive algorithms",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7712
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:253-E | codeforces | 253-E | Printer | https://codeforces.com/problemset/problem/253/E | [
"binary search",
"data structures",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 583
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:253-D | codeforces | 253-D | Table with Letters - 2 | https://codeforces.com/problemset/problem/253/D | [
"brute force",
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 921
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:253-C | codeforces | 253-C | Text Editor | https://codeforces.com/problemset/problem/253/C | [
"data structures",
"dfs and similar",
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2893
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:253-B | codeforces | 253-B | Physics Practical | https://codeforces.com/problemset/problem/253/B | [
"binary search",
"dp",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12212
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:253-A | codeforces | 253-A | Boys and Girls | https://codeforces.com/problemset/problem/253/A | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12129
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:252-B | codeforces | 252-B | Unsorting Array | https://codeforces.com/problemset/problem/252/B | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1867
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:252-A | codeforces | 252-A | Little Xor | https://codeforces.com/problemset/problem/252/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 5836
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:251-E | codeforces | 251-E | Tree and Table | https://codeforces.com/problemset/problem/251/E | [
"dfs and similar",
"dp",
"implementation",
"trees"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 204
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:251-D | codeforces | 251-D | Two Sets | https://codeforces.com/problemset/problem/251/D | [
"bitmasks",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 581
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:251-C | codeforces | 251-C | Number Transformation | https://codeforces.com/problemset/problem/251/C | [
"dp",
"greedy",
"number theory"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1121
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:251-B | codeforces | 251-B | Playing with Permutations | https://codeforces.com/problemset/problem/251/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1372
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:251-A | codeforces | 251-A | Points on Line | https://codeforces.com/problemset/problem/251/A | [
"binary search",
"combinatorics",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 21037
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:250-E | codeforces | 250-E | Mad Joe | https://codeforces.com/problemset/problem/250/E | [
"brute force"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 502
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:250-D | codeforces | 250-D | Building Bridge | https://codeforces.com/problemset/problem/250/D | [
"geometry",
"ternary search",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1006
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:250-C | codeforces | 250-C | Movie Critics | https://codeforces.com/problemset/problem/250/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2224
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:250-B | codeforces | 250-B | Restoring IPv6 | https://codeforces.com/problemset/problem/250/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2229
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:250-A | codeforces | 250-A | Paper Work | https://codeforces.com/problemset/problem/250/A | [
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 4782
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:249-E | codeforces | 249-E | Endless Matrix | https://codeforces.com/problemset/problem/249/E | [
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 354
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:249-D | codeforces | 249-D | Donkey and Stars | https://codeforces.com/problemset/problem/249/D | [
"data structures",
"dp",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 506
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:248-E | codeforces | 248-E | Piglet's Birthday | https://codeforces.com/problemset/problem/248/E | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 635
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:248-D | codeforces | 248-D | Sweets for Everyone! | https://codeforces.com/problemset/problem/248/D | [
"binary search",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 528
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:248-C | codeforces | 248-C | Robo-Footballer | https://codeforces.com/problemset/problem/248/C | [
"binary search",
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 898
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:248-B | codeforces | 248-B | Chilly Willy | https://codeforces.com/problemset/problem/248/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5795
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:248-A | codeforces | 248-A | Cupboards | https://codeforces.com/problemset/problem/248/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24996
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:246-E | codeforces | 246-E | Blood Cousins Return | https://codeforces.com/problemset/problem/246/E | [
"binary search",
"data structures",
"dfs and similar",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 4454
} | 2026-04-13T03:38:27.662191+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.