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:2193-H
|
codeforces
|
2193-H
|
Remove the Grail Tree
|
https://codeforces.com/problemset/problem/2193/H
|
[
"dfs and similar",
"dp",
"graphs",
"greedy",
"implementation",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 567
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2193-G
|
codeforces
|
2193-G
|
Paths in a Tree
|
https://codeforces.com/problemset/problem/2193/G
|
[
"dfs and similar",
"interactive",
"sortings",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 1430
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2193-F
|
codeforces
|
2193-F
|
Pizza Delivery
|
https://codeforces.com/problemset/problem/2193/F
|
[
"dp",
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 5498
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2193-E
|
codeforces
|
2193-E
|
Product Queries
|
https://codeforces.com/problemset/problem/2193/E
|
[
"dp",
"math",
"number theory",
"shortest paths"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 11302
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2193-D
|
codeforces
|
2193-D
|
Monster Game
|
https://codeforces.com/problemset/problem/2193/D
|
[
"binary search",
"sortings",
"two pointers"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 16804
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2193-C
|
codeforces
|
2193-C
|
Replace and Sum
|
https://codeforces.com/problemset/problem/2193/C
|
[
"data structures",
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 22220
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2193-B
|
codeforces
|
2193-B
|
Reverse a Permutation
|
https://codeforces.com/problemset/problem/2193/B
|
[
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 23837
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2193-A
|
codeforces
|
2193-A
|
DBMB and the Array
|
https://codeforces.com/problemset/problem/2193/A
|
[
"brute force",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 33520
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2191-B
|
codeforces
|
2191-B
|
MEX Reordering
|
https://codeforces.com/problemset/problem/2191/B
|
[
"constructive algorithms",
"sortings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 16857
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2191-A
|
codeforces
|
2191-A
|
Array Coloring
|
https://codeforces.com/problemset/problem/2191/A
|
[
"constructive algorithms"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 22317
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2190-G
|
codeforces
|
2190-G
|
Maximize Determinant
|
https://codeforces.com/problemset/problem/2190/G
|
[
"graphs"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 53
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2190-F
|
codeforces
|
2190-F
|
Xor Product
|
https://codeforces.com/problemset/problem/2190/F
|
[
"bitmasks",
"dp"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 47
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2190-E
|
codeforces
|
2190-E
|
Median Permutation
|
https://codeforces.com/problemset/problem/2190/E
|
[
"combinatorics"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 156
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2190-D
|
codeforces
|
2190-D
|
Prufer Vertex
|
https://codeforces.com/problemset/problem/2190/D
|
[
"combinatorics",
"dsu",
"number theory",
"probabilities",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 729
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2190-C
|
codeforces
|
2190-C
|
Comparable Permutations
|
https://codeforces.com/problemset/problem/2190/C
|
[
"greedy",
"implementation",
"interactive",
"sortings",
"two pointers"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 1047
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2190-B2
|
codeforces
|
2190-B2
|
Sub-RBS (Hard Version)
|
https://codeforces.com/problemset/problem/2190/B2
|
[
"dp",
"games",
"implementation",
"strings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 2582
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2190-B1
|
codeforces
|
2190-B1
|
Sub-RBS (Easy Version)
|
https://codeforces.com/problemset/problem/2190/B1
|
[
"combinatorics",
"constructive algorithms",
"dp",
"greedy",
"strings",
"two pointers"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 8396
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2190-A
|
codeforces
|
2190-A
|
Sorting Game
|
https://codeforces.com/problemset/problem/2190/A
|
[
"constructive algorithms",
"games",
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 13810
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2189-F
|
codeforces
|
2189-F
|
Zhora the Vacuum Cleaner
|
https://codeforces.com/problemset/problem/2189/F
|
[
"data structures",
"dfs and similar",
"dp",
"greedy",
"implementation",
"sortings",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 137
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2189-E
|
codeforces
|
2189-E
|
Majority Wins?
|
https://codeforces.com/problemset/problem/2189/E
|
[
"constructive algorithms",
"greedy",
"math",
"strings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 534
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2189-D2
|
codeforces
|
2189-D2
|
Little String (Hard Version)
|
https://codeforces.com/problemset/problem/2189/D2
|
[
"combinatorics",
"dp",
"greedy",
"math",
"number theory"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 1376
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2189-D1
|
codeforces
|
2189-D1
|
Little String (Easy Version)
|
https://codeforces.com/problemset/problem/2189/D1
|
[
"combinatorics",
"dp",
"greedy",
"math",
"number theory"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 3037
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2189-C2
|
codeforces
|
2189-C2
|
XOR-convenience (Hard Version)
|
https://codeforces.com/problemset/problem/2189/C2
|
[
"bitmasks",
"constructive algorithms",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 4949
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2189-C1
|
codeforces
|
2189-C1
|
XOR Convenience (Easy Version)
|
https://codeforces.com/problemset/problem/2189/C1
|
[
"bitmasks",
"constructive algorithms",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 11341
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2189-B
|
codeforces
|
2189-B
|
The Curse of the Frog
|
https://codeforces.com/problemset/problem/2189/B
|
[
"constructive algorithms",
"greedy",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 12585
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2189-A
|
codeforces
|
2189-A
|
Table with Numbers
|
https://codeforces.com/problemset/problem/2189/A
|
[
"greedy",
"implementation"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 20970
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2188-B
|
codeforces
|
2188-B
|
Seats
|
https://codeforces.com/problemset/problem/2188/B
|
[
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 16229
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2188-A
|
codeforces
|
2188-A
|
Divisible Permutation
|
https://codeforces.com/problemset/problem/2188/A
|
[
"constructive algorithms"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 21245
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2187-G
|
codeforces
|
2187-G
|
Many Cartesian Trees
|
https://codeforces.com/problemset/problem/2187/G
|
[
"greedy",
"sortings",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 15
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2187-F2
|
codeforces
|
2187-F2
|
Al Fine (Counting Version)
|
https://codeforces.com/problemset/problem/2187/F2
|
[
"dp",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 23
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2187-F1
|
codeforces
|
2187-F1
|
Al Fine (Maximizing Version)
|
https://codeforces.com/problemset/problem/2187/F1
|
[
"binary search",
"divide and conquer",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 100
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2187-E
|
codeforces
|
2187-E
|
Doors and Keys
|
https://codeforces.com/problemset/problem/2187/E
|
[
"brute force",
"dp"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 77
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2187-D
|
codeforces
|
2187-D
|
Cool Problem
|
https://codeforces.com/problemset/problem/2187/D
|
[
"bitmasks",
"dp",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 338
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2187-C
|
codeforces
|
2187-C
|
Jerry and Tom
|
https://codeforces.com/problemset/problem/2187/C
|
[
"data structures",
"dfs and similar",
"dsu",
"games",
"graphs",
"greedy",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 811
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2187-B
|
codeforces
|
2187-B
|
Shortest Statement Ever
|
https://codeforces.com/problemset/problem/2187/B
|
[
"bitmasks",
"constructive algorithms",
"dp",
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 3688
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2187-A
|
codeforces
|
2187-A
|
Restricted Sorting
|
https://codeforces.com/problemset/problem/2187/A
|
[
"greedy",
"sortings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 11915
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2185-H
|
codeforces
|
2185-H
|
BattleCows 2
|
https://codeforces.com/problemset/problem/2185/H
|
[
"binary search",
"brute force",
"data structures",
"dp",
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 446
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2185-G
|
codeforces
|
2185-G
|
Mixing MEXes
|
https://codeforces.com/problemset/problem/2185/G
|
[
"data structures",
"implementation",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 2412
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2185-F
|
codeforces
|
2185-F
|
BattleCows
|
https://codeforces.com/problemset/problem/2185/F
|
[
"data structures",
"divide and conquer",
"implementation"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 3798
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2185-E
|
codeforces
|
2185-E
|
The Robotic Rush
|
https://codeforces.com/problemset/problem/2185/E
|
[
"binary search",
"greedy",
"implementation",
"two pointers"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 7751
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2185-D
|
codeforces
|
2185-D
|
OutOfMemoryError
|
https://codeforces.com/problemset/problem/2185/D
|
[
"data structures",
"implementation",
"math",
"two pointers"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 17317
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2185-C
|
codeforces
|
2185-C
|
Shifted MEX
|
https://codeforces.com/problemset/problem/2185/C
|
[
"implementation",
"sortings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 24199
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2185-B
|
codeforces
|
2185-B
|
Prefix Max
|
https://codeforces.com/problemset/problem/2185/B
|
[
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 33124
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2185-A
|
codeforces
|
2185-A
|
Perfect Root
|
https://codeforces.com/problemset/problem/2185/A
|
[
"constructive algorithms",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 34796
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2184-G
|
codeforces
|
2184-G
|
Nastiness of Segments
|
https://codeforces.com/problemset/problem/2184/G
|
[
"binary search",
"data structures"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 2249
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2184-F
|
codeforces
|
2184-F
|
Cherry Tree
|
https://codeforces.com/problemset/problem/2184/F
|
[
"dfs and similar",
"dp",
"graphs",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 3044
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2184-E
|
codeforces
|
2184-E
|
Exquisite Array
|
https://codeforces.com/problemset/problem/2184/E
|
[
"combinatorics",
"data structures",
"dsu",
"sortings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 4814
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2184-D
|
codeforces
|
2184-D
|
Unfair Game
|
https://codeforces.com/problemset/problem/2184/D
|
[
"combinatorics",
"dp",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 7957
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2184-C
|
codeforces
|
2184-C
|
Huge Pile
|
https://codeforces.com/problemset/problem/2184/C
|
[
"binary search",
"dfs and similar",
"dp",
"graphs",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 19251
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2184-B
|
codeforces
|
2184-B
|
Hourglass
|
https://codeforces.com/problemset/problem/2184/B
|
[
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 21569
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2184-A
|
codeforces
|
2184-A
|
Social Experiment
|
https://codeforces.com/problemset/problem/2184/A
|
[
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 33453
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-I2
|
codeforces
|
2183-I2
|
Pairs Flipping (Hard Version)
|
https://codeforces.com/problemset/problem/2183/I2
|
[
"constructive algorithms"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 43
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-I1
|
codeforces
|
2183-I1
|
Pairs Flipping (Easy Version)
|
https://codeforces.com/problemset/problem/2183/I1
|
[
"constructive algorithms"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 51
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-H
|
codeforces
|
2183-H
|
Minimise Cost
|
https://codeforces.com/problemset/problem/2183/H
|
[
"binary search",
"dp",
"greedy",
"sortings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 118
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-G
|
codeforces
|
2183-G
|
Snake Instructions
|
https://codeforces.com/problemset/problem/2183/G
|
[
"constructive algorithms",
"greedy",
"interactive"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 185
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-F
|
codeforces
|
2183-F
|
Jumping Man
|
https://codeforces.com/problemset/problem/2183/F
|
[
"brute force",
"combinatorics",
"dfs and similar",
"dp",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 910
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-E
|
codeforces
|
2183-E
|
LCM is Legendary Counting Master
|
https://codeforces.com/problemset/problem/2183/E
|
[
"dp",
"math",
"number theory"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 2454
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-D2
|
codeforces
|
2183-D2
|
Tree Coloring (Hard Version)
|
https://codeforces.com/problemset/problem/2183/D2
|
[
"combinatorics",
"constructive algorithms",
"data structures",
"dfs and similar",
"greedy",
"implementation",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 2206
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-D1
|
codeforces
|
2183-D1
|
Tree Coloring (Easy Version)
|
https://codeforces.com/problemset/problem/2183/D1
|
[
"constructive algorithms",
"dfs and similar",
"greedy",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 7533
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-C
|
codeforces
|
2183-C
|
War Strategy
|
https://codeforces.com/problemset/problem/2183/C
|
[
"binary search",
"greedy",
"math",
"two pointers"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 9360
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-B
|
codeforces
|
2183-B
|
Yet Another MEX Problem
|
https://codeforces.com/problemset/problem/2183/B
|
[
"constructive algorithms",
"greedy"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 14919
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2183-A
|
codeforces
|
2183-A
|
Binary Array Game
|
https://codeforces.com/problemset/problem/2183/A
|
[
"games"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 21961
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2182-G
|
codeforces
|
2182-G
|
Short Garland
|
https://codeforces.com/problemset/problem/2182/G
|
[
"combinatorics",
"data structures",
"dfs and similar",
"dp",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 291
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2182-F2
|
codeforces
|
2182-F2
|
Christmas Reindeer (hard version)
|
https://codeforces.com/problemset/problem/2182/F2
|
[
"bitmasks",
"brute force",
"combinatorics",
"data structures",
"greedy",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 936
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2182-F1
|
codeforces
|
2182-F1
|
Christmas Reindeer (easy version)
|
https://codeforces.com/problemset/problem/2182/F1
|
[
"bitmasks",
"brute force",
"combinatorics",
"dp",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 1102
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2182-E
|
codeforces
|
2182-E
|
New Year's Gifts
|
https://codeforces.com/problemset/problem/2182/E
|
[
"binary search",
"data structures",
"greedy",
"sortings",
"two pointers"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 4839
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2182-D
|
codeforces
|
2182-D
|
Christmas Tree Decoration
|
https://codeforces.com/problemset/problem/2182/D
|
[
"combinatorics",
"dp",
"greedy",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 7705
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2182-C
|
codeforces
|
2182-C
|
Production of Snowmen
|
https://codeforces.com/problemset/problem/2182/C
|
[
"brute force",
"combinatorics",
"dp"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 13743
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2182-B
|
codeforces
|
2182-B
|
New Year Cake
|
https://codeforces.com/problemset/problem/2182/B
|
[
"brute force"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 20737
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2182-A
|
codeforces
|
2182-A
|
New Year String
|
https://codeforces.com/problemset/problem/2182/A
|
[
"constructive algorithms",
"greedy",
"implementation",
"strings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 22547
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-M
|
codeforces
|
2181-M
|
Medical Parity
|
https://codeforces.com/problemset/problem/2181/M
|
[
"dp",
"strings"
] | null | null |
stdin_stdout
| 1,700
|
{
"solved_count": 2678
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-L
|
codeforces
|
2181-L
|
LLM Training
|
https://codeforces.com/problemset/problem/2181/L
|
[
"math",
"string suffix structures"
] | null | null |
stdin_stdout
| 2,800
|
{
"solved_count": 107
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-K
|
codeforces
|
2181-K
|
Knit the Grid
|
https://codeforces.com/problemset/problem/2181/K
|
[
"2-sat",
"constructive algorithms",
"graphs",
"matrices"
] | null | null |
stdin_stdout
| 3,500
|
{
"solved_count": 50
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-J
|
codeforces
|
2181-J
|
Jinx or Jackpot
|
https://codeforces.com/problemset/problem/2181/J
|
[
"brute force",
"dp",
"math",
"probabilities"
] | null | null |
stdin_stdout
| 2,300
|
{
"solved_count": 588
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-I
|
codeforces
|
2181-I
|
Irrigation Interlock
|
https://codeforces.com/problemset/problem/2181/I
|
[
"geometry"
] | null | null |
stdin_stdout
| 3,500
|
{
"solved_count": 33
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-H
|
codeforces
|
2181-H
|
Honey Cake
|
https://codeforces.com/problemset/problem/2181/H
|
[
"brute force",
"math",
"number theory"
] | null | null |
stdin_stdout
| 1,200
|
{
"solved_count": 5175
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-G
|
codeforces
|
2181-G
|
Greta's Game
|
https://codeforces.com/problemset/problem/2181/G
|
[
"binary search",
"dp",
"graphs",
"greedy",
"math"
] | null | null |
stdin_stdout
| 2,400
|
{
"solved_count": 531
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-F
|
codeforces
|
2181-F
|
Fragmented Nim
|
https://codeforces.com/problemset/problem/2181/F
|
[
"games"
] | null | null |
stdin_stdout
| 1,600
|
{
"solved_count": 2701
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-E
|
codeforces
|
2181-E
|
Elevator Against Humanity
|
https://codeforces.com/problemset/problem/2181/E
|
[
"brute force",
"constructive algorithms",
"greedy",
"sortings"
] | null | null |
stdin_stdout
| 2,900
|
{
"solved_count": 113
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-D
|
codeforces
|
2181-D
|
Doorway
|
https://codeforces.com/problemset/problem/2181/D
|
[
"binary search",
"data structures",
"sortings"
] | null | null |
stdin_stdout
| 2,000
|
{
"solved_count": 1054
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-C
|
codeforces
|
2181-C
|
Cacti Classification
|
https://codeforces.com/problemset/problem/2181/C
|
[
"binary search",
"constructive algorithms",
"interactive",
"math"
] | null | null |
stdin_stdout
| 3,200
|
{
"solved_count": 114
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-B
|
codeforces
|
2181-B
|
Battle of Arrays
|
https://codeforces.com/problemset/problem/2181/B
|
[
"data structures",
"games",
"greedy"
] | null | null |
stdin_stdout
| 1,400
|
{
"solved_count": 4082
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2181-A
|
codeforces
|
2181-A
|
Alphabet City
|
https://codeforces.com/problemset/problem/2181/A
|
[
"binary search",
"math",
"strings"
] | null | null |
stdin_stdout
| 1,300
|
{
"solved_count": 3017
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-H2
|
codeforces
|
2180-H2
|
Bug Is Feature (Conditional Version)
|
https://codeforces.com/problemset/problem/2180/H2
|
[
"games"
] | null | null |
stdin_stdout
| 3,500
|
{
"solved_count": 84
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-H1
|
codeforces
|
2180-H1
|
Bug Is Feature (Unconditional Version)
|
https://codeforces.com/problemset/problem/2180/H1
|
[
"games"
] | null | null |
stdin_stdout
| 3,400
|
{
"solved_count": 102
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-G
|
codeforces
|
2180-G
|
Balance
|
https://codeforces.com/problemset/problem/2180/G
|
[
"bitmasks",
"combinatorics",
"implementation",
"math"
] | null | null |
stdin_stdout
| 3,500
|
{
"solved_count": 112
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-F2
|
codeforces
|
2180-F2
|
Control Car (Hard Version)
|
https://codeforces.com/problemset/problem/2180/F2
|
[
"combinatorics",
"dp",
"matrices",
"probabilities"
] | null | null |
stdin_stdout
| 3,200
|
{
"solved_count": 196
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-F1
|
codeforces
|
2180-F1
|
Control Car (Easy Version)
|
https://codeforces.com/problemset/problem/2180/F1
|
[
"combinatorics",
"dp",
"probabilities"
] | null | null |
stdin_stdout
| 2,800
|
{
"solved_count": 362
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-E
|
codeforces
|
2180-E
|
No Effect XOR
|
https://codeforces.com/problemset/problem/2180/E
|
[
"bitmasks",
"divide and conquer",
"dp",
"greedy",
"math"
] | null | null |
stdin_stdout
| 2,300
|
{
"solved_count": 1606
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-D
|
codeforces
|
2180-D
|
Insolvable Disks
|
https://codeforces.com/problemset/problem/2180/D
|
[
"data structures",
"dp",
"greedy",
"math"
] | null | null |
stdin_stdout
| 1,900
|
{
"solved_count": 3940
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-C
|
codeforces
|
2180-C
|
XOR-factorization
|
https://codeforces.com/problemset/problem/2180/C
|
[
"bitmasks",
"constructive algorithms",
"dp",
"greedy",
"number theory"
] | null | null |
stdin_stdout
| 1,900
|
{
"solved_count": 5844
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-B
|
codeforces
|
2180-B
|
Ashmal
|
https://codeforces.com/problemset/problem/2180/B
|
[
"greedy",
"strings"
] | null | null |
stdin_stdout
| 800
|
{
"solved_count": 22770
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2180-A
|
codeforces
|
2180-A
|
Carnival Wheel
|
https://codeforces.com/problemset/problem/2180/A
|
[
"brute force",
"number theory"
] | null | null |
stdin_stdout
| 800
|
{
"solved_count": 24136
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2179-H
|
codeforces
|
2179-H
|
Blackslex and Plants
|
https://codeforces.com/problemset/problem/2179/H
|
[
"bitmasks",
"data structures",
"dp",
"implementation",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 1115
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2179-G
|
codeforces
|
2179-G
|
Blackslex and Penguin Migration
|
https://codeforces.com/problemset/problem/2179/G
|
[
"brute force",
"interactive",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 1053
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2179-F
|
codeforces
|
2179-F
|
Blackslex and Another RGB Walking
|
https://codeforces.com/problemset/problem/2179/F
|
[
"constructive algorithms",
"graphs",
"interactive",
"number theory",
"trees"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 2473
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2179-E
|
codeforces
|
2179-E
|
Blackslex and Girls
|
https://codeforces.com/problemset/problem/2179/E
|
[
"constructive algorithms",
"geometry",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 5289
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2179-D
|
codeforces
|
2179-D
|
Blackslex and Penguin Civilization
|
https://codeforces.com/problemset/problem/2179/D
|
[
"bitmasks",
"constructive algorithms",
"greedy",
"math"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 12264
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2179-C
|
codeforces
|
2179-C
|
Blackslex and Number Theory
|
https://codeforces.com/problemset/problem/2179/C
|
[
"implementation",
"math",
"number theory",
"sortings"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 20540
}
|
2026-02-02T02:50:16.862534+00:00
|
codeforces:2179-B
|
codeforces
|
2179-B
|
Blackslex and Showering
|
https://codeforces.com/problemset/problem/2179/B
|
[
"dp",
"greedy",
"implementation"
] | null | null |
stdin_stdout
| null |
{
"solved_count": 26525
}
|
2026-02-02T02:50:16.862534+00:00
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.