HDU 2832 Snail’s trouble [模拟]
来源:互联网 发布:网络反侦查 编辑:程序博客网 时间:2024/06/04 19:07
Description
一只蜗牛在一根绳子上爬啊爬,k cm/min,然后绳子它每爬完,就延长1m,不过蜗牛的位置比例不变。然后问多久能爬到
Alogrithm
模拟蜗牛爬,绳子延长就OK了
Code
#include <iostream>using namespace std;int main(){ int k; while (cin >> k) { double x = 0; double l = 100; int t = 0; for (;;) { t++; x += k; if (x >= l) break; x /= l; l += 100; x *= l; } cout << t << endl; } return 0;}
0 0
- HDU 2832 Snail’s trouble [模拟]
- hdu 2832 Snail’s trouble
- HDU 2832 Snail’s trouble 数学题
- HDU 2832 Snail’s trouble(数学题)
- HDU 2832-Snail’s trouble(分治)
- HDU 1302 The Snail【模拟】
- SGU 476 Coach's Trouble 大数模拟
- hdu 1302 The Snail (模拟)
- HDU 1302 The Snail(模拟题)
- Trouble HDU
- 1302 The Snail【模拟】
- 【模拟】HDU1302The Snail
- king's trouble II
- king's trouble II
- king's trouble I
- king's trouble I
- HDU 1302 The Snail
- hdu 1302 The Snail
- java.lang.NoClassDefFoundError: org/mybatis/generator/exception/InvalidConfigurationException
- 同名函数及链接过程
- 日本房地产泡沫破裂后的平民生活
- 1050 螺旋矩阵(25)
- Kotlin入门篇之——HelloWord
- HDU 2832 Snail’s trouble [模拟]
- ningbooj--1655--木块拼接(贪心)
- Error:java.io.FileNotFoundException: 系统找不到指定的文件.
- 关于linux socket 编程 端口复用的理解
- 图形化打印二叉树
- java 数据结构 常见的排序算法
- leetcode:Count of Smaller Numbers After Self
- HibernateDaoSupport
- 动态输入日期与时间(DatePicker与TimePicker应用)