Hi!
How to solve the following problem: https://www.hackerearth.com/problem/algorithm/hanumant-and-his-love/description/
The problem asks to solve the following summation:
where p is a prime and φ(m) is the Euler totient function.
Thanks!
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Hanumant and His Love — CodeBattle Problem
Hi!
How to solve the following problem: https://www.hackerearth.com/problem/algorithm/hanumant-and-his-love/description/
The problem asks to solve the following summation:
where p is a prime and φ(m) is the Euler totient function.
Thanks!
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | Death_Scythe | 2017-03-19 08:24:58 | 390 | Initial revision (published) |
Название |
---|