A10356 | A Trivial Problem
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer $m$ and asks for the number of positive integers $n$ , such that the factorial of $n$ ends with exactly $m$ zeroes. Are you among those great programmers who can solve this problem?
输入格式
The only line of input contains an integer $m$ ( $1<=m<=100000$ ) — the required number of trailing zeroes in factorial.
输出格式
First print $k$ — the number of values of $n$ such that the factorial of $n$ ends with $m$ zeroes. Then print these $k$ integers in increasing order.
输入输出样例
输入 #1
1
输出 #1
5 5 6 7 8 9
输入 #2
5
输出 #2
0
The factorial of $n$ is equal to the product of all integers from $1$ to $n$ inclusive, that is $n!=1·2·3·...·n$ .
In the first sample, $5!=120$ , $6!=720$ , $7!=5040$ , $8!=40320$ and $9!=362880$ .
In the first sample, $5!=120$ , $6!=720$ , $7!=5040$ , $8!=40320$ and $9!=362880$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted