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 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
7 | nor | 155 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
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/rootN
is 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