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:765-C | codeforces | 765-C | Table Tennis Game 2 | https://codeforces.com/problemset/problem/765/C | [
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 7474
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:765-B | codeforces | 765-B | Code obfuscation | https://codeforces.com/problemset/problem/765/B | [
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 7603
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:765-A | codeforces | 765-A | Neverending competitions | https://codeforces.com/problemset/problem/765/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 9630
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:764-B | codeforces | 764-B | Timofey and cubes | https://codeforces.com/problemset/problem/764/B | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 900 | {
"solved_count": 12780
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:764-A | codeforces | 764-A | Taymyr is calling you | https://codeforces.com/problemset/problem/764/A | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17213
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:763-E | codeforces | 763-E | Timofey and our friends animals | https://codeforces.com/problemset/problem/763/E | [
"data structures",
"divide and conquer",
"dsu"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 637
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:763-D | codeforces | 763-D | Timofey and a flat tree | https://codeforces.com/problemset/problem/763/D | [
"data structures",
"graphs",
"hashing",
"shortest paths",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 706
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:763-C | codeforces | 763-C | Timofey and remoduling | https://codeforces.com/problemset/problem/763/C | [
"brute force",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 819
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:763-B | codeforces | 763-B | Timofey and rectangles | https://codeforces.com/problemset/problem/763/B | [
"constructive algorithms",
"geometry"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3120
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:763-A | codeforces | 763-A | Timofey and a tree | https://codeforces.com/problemset/problem/763/A | [
"dfs and similar",
"dp",
"dsu",
"graphs",
"implementation",
"trees"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 12304
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:762-F | codeforces | 762-F | Tree nesting | https://codeforces.com/problemset/problem/762/F | [
"combinatorics",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 532
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:762-E | codeforces | 762-E | Radio stations | https://codeforces.com/problemset/problem/762/E | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1710
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:762-D | codeforces | 762-D | Maximum path | https://codeforces.com/problemset/problem/762/D | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1881
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:762-C | codeforces | 762-C | Two strings | https://codeforces.com/problemset/problem/762/C | [
"binary search",
"hashing",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3070
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:762-B | codeforces | 762-B | USB vs. PS/2 | https://codeforces.com/problemset/problem/762/B | [
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11091
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:762-A | codeforces | 762-A | k-th divisor | https://codeforces.com/problemset/problem/762/A | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 26966
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:761-F | codeforces | 761-F | Dasha and Photos | https://codeforces.com/problemset/problem/761/F | [
"brute force",
"data structures",
"dp",
"implementation"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 752
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:761-E | codeforces | 761-E | Dasha and Puzzle | https://codeforces.com/problemset/problem/761/E | [
"constructive algorithms",
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2428
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:761-D | codeforces | 761-D | Dasha and Very Difficult Problem | https://codeforces.com/problemset/problem/761/D | [
"binary search",
"brute force",
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4231
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:761-C | codeforces | 761-C | Dasha and Password | https://codeforces.com/problemset/problem/761/C | [
"brute force",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 6057
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:761-B | codeforces | 761-B | Dasha and friends | https://codeforces.com/problemset/problem/761/B | [
"brute force",
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7084
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:761-A | codeforces | 761-A | Dasha and Stairs | https://codeforces.com/problemset/problem/761/A | [
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 15236
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:760-B | codeforces | 760-B | Frodo and pillows | https://codeforces.com/problemset/problem/760/B | [
"binary search",
"greedy"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7968
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:760-A | codeforces | 760-A | Petr and a calendar | https://codeforces.com/problemset/problem/760/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8702
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:758-F | codeforces | 758-F | Geometrical Progression | https://codeforces.com/problemset/problem/758/F | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 762
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:758-E | codeforces | 758-E | Broken Tree | https://codeforces.com/problemset/problem/758/E | [
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 642
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:758-D | codeforces | 758-D | Ability To Convert | https://codeforces.com/problemset/problem/758/D | [
"constructive algorithms",
"dp",
"greedy",
"math",
"strings"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2965
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:758-C | codeforces | 758-C | Unfair Poll | https://codeforces.com/problemset/problem/758/C | [
"binary search",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4075
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:758-B | codeforces | 758-B | Blown Garland | https://codeforces.com/problemset/problem/758/B | [
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10786
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:758-A | codeforces | 758-A | Holiday Of Equality | https://codeforces.com/problemset/problem/758/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 77186
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:757-G | codeforces | 757-G | Can Bash Save the Day? | https://codeforces.com/problemset/problem/757/G | [
"data structures",
"divide and conquer",
"graphs",
"trees"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 663
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:757-F | codeforces | 757-F | Team Rocket Rises Again | https://codeforces.com/problemset/problem/757/F | [
"data structures",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1563
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:757-E | codeforces | 757-E | Bash Plays with Functions | https://codeforces.com/problemset/problem/757/E | [
"brute force",
"combinatorics",
"dp",
"number theory"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1641
} | 2026-08-17T01:43:56.191071+00:00 |
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": 1579
} | 2026-08-17T01:43:56.191071+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": 2479
} | 2026-08-17T01:43:56.191071+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": 11613
} | 2026-08-17T01:43:56.191071+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": 11923
} | 2026-08-17T01:43:56.191071+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": 270
} | 2026-08-17T01:43:56.191071+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": 328
} | 2026-08-17T01:43:56.191071+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": 1165
} | 2026-08-17T01:43:56.191071+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": 1518
} | 2026-08-17T01:43:56.191071+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": 4606
} | 2026-08-17T01:43:56.191071+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": 3237
} | 2026-08-17T01:43:56.191071+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": 1151
} | 2026-08-17T01:43:56.191071+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": 2012
} | 2026-08-17T01:43:56.191071+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": 944
} | 2026-08-17T01:43:56.191071+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": 2722
} | 2026-08-17T01:43:56.191071+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": 15507
} | 2026-08-17T01:43:56.191071+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": 13080
} | 2026-08-17T01:43:56.191071+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": 20178
} | 2026-08-17T01:43:56.191071+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": 622
} | 2026-08-17T01:43:56.191071+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": 2737
} | 2026-08-17T01:43:56.191071+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": 1121
} | 2026-08-17T01:43:56.191071+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": 7623
} | 2026-08-17T01:43:56.191071+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": 9496
} | 2026-08-17T01:43:56.191071+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": 475
} | 2026-08-17T01:43:56.191071+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": 1459
} | 2026-08-17T01:43:56.191071+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": 10144
} | 2026-08-17T01:43:56.191071+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": 267
} | 2026-08-17T01:43:56.191071+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": 635
} | 2026-08-17T01:43:56.191071+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": 655
} | 2026-08-17T01:43:56.191071+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": 1965
} | 2026-08-17T01:43:56.191071+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": 3176
} | 2026-08-17T01:43:56.191071+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": 7135
} | 2026-08-17T01:43:56.191071+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": 9747
} | 2026-08-17T01:43:56.191071+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": 95365
} | 2026-08-17T01:43:56.191071+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": 1299
} | 2026-08-17T01:43:56.191071+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": 2851
} | 2026-08-17T01:43:56.191071+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": 6301
} | 2026-08-17T01:43:56.191071+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": 9005
} | 2026-08-17T01:43:56.191071+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": 58256
} | 2026-08-17T01:43:56.191071+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": 746
} | 2026-08-17T01:43:56.191071+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": 1678
} | 2026-08-17T01:43:56.191071+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": 2086
} | 2026-08-17T01:43:56.191071+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": 4960
} | 2026-08-17T01:43:56.191071+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": 5663
} | 2026-08-17T01:43:56.191071+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": 9384
} | 2026-08-17T01:43:56.191071+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": 522
} | 2026-08-17T01:43:56.191071+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": 2111
} | 2026-08-17T01:43:56.191071+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": 3603
} | 2026-08-17T01:43:56.191071+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": 5079
} | 2026-08-17T01:43:56.191071+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": 9742
} | 2026-08-17T01:43:56.191071+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": 11326
} | 2026-08-17T01:43:56.191071+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": 1669
} | 2026-08-17T01:43:56.191071+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": 931
} | 2026-08-17T01:43:56.191071+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": 1912
} | 2026-08-17T01:43:56.191071+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": 5400
} | 2026-08-17T01:43:56.191071+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": 3885
} | 2026-08-17T01:43:56.191071+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": 32342
} | 2026-08-17T01:43:56.191071+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": 24112
} | 2026-08-17T01:43:56.191071+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": 3897
} | 2026-08-17T01:43:56.191071+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": 11059
} | 2026-08-17T01:43:56.191071+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": 157
} | 2026-08-17T01:43:56.191071+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": 165
} | 2026-08-17T01:43:56.191071+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": 1372
} | 2026-08-17T01:43:56.191071+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": 1971
} | 2026-08-17T01:43:56.191071+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": 9931
} | 2026-08-17T01:43:56.191071+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": 1664
} | 2026-08-17T01:43:56.191071+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": 4777
} | 2026-08-17T01:43:56.191071+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": 13599
} | 2026-08-17T01:43:56.191071+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.