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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
3 | adamant | 156 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
7 | maroonrk | 153 |
7 | cry | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
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.
Название |
---|
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