# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | Petr | 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