Elephant

一、Elephant

本题链接：Elephant

题目：
A. Elephant
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Examples

input
5
output
1

input
12
output
3

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.

本博客给出本题截图：

题意：每次可以走1，2，3，4，5步，问走到n最少需要几步

AC代码

#include <iostream>using namespace std;int main()
{
    int n, i = 0;cin >> n;for (i = 0; n > 0; i ++ )n -= 5;cout << i << endl;return 0;
}

总结

水题，不解释