# | User | Rating |
---|---|---|
1 | jiangly | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 158 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 151 |
8 | awoo | 151 |
10 | TheScrasse | 147 |
Name |
---|
I am the author of problem C, and I have to admit, I have never known of any of those links above, and none of my friends told me about those either :D
P/s: And yes, might be subjective, but I'd rather implementing this one than Googling :D
That's funny because you can just google the whole phrase from the statement: "the number of trailing zero digits in the b-ary (in the base/radix of b) representation of n! (factorial of n)."
also https://cp-algorithms.com/algebra/factorial-divisors.html :)
and russian http://e-maxx.ru/algo/factorial_divisors
Hi so to me seems like a notorious coincidence