heartlessly / heartlessly.github.io

A blog for Heartlessly
1 stars 0 forks source link

「Codeforces 1164O」Greatest Prime Divisor | Heartlessly's Blog #105

Open heartlessly opened 5 years ago

heartlessly commented 5 years ago

https://heartlessly.github.io/problems/codeforces-1164o/

Description设 $S = 1 \cdot 1! + 2 \cdot 2! + 3\cdot 3! + \cdots + 100 \cdot 100!$,求 $S + 1$ 最大的质因子。