Where I can learn some techniques of number theory which I can use in competetive programming?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
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