AtCoder Beginner Contest 055
翻译中…
Problem Statement
翻译中…
Snuke loves working out. He is now exercising $N$ times.
翻译中…
Before he starts exercising, his power is $1$. After he exercises for the $i$-th time, his power gets multiplied by $i$.
翻译中…
Find Snuke's power after he exercises $N$ times. Since the answer can be extremely large, print the answer modulo $10^{9}+7$.
翻译中…
Constraints
翻译中…
$1 ≤ N ≤ 10^{5}$
翻译中…
Input
翻译中…
The input is given from Standard Input in the following format:
翻译中…
N翻译中…
Output
翻译中…
Print the answer modulo $10^{9}+7$.
翻译中…
样例
Input #1
3
Output #1
6
- After Snuke exercises for the first time, his power gets multiplied by $1$ and becomes $1$.
- After Snuke exercises for the second time, his power gets multiplied by $2$ and becomes $2$.
- After Snuke exercises for the third time, his power gets multiplied by $3$ and becomes $6$.
Input #2
10
Output #2
3628800
Input #3
100000
Output #3
457992974
Print the answer modulo $10^{9}+7$.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。