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: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": 6324
} | 2026-11-02T05:37:07.883505+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": 9067
} | 2026-11-02T05:37:07.883505+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": 59092
} | 2026-11-02T05:37:07.883505+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": 765
} | 2026-11-02T05:37:07.883505+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": 1689
} | 2026-11-02T05:37:07.883505+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": 2101
} | 2026-11-02T05:37:07.883505+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": 4976
} | 2026-11-02T05:37:07.883505+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": 5677
} | 2026-11-02T05:37:07.883505+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": 9413
} | 2026-11-02T05:37:07.883505+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": 527
} | 2026-11-02T05:37:07.883505+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": 2127
} | 2026-11-02T05:37:07.883505+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": 3630
} | 2026-11-02T05:37:07.883505+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": 5099
} | 2026-11-02T05:37:07.883505+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": 9796
} | 2026-11-02T05:37:07.883505+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": 11420
} | 2026-11-02T05:37:07.883505+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": 1682
} | 2026-11-02T05:37:07.883505+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": 947
} | 2026-11-02T05:37:07.883505+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": 1920
} | 2026-11-02T05:37:07.883505+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": 5417
} | 2026-11-02T05:37:07.883505+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": 3910
} | 2026-11-02T05:37:07.883505+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": 32684
} | 2026-11-02T05:37:07.883505+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": 24290
} | 2026-11-02T05:37:07.883505+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": 3915
} | 2026-11-02T05:37:07.883505+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": 11107
} | 2026-11-02T05:37:07.883505+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": 158
} | 2026-11-02T05:37:07.883505+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": 166
} | 2026-11-02T05:37:07.883505+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": 1400
} | 2026-11-02T05:37:07.883505+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": 1979
} | 2026-11-02T05:37:07.883505+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": 10054
} | 2026-11-02T05:37:07.883505+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": 1674
} | 2026-11-02T05:37:07.883505+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": 4821
} | 2026-11-02T05:37:07.883505+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": 13730
} | 2026-11-02T05:37:07.883505+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": 16270
} | 2026-11-02T05:37:07.883505+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": 11983
} | 2026-11-02T05:37:07.883505+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": 10198
} | 2026-11-02T05:37:07.883505+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": 54864
} | 2026-11-02T05:37:07.883505+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": 246
} | 2026-11-02T05:37:07.883505+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": 4038
} | 2026-11-02T05:37:07.883505+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": 3366
} | 2026-11-02T05:37:07.883505+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": 6076
} | 2026-11-02T05:37:07.883505+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": 5764
} | 2026-11-02T05:37:07.883505+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": 8988
} | 2026-11-02T05:37:07.883505+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": 9223
} | 2026-11-02T05:37:07.883505+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": 2922
} | 2026-11-02T05:37:07.883505+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": 253
} | 2026-11-02T05:37:07.883505+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": 1819
} | 2026-11-02T05:37:07.883505+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": 5348
} | 2026-11-02T05:37:07.883505+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": 8574
} | 2026-11-02T05:37:07.883505+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": 86
} | 2026-11-02T05:37:07.883505+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": 362
} | 2026-11-02T05:37:07.883505+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": 257
} | 2026-11-02T05:37:07.883505+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": 623
} | 2026-11-02T05:37:07.883505+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": 1073
} | 2026-11-02T05:37:07.883505+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": 16552
} | 2026-11-02T05:37:07.883505+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": 8104
} | 2026-11-02T05:37:07.883505+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": 8830
} | 2026-11-02T05:37:07.883505+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": 13301
} | 2026-11-02T05:37:07.883505+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": 1470
} | 2026-11-02T05:37:07.883505+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": 5730
} | 2026-11-02T05:37:07.883505+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": 3957
} | 2026-11-02T05:37:07.883505+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": 5764
} | 2026-11-02T05:37:07.883505+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": 32549
} | 2026-11-02T05:37:07.883505+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": 209597
} | 2026-11-02T05:37:07.883505+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": 1438
} | 2026-11-02T05:37:07.883505+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": 1144
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:733-D | codeforces | 733-D | Kostya the Sculptor | https://codeforces.com/problemset/problem/733/D | [
"data structures",
"hashing"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4400
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:733-C | codeforces | 733-C | Epidemic in Monstropolis | https://codeforces.com/problemset/problem/733/C | [
"constructive algorithms",
"dp",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3606
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:733-B | codeforces | 733-B | Parade | https://codeforces.com/problemset/problem/733/B | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11045
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:733-A | codeforces | 733-A | Grasshopper And the String | https://codeforces.com/problemset/problem/733/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 17150
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:732-F | codeforces | 732-F | Tourist Reform | https://codeforces.com/problemset/problem/732/F | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3848
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:732-E | codeforces | 732-E | Sockets | https://codeforces.com/problemset/problem/732/E | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1693
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:732-D | codeforces | 732-D | Exams | https://codeforces.com/problemset/problem/732/D | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 6061
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:732-C | codeforces | 732-C | Sanatorium | https://codeforces.com/problemset/problem/732/C | [
"binary search",
"constructive algorithms",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 10282
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:732-B | codeforces | 732-B | Cormen --- The Best Friend Of a Man | https://codeforces.com/problemset/problem/732/B | [
"dp",
"greedy"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26086
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:732-A | codeforces | 732-A | Buy a Shovel | https://codeforces.com/problemset/problem/732/A | [
"brute force",
"constructive algorithms",
"implementation",
"math"
] | null | null | stdin_stdout | 800 | {
"solved_count": 93972
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:731-F | codeforces | 731-F | Video Cards | https://codeforces.com/problemset/problem/731/F | [
"brute force",
"data structures",
"implementation",
"math",
"number theory"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3217
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:731-E | codeforces | 731-E | Funny Game | https://codeforces.com/problemset/problem/731/E | [
"dp",
"games"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1948
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:731-D | codeforces | 731-D | 80-th Level Archeology | https://codeforces.com/problemset/problem/731/D | [
"brute force",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 1314
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:731-C | codeforces | 731-C | Socks | https://codeforces.com/problemset/problem/731/C | [
"dfs and similar",
"dsu",
"graphs",
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 8100
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:731-B | codeforces | 731-B | Coupons and Discounts | https://codeforces.com/problemset/problem/731/B | [
"constructive algorithms",
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 8404
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:731-A | codeforces | 731-A | Night at the Museum | https://codeforces.com/problemset/problem/731/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 55045
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-L | codeforces | 730-L | Expression Queries | https://codeforces.com/problemset/problem/730/L | [
"data structures"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 249
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-K | codeforces | 730-K | Roads Orientation Problem | https://codeforces.com/problemset/problem/730/K | [
"graphs"
] | null | null | stdin_stdout | 3,200 | {
"solved_count": 199
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-J | codeforces | 730-J | Bottles | https://codeforces.com/problemset/problem/730/J | [
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 4241
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-I | codeforces | 730-I | Olympiad in Programming and Sports | https://codeforces.com/problemset/problem/730/I | [
"dp",
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 3040
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-H | codeforces | 730-H | Delete Them | https://codeforces.com/problemset/problem/730/H | [
"constructive algorithms",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 3339
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-G | codeforces | 730-G | Car Repair Shop | https://codeforces.com/problemset/problem/730/G | [
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2338
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-F | codeforces | 730-F | Ber Patio | https://codeforces.com/problemset/problem/730/F | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 218
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-E | codeforces | 730-E | Award Ceremony | https://codeforces.com/problemset/problem/730/E | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 932
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-D | codeforces | 730-D | Running Over The Bridges | https://codeforces.com/problemset/problem/730/D | [
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 970
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-C | codeforces | 730-C | Bulmart | https://codeforces.com/problemset/problem/730/C | [
"binary search",
"dfs and similar"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1421
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-B | codeforces | 730-B | Minimum and Maximum | https://codeforces.com/problemset/problem/730/B | [
"constructive algorithms",
"interactive"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2848
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:730-A | codeforces | 730-A | Toda 2 | https://codeforces.com/problemset/problem/730/A | [
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1747
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:729-F | codeforces | 729-F | Financiers Game | https://codeforces.com/problemset/problem/729/F | [
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 1125
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:729-E | codeforces | 729-E | Subordinates | https://codeforces.com/problemset/problem/729/E | [
"constructive algorithms",
"data structures",
"graphs",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2430
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:729-D | codeforces | 729-D | Sea Battle | https://codeforces.com/problemset/problem/729/D | [
"constructive algorithms",
"greedy",
"math"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4147
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:729-C | codeforces | 729-C | Road to Cinema | https://codeforces.com/problemset/problem/729/C | [
"binary search",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 4234
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:729-B | codeforces | 729-B | Spotlights | https://codeforces.com/problemset/problem/729/B | [
"dp",
"implementation"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 8879
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:729-A | codeforces | 729-A | Interview with Oleg | https://codeforces.com/problemset/problem/729/A | [
"implementation",
"strings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 8248
} | 2026-11-02T05:37:07.883505+00:00 |
codeforces:727-F | codeforces | 727-F | Polycarp's problems | https://codeforces.com/problemset/problem/727/F | [
"binary search",
"dp",
"greedy"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1156
} | 2026-11-02T05:37:07.883505+00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.