URAL - 1740 - Deer is Better!
来源:互联网 发布:cip协议解析 获取数据 编辑:程序博客网 时间:2024/05/17 21:06
题意:一只驴每h小时走k千米,现要走l千米,问这只驴最少用时与最长用时(1 ≤ k ≤ l ≤ 1000; 1 ≤ h ≤ 1000)。
题目链接:http://acm.timus.ru/problem.aspx?space=1&num=1740
——>>每h小时走k千米,可极限为第0.00000...001秒走了k千米或者最后0.00000...001秒走了k千米,这样就是多一个h与少一个h的问题了~
#include <cstdio>#include <cmath>using namespace std;int main(){ double l, k, h; while(scanf("%lf%lf%lf", &l, &k, &h) == 3) printf("%.8lf %.8lf\n", floor(l / k) * h, ceil(l / k) * h); return 0;}
- ural 1740 Deer is Better!
- URAL - 1740 - Deer is Better!
- Deer is Better! ural 1740
- English is better and better
- HDOJ More is better
- HDU2929:Bigger is Better
- Worse is Better
- hdu More is better
- HDOJ1856More is better
- More is better
- HDU1856:More is better
- HDU1856--More is better
- hdu1856-More is better
- HDU1856:More is better
- hdu1856 More is better
- H - More is better
- More is better
- More is better
- 目录说明
- Java中拷贝文件的效率问题
- IE常见的CSS的BUG(一)
- 用iSSH代替Mobile Terminal管理iOS
- 使用CCTMXTiledMap出错的问题!
- URAL - 1740 - Deer is Better!
- 大学那会儿,我读过的技术经典图书
- URAL - 1741 - Communication Fiend(dp)
- java:重写equals 和hashcode
- 本地存储策略
- Android 中各种XML文件的作用
- java中equal和==的比较
- Linux多线程——使用信号量同步线程
- 洋娃娃埋没了多少天才