A10251 | Elephant
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
An elephant decided to visit his friend. It turned out that the elephant's house is located at point $0$ and his friend's house is located at point $x(x>0)$ of the coordinate line. In one step the elephant can move $1$ , $2$ , $3$ , $4$ or $5$ positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.
输入格式
The first line of the input contains an integer $x$ ( $1<=x<=1000000$ ) — The coordinate of the friend's house.
输出格式
Print the minimum number of steps that elephant needs to make to get from point $0$ to point $x$ .
输入输出样例
输入 #1
5
输出 #1
1
输入 #2
12
输出 #2
3
In the first sample the elephant needs to make one step of length $5$ to reach the point $x$ .
In the second sample the elephant can get to point $x$ if he moves by $3$ , $5$ and $4$ . There are other ways to get the optimal answer but the elephant cannot reach $x$ in less than three moves.
In the second sample the elephant can get to point $x$ if he moves by $3$ , $5$ and $4$ . There are other ways to get the optimal answer but the elephant cannot reach $x$ in less than three moves.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted