CodeForces 617A Elephant

最新推荐文章于 2021-10-07 10:58:00 发布

lizhaowei213

最新推荐文章于 2021-10-07 10:58:00 发布

阅读量369

点赞数

CC 4.0 BY-SA版权

分类专栏：模拟&水贪心

本文链接：https://blog.youkuaiyun.com/lizhaowei213/article/details/50586547

模拟&水同时被 2 个专栏收录

50 篇文章

订阅专栏

贪心

11 篇文章

订阅专栏

这篇博客介绍了一个利用贪心算法解决的实际问题：一只大象如何以最少的步数到达朋友家。通过分析问题，我们了解到贪心策略在此类问题中能够提供最优解，并通过代码实现验证了算法的有效性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Input

The first line of the input contains an integer x (1 ≤ x ≤ 1 000 000) — The coordinate of the friend's house.

Output

Print the minimum number of steps that elephant needs to make to get from point 0 to point x.

Sample test(s)

Input

Output

Input

Output

Note

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.

贪心水题。一次最多移动5，那就求余数就行了。

x=input()
if x % 5 == 0:
    print x/5
else:
    print x / 5 + 1