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:296-B | codeforces | 296-B | Yaroslav and Two Strings | https://codeforces.com/problemset/problem/296/B | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2664
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:296-A | codeforces | 296-A | Yaroslav and Permutations | https://codeforces.com/problemset/problem/296/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 25939
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:295-E | codeforces | 295-E | Yaroslav and Points | https://codeforces.com/problemset/problem/295/E | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 813
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:295-D | codeforces | 295-D | Greg and Caves | https://codeforces.com/problemset/problem/295/D | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 737
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:295-C | codeforces | 295-C | Greg and Friends | https://codeforces.com/problemset/problem/295/C | [
"combinatorics",
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1928
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:295-B | codeforces | 295-B | Greg and Graph | https://codeforces.com/problemset/problem/295/B | [
"dp",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 17360
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:295-A | codeforces | 295-A | Greg and Array | https://codeforces.com/problemset/problem/295/A | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 25730
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:294-E | codeforces | 294-E | Shaass the Great | https://codeforces.com/problemset/problem/294/E | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1110
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:294-D | codeforces | 294-D | Shaass and Painter Robot | https://codeforces.com/problemset/problem/294/D | [
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 378
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:294-C | codeforces | 294-C | Shaass and Lights | https://codeforces.com/problemset/problem/294/C | [
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4307
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:294-B | codeforces | 294-B | Shaass and Bookshelf | https://codeforces.com/problemset/problem/294/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5028
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:294-A | codeforces | 294-A | Shaass and Oskols | https://codeforces.com/problemset/problem/294/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 28236
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:293-E | codeforces | 293-E | Close Vertices | https://codeforces.com/problemset/problem/293/E | [
"data structures",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1957
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:293-D | codeforces | 293-D | Ksusha and Square | https://codeforces.com/problemset/problem/293/D | [
"geometry",
"math",
"probabilities",
"two pointers"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 260
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:293-C | codeforces | 293-C | Cube Problem | https://codeforces.com/problemset/problem/293/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 628
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:293-B | codeforces | 293-B | Distinct Paths | https://codeforces.com/problemset/problem/293/B | [
"brute force",
"combinatorics"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 940
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:293-A | codeforces | 293-A | Weird Game | https://codeforces.com/problemset/problem/293/A | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3182
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:292-E | codeforces | 292-E | Copying Data | https://codeforces.com/problemset/problem/292/E | [
"data structures"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4841
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:292-D | codeforces | 292-D | Connected Components | https://codeforces.com/problemset/problem/292/D | [
"data structures",
"dfs and similar",
"dp",
"dsu"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2759
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:292-C | codeforces | 292-C | Beautiful IP Addresses | https://codeforces.com/problemset/problem/292/C | [
"brute force"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1308
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:292-B | codeforces | 292-B | Network Topology | https://codeforces.com/problemset/problem/292/B | [
"graphs",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10419
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:292-A | codeforces | 292-A | SMSC | https://codeforces.com/problemset/problem/292/A | [
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 2849
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:291-E | codeforces | 291-E | Tree-String Problem | https://codeforces.com/problemset/problem/291/E | [
"*special",
"dfs and similar",
"hashing",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1554
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:291-D | codeforces | 291-D | Parallel Programming | https://codeforces.com/problemset/problem/291/D | [
"*special",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1535
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:291-C | codeforces | 291-C | Network Mask | https://codeforces.com/problemset/problem/291/C | [
"*special",
"bitmasks",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1847
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:291-B | codeforces | 291-B | Command Line Arguments | https://codeforces.com/problemset/problem/291/B | [
"*special",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3080
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:291-A | codeforces | 291-A | Spyke Talks | https://codeforces.com/problemset/problem/291/A | [
"*special",
"implementation",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 6463
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:290-F | codeforces | 290-F | Greedy Petya | https://codeforces.com/problemset/problem/290/F | [
"*special",
"dfs and similar",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 153
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:290-E | codeforces | 290-E | HQ | https://codeforces.com/problemset/problem/290/E | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 225
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:290-D | codeforces | 290-D | Orange | https://codeforces.com/problemset/problem/290/D | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1899
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:290-C | codeforces | 290-C | WTF? | https://codeforces.com/problemset/problem/290/C | [
"*special",
"graph matchings",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1666
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:290-B | codeforces | 290-B | QR code | https://codeforces.com/problemset/problem/290/B | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 2610
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:290-A | codeforces | 290-A | Mysterious strings | https://codeforces.com/problemset/problem/290/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3229
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:289-B | codeforces | 289-B | Polo the Penguin and Matrix | https://codeforces.com/problemset/problem/289/B | [
"brute force",
"dp",
"implementation",
"sortings",
"ternary search"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 18921
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:289-A | codeforces | 289-A | Polo the Penguin and Segments | https://codeforces.com/problemset/problem/289/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10289
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:288-E | codeforces | 288-E | Polo the Penguin and Lucky Numbers | https://codeforces.com/problemset/problem/288/E | [
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 346
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:288-D | codeforces | 288-D | Polo the Penguin and Trees | https://codeforces.com/problemset/problem/288/D | [
"combinatorics",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 834
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:288-C | codeforces | 288-C | Polo the Penguin and XOR operation | https://codeforces.com/problemset/problem/288/C | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2448
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:288-B | codeforces | 288-B | Polo the Penguin and Houses | https://codeforces.com/problemset/problem/288/B | [
"combinatorics"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3197
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:288-A | codeforces | 288-A | Polo the Penguin and Strings | https://codeforces.com/problemset/problem/288/A | [
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6740
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:287-B | codeforces | 287-B | Pipeline | https://codeforces.com/problemset/problem/287/B | [
"binary search",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 11488
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:287-A | codeforces | 287-A | IQ Test | https://codeforces.com/problemset/problem/287/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21922
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:286-E | codeforces | 286-E | Ladies' Shop | https://codeforces.com/problemset/problem/286/E | [
"constructive algorithms",
"fft",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1016
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:286-D | codeforces | 286-D | Tourists | https://codeforces.com/problemset/problem/286/D | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 453
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:286-C | codeforces | 286-C | Main Sequence | https://codeforces.com/problemset/problem/286/C | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1596
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:286-B | codeforces | 286-B | Shifting | https://codeforces.com/problemset/problem/286/B | [
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1170
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:286-A | codeforces | 286-A | Lucky Permutation | https://codeforces.com/problemset/problem/286/A | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3440
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:285-E | codeforces | 285-E | Positions in Permutations | https://codeforces.com/problemset/problem/285/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1287
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:285-D | codeforces | 285-D | Permutation Sum | https://codeforces.com/problemset/problem/285/D | [
"bitmasks",
"combinatorics",
"dp",
"implementation",
"meet-in-the-middle"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1671
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:285-C | codeforces | 285-C | Building Permutation | https://codeforces.com/problemset/problem/285/C | [
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 26273
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:285-B | codeforces | 285-B | Find Marble | https://codeforces.com/problemset/problem/285/B | [
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 15684
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:285-A | codeforces | 285-A | Slightly Decreasing Permutations | https://codeforces.com/problemset/problem/285/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 14118
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:284-B | codeforces | 284-B | Cows and Poker Game | https://codeforces.com/problemset/problem/284/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7352
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:284-A | codeforces | 284-A | Cows and Primitive Roots | https://codeforces.com/problemset/problem/284/A | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 7314
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:283-E | codeforces | 283-E | Cow Tennis Tournament | https://codeforces.com/problemset/problem/283/E | [
"combinatorics",
"data structures",
"math"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 850
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:283-D | codeforces | 283-D | Cows and Cool Sequences | https://codeforces.com/problemset/problem/283/D | [
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 639
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:283-C | codeforces | 283-C | Coin Troubles | https://codeforces.com/problemset/problem/283/C | [
"dp"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1558
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:283-B | codeforces | 283-B | Cow Program | https://codeforces.com/problemset/problem/283/B | [
"dfs and similar",
"dp",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3921
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:283-A | codeforces | 283-A | Cows and Sequence | https://codeforces.com/problemset/problem/283/A | [
"constructive algorithms",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6865
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:282-E | codeforces | 282-E | Sausage Maximization | https://codeforces.com/problemset/problem/282/E | [
"bitmasks",
"data structures",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 4289
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:282-D | codeforces | 282-D | Yet Another Number Game | https://codeforces.com/problemset/problem/282/D | [
"dp",
"games"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1604
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:282-C | codeforces | 282-C | XOR and OR | https://codeforces.com/problemset/problem/282/C | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10157
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:282-B | codeforces | 282-B | Painting Eggs | https://codeforces.com/problemset/problem/282/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13950
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:282-A | codeforces | 282-A | Bit++ | https://codeforces.com/problemset/problem/282/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 355313
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:281-B | codeforces | 281-B | Nearest Fraction | https://codeforces.com/problemset/problem/281/B | [
"brute force",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3223
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:281-A | codeforces | 281-A | Word Capitalization | https://codeforces.com/problemset/problem/281/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 268866
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:280-E | codeforces | 280-E | Sequence Transformation | https://codeforces.com/problemset/problem/280/E | [
"brute force",
"data structures",
"dp",
"implementation",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 258
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:280-D | codeforces | 280-D | k-Maximum Subsequence Sum | https://codeforces.com/problemset/problem/280/D | [
"data structures",
"flows",
"graphs",
"implementation"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1640
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:280-C | codeforces | 280-C | Game on Tree | https://codeforces.com/problemset/problem/280/C | [
"implementation",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 5073
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:280-B | codeforces | 280-B | Maximum Xor Secondary | https://codeforces.com/problemset/problem/280/B | [
"data structures",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5181
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:280-A | codeforces | 280-A | Rectangle Puzzle | https://codeforces.com/problemset/problem/280/A | [
"geometry"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1577
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:279-E | codeforces | 279-E | Beautiful Decomposition | https://codeforces.com/problemset/problem/279/E | [
"dp",
"games",
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1588
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:279-D | codeforces | 279-D | The Minimum Number of Variables | https://codeforces.com/problemset/problem/279/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 849
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:279-C | codeforces | 279-C | Ladder | https://codeforces.com/problemset/problem/279/C | [
"dp",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8898
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:279-B | codeforces | 279-B | Books | https://codeforces.com/problemset/problem/279/B | [
"binary search",
"brute force",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 71413
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:279-A | codeforces | 279-A | Point on Spiral | https://codeforces.com/problemset/problem/279/A | [
"brute force",
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 5903
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:278-B | codeforces | 278-B | New Problem | https://codeforces.com/problemset/problem/278/B | [
"brute force",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 3632
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:278-A | codeforces | 278-A | Circle Line | https://codeforces.com/problemset/problem/278/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 12804
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:277-E | codeforces | 277-E | Binary Tree on Plane | https://codeforces.com/problemset/problem/277/E | [
"flows",
"trees"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1473
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:277-D | codeforces | 277-D | Google Code Jam | https://codeforces.com/problemset/problem/277/D | [
"dp",
"probabilities"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 372
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:277-C | codeforces | 277-C | Game | https://codeforces.com/problemset/problem/277/C | [
"games",
"implementation"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 484
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:277-B | codeforces | 277-B | Set of Points | https://codeforces.com/problemset/problem/277/B | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 846
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:277-A | codeforces | 277-A | Learning Languages | https://codeforces.com/problemset/problem/277/A | [
"dfs and similar",
"dsu"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 21439
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:276-E | codeforces | 276-E | Little Girl and Problem on Trees | https://codeforces.com/problemset/problem/276/E | [
"data structures",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1847
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:276-D | codeforces | 276-D | Little Girl and Maximum XOR | https://codeforces.com/problemset/problem/276/D | [
"bitmasks",
"dp",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 16276
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:276-C | codeforces | 276-C | Little Girl and Maximum Sum | https://codeforces.com/problemset/problem/276/C | [
"data structures",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 39079
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:276-B | codeforces | 276-B | Little Girl and Game | https://codeforces.com/problemset/problem/276/B | [
"games",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 31998
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:276-A | codeforces | 276-A | Lunch Rush | https://codeforces.com/problemset/problem/276/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30000
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:275-B | codeforces | 275-B | Convex Shape | https://codeforces.com/problemset/problem/275/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3038
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:275-A | codeforces | 275-A | Lights Out | https://codeforces.com/problemset/problem/275/A | [
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 36300
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:274-E | codeforces | 274-E | Mirror Room | https://codeforces.com/problemset/problem/274/E | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 341
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:274-D | codeforces | 274-D | Lovely Matrix | https://codeforces.com/problemset/problem/274/D | [
"dfs and similar",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1149
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:274-C | codeforces | 274-C | The Last Hole! | https://codeforces.com/problemset/problem/274/C | [
"brute force",
"geometry"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 371
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:274-B | codeforces | 274-B | Zero Tree | https://codeforces.com/problemset/problem/274/B | [
"dfs and similar",
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 5554
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:274-A | codeforces | 274-A | k-Multiple Free Set | https://codeforces.com/problemset/problem/274/A | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10786
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:273-E | codeforces | 273-E | Dima and Game | https://codeforces.com/problemset/problem/273/E | [
"dp",
"games"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 395
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:273-D | codeforces | 273-D | Dima and Figure | https://codeforces.com/problemset/problem/273/D | [
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 477
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:272-E | codeforces | 272-E | Dima and Horses | https://codeforces.com/problemset/problem/272/E | [
"combinatorics",
"constructive algorithms",
"graphs"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1291
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:272-D | codeforces | 272-D | Dima and Two Sequences | https://codeforces.com/problemset/problem/272/D | [
"combinatorics",
"math",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2823
} | 2026-04-13T03:38:27.662191+00:00 |
codeforces:272-C | codeforces | 272-C | Dima and Staircase | https://codeforces.com/problemset/problem/272/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7180
} | 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.