Hi,
Here Problem link:http://codeforces.me/contest/273/problem/B
Here m can be non prime number.How can I handle the division property? I read tutorialhttp://codeforces.me/blog/entry/6625, but I can't understand properly. Can you reply, thanks
# | 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 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
Hi,
Here Problem link:http://codeforces.me/contest/273/problem/B
Here m can be non prime number.How can I handle the division property? I read tutorialhttp://codeforces.me/blog/entry/6625, but I can't understand properly. Can you reply, thanks
Name |
---|
The exact number you want to compute is a fraction, with some factorials in the nominator and 2^(number of pairs that occur in both sequences). So, you can just pre-compute all the required factorials, and split each into a number of form o*(2^p), where o is an odd number modulo M and x >= 0. Then, you can handle separately all the odd prime factors (merged in o) and the power of 2.