Dear brethren, If you guys were to give a CF based rating to today's GCJ qualification problems what would be? A, B, C, D, E?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Dear brethren, If you guys were to give a CF based rating to today's GCJ qualification problems what would be? A, B, C, D, E?
| Name |
|---|



$$$A - 900$$$, $$$B - 1400$$$, $$$C - 1500$$$, $$$D - 1900$$$ and $$$E - 2100$$$
B's hidden test case was hard.(atleast for me)
C was definitely more than 1600.
dont know about D and E.
Actually the dp solution for B is very easy to implement, and you don't need to worry about case analysis. C was also much easier if we started backwards, and built our answer from that.
much easier if we started backwardsOh that's what she said.
.
.
.
I meant recursive DP xD