Codeforces Round #340 (Div. 2)：A. Elephant

An elephant decided to visit his friend. It turned out that the elephant's house is located at point0 and his friend's house is located at point x(x > 0) of the coordinate line. In one step the elephant can move1, 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 point0 to point x.

Sample test(s)

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 by3, 5 and 4. There are other ways to get the optimal answer but the elephant cannot reachx in less than three moves.

从5开始枚举

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
    int x;
    scanf("%d",&x);
    if(x%5==0) printf("%d\n", x/5);
    else {
        if(x%5%4==0) printf("%d\n", x/5+x%5/4);
        else {
            if(x%5%4%3==0) printf("%d\n", x/5+x%5/4+x%5%4/3);
            else {
                if(x%5%4%3%2==0) printf("%d\n", x/5+x%5/4+x%5%4/3+x%5%4%3/2);
                else{
                    printf("%d\n", x/5+x%5/4+x%5%4/3+x%5%4%3/2+x%5%4%3%2);
                }
            }
        }
    }
    return 0;
}

现在细想一下，其实写的代码还是太累赘，x%5只能是0、1、2、3、4，所以如果是0输出x/5，否则输出x/5+1即可

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
    int x;
    scanf("%d",&x);
    if(x%5==0) printf("%d\n", x/5);
    else {
       printf("%d\n", x/5+1);
    }
    return 0;
}