ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
5355 | P1353E K-periodic Garland | 0 / 0 | (None) | |
5359 | P1354F Summoning Minions | 0 / 0 | (None) | |
5361 | P1355B Young Explorers | 0 / 0 | (None) | |
5384 | P1359B New Theatre Square | 0 / 0 | (None) | |
5389 | P1360E Polygon | 0 / 0 | (None) | |
5390 | P1360F Spy-string | 0 / 0 | (None) | |
5399 | P1363E Tree Shuffling | 0 / 0 | (None) | |
5400 | P1363F Rotating Substrings | 0 / 0 | (None) | |
5411 | P1366E Two Arrays | 0 / 0 | (None) | |
5412 | P1366F Jog Around The Graph | 0 / 0 | (None) | |
5413 | P1366G Construct the String | 0 / 0 | (None) | |
5416 | P1367E Necklace Assembly | 0 / 0 | (None) | |
5417 | P1367F1 Flying Sort (Easy Version) | 0 / 0 | (None) | |
5423 | P1368H1 Breadboard Capacity (easy version) | 0 / 0 | (None) | |
5427 | P1369D TediousLee | 0 / 0 | (None) | |
5432 | P1370D Odd-Even Subsequence | 0 / 0 | (None) | |
5438 | P1371E2 Asterism (Hard Version) | 0 / 0 | (None) | |
5442 | P1372D Omkar and Circle | 0 / 0 | (None) | |
5446 | P1373D Maximum Sum on Even Positions | 0 / 0 | (None) | |
5460 | P1379C Choosing flowers | 0 / 0 | (None) |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.