100-days-of-rust/Week-14/Day-97_Elephant/README.md
2023-03-23 21:48:17 -04:00

35 lines
1019 B
Markdown
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

## Elephant
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 needs to make in order to get to his friend's house.
### Input
The first line of the input contains an integer x (1x1000000) — 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.
### Input Example
```
5
```
### Output Example
```
1
```
### Input Example
```
12
```
### Output Example
```
3
```
### Notes
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.