8
Greatest Common Divisors (GCD) and Least Common Multiples (LCM) - Euclidean Algorithm
15/12/20224 bài tập
Nội dung
- Greatest Common Divisors (GCD) and Least Common Multiples (LCM) - Euclidean Algorithm
- Euler's Totient Function
- Primality Tests
- Randomized Algorithms (Probabilities)
Tài liệu (4)
Bài tập4
| OJ | Tên bài | Chủ đề | Trạng thái |
|---|---|---|---|
| Codeforces | Row GCD codeforces:1458A | ||
| Codeforces | Same GCDs codeforces:1295D | ||
| HackerRank | The Chosen One hackerrank:the-chosen-one | ||
| VNOJ | icpc22_national_d vnoj:icpc22_national_d |