CF617A.Elephant
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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.