05 | Tutorial | Number Theory I

📌 Sheet: https://codeforces.com/group/dGAT8VJT3b/contests 📚 Materials: Sieve → http://youkn0wwho.academy/topic-list/sieve Binary Exponentiation → https://youkn0wwho.academy/topic-list/binary_exponentiation 🧩 Templates: Divisors (O(√n)) → https://ideone.com/feX42C IsPrime (O(√n)) → https://ideone.com/ez97Rs Prime Factors (O(√n)) → https://ideone.com/xxc8Nq Sieve → https://ideone.com/IaNWZi Linear Sieve → https://ideone.com/n5h9Qg Precompute Divisors (O(n log n)) → https://ideone.com/QH87nI Modular Arithmetic → https://ideone.com/lfJ4c1 SPF + Fast Factorization → https://ideone.com/MZ4Pxm 💡 Solutions: Problem V → https://ideone.com/cNmBEM Problem P → https://ideone.com/gNIEjQ Problem W → https://ideone.com/Oj7UBA Problem R → https://ideone.com/UcdkNZ Problem P2 → https://ideone.com/TgPok7 ⏱️ Timestamps: 00:00 – Intro 01:46 – Divisors 17:39 – Prime Numbers 22:20 – Prime Factorization 37:33 – Problem V 40:20 – Problem P 48:15 – Sieve 01:13:18 – Problem W 01:18:57 – Problem R 01:21:42 – Modular Arithmetic 01:38:50 – Fast Power 01:55:46 – SPF