1238: Simple学长买咖啡
内存限制:128 MB
时间限制:1.000 S
评测方式:文本比较
命题人:
提交:377
解决:202
题目描述
As you know,Simple buys coffee everyday,while he must program everyday ,so his time is very precious, then he invented a strange way of walking, one can walk 1, 2, 3, 4 or 5 unit of distance at once.It turned out that the Simple is located at point 0 and the shop is locatedat point x(x>0) of the coordinate line.Determine, what is the minimum number of steps he needs to make in order to get to the shop.
输入
The first T indicates there are T groups of date.
The first line of every group contains an integer x (1 ≤ x ≤ 1 000 000) — The coordinate of the shop.
输出
Print the minimum number of steps that Simple needs to make to get from point 0 to point x.
样例输入 复制
2
5
12
样例输出 复制
1
3