# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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