ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
---|---|---|---|---|
9216 | P1957B A BIT of a Construction | 0 / 0 | 3 | |
9203 | P1966B Rectangle Filling | 0 / 0 | 3 | |
9202 | P1967A Permutation Counting | 0 / 0 | 4 | |
9198 | P1967D Long Way to be Non-decreasing | 0 / 0 | 10 | |
9195 | P1967F Next and Prev | 0 / 0 | 10 | |
9186 | P1969A Two Friends | 0 / 0 | 3 | |
9184 | P1969C Minimizing the Sum | 0 / 0 | 5 | |
9181 | P1969F Card Pairing | 0 / 0 | 10 | |
9180 | P1970A1 Balanced Shuffle (Easy) | 0 / 0 | (None) | |
9165 | P1970F1 Playing Quidditch (Easy) | 0 / 0 | (None) | |
9164 | P1970F2 Playing Quidditch (Medium) | 0 / 0 | (None) | |
9163 | P1970F3 Playing Quidditch (Hard) | 0 / 0 | (None) | |
9312 | P1971A My First Sorting Problem | 0 / 0 | 3 | |
9311 | P1971B Different String | 0 / 0 | 3 | |
9310 | P1971C Clock and Strings | 0 / 0 | 3 | |
9309 | P1971D Binary Cut | 0 / 0 | 3 | |
9307 | P1971F Circle Perimeter | 0 / 0 | 5 | |
9304 | P1973A Chess For Three | 0 / 0 | 3 | |
9302 | P1973C Cat, Fox and Double Maximum | 0 / 0 | 5 | |
9299 | P1973F Maximum GCD Sum Queries | 0 / 0 | 10 |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.