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:1555-B | codeforces | 1555-B | Two Tables | https://codeforces.com/problemset/problem/1555/B | [
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 17289
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1555-A | codeforces | 1555-A | PizzaForces | https://codeforces.com/problemset/problem/1555/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 30410
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1554-E | codeforces | 1554-E | You | https://codeforces.com/problemset/problem/1554/E | [
"dfs and similar",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1386
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1554-D | codeforces | 1554-D | Diane | https://codeforces.com/problemset/problem/1554/D | [
"constructive algorithms",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 10598
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1554-C | codeforces | 1554-C | Mikasa | https://codeforces.com/problemset/problem/1554/C | [
"binary search",
"bitmasks",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9811
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1554-B | codeforces | 1554-B | Cobb | https://codeforces.com/problemset/problem/1554/B | [
"bitmasks",
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1554-A | codeforces | 1554-A | Cherry | https://codeforces.com/problemset/problem/1554/A | [
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-I | codeforces | 1553-I | Stairs | https://codeforces.com/problemset/problem/1553/I | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 317
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-H | codeforces | 1553-H | XOR and Distance | https://codeforces.com/problemset/problem/1553/H | [
"bitmasks",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 855
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-G | codeforces | 1553-G | Common Divisor Graph | https://codeforces.com/problemset/problem/1553/G | [
"brute force",
"constructive algorithms",
"dsu",
"graphs",
"hashing",
"math",
"number theory"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1219
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-F | codeforces | 1553-F | Pairwise Modulo | https://codeforces.com/problemset/problem/1553/F | [
"data structures",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2533
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-E | codeforces | 1553-E | Permutation Shift | https://codeforces.com/problemset/problem/1553/E | [
"brute force",
"combinatorics",
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3788
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-D | codeforces | 1553-D | Backspace | https://codeforces.com/problemset/problem/1553/D | [
"dp",
"greedy",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 15138
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-C | codeforces | 1553-C | Penalty | https://codeforces.com/problemset/problem/1553/C | [
"bitmasks",
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 19858
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-B | codeforces | 1553-B | Reverse String | https://codeforces.com/problemset/problem/1553/B | [
"brute force",
"dp",
"hashing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15519
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1553-A | codeforces | 1553-A | Digits Sum | https://codeforces.com/problemset/problem/1553/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 34352
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-I | codeforces | 1552-I | Organizing a Music Festival | https://codeforces.com/problemset/problem/1552/I | [
"dfs and similar",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 148
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-H | codeforces | 1552-H | Guess the Perimeter | https://codeforces.com/problemset/problem/1552/H | [
"binary search",
"interactive",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 465
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-G | codeforces | 1552-G | A Serious Referee | https://codeforces.com/problemset/problem/1552/G | [
"bitmasks",
"brute force",
"dfs and similar",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 671
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-F | codeforces | 1552-F | Telepanting | https://codeforces.com/problemset/problem/1552/F | [
"binary search",
"data structures",
"dp",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 3345
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-E | codeforces | 1552-E | Colors and Intervals | https://codeforces.com/problemset/problem/1552/E | [
"constructive algorithms",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2130
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-D | codeforces | 1552-D | Array Differentiation | https://codeforces.com/problemset/problem/1552/D | [
"bitmasks",
"brute force",
"constructive algorithms",
"dfs and similar",
"dp",
"graphs",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7911
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-C | codeforces | 1552-C | Maximize the Intersections | https://codeforces.com/problemset/problem/1552/C | [
"combinatorics",
"constructive algorithms",
"geometry",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 6296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-B | codeforces | 1552-B | Running for Gold | https://codeforces.com/problemset/problem/1552/B | [
"combinatorics",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1552-A | codeforces | 1552-A | Subsequence Permutation | https://codeforces.com/problemset/problem/1552/A | [
"sortings",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 25391
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1551-F | codeforces | 1551-F | Equidistant Vertices | https://codeforces.com/problemset/problem/1551/F | [
"brute force",
"combinatorics",
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2188
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1551-E | codeforces | 1551-E | Fixed Points | https://codeforces.com/problemset/problem/1551/E | [
"binary search",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 4568
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1551-D2 | codeforces | 1551-D2 | Domino (hard version) | https://codeforces.com/problemset/problem/1551/D2 | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2992
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1551-D1 | codeforces | 1551-D1 | Domino (easy version) | https://codeforces.com/problemset/problem/1551/D1 | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7586
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1551-C | codeforces | 1551-C | Interesting Story | https://codeforces.com/problemset/problem/1551/C | [
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14583
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1551-B2 | codeforces | 1551-B2 | Wonderful Coloring - 2 | https://codeforces.com/problemset/problem/1551/B2 | [
"binary search",
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 16705
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1551-B1 | codeforces | 1551-B1 | Wonderful Coloring - 1 | https://codeforces.com/problemset/problem/1551/B1 | [
"greedy",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 31380
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1551-A | codeforces | 1551-A | Polycarp and Coins | https://codeforces.com/problemset/problem/1551/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 58605
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1550-F | codeforces | 1550-F | Jumping Around | https://codeforces.com/problemset/problem/1550/F | [
"binary search",
"data structures",
"divide and conquer",
"dp",
"dsu",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 902
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1550-E | codeforces | 1550-E | Stringforces | https://codeforces.com/problemset/problem/1550/E | [
"binary search",
"bitmasks",
"brute force",
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1844
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1550-D | codeforces | 1550-D | Excellent Arrays | https://codeforces.com/problemset/problem/1550/D | [
"binary search",
"combinatorics",
"constructive algorithms",
"implementation",
"math",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2063
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1550-C | codeforces | 1550-C | Manhattan Subarrays | https://codeforces.com/problemset/problem/1550/C | [
"brute force",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 10868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1550-B | codeforces | 1550-B | Maximum Cost Deletion | https://codeforces.com/problemset/problem/1550/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 28610
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1550-A | codeforces | 1550-A | Find The Array | https://codeforces.com/problemset/problem/1550/A | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29500
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1549-B | codeforces | 1549-B | Gregor and the Pawn Game | https://codeforces.com/problemset/problem/1549/B | [
"dfs and similar",
"dp",
"flows",
"graph matchings",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26949
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1549-A | codeforces | 1549-A | Gregor and Cryptography | https://codeforces.com/problemset/problem/1549/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 35666
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1548-E | codeforces | 1548-E | Gregor and the Two Painters | https://codeforces.com/problemset/problem/1548/E | [
"data structures",
"divide and conquer",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 602
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1548-D2 | codeforces | 1548-D2 | Gregor and the Odd Cows (Hard) | https://codeforces.com/problemset/problem/1548/D2 | [
"brute force",
"geometry",
"math",
"number theory"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1548-D1 | codeforces | 1548-D1 | Gregor and the Odd Cows (Easy) | https://codeforces.com/problemset/problem/1548/D1 | [
"bitmasks",
"geometry",
"math",
"number theory"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1625
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1548-C | codeforces | 1548-C | The Three Little Pigs | https://codeforces.com/problemset/problem/1548/C | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2050
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1548-B | codeforces | 1548-B | Integers Have Friends | https://codeforces.com/problemset/problem/1548/B | [
"binary search",
"data structures",
"divide and conquer",
"math",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 11406
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1548-A | codeforces | 1548-A | Web of Lies | https://codeforces.com/problemset/problem/1548/A | [
"brute force",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 17763
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1547-G | codeforces | 1547-G | How Many Paths? | https://codeforces.com/problemset/problem/1547/G | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3561
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1547-F | codeforces | 1547-F | Array Stabilization (GCD version) | https://codeforces.com/problemset/problem/1547/F | [
"binary search",
"brute force",
"data structures",
"divide and conquer",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 7016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1547-E | codeforces | 1547-E | Air Conditioners | https://codeforces.com/problemset/problem/1547/E | [
"data structures",
"dp",
"implementation",
"shortest paths",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 16452
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1547-D | codeforces | 1547-D | Co-growing Sequence | https://codeforces.com/problemset/problem/1547/D | [
"bitmasks",
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 18660
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1547-C | codeforces | 1547-C | Pair Programming | https://codeforces.com/problemset/problem/1547/C | [
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 24468
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1547-B | codeforces | 1547-B | Alphabetical Strings | https://codeforces.com/problemset/problem/1547/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 27947
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1547-A | codeforces | 1547-A | Shortest Path with Obstacle | https://codeforces.com/problemset/problem/1547/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32342
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1546-B | codeforces | 1546-B | AquaMoon and Stolen String | https://codeforces.com/problemset/problem/1546/B | [
"interactive",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 13971
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1546-A | codeforces | 1546-A | AquaMoon and Two Arrays | https://codeforces.com/problemset/problem/1546/A | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18595
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1545-F | codeforces | 1545-F | AquaMoon and Potatoes | https://codeforces.com/problemset/problem/1545/F | [
"brute force",
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 130
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1545-E2 | codeforces | 1545-E2 | AquaMoon and Time Stop (hard version) | https://codeforces.com/problemset/problem/1545/E2 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 101
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1545-E1 | codeforces | 1545-E1 | AquaMoon and Time Stop (easy version) | https://codeforces.com/problemset/problem/1545/E1 | [
"data structures",
"dp"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 100
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1545-D | codeforces | 1545-D | AquaMoon and Wrong Coordinate | https://codeforces.com/problemset/problem/1545/D | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 609
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1545-C | codeforces | 1545-C | AquaMoon and Permutations | https://codeforces.com/problemset/problem/1545/C | [
"2-sat",
"brute force",
"combinatorics",
"constructive algorithms",
"graph matchings",
"graphs"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 769
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1545-B | codeforces | 1545-B | AquaMoon and Chess | https://codeforces.com/problemset/problem/1545/B | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 6791
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1545-A | codeforces | 1545-A | AquaMoon and Strange Sort | https://codeforces.com/problemset/problem/1545/A | [
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14918
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1543-E | codeforces | 1543-E | The Final Pursuit | https://codeforces.com/problemset/problem/1543/E | [
"bitmasks",
"constructive algorithms",
"divide and conquer",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 452
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1543-D2 | codeforces | 1543-D2 | RPD and Rap Sheet (Hard Version) | https://codeforces.com/problemset/problem/1543/D2 | [
"brute force",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2174
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1543-D1 | codeforces | 1543-D1 | RPD and Rap Sheet (Easy Version) | https://codeforces.com/problemset/problem/1543/D1 | [
"bitmasks",
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8024
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1543-C | codeforces | 1543-C | Need for Pink Slips | https://codeforces.com/problemset/problem/1543/C | [
"bitmasks",
"brute force",
"dfs and similar",
"implementation",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5635
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1543-B | codeforces | 1543-B | Customising the Track | https://codeforces.com/problemset/problem/1543/B | [
"combinatorics",
"greedy",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 24537
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1543-A | codeforces | 1543-A | Exciting Bets | https://codeforces.com/problemset/problem/1543/A | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 900 | {
"solved_count": 41637
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1542-E2 | codeforces | 1542-E2 | Abnormal Permutation Pairs (hard version) | https://codeforces.com/problemset/problem/1542/E2 | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 1020
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1542-E1 | codeforces | 1542-E1 | Abnormal Permutation Pairs (easy version) | https://codeforces.com/problemset/problem/1542/E1 | [
"combinatorics",
"dp",
"fft",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1441
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1542-D | codeforces | 1542-D | Priority Queue | https://codeforces.com/problemset/problem/1542/D | [
"combinatorics",
"dp",
"implementation",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2925
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1542-C | codeforces | 1542-C | Strange Function | https://codeforces.com/problemset/problem/1542/C | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1542-B | codeforces | 1542-B | Plus and Multiply | https://codeforces.com/problemset/problem/1542/B | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 26653
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1542-A | codeforces | 1542-A | Odd Set | https://codeforces.com/problemset/problem/1542/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 51848
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1541-B | codeforces | 1541-B | Pleasant Pairs | https://codeforces.com/problemset/problem/1541/B | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 38942
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1541-A | codeforces | 1541-A | Pretty Permutations | https://codeforces.com/problemset/problem/1541/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 30758
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1540-E | codeforces | 1540-E | Tasty Dishes | https://codeforces.com/problemset/problem/1540/E | [
"math",
"matrices"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 134
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1540-D | codeforces | 1540-D | Inverse Inversions | https://codeforces.com/problemset/problem/1540/D | [
"binary search",
"brute force",
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 387
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1540-C2 | codeforces | 1540-C2 | Converging Array (Hard Version) | https://codeforces.com/problemset/problem/1540/C2 | [
"dp",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 560
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1540-C1 | codeforces | 1540-C1 | Converging Array (Easy Version) | https://codeforces.com/problemset/problem/1540/C1 | [
"dp",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 754
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1540-B | codeforces | 1540-B | Tree Array | https://codeforces.com/problemset/problem/1540/B | [
"brute force",
"combinatorics",
"dp",
"graphs",
"math",
"probabilities",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1540-A | codeforces | 1540-A | Great Graphs | https://codeforces.com/problemset/problem/1540/A | [
"constructive algorithms",
"graphs",
"greedy",
"shortest paths",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15016
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1539-F | codeforces | 1539-F | Strange Array | https://codeforces.com/problemset/problem/1539/F | [
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 986
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1539-E | codeforces | 1539-E | Game with Cards | https://codeforces.com/problemset/problem/1539/E | [
"binary search",
"constructive algorithms",
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1056
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1539-D | codeforces | 1539-D | PriceFixed | https://codeforces.com/problemset/problem/1539/D | [
"binary search",
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12777
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1539-C | codeforces | 1539-C | Stable Groups | https://codeforces.com/problemset/problem/1539/C | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 31887
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1539-B | codeforces | 1539-B | Love Song | https://codeforces.com/problemset/problem/1539/B | [
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 26809
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1539-A | codeforces | 1539-A | Contest Start | https://codeforces.com/problemset/problem/1539/A | [
"combinatorics",
"geometry",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 21563
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1538-G | codeforces | 1538-G | Gift Set | https://codeforces.com/problemset/problem/1538/G | [
"binary search",
"greedy",
"math",
"ternary search"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1538-F | codeforces | 1538-F | Interesting Function | https://codeforces.com/problemset/problem/1538/F | [
"binary search",
"dp",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 22308
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1538-E | codeforces | 1538-E | Funny Substrings | https://codeforces.com/problemset/problem/1538/E | [
"data structures",
"hashing",
"implementation",
"matrices",
"strings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3226
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1538-D | codeforces | 1538-D | Another Problem About Dividing Numbers | https://codeforces.com/problemset/problem/1538/D | [
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 15332
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1538-C | codeforces | 1538-C | Number of Pairs | https://codeforces.com/problemset/problem/1538/C | [
"binary search",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 34687
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1538-B | codeforces | 1538-B | Friends and Candies | https://codeforces.com/problemset/problem/1538/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 33591
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1538-A | codeforces | 1538-A | Stone Game | https://codeforces.com/problemset/problem/1538/A | [
"brute force",
"dp",
"greedy"
] | null | null | stdin_stdout | 800 | {
"solved_count": 40514
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1537-F | codeforces | 1537-F | Figure Fixing | https://codeforces.com/problemset/problem/1537/F | [
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"greedy",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2820
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1537-E2 | codeforces | 1537-E2 | Erase and Extend (Hard Version) | https://codeforces.com/problemset/problem/1537/E2 | [
"binary search",
"data structures",
"greedy",
"hashing",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 6202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1537-E1 | codeforces | 1537-E1 | Erase and Extend (Easy Version) | https://codeforces.com/problemset/problem/1537/E1 | [
"binary search",
"brute force",
"dp",
"greedy",
"hashing",
"implementation",
"string suffix structures",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 16490
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1537-D | codeforces | 1537-D | Deleting Divisors | https://codeforces.com/problemset/problem/1537/D | [
"games",
"math",
"number theory"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 13664
} | 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.