Where I can learn some techniques of number theory which I can use in competetive programming?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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