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:757-D | codeforces | 757-D | Felicity's Big Secret Revealed | https://codeforces.com/problemset/problem/757/D | [
"bitmasks",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:757-C | codeforces | 757-C | Felicity is Coming! | https://codeforces.com/problemset/problem/757/C | [
"data structures",
"hashing",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2466
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:757-B | codeforces | 757-B | Bash's Big Day | https://codeforces.com/problemset/problem/757/B | [
"greedy",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11455
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:757-A | codeforces | 757-A | Gotta Catch Em' All! | https://codeforces.com/problemset/problem/757/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 11847
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:756-F | codeforces | 756-F | Long number | https://codeforces.com/problemset/problem/756/F | [
"expression parsing",
"math",
"number theory"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 130
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:756-E | codeforces | 756-E | Byteland coins | https://codeforces.com/problemset/problem/756/E | [
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 208
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:756-D | codeforces | 756-D | Bacterial Melee | https://codeforces.com/problemset/problem/756/D | [
"brute force",
"combinatorics",
"dp",
"string suffix structures"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1086
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:756-C | codeforces | 756-C | Nikita and stack | https://codeforces.com/problemset/problem/756/C | [
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1471
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:756-B | codeforces | 756-B | Travel Card | https://codeforces.com/problemset/problem/756/B | [
"binary search",
"dp"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4552
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:756-A | codeforces | 756-A | Pavel and barbecue | https://codeforces.com/problemset/problem/756/A | [
"constructive algorithms",
"dfs and similar"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3219
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:755-G | codeforces | 755-G | PolandBall and Many Other Balls | https://codeforces.com/problemset/problem/755/G | [
"combinatorics",
"divide and conquer",
"dp",
"fft",
"math",
"number theory"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 1032
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:755-F | codeforces | 755-F | PolandBall and Gifts | https://codeforces.com/problemset/problem/755/F | [
"bitmasks",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1890
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:755-E | codeforces | 755-E | PolandBall and White-Red graph | https://codeforces.com/problemset/problem/755/E | [
"constructive algorithms",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 918
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:755-D | codeforces | 755-D | PolandBall and Polygon | https://codeforces.com/problemset/problem/755/D | [
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2678
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:755-C | codeforces | 755-C | PolandBall and Forest | https://codeforces.com/problemset/problem/755/C | [
"dfs and similar",
"dsu",
"graphs",
"interactive",
"trees"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 15113
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:755-B | codeforces | 755-B | PolandBall and Game | https://codeforces.com/problemset/problem/755/B | [
"binary search",
"data structures",
"games",
"greedy",
"sortings",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 12907
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:755-A | codeforces | 755-A | PolandBall and Hypothesis | https://codeforces.com/problemset/problem/755/A | [
"brute force",
"graphs",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 19960
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:754-E | codeforces | 754-E | Dasha and cyclic table | https://codeforces.com/problemset/problem/754/E | [
"bitmasks",
"brute force",
"fft",
"strings",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 567
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:754-D | codeforces | 754-D | Fedor and coupons | https://codeforces.com/problemset/problem/754/D | [
"binary search",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2697
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:754-C | codeforces | 754-C | Vladik and chat | https://codeforces.com/problemset/problem/754/C | [
"brute force",
"constructive algorithms",
"dp",
"implementation",
"strings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1100
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:754-B | codeforces | 754-B | Ilya and tic-tac-toe game | https://codeforces.com/problemset/problem/754/B | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7509
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:754-A | codeforces | 754-A | Lesha and array splitting | https://codeforces.com/problemset/problem/754/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 9405
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:753-C | codeforces | 753-C | Interactive Bulls and Cows (Hard) | https://codeforces.com/problemset/problem/753/C | [
"brute force",
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 401
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:753-B | codeforces | 753-B | Interactive Bulls and Cows (Easy) | https://codeforces.com/problemset/problem/753/B | [
"brute force",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1442
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:753-A | codeforces | 753-A | Santa Claus and Candies | https://codeforces.com/problemset/problem/753/A | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 9951
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:750-H | codeforces | 750-H | New Year and Snowy Grid | https://codeforces.com/problemset/problem/750/H | [
"dfs and similar",
"dsu",
"graphs",
"interactive"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 240
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:750-G | codeforces | 750-G | New Year and Binary Tree Paths | https://codeforces.com/problemset/problem/750/G | [
"bitmasks",
"brute force",
"combinatorics",
"dp"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 527
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:750-F | codeforces | 750-F | New Year and Finding Roots | https://codeforces.com/problemset/problem/750/F | [
"constructive algorithms",
"implementation",
"interactive",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 595
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:750-E | codeforces | 750-E | New Year and Old Subsequence | https://codeforces.com/problemset/problem/750/E | [
"data structures",
"divide and conquer",
"dp",
"matrices"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:750-D | codeforces | 750-D | New Year and Fireworks | https://codeforces.com/problemset/problem/750/D | [
"brute force",
"data structures",
"dfs and similar",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:750-C | codeforces | 750-C | New Year and Rating | https://codeforces.com/problemset/problem/750/C | [
"binary search",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7001
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:750-B | codeforces | 750-B | New Year and North Pole | https://codeforces.com/problemset/problem/750/B | [
"geometry",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9727
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:750-A | codeforces | 750-A | New Year and Hurry | https://codeforces.com/problemset/problem/750/A | [
"binary search",
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 93290
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:749-E | codeforces | 749-E | Inversions After Shuffle | https://codeforces.com/problemset/problem/749/E | [
"data structures",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1256
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:749-D | codeforces | 749-D | Leaving Auction | https://codeforces.com/problemset/problem/749/D | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2714
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:749-C | codeforces | 749-C | Voting | https://codeforces.com/problemset/problem/749/C | [
"greedy",
"implementation",
"two pointers"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6264
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:749-B | codeforces | 749-B | Parallelogram is Back | https://codeforces.com/problemset/problem/749/B | [
"brute force",
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:749-A | codeforces | 749-A | Bachgold Problem | https://codeforces.com/problemset/problem/749/A | [
"greedy",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 800 | {
"solved_count": 57403
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:748-F | codeforces | 748-F | Santa Clauses and a Soccer Championship | https://codeforces.com/problemset/problem/748/F | [
"constructive algorithms",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 721
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:748-E | codeforces | 748-E | Santa Claus and Tangerines | https://codeforces.com/problemset/problem/748/E | [
"binary search",
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1605
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:748-D | codeforces | 748-D | Santa Claus and a Palindrome | https://codeforces.com/problemset/problem/748/D | [
"constructive algorithms",
"data structures",
"greedy"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2058
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:748-C | codeforces | 748-C | Santa Claus and Robot | https://codeforces.com/problemset/problem/748/C | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 4868
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:748-B | codeforces | 748-B | Santa Claus and Keyboard Check | https://codeforces.com/problemset/problem/748/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5568
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:748-A | codeforces | 748-A | Santa Claus and a Place in a Class | https://codeforces.com/problemset/problem/748/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 9361
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:747-F | codeforces | 747-F | Igor and Interesting Numbers | https://codeforces.com/problemset/problem/747/F | [
"brute force",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 484
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:747-E | codeforces | 747-E | Comments | https://codeforces.com/problemset/problem/747/E | [
"dfs and similar",
"expression parsing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2096
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:747-D | codeforces | 747-D | Winter Is Coming | https://codeforces.com/problemset/problem/747/D | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3465
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:747-C | codeforces | 747-C | Servers | https://codeforces.com/problemset/problem/747/C | [
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5040
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:747-B | codeforces | 747-B | Mammoth's Genome Decoding | https://codeforces.com/problemset/problem/747/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:747-A | codeforces | 747-A | Display Size | https://codeforces.com/problemset/problem/747/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 11242
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:746-G | codeforces | 746-G | New Roads | https://codeforces.com/problemset/problem/746/G | [
"constructive algorithms",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1641
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:746-F | codeforces | 746-F | Music in Car | https://codeforces.com/problemset/problem/746/F | [
"data structures",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 904
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:746-E | codeforces | 746-E | Numbers Exchange | https://codeforces.com/problemset/problem/746/E | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1905
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:746-D | codeforces | 746-D | Green and Black Tea | https://codeforces.com/problemset/problem/746/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 5370
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:746-C | codeforces | 746-C | Tram | https://codeforces.com/problemset/problem/746/C | [
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 3865
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:746-B | codeforces | 746-B | Decoding | https://codeforces.com/problemset/problem/746/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 31989
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:746-A | codeforces | 746-A | Compote | https://codeforces.com/problemset/problem/746/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 23898
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:745-B | codeforces | 745-B | Hongcow Solves A Puzzle | https://codeforces.com/problemset/problem/745/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3886
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:745-A | codeforces | 745-A | Hongcow Learns the Cyclic Shift | https://codeforces.com/problemset/problem/745/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11009
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:744-E | codeforces | 744-E | Hongcow Masters the Cyclic Shift | https://codeforces.com/problemset/problem/744/E | [
"strings",
"two pointers"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 150
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:744-D | codeforces | 744-D | Hongcow Draws a Circle | https://codeforces.com/problemset/problem/744/D | [
"geometry"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 136
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:744-C | codeforces | 744-C | Hongcow Buys a Deck of Cards | https://codeforces.com/problemset/problem/744/C | [
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1312
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:744-B | codeforces | 744-B | Hongcow's Game | https://codeforces.com/problemset/problem/744/B | [
"bitmasks",
"divide and conquer",
"interactive"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1960
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:744-A | codeforces | 744-A | Hongcow Builds A Nation | https://codeforces.com/problemset/problem/744/A | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9798
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:743-E | codeforces | 743-E | Vladik and cards | https://codeforces.com/problemset/problem/743/E | [
"binary search",
"bitmasks",
"brute force",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1631
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:743-D | codeforces | 743-D | Chloe and pleasant prizes | https://codeforces.com/problemset/problem/743/D | [
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4735
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:743-C | codeforces | 743-C | Vladik and fractions | https://codeforces.com/problemset/problem/743/C | [
"brute force",
"constructive algorithms",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 13455
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:743-B | codeforces | 743-B | Chloe and the sequence | https://codeforces.com/problemset/problem/743/B | [
"binary search",
"bitmasks",
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 16086
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:743-A | codeforces | 743-A | Vladik and flights | https://codeforces.com/problemset/problem/743/A | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 11748
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:742-B | codeforces | 742-B | Arpa’s obvious problem and Mehrdad’s terrible solution | https://codeforces.com/problemset/problem/742/B | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 10077
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:742-A | codeforces | 742-A | Arpa’s hard exam and Mehrdad’s naive cheat | https://codeforces.com/problemset/problem/742/A | [
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 52323
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:741-E | codeforces | 741-E | Arpa’s abnormal DNA and Mehrdad’s deep interest | https://codeforces.com/problemset/problem/741/E | [
"data structures",
"string suffix structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 193
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:741-D | codeforces | 741-D | Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths | https://codeforces.com/problemset/problem/741/D | [
"data structures",
"dfs and similar",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 3659
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:741-C | codeforces | 741-C | Arpa’s overnight party and Mehrdad’s silent entering | https://codeforces.com/problemset/problem/741/C | [
"constructive algorithms",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 3127
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:741-B | codeforces | 741-B | Arpa's weak amphitheater and Mehrdad's valuable Hoses | https://codeforces.com/problemset/problem/741/B | [
"dfs and similar",
"dp",
"dsu"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5930
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:741-A | codeforces | 741-A | Arpa's loud Owf and Mehrdad's evil plan | https://codeforces.com/problemset/problem/741/A | [
"dfs and similar",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5697
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:740-B | codeforces | 740-B | Alyona and flowers | https://codeforces.com/problemset/problem/740/B | [
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8885
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:740-A | codeforces | 740-A | Alyona and copybooks | https://codeforces.com/problemset/problem/740/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 9171
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:739-E | codeforces | 739-E | Gosha is hunting | https://codeforces.com/problemset/problem/739/E | [
"brute force",
"data structures",
"dp",
"flows",
"math",
"probabilities",
"sortings"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 2656
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:739-D | codeforces | 739-D | Recover a functional graph | https://codeforces.com/problemset/problem/739/D | [
"graph matchings"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 215
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:739-C | codeforces | 739-C | Alyona and towers | https://codeforces.com/problemset/problem/739/C | [
"data structures"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1713
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:739-B | codeforces | 739-B | Alyona and a tree | https://codeforces.com/problemset/problem/739/B | [
"binary search",
"data structures",
"dfs and similar",
"graphs",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5142
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:739-A | codeforces | 739-A | Alyona and mex | https://codeforces.com/problemset/problem/739/A | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8465
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:737-F | codeforces | 737-F | Dirty plates | https://codeforces.com/problemset/problem/737/F | [
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 85
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:737-E | codeforces | 737-E | Tanya is 5! | https://codeforces.com/problemset/problem/737/E | [
"graph matchings",
"graphs",
"greedy",
"schedules"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 138
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:736-E | codeforces | 736-E | Chess Championship | https://codeforces.com/problemset/problem/736/E | [
"constructive algorithms",
"flows",
"greedy",
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 206
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:736-D | codeforces | 736-D | Permutations | https://codeforces.com/problemset/problem/736/D | [
"math",
"matrices"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 546
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:735-E | codeforces | 735-E | Ostap and Tree | https://codeforces.com/problemset/problem/735/E | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1006
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:735-D | codeforces | 735-D | Taxes | https://codeforces.com/problemset/problem/735/D | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 15955
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:735-C | codeforces | 735-C | Tennis Championship | https://codeforces.com/problemset/problem/735/C | [
"combinatorics",
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7989
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:735-B | codeforces | 735-B | Urbanization | https://codeforces.com/problemset/problem/735/B | [
"greedy",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8755
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:735-A | codeforces | 735-A | Ostap and Grasshopper | https://codeforces.com/problemset/problem/735/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 13163
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:734-F | codeforces | 734-F | Anton and School | https://codeforces.com/problemset/problem/734/F | [
"bitmasks",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:734-E | codeforces | 734-E | Anton and Tree | https://codeforces.com/problemset/problem/734/E | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 5302
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:734-D | codeforces | 734-D | Anton and Chess | https://codeforces.com/problemset/problem/734/D | [
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3920
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:734-C | codeforces | 734-C | Anton and Making Potions | https://codeforces.com/problemset/problem/734/C | [
"binary search",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5699
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:734-B | codeforces | 734-B | Anton and Digits | https://codeforces.com/problemset/problem/734/B | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 32042
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:734-A | codeforces | 734-A | Anton and Danik | https://codeforces.com/problemset/problem/734/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 197181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:733-F | codeforces | 733-F | Drivers Dissatisfaction | https://codeforces.com/problemset/problem/733/F | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1340
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:733-E | codeforces | 733-E | Sleep in Class | https://codeforces.com/problemset/problem/733/E | [
"constructive algorithms",
"data structures",
"math",
"two pointers"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1066
} | 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.