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 | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3312 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 136 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
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.
| 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