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:1286-A | codeforces | 1286-A | Garland | https://codeforces.com/problemset/problem/1286/A | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9668
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1285-F | codeforces | 1285-F | Classical? | https://codeforces.com/problemset/problem/1285/F | [
"binary search",
"combinatorics",
"number theory"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1371
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1285-E | codeforces | 1285-E | Delete a Segment | https://codeforces.com/problemset/problem/1285/E | [
"brute force",
"constructive algorithms",
"data structures",
"dp",
"graphs",
"sortings",
"trees",
"two pointers"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2005
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1285-D | codeforces | 1285-D | Dr. Evil Underscores | https://codeforces.com/problemset/problem/1285/D | [
"bitmasks",
"brute force",
"dfs and similar",
"divide and conquer",
"dp",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8640
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1285-C | codeforces | 1285-C | Fadi and LCM | https://codeforces.com/problemset/problem/1285/C | [
"brute force",
"math",
"number theory"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 28310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1285-B | codeforces | 1285-B | Just Eat It! | https://codeforces.com/problemset/problem/1285/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 31198
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1285-A | codeforces | 1285-A | Mezo Playing Zoma | https://codeforces.com/problemset/problem/1285/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 29948
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1284-G | codeforces | 1284-G | Seollal | https://codeforces.com/problemset/problem/1284/G | [
"graphs"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 228
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1284-F | codeforces | 1284-F | New Year and Social Network | https://codeforces.com/problemset/problem/1284/F | [
"data structures",
"graph matchings",
"graphs",
"math",
"trees"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 413
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1284-E | codeforces | 1284-E | New Year and Castle Construction | https://codeforces.com/problemset/problem/1284/E | [
"combinatorics",
"geometry",
"math",
"sortings"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1385
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1284-D | codeforces | 1284-D | New Year and Conference | https://codeforces.com/problemset/problem/1284/D | [
"binary search",
"data structures",
"hashing",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1284-C | codeforces | 1284-C | New Year and Permutation | https://codeforces.com/problemset/problem/1284/C | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8764
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1284-B | codeforces | 1284-B | New Year and Ascent Sequence | https://codeforces.com/problemset/problem/1284/B | [
"binary search",
"combinatorics",
"data structures",
"dp",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 11482
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1284-A | codeforces | 1284-A | New Year and Naming | https://codeforces.com/problemset/problem/1284/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18601
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1283-F | codeforces | 1283-F | DIY Garland | https://codeforces.com/problemset/problem/1283/F | [
"constructive algorithms",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2049
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1283-E | codeforces | 1283-E | New Year Parties | https://codeforces.com/problemset/problem/1283/E | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 7349
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1283-D | codeforces | 1283-D | Christmas Trees | https://codeforces.com/problemset/problem/1283/D | [
"graphs",
"greedy",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 9566
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1283-C | codeforces | 1283-C | Friends and Gifts | https://codeforces.com/problemset/problem/1283/C | [
"constructive algorithms",
"data structures",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14175
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1283-B | codeforces | 1283-B | Candies Division | https://codeforces.com/problemset/problem/1283/B | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 23107
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1283-A | codeforces | 1283-A | Minutes Before the New Year | https://codeforces.com/problemset/problem/1283/A | [
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 61559
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1282-E | codeforces | 1282-E | The Cake Is a Lie | https://codeforces.com/problemset/problem/1282/E | [
"constructive algorithms",
"data structures",
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 1223
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1282-D | codeforces | 1282-D | Enchanted Artifact | https://codeforces.com/problemset/problem/1282/D | [
"constructive algorithms",
"interactive",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2379
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1282-C | codeforces | 1282-C | Petya and Exam | https://codeforces.com/problemset/problem/1282/C | [
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4597
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1282-B2 | codeforces | 1282-B2 | K for the Price of One (Hard Version) | https://codeforces.com/problemset/problem/1282/B2 | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11032
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1282-B1 | codeforces | 1282-B1 | K for the Price of One (Easy Version) | https://codeforces.com/problemset/problem/1282/B1 | [
"dp",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12176
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1282-A | codeforces | 1282-A | Temporarily unavailable | https://codeforces.com/problemset/problem/1282/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 15510
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1281-B | codeforces | 1281-B | Azamon Web Services | https://codeforces.com/problemset/problem/1281/B | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8700
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1281-A | codeforces | 1281-A | Suffix Three | https://codeforces.com/problemset/problem/1281/A | [
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 18952
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1280-F | codeforces | 1280-F | Intergalactic Sliding Puzzle | https://codeforces.com/problemset/problem/1280/F | [
"combinatorics",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 109
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1280-E | codeforces | 1280-E | Kirchhoff's Current Loss | https://codeforces.com/problemset/problem/1280/E | [
"math"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 231
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1280-D | codeforces | 1280-D | Miss Punyverse | https://codeforces.com/problemset/problem/1280/D | [
"dp",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1244
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1280-C | codeforces | 1280-C | Jeremy Bearimy | https://codeforces.com/problemset/problem/1280/C | [
"dfs and similar",
"graphs",
"greedy",
"trees"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3043
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1280-B | codeforces | 1280-B | Beingawesomeism | https://codeforces.com/problemset/problem/1280/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4211
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1280-A | codeforces | 1280-A | Cut and Paste | https://codeforces.com/problemset/problem/1280/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 5854
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1279-F | codeforces | 1279-F | New Year and Handle Change | https://codeforces.com/problemset/problem/1279/F | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 1225
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1279-E | codeforces | 1279-E | New Year Permutations | https://codeforces.com/problemset/problem/1279/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 456
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1279-D | codeforces | 1279-D | Santa's Bot | https://codeforces.com/problemset/problem/1279/D | [
"combinatorics",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 7350
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1279-C | codeforces | 1279-C | Stack of Presents | https://codeforces.com/problemset/problem/1279/C | [
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12450
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1279-B | codeforces | 1279-B | Verse For Santa | https://codeforces.com/problemset/problem/1279/B | [
"binary search",
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 14442
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1279-A | codeforces | 1279-A | New Year Garland | https://codeforces.com/problemset/problem/1279/A | [
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 17887
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1278-F | codeforces | 1278-F | Cards | https://codeforces.com/problemset/problem/1278/F | [
"combinatorics",
"dp",
"math",
"number theory",
"probabilities"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 2526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1278-E | codeforces | 1278-E | Tests for problem D | https://codeforces.com/problemset/problem/1278/E | [
"constructive algorithms",
"dfs and similar",
"divide and conquer",
"trees"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2049
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1278-D | codeforces | 1278-D | Segment Tree | https://codeforces.com/problemset/problem/1278/D | [
"data structures",
"dsu",
"graphs",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 4348
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1278-C | codeforces | 1278-C | Berry Jam | https://codeforces.com/problemset/problem/1278/C | [
"data structures",
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 8581
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1278-B | codeforces | 1278-B | A and B | https://codeforces.com/problemset/problem/1278/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 14207
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1278-A | codeforces | 1278-A | Shuffle Hashing | https://codeforces.com/problemset/problem/1278/A | [
"brute force",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18349
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1277-D | codeforces | 1277-D | Let's Play the Words? | https://codeforces.com/problemset/problem/1277/D | [
"data structures",
"hashing",
"implementation",
"math"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3279
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1277-B | codeforces | 1277-B | Make Them Odd | https://codeforces.com/problemset/problem/1277/B | [
"greedy",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17099
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1277-A | codeforces | 1277-A | Happy Birthday, Polycarp! | https://codeforces.com/problemset/problem/1277/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14513
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1276-F | codeforces | 1276-F | Asterisk Substrings | https://codeforces.com/problemset/problem/1276/F | [
"string suffix structures"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 449
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1276-E | codeforces | 1276-E | Four Stones | https://codeforces.com/problemset/problem/1276/E | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 123
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1276-D | codeforces | 1276-D | Tree Elimination | https://codeforces.com/problemset/problem/1276/D | [
"dp",
"trees"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 676
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1276-C | codeforces | 1276-C | Beautiful Rectangle | https://codeforces.com/problemset/problem/1276/C | [
"brute force",
"combinatorics",
"constructive algorithms",
"data structures",
"greedy",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1790
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1276-B | codeforces | 1276-B | Two Fairs | https://codeforces.com/problemset/problem/1276/B | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 5697
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1276-A | codeforces | 1276-A | As Simple as One and Two | https://codeforces.com/problemset/problem/1276/A | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 12959
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1275-F | codeforces | 1275-F | Шардирование постов | https://codeforces.com/problemset/problem/1275/F | [
"*special",
"binary search",
"interactive"
] | null | null | stdin_stdout | null | {
"solved_count": 92
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1275-E3 | codeforces | 1275-E3 | Контрольная сумма | https://codeforces.com/problemset/problem/1275/E3 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 61
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1275-E2 | codeforces | 1275-E2 | Контрольная сумма | https://codeforces.com/problemset/problem/1275/E2 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 138
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1275-E1 | codeforces | 1275-E1 | Контрольная сумма | https://codeforces.com/problemset/problem/1275/E1 | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 265
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1275-D | codeforces | 1275-D | Storage2 | https://codeforces.com/problemset/problem/1275/D | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 422
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1275-C | codeforces | 1275-C | #define Задача B ... | https://codeforces.com/problemset/problem/1275/C | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 698
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1275-B | codeforces | 1275-B | Code Review | https://codeforces.com/problemset/problem/1275/B | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 844
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1275-A | codeforces | 1275-A | Скрытый друг | https://codeforces.com/problemset/problem/1275/A | [
"*special"
] | null | null | stdin_stdout | null | {
"solved_count": 891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1272-F | codeforces | 1272-F | Two Bracket Sequences | https://codeforces.com/problemset/problem/1272/F | [
"dp",
"strings",
"two pointers"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2341
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1272-E | codeforces | 1272-E | Nearest Opposite Parity | https://codeforces.com/problemset/problem/1272/E | [
"dfs and similar",
"graphs",
"shortest paths"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 8030
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1272-D | codeforces | 1272-D | Remove One Element | https://codeforces.com/problemset/problem/1272/D | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 19400
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1272-C | codeforces | 1272-C | Yet Another Broken Keyboard | https://codeforces.com/problemset/problem/1272/C | [
"combinatorics",
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 30898
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1272-B | codeforces | 1272-B | Snow Walking Robot | https://codeforces.com/problemset/problem/1272/B | [
"constructive algorithms",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 14702
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1272-A | codeforces | 1272-A | Three Friends | https://codeforces.com/problemset/problem/1272/A | [
"brute force",
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 22125
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1271-F | codeforces | 1271-F | Divide The Students | https://codeforces.com/problemset/problem/1271/F | [
"brute force"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 260
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1271-E | codeforces | 1271-E | Common Number | https://codeforces.com/problemset/problem/1271/E | [
"binary search",
"combinatorics",
"dp",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3718
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1271-D | codeforces | 1271-D | Portals | https://codeforces.com/problemset/problem/1271/D | [
"data structures",
"dp",
"greedy",
"implementation",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3411
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1271-C | codeforces | 1271-C | Shawarma Tent | https://codeforces.com/problemset/problem/1271/C | [
"brute force",
"geometry",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 11133
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1271-B | codeforces | 1271-B | Blocks | https://codeforces.com/problemset/problem/1271/B | [
"greedy",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 12113
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1271-A | codeforces | 1271-A | Suits | https://codeforces.com/problemset/problem/1271/A | [
"brute force",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 15691
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-I | codeforces | 1270-I | Xor on Figures | https://codeforces.com/problemset/problem/1270/I | [
"constructive algorithms",
"fft",
"math"
] | null | null | stdin_stdout | 3,500 | {
"solved_count": 318
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-H | codeforces | 1270-H | Number of Components | https://codeforces.com/problemset/problem/1270/H | [
"data structures"
] | null | null | stdin_stdout | 3,300 | {
"solved_count": 1007
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-G | codeforces | 1270-G | Subset with Zero Sum | https://codeforces.com/problemset/problem/1270/G | [
"constructive algorithms",
"dfs and similar",
"graphs",
"math"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 2976
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-F | codeforces | 1270-F | Awesome Substrings | https://codeforces.com/problemset/problem/1270/F | [
"math",
"strings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1337
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-E | codeforces | 1270-E | Divide Points | https://codeforces.com/problemset/problem/1270/E | [
"constructive algorithms",
"geometry",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 2750
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-D | codeforces | 1270-D | Strange Device | https://codeforces.com/problemset/problem/1270/D | [
"constructive algorithms",
"interactive",
"math",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4875
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-C | codeforces | 1270-C | Make Good | https://codeforces.com/problemset/problem/1270/C | [
"bitmasks",
"constructive algorithms",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 15055
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-B | codeforces | 1270-B | Interesting Subarray | https://codeforces.com/problemset/problem/1270/B | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 17395
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1270-A | codeforces | 1270-A | Card Game | https://codeforces.com/problemset/problem/1270/A | [
"games",
"greedy",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 17829
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1269-B | codeforces | 1269-B | Modulo Equality | https://codeforces.com/problemset/problem/1269/B | [
"brute force",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 9629
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1269-A | codeforces | 1269-A | Equation | https://codeforces.com/problemset/problem/1269/A | [
"brute force",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 24176
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1268-E | codeforces | 1268-E | Happy Cactus | https://codeforces.com/problemset/problem/1268/E | [
"dp"
] | null | null | stdin_stdout | 3,400 | {
"solved_count": 296
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1268-D | codeforces | 1268-D | Invertation in Tournament | https://codeforces.com/problemset/problem/1268/D | [
"brute force",
"divide and conquer",
"graphs",
"math"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 642
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1268-C | codeforces | 1268-C | K Integers | https://codeforces.com/problemset/problem/1268/C | [
"binary search",
"data structures"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1955
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1268-B | codeforces | 1268-B | Domino for Young | https://codeforces.com/problemset/problem/1268/B | [
"dp",
"greedy",
"math"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 6457
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1268-A | codeforces | 1268-A | Long Beautiful Integer | https://codeforces.com/problemset/problem/1268/A | [
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 9081
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-L | codeforces | 1267-L | Lexicography | https://codeforces.com/problemset/problem/1267/L | [
"constructive algorithms",
"strings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3362
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-K | codeforces | 1267-K | Key Storage | https://codeforces.com/problemset/problem/1267/K | [
"combinatorics",
"math"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 2146
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-J | codeforces | 1267-J | Just Arrange the Icons | https://codeforces.com/problemset/problem/1267/J | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3064
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-I | codeforces | 1267-I | Intriguing Selection | https://codeforces.com/problemset/problem/1267/I | [
"brute force",
"constructive algorithms",
"implementation",
"interactive",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-H | codeforces | 1267-H | Help BerLine | https://codeforces.com/problemset/problem/1267/H | [
"constructive algorithms"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-G | codeforces | 1267-G | Game Relics | https://codeforces.com/problemset/problem/1267/G | [
"math",
"probabilities"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 827
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-F | codeforces | 1267-F | Foolprüf Security | https://codeforces.com/problemset/problem/1267/F | [
"graphs"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 720
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-E | codeforces | 1267-E | Elections | https://codeforces.com/problemset/problem/1267/E | [
"greedy"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3522
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:1267-D | codeforces | 1267-D | DevOps Best Practices | https://codeforces.com/problemset/problem/1267/D | [
"constructive algorithms"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 262
} | 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.