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
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
5 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | 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
Hi, if the upper range of unsigned __int64 is 2^64-1 then how can I get any number modulo by 2^64? Thanks.
Your text to link here... My dp solution is O(n^2) but here n=50000 and time is 1 sec. Is there any mathematical formula which reduces time within 1 sec. Any hints...Thanks
http://www.codeforces.com/contest/112/problem/D
if input is=> 18 4 why output is=> 2, if I'm not wrong it would be 3, because 6,9,18 aren't divisor of the 14,15,16,17.
and the last input=> 10000 3 output should be 23, because out of 25 divisor of 10000 ,there are only 1 and 2 common divisor between 10000 and 9998
Name |
---|