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:175-D | codeforces | 175-D | Plane of Tanks: Duel | https://codeforces.com/problemset/problem/175/D | [
"brute force",
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 321
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:175-C | codeforces | 175-C | Geometry Horse | https://codeforces.com/problemset/problem/175/C | [
"greedy",
"implementation",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1526
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:175-B | codeforces | 175-B | Plane of Tanks: Pro | https://codeforces.com/problemset/problem/175/B | [
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 1579
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:175-A | codeforces | 175-A | Robot Bicorn Attack | https://codeforces.com/problemset/problem/175/A | [
"brute force",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2557
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:174-C | codeforces | 174-C | Range Increments | https://codeforces.com/problemset/problem/174/C | [
"data structures",
"greedy"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:174-B | codeforces | 174-B | File List | https://codeforces.com/problemset/problem/174/B | [
"dp",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2525
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:174-A | codeforces | 174-A | Problem About Equation | https://codeforces.com/problemset/problem/174/A | [
"math"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 3335
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:173-E | codeforces | 173-E | Camping Groups | https://codeforces.com/problemset/problem/173/E | [
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,600 | {
"solved_count": 648
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:173-D | codeforces | 173-D | Deputies | https://codeforces.com/problemset/problem/173/D | [
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 290
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:173-C | codeforces | 173-C | Spiral Maximum | https://codeforces.com/problemset/problem/173/C | [
"brute force",
"dp"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1117
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:173-B | codeforces | 173-B | Chamber of Secrets | https://codeforces.com/problemset/problem/173/B | [
"dfs and similar",
"shortest paths"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 4042
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:173-A | codeforces | 173-A | Rock-Paper-Scissors | https://codeforces.com/problemset/problem/173/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2531
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:172-E | codeforces | 172-E | BHTML+BCSS | https://codeforces.com/problemset/problem/172/E | [
"*special",
"dfs and similar",
"expression parsing"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 283
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:172-D | codeforces | 172-D | Calendar Reform | https://codeforces.com/problemset/problem/172/D | [
"*special",
"number theory"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1521
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:172-C | codeforces | 172-C | Bus | https://codeforces.com/problemset/problem/172/C | [
"*special",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 1259
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:172-B | codeforces | 172-B | Pseudorandom Sequence Period | https://codeforces.com/problemset/problem/172/B | [
"*special",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 3164
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:172-A | codeforces | 172-A | Phone Code | https://codeforces.com/problemset/problem/172/A | [
"*special",
"brute force",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 7559
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:171-H | codeforces | 171-H | A polyline | https://codeforces.com/problemset/problem/171/H | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 338
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:171-G | codeforces | 171-G | Mysterious numbers - 2 | https://codeforces.com/problemset/problem/171/G | [
"*special"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1067
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:171-F | codeforces | 171-F | ucyhf | https://codeforces.com/problemset/problem/171/F | [
"*special",
"brute force",
"implementation",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 1486
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:171-E | codeforces | 171-E | MYSTERIOUS LANGUAGE | https://codeforces.com/problemset/problem/171/E | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1605
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:171-D | codeforces | 171-D | Broken checker | https://codeforces.com/problemset/problem/171/D | [
"*special",
"brute force"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 2817
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:171-C | codeforces | 171-C | A Piece of Cake | https://codeforces.com/problemset/problem/171/C | [
"*special",
"implementation"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1227
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:171-B | codeforces | 171-B | Star | https://codeforces.com/problemset/problem/171/B | [
"*special",
"combinatorics"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 4775
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:171-A | codeforces | 171-A | Mysterious numbers - 1 | https://codeforces.com/problemset/problem/171/A | [
"*special",
"constructive algorithms"
] | null | null | stdin_stdout | 1,200 | {
"solved_count": 5095
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:169-B | codeforces | 169-B | Replacing Digits | https://codeforces.com/problemset/problem/169/B | [
"greedy"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 3736
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:169-A | codeforces | 169-A | Chores | https://codeforces.com/problemset/problem/169/A | [
"sortings"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8210
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:168-B | codeforces | 168-B | Wizards and Minimal Spell | https://codeforces.com/problemset/problem/168/B | [
"implementation",
"strings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1310
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:168-A | codeforces | 168-A | Wizards and Demonstration | https://codeforces.com/problemset/problem/168/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 900 | {
"solved_count": 11537
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:167-E | codeforces | 167-E | Wizards and Bets | https://codeforces.com/problemset/problem/167/E | [
"dfs and similar",
"graphs",
"math",
"matrices"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 675
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:167-D | codeforces | 167-D | Wizards and Roads | https://codeforces.com/problemset/problem/167/D | [
"data structures",
"divide and conquer",
"graph matchings",
"graphs",
"greedy"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 217
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:167-C | codeforces | 167-C | Wizards and Numbers | https://codeforces.com/problemset/problem/167/C | [
"games",
"math"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 742
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:167-B | codeforces | 167-B | Wizards and Huge Prize | https://codeforces.com/problemset/problem/167/B | [
"dp",
"math",
"probabilities"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 2460
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:167-A | codeforces | 167-A | Wizards and Trolleybuses | https://codeforces.com/problemset/problem/167/A | [
"implementation",
"math"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2189
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:166-E | codeforces | 166-E | Tetrahedron | https://codeforces.com/problemset/problem/166/E | [
"dp",
"math",
"matrices"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 25833
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:166-D | codeforces | 166-D | Shoe Store | https://codeforces.com/problemset/problem/166/D | [
"dp",
"graph matchings",
"greedy",
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 392
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:166-C | codeforces | 166-C | Median | https://codeforces.com/problemset/problem/166/C | [
"greedy",
"math",
"sortings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 7446
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:166-B | codeforces | 166-B | Polygons | https://codeforces.com/problemset/problem/166/B | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 3061
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:166-A | codeforces | 166-A | Rank List | https://codeforces.com/problemset/problem/166/A | [
"binary search",
"implementation",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 21082
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:165-E | codeforces | 165-E | Compatible Numbers | https://codeforces.com/problemset/problem/165/E | [
"bitmasks",
"brute force",
"dfs and similar",
"dp"
] | null | null | stdin_stdout | 2,200 | {
"solved_count": 9481
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:165-D | codeforces | 165-D | Beard Graph | https://codeforces.com/problemset/problem/165/D | [
"data structures",
"dsu",
"trees"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 1937
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:165-C | codeforces | 165-C | Another Problem on Strings | https://codeforces.com/problemset/problem/165/C | [
"binary search",
"brute force",
"dp",
"math",
"strings",
"two pointers"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 13891
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:165-B | codeforces | 165-B | Burning Midnight Oil | https://codeforces.com/problemset/problem/165/B | [
"binary search",
"implementation"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 23047
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:165-A | codeforces | 165-A | Supercentral Point | https://codeforces.com/problemset/problem/165/A | [
"implementation"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 26368
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:164-E | codeforces | 164-E | Polycarpus and Tasks | https://codeforces.com/problemset/problem/164/E | [] | null | null | stdin_stdout | 3,100 | {
"solved_count": 74
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:164-D | codeforces | 164-D | Minimum Diameter | https://codeforces.com/problemset/problem/164/D | [
"binary search",
"brute force"
] | null | null | stdin_stdout | 3,100 | {
"solved_count": 276
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:164-C | codeforces | 164-C | Machine Programming | https://codeforces.com/problemset/problem/164/C | [
"flows",
"graphs"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 984
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:164-B | codeforces | 164-B | Ancient Berland Hieroglyphs | https://codeforces.com/problemset/problem/164/B | [
"two pointers"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 529
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:164-A | codeforces | 164-A | Variable, or There and Back Again | https://codeforces.com/problemset/problem/164/A | [
"dfs and similar",
"graphs"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1201
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:163-E | codeforces | 163-E | e-Government | https://codeforces.com/problemset/problem/163/E | [
"data structures",
"dfs and similar",
"dp",
"strings",
"trees"
] | null | null | stdin_stdout | 2,800 | {
"solved_count": 2202
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:163-D | codeforces | 163-D | Large Refrigerator | https://codeforces.com/problemset/problem/163/D | [
"brute force"
] | null | null | stdin_stdout | 2,900 | {
"solved_count": 571
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:163-C | codeforces | 163-C | Conveyor | https://codeforces.com/problemset/problem/163/C | [
"sortings",
"two pointers"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 615
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:163-B | codeforces | 163-B | Lemmings | https://codeforces.com/problemset/problem/163/B | [
"binary search"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 1181
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:163-A | codeforces | 163-A | Substring and Subsequence | https://codeforces.com/problemset/problem/163/A | [
"dp"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3002
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-J | codeforces | 162-J | Brackets | https://codeforces.com/problemset/problem/162/J | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 104
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-I | codeforces | 162-I | Truncatable primes | https://codeforces.com/problemset/problem/162/I | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 97
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-H | codeforces | 162-H | Alternating case | https://codeforces.com/problemset/problem/162/H | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 227
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-G | codeforces | 162-G | Non-decimal sum | https://codeforces.com/problemset/problem/162/G | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 89
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-F | codeforces | 162-F | Factorial zeros | https://codeforces.com/problemset/problem/162/F | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 230
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-E | codeforces | 162-E | HQ9+ | https://codeforces.com/problemset/problem/162/E | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 187
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-D | codeforces | 162-D | Remove digits | https://codeforces.com/problemset/problem/162/D | [
"*special"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 233
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-C | codeforces | 162-C | Prime factorization | https://codeforces.com/problemset/problem/162/C | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 1389
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-B | codeforces | 162-B | Binary notation | https://codeforces.com/problemset/problem/162/B | [
"*special"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 328
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:162-A | codeforces | 162-A | Pentagonal numbers | https://codeforces.com/problemset/problem/162/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 844
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:161-E | codeforces | 161-E | Polycarpus the Safecracker | https://codeforces.com/problemset/problem/161/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 508
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:161-D | codeforces | 161-D | Distance in Tree | https://codeforces.com/problemset/problem/161/D | [
"dfs and similar",
"dp",
"trees"
] | null | null | stdin_stdout | 1,800 | {
"solved_count": 19404
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:161-C | codeforces | 161-C | Abracadabra | https://codeforces.com/problemset/problem/161/C | [
"divide and conquer"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 695
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:161-B | codeforces | 161-B | Discounts | https://codeforces.com/problemset/problem/161/B | [
"constructive algorithms",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 2095
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:161-A | codeforces | 161-A | Dress'em in Vests! | https://codeforces.com/problemset/problem/161/A | [
"binary search",
"brute force",
"greedy",
"two pointers"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 5496
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:160-E | codeforces | 160-E | Buses and People | https://codeforces.com/problemset/problem/160/E | [
"binary search",
"data structures",
"sortings"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 686
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:160-D | codeforces | 160-D | Edges in MST | https://codeforces.com/problemset/problem/160/D | [
"dfs and similar",
"dsu",
"graphs",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3384
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:160-C | codeforces | 160-C | Find Pair | https://codeforces.com/problemset/problem/160/C | [
"implementation",
"math",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3724
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:160-B | codeforces | 160-B | Unlucky Ticket | https://codeforces.com/problemset/problem/160/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 15654
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:160-A | codeforces | 160-A | Twins | https://codeforces.com/problemset/problem/160/A | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 900 | {
"solved_count": 144873
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:159-E | codeforces | 159-E | Zebra Tower | https://codeforces.com/problemset/problem/159/E | [
"*special",
"data structures",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 1099
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:159-D | codeforces | 159-D | Palindrome pairs | https://codeforces.com/problemset/problem/159/D | [
"*special",
"brute force",
"dp",
"strings"
] | null | null | stdin_stdout | 1,500 | {
"solved_count": 4692
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:159-C | codeforces | 159-C | String Manipulation 1.0 | https://codeforces.com/problemset/problem/159/C | [
"*special",
"binary search",
"brute force",
"data structures",
"strings"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 3208
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:159-B | codeforces | 159-B | Matchmaker | https://codeforces.com/problemset/problem/159/B | [
"*special",
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 4191
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:159-A | codeforces | 159-A | Friends or Not | https://codeforces.com/problemset/problem/159/A | [
"*special",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 2663
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:158-E | codeforces | 158-E | Phone Talks | https://codeforces.com/problemset/problem/158/E | [
"*special",
"dp",
"sortings"
] | null | null | stdin_stdout | 1,900 | {
"solved_count": 1541
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:158-D | codeforces | 158-D | Ice Sculptures | https://codeforces.com/problemset/problem/158/D | [
"*special",
"brute force",
"number theory"
] | null | null | stdin_stdout | 1,300 | {
"solved_count": 6506
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:158-C | codeforces | 158-C | Cd and pwd commands | https://codeforces.com/problemset/problem/158/C | [
"*special",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,400 | {
"solved_count": 10431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:158-B | codeforces | 158-B | Taxi | https://codeforces.com/problemset/problem/158/B | [
"*special",
"greedy",
"implementation"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 104542
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:158-A | codeforces | 158-A | Next Round | https://codeforces.com/problemset/problem/158/A | [
"*special",
"implementation"
] | null | null | stdin_stdout | 800 | {
"solved_count": 323431
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:157-B | codeforces | 157-B | Trace | https://codeforces.com/problemset/problem/157/B | [
"geometry",
"sortings"
] | null | null | stdin_stdout | 1,000 | {
"solved_count": 14216
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:157-A | codeforces | 157-A | Game Outcome | https://codeforces.com/problemset/problem/157/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 8652
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:156-E | codeforces | 156-E | Mrs. Hudson's Pancakes | https://codeforces.com/problemset/problem/156/E | [
"brute force",
"dp"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 177
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:156-D | codeforces | 156-D | Clues | https://codeforces.com/problemset/problem/156/D | [
"combinatorics",
"graphs"
] | null | null | stdin_stdout | 2,500 | {
"solved_count": 2069
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:156-C | codeforces | 156-C | Cipher | https://codeforces.com/problemset/problem/156/C | [
"combinatorics",
"dp"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 2647
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:156-B | codeforces | 156-B | Suspects | https://codeforces.com/problemset/problem/156/B | [
"constructive algorithms",
"data structures",
"implementation"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 2455
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:156-A | codeforces | 156-A | Message | https://codeforces.com/problemset/problem/156/A | [
"brute force"
] | null | null | stdin_stdout | 1,700 | {
"solved_count": 3273
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:155-B | codeforces | 155-B | Combination | https://codeforces.com/problemset/problem/155/B | [
"greedy",
"sortings"
] | null | null | stdin_stdout | 1,100 | {
"solved_count": 10968
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:155-A | codeforces | 155-A | I_love_\%username\% | https://codeforces.com/problemset/problem/155/A | [
"brute force"
] | null | null | stdin_stdout | 800 | {
"solved_count": 94333
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:154-E | codeforces | 154-E | Martian Colony | https://codeforces.com/problemset/problem/154/E | [
"geometry"
] | null | null | stdin_stdout | 3,000 | {
"solved_count": 112
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:154-D | codeforces | 154-D | Flatland Fencing | https://codeforces.com/problemset/problem/154/D | [
"games",
"math"
] | null | null | stdin_stdout | 2,400 | {
"solved_count": 488
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:154-C | codeforces | 154-C | Double Profiles | https://codeforces.com/problemset/problem/154/C | [
"graphs",
"hashing",
"sortings"
] | null | null | stdin_stdout | 2,300 | {
"solved_count": 3331
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:154-B | codeforces | 154-B | Colliders | https://codeforces.com/problemset/problem/154/B | [
"math",
"number theory"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 6168
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:154-A | codeforces | 154-A | Hometask | https://codeforces.com/problemset/problem/154/A | [
"greedy"
] | null | null | stdin_stdout | 1,600 | {
"solved_count": 4332
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:153-E | codeforces | 153-E | Euclidean Distance | https://codeforces.com/problemset/problem/153/E | [
"*special"
] | null | null | stdin_stdout | 2,100 | {
"solved_count": 84
} | 2026-06-01T05:00:40.145500+00:00 |
codeforces:153-D | codeforces | 153-D | Date Change | https://codeforces.com/problemset/problem/153/D | [
"*special"
] | null | null | stdin_stdout | 2,000 | {
"solved_count": 89
} | 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.