| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
| 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