Hi,
Here Problem link:http://codeforces.com/contest/273/problem/B
Here m can be non prime number.How can I handle the division property? I read tutorialhttp://codeforces.com/blog/entry/6625, but I can't understand properly. Can you reply, thanks
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Hi,
Here Problem link:http://codeforces.com/contest/273/problem/B
Here m can be non prime number.How can I handle the division property? I read tutorialhttp://codeforces.com/blog/entry/6625, but I can't understand properly. Can you reply, thanks
Название |
---|
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.