Where I can learn some techniques of number theory which I can use in competetive programming?
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Where I can learn some techniques of number theory which I can use in competetive programming?
Name |
---|
Solving problem is a really good way i think...
You can use CodeForces Number Theory tag and also Project Euler have some problems that a lot of them are math or number theories....
Also this page is good I think...Wish help you
(UP: you can google that page's subjects easily and learn about them)
I am not very good in number theory but these are important : - find out number n is prime or not and diviosrs of number n O(sqrt(n)) - find prime numbers less than number n - calculate pow(a,b) in O(logb) - calculate a/b mod p
these are the most useful things in number theory i guess