Problem : 86D - Powerful array My submission: 193616090
I don't understand what I'm doing wrong here?
This problem can be solved using Moss algorithm. So I was trying to solve this with moss algorithm but still time limit for test case no 6.
Problem : 86D - Powerful array My submission: 193616090
I don't understand what I'm doing wrong here?
This problem can be solved using Moss algorithm. So I was trying to solve this with moss algorithm but still time limit for test case no 6.
| # | 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 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
| Name |
|---|



q1.l-1/rootN == q2.l-1/rootNis evaluated asq1.l-(1/rootN) == q2.l-(1/rootN)due to the order of operations. You want to add parenthesis around the subtraction since that is what you're trying to do:(q1.l-1)/rootN == (q2.l-1)/rootN