Hello Guys, I am stuck on deciding how should I practice Number Theory problems based on the concepts that I have learned. I recently came across the following algorithms on Number Theory.
- Prime Factorisation
- Binary Exponentiation
- Euclid's Algorithm
- Extended Euclid's Algorithm
- Sieve of Erathosene
- Euler's totient function
- Linear Diophantine Equation
- Chinese Remainder Theorem
Could you guys please help me find the problems related to the above topics on codeforces?
Auto comment: topic has been updated by Pulkit95700 (previous revision, new revision, compare).
https://youkn0wwho.academy/topic-list/?category=number_theory
helpful, thanks.
Thank you. This is the best properly organized resource I have seen for learning any topic.
https://codeforces.com/blog/entry/49494
https://codeforces.com/contests/348180
Solve 1973F - Maximum GCD Sum Queries
Is it kinda multiple-topic mashup problem?
don't listen to the cheater
Hey pulkit do you get any website for practicing topic wise questions if yes can you share
https://youkn0wwho.academy/topic-list/?category=number_theory
This is the best I found so far.
Bhaiya Ji Blogs Bhi Likhte Hai..
PS : Nice Blog✨