1月22号acm寒假练习第一题

Time limit1000 msMemory limit262144 kBSourceCodeforces Round #340 (Div. 2)Tagsmath *700EditorialTutorial

problem description

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
Examples Output
1

Examples Input
12
Examples Output
3

问题链接：https://vjudge.net/contest/279627#problem

问题描述：输入大象要走的路程，计算大象走的最小步数。

问题分析：步数每次都走最大步数，除了走小于5就能完成以外。

程序说明：用需要走的步数除以最大步数5所得的整形数，再用要走步数对最大步数求余，若不为0，则得到的整形数+1.

#include<iostream>
using namespace std;
int main()
{   int a,b,c;
    cin>>a;
	b=a/5;
	c=a;
	if(c%5!=0)
		b++;
	cout<<b<<endl;
}