ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
40 | P1638F Two Posters | 0 / 0 | (None) | |
28 | P1641A Great Sequence | 0 / 0 | (None) | |
26 | P1641C Anonymity Is Important | 0 / 0 | (None) | |
25 | P1641D Two Arrays | 0 / 0 | (None) | |
19 | P1644B Anti-Fibonacci Permutation | 0 / 0 | (None) | |
18 | P1644C Increase Subarray Sums | 0 / 0 | (None) | |
16 | P1644E Expand the Path | 0 / 0 | (None) | |
13 | P1646B Quality vs Quantity | 0 / 0 | (None) | |
12 | P1646C Factorials and Powers of Two | 0 / 0 | (None) | |
10 | P1646E Power Board | 0 / 0 | (None) | |
7610 | P1647B Madoka and the Elegant Gift | 0 / 0 | (None) | |
7 | P1648B Integral Array | 0 / 0 | (None) | |
5214 | P1650D Twist the Permutation | 0 / 0 | (None) | |
7603 | P1651C Fault-tolerant Network | 0 / 0 | (None) | |
7600 | P1651F Tower Defense | 0 / 0 | (None) | |
7625 | P1654A Maximum Cake Tastiness | 0 / 0 | (None) | |
7621 | P1654E Arithmetic Operations | 0 / 0 | (None) | |
7722 | P1676C Most Similar Words | 0 / 0 | (None) | |
7721 | P1676D X-Sum | 0 / 0 | (None) | |
7717 | P1676H1 Maximum Crossings (Easy Version) | 0 / 0 | (None) |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.