# | 题目 | 难度 | 提交 | 通过率(AC/submission) | |
---|---|---|---|---|---|
4202 |
data structures
|
★ ★ ★ |
![]() |
0% ![]() |
|
4201 |
binary search,combinatorics,implementation
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4200 |
bitmasks
|
★ ★ ★ |
![]() |
0% ![]() |
|
4199 |
binary search,dfs and similar,hashing,string suffix structures,trees
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4198 |
brute force,implementation,strings
|
★ |
![]() |
0% ![]() |
|
4197 |
dfs and similar,dp,dsu,graphs
|
★ ★ |
![]() |
0% ![]() |
|
4196 |
dfs and similar,dp,two pointers
|
★ ★ ★ |
![]() |
0% ![]() |
|
4195 |
dfs and similar
|
★ ★ ★ |
![]() |
0% ![]() |
|
4194 |
binary search,greedy
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4193 |
brute force,dfs and similar,dsu
|
★ ★ ★ |
![]() |
0% ![]() |
|
4192 |
combinatorics,dp,matrices,strings
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4191 |
geometry,math
|
★ ★ |
![]() |
0% ![]() |
|
4190 |
implementation,math
|
★ ★ ★ |
![]() |
0% ![]() |
|
4189 |
dp,implementation
|
★ ★ ★ |
![]() |
0% ![]() |
|
4188 |
brute force
|
★ |
![]() |
0% ![]() |
|
4187 |
greedy
|
★ ★ |
![]() |
0% ![]() |
|
4186 |
greedy
|
★ ★ ★ |
![]() |
0% ![]() |
|
4185 |
dp,greedy
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4184 |
brute force,implementation
|
★ |
![]() |
0% ![]() |
|
4183 |
constructive algorithms,greedy,implementation
|
★ ★ |
![]() |
0% ![]() |
|
4182 |
dp,greedy,implementation
|
★ ★ ★ |
![]() |
0% ![]() |
|
4181 |
dp
|
★ ★ ★ ★ ★ |
![]() |
0% ![]() |
|
4180 |
greedy,math
|
★ |
![]() |
100% ![]() |
|
4179 |
strings
|
★ ★ |
![]() |
0% ![]() |
|
4178 |
geometry
|
★ ★ ★ |
![]() |
0% ![]() |
|
4177 |
math
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4176 |
implementation
|
★ |
![]() |
0% ![]() |
|
4175 |
dfs and similar
|
★ ★ |
![]() |
0% ![]() |
|
4174 |
bitmasks,brute force,dp,math
|
★ ★ ★ |
![]() |
0% ![]() |
|
4173 |
dp,trees
|
★ ★ ★ |
![]() |
0% ![]() |
|
4172 |
constructive algorithms,math
|
★ |
![]() |
0% ![]() |
|
4171 |
brute force
|
★ ★ |
![]() |
0% ![]() |
|
4170 |
bitmasks,divide and conquer,math
|
★ ★ |
![]() |
0% ![]() |
|
4169 |
dfs and similar
|
★ ★ ★ |
![]() |
0% ![]() |
|
4168 |
constructive algorithms,data structures
|
★ ★ ★ |
![]() |
0% ![]() |
|
4167 |
dp
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4166 |
dp
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4165 |
flows
|
★ ★ ★ ★ ★ |
![]() |
0% ![]() |
|
4164 |
flows
|
★ ★ ★ ★ ★ |
![]() |
0% ![]() |
|
4163 |
greedy,implementation
|
★ |
![]() |
0% ![]() |
|
4162 |
brute force,data structures,geometry,math
|
★ ★ |
![]() |
0% ![]() |
|
4161 |
binary search,hashing,string suffix structures,strings
|
★ ★ ★ |
![]() |
0% ![]() |
|
4160 |
binary search,data structures,two pointers
|
★ ★ ★ |
![]() |
0% ![]() |
|
4159 |
dp,matrices
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4158 |
brute force,dsu,meet-in-the-middle,number theory
|
★ ★ |
![]() |
0% ![]() |
|
4157 |
greedy,math,sortings
|
★ ★ ★ |
![]() |
0% ![]() |
|
4156 |
constructive algorithms,greedy
|
★ ★ ★ |
![]() |
0% ![]() |
|
4155 |
data structures
|
★ ★ ★ ★ |
![]() |
0% ![]() |
|
4154 |
dfs and similar,dp,dsu,trees,two pointers
|
★ ★ ★ |
![]() |
0% ![]() |
|
4153 |
math,number theory
|
★ ★ ★ ★ |
![]() |
0% ![]() |