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: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": 16181
} | 2026-08-17T01:43:56.191071+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": 11854
} | 2026-08-17T01:43:56.191071+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": 10149
} | 2026-08-17T01:43:56.191071+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": 53655
} | 2026-08-17T01:43:56.191071+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": 243
} | 2026-08-17T01:43:56.191071+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": 3881
} | 2026-08-17T01:43:56.191071+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": 3315
} | 2026-08-17T01:43:56.191071+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": 5998
} | 2026-08-17T01:43:56.191071+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": 5738
} | 2026-08-17T01:43:56.191071+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": 8936
} | 2026-08-17T01:43:56.191071+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": 9203
} | 2026-08-17T01:43:56.191071+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": 2861
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 1799
} | 2026-08-17T01:43:56.191071+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": 5264
} | 2026-08-17T01:43:56.191071+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": 8527
} | 2026-08-17T01:43:56.191071+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-08-17T01:43:56.191071+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": 361
} | 2026-08-17T01:43:56.191071+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": 255
} | 2026-08-17T01:43:56.191071+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": 621
} | 2026-08-17T01:43:56.191071+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": 1066
} | 2026-08-17T01:43:56.191071+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": 16301
} | 2026-08-17T01:43:56.191071+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": 8066
} | 2026-08-17T01:43:56.191071+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": 8808
} | 2026-08-17T01:43:56.191071+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": 13237
} | 2026-08-17T01:43:56.191071+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": 1453
} | 2026-08-17T01:43:56.191071+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": 5550
} | 2026-08-17T01:43:56.191071+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": 3941
} | 2026-08-17T01:43:56.191071+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": 5741
} | 2026-08-17T01:43:56.191071+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": 32317
} | 2026-08-17T01:43:56.191071+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": 202785
} | 2026-08-17T01:43:56.191071+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": 1418
} | 2026-08-17T01:43:56.191071+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": 1122
} | 2026-08-17T01:43:56.191071+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": 4377
} | 2026-08-17T01:43:56.191071+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": 3592
} | 2026-08-17T01:43:56.191071+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": 10998
} | 2026-08-17T01:43:56.191071+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": 17053
} | 2026-08-17T01:43:56.191071+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": 3690
} | 2026-08-17T01:43:56.191071+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": 1687
} | 2026-08-17T01:43:56.191071+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": 6010
} | 2026-08-17T01:43:56.191071+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": 10240
} | 2026-08-17T01:43:56.191071+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": 25950
} | 2026-08-17T01:43:56.191071+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": 91655
} | 2026-08-17T01:43:56.191071+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": 3188
} | 2026-08-17T01:43:56.191071+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": 1932
} | 2026-08-17T01:43:56.191071+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": 1305
} | 2026-08-17T01:43:56.191071+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": 8008
} | 2026-08-17T01:43:56.191071+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": 8378
} | 2026-08-17T01:43:56.191071+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": 54288
} | 2026-08-17T01:43:56.191071+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": 246
} | 2026-08-17T01:43:56.191071+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": 190
} | 2026-08-17T01:43:56.191071+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": 4150
} | 2026-08-17T01:43:56.191071+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": 2908
} | 2026-08-17T01:43:56.191071+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": 3302
} | 2026-08-17T01:43:56.191071+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": 2322
} | 2026-08-17T01:43:56.191071+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": 217
} | 2026-08-17T01:43:56.191071+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": 923
} | 2026-08-17T01:43:56.191071+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": 961
} | 2026-08-17T01:43:56.191071+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": 1409
} | 2026-08-17T01:43:56.191071+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": 2823
} | 2026-08-17T01:43:56.191071+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": 1738
} | 2026-08-17T01:43:56.191071+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": 1103
} | 2026-08-17T01:43:56.191071+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": 2405
} | 2026-08-17T01:43:56.191071+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": 4111
} | 2026-08-17T01:43:56.191071+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": 4204
} | 2026-08-17T01:43:56.191071+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": 8819
} | 2026-08-17T01:43:56.191071+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": 8176
} | 2026-08-17T01:43:56.191071+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": 1151
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:727-E | codeforces | 727-E | Games on a CD | https://codeforces.com/problemset/problem/727/E | [
"data structures",
"hashing",
"string suffix structures",
"strings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1656
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:727-D | codeforces | 727-D | T-shirts Distribution | https://codeforces.com/problemset/problem/727/D | [
"constructive algorithms",
"flows",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2106
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:727-C | codeforces | 727-C | Guess the Array | https://codeforces.com/problemset/problem/727/C | [
"constructive algorithms",
"interactive",
"math"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 9283
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:727-B | codeforces | 727-B | Bill Total Value | https://codeforces.com/problemset/problem/727/B | [
"expression parsing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2286
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:727-A | codeforces | 727-A | Transformation: from A to B | https://codeforces.com/problemset/problem/727/A | [
"brute force",
"dfs and similar",
"math"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 18695
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:725-G | codeforces | 725-G | Messages on a Tree | https://codeforces.com/problemset/problem/725/G | [] | null | null | stdin_stdout | 3,300 | {
"solved_count": 289
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:725-F | codeforces | 725-F | Family Photos | https://codeforces.com/problemset/problem/725/F | [
"games",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 801
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:725-E | codeforces | 725-E | Too Much Money | https://codeforces.com/problemset/problem/725/E | [
"brute force",
"greedy"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 743
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:725-D | codeforces | 725-D | Contest Balloons | https://codeforces.com/problemset/problem/725/D | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 3144
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:725-C | codeforces | 725-C | Hidden Word | https://codeforces.com/problemset/problem/725/C | [
"brute force",
"constructive algorithms",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2955
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:725-B | codeforces | 725-B | Food on the Plane | https://codeforces.com/problemset/problem/725/B | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5371
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:725-A | codeforces | 725-A | Jumping Ball | https://codeforces.com/problemset/problem/725/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7558
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:724-G | codeforces | 724-G | Xor-matic Number of the Graph | https://codeforces.com/problemset/problem/724/G | [
"bitmasks",
"graphs",
"math",
"number theory",
"trees"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 1611
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:724-F | codeforces | 724-F | Uniformly Branched Trees | https://codeforces.com/problemset/problem/724/F | [
"combinatorics",
"dp",
"trees"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 566
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:724-E | codeforces | 724-E | Goods transportation | https://codeforces.com/problemset/problem/724/E | [
"dp",
"flows",
"greedy"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 2054
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:724-D | codeforces | 724-D | Dense Subsequence | https://codeforces.com/problemset/problem/724/D | [
"data structures",
"greedy",
"strings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 2495
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:724-C | codeforces | 724-C | Ray Tracing | https://codeforces.com/problemset/problem/724/C | [
"greedy",
"hashing",
"implementation",
"math",
"number theory",
"sortings"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2296
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:724-B | codeforces | 724-B | Batch Sort | https://codeforces.com/problemset/problem/724/B | [
"brute force",
"greedy",
"implementation",
"math"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4266
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:724-A | codeforces | 724-A | Checking the Calendar | https://codeforces.com/problemset/problem/724/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 7611
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:723-F | codeforces | 723-F | st-Spanning Tree | https://codeforces.com/problemset/problem/723/F | [
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 1794
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:723-E | codeforces | 723-E | One-Way Reform | https://codeforces.com/problemset/problem/723/E | [
"constructive algorithms",
"dfs and similar",
"flows",
"graphs",
"greedy"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 2350
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:723-D | codeforces | 723-D | Lakes in Berland | https://codeforces.com/problemset/problem/723/D | [
"dfs and similar",
"dsu",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 7614
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:723-C | codeforces | 723-C | Polycarp at the Radio | https://codeforces.com/problemset/problem/723/C | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 5288
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:723-B | codeforces | 723-B | Text Document Analysis | https://codeforces.com/problemset/problem/723/B | [
"expression parsing",
"implementation",
"strings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 11021
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:723-A | codeforces | 723-A | The New Year: Meeting Friends | https://codeforces.com/problemset/problem/723/A | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 104265
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:722-F | codeforces | 722-F | Cyclic Cipher | https://codeforces.com/problemset/problem/722/F | [
"chinese remainder theorem",
"data structures",
"implementation",
"number theory",
"two pointers"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 662
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:722-E | codeforces | 722-E | Research Rover | https://codeforces.com/problemset/problem/722/E | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 1173
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:722-D | codeforces | 722-D | Generating Sets | https://codeforces.com/problemset/problem/722/D | [
"binary search",
"data structures",
"dfs and similar",
"greedy",
"strings",
"trees"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 3377
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:722-C | codeforces | 722-C | Destroying Array | https://codeforces.com/problemset/problem/722/C | [
"data structures",
"dsu"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 11881
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:722-B | codeforces | 722-B | Verse Pattern | https://codeforces.com/problemset/problem/722/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 6818
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:722-A | codeforces | 722-A | Broken Clock | https://codeforces.com/problemset/problem/722/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 7001
} | 2026-08-17T01:43:56.191071+00:00 |
codeforces:721-E | codeforces | 721-E | Road to Home | https://codeforces.com/problemset/problem/721/E | [
"binary search",
"dp"
] | null | null | stdin_stdout | 2,700 | {
"solved_count": 385
} | 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.