Codeforces 617A-Elephant
2016-01-29 17:57
375 查看
A. Elephant
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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.
Sample test(s)
input
output
input
output
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.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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.
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 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.
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int main() { int N; while(scanf("%d",&N)!=EOF) { int uu,uui; uu=N/5; uui=N%5; if(uui!=0) uu++; printf("%d\n",uu); } return 0; }
相关文章推荐
- Windows 平台10.2.0.1 升级到10.2.0.4 报msvcr71.dll错误解决
- 【转】with as 递归实现嵌套循环
- DEV treeList 获取 ListcheckBox选中节点内容
- 【转载】MySQL被慢sql hang住了,用shell脚本快速清除不断增长的慢sql的办法
- MKMapView用法
- WebStorm 11、PhpStorm 10免费激活(不需要注册码)
- PWLib指引者[转]
- android cordova混合开发(交互部分)
- STM32 BUTTON方式(polling & interrupt)
- 数学小魔术——猜数字
- js动态的属性名如何取该属性的值
- 通过Linux命令过滤出binlog中完整的SQL语句
- 【转载】 使用Anemometer基于pt-query-digest将MySQL慢查询可视化
- Js作用域与作用域链详解
- Android硬件加速的一些问题和错误
- springmvc validator遇到的问题
- 3. Longest Substring Without Repeating Characters
- Error NO.2013 Lost connection to Mysql server during query
- ntohs, ntohl, htons,htonl的比较和详解【转】
- unity3d 项目测试笔记