寒假杭电acm 4
来源:互联网 发布:程序员转行做销售 编辑:程序博客网 时间:2024/05/16 17:56
/*
*Copyright (c) 2015,烟台大学计算机学院
*All rights reserved.
*文件名称:.cpp
*作者:孙旭明
*完成时间:2015年4月12号
*版本号:v1.0
*问题输入:
An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it slips down d inches. The process of climbing and resting then repeats. How long before the worm climbs out of the well? We'll always count a portion of a minute as a whole minute and if the worm just reaches the top of the well at the end of its climbing, we'll assume the worm makes it out.
Input
There will be multiple problem instances. Each line will contain 3 positive integers n, u and d. These give the values mentioned in the paragraph above. Furthermore, you may assume d < u and n < 100. A value of n = 0 indicates end of output.
Output
Each input instance should generate a single integer on a line, indicating the number of minutes it takes for the worm to climb out of the well.
问题输出:
Sample Input
10 2 1
20 3 1
0 0 0
Sample Output
17
19
*/
#include <iostream>
using namespace std;
int main()
{
int n,d,u,t1=0,t2=0,count;
while (cin>>n>>d>>u&&n!=0)
{
t1=0;
t2=0;
count=0;
while (count<=n)
{
count+=d;
t1++;
if(count>=n)
break;
count-=u;
t2++;
}
cout<<t1+t2<<endl;
}
return 0;
}
- 寒假杭电acm 4
- 寒假杭电acm 1
- 寒假杭电acm 2奇数乘积
- 寒假杭电acm3
- 寒假杭电acm5
- 杭电 ACM 1.2.4
- 杭电ACM 1.2.4 GPA
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电acm 1010
- 杭电 acm 1045
- 杭电ACM-1010
- 杭电ACM 1172
- 杭电ACM 1174
- 杭电ACM 1175
- 杭电ACM 分类
- 杭电ACM分类
- 杭电acm 1000
- EventBus使用详解(一)——初步使用EventBus
- OJ 199 Binary Tree Side View
- C语言printf()函数的%*s输出
- 关于 (&a+1) 的困惑
- 层次化查询(START BY ... CONNECT BY PRIOR)
- 寒假杭电acm 4
- LOB 代表大对象数据,包括 BLOB 和 CLOB 两种类型
- [Leetcode] 189.Rotate Array
- 蘑菇智能自行车系统 改变你的自行车
- 2015年4月第六届蓝桥杯c/c++B组省赛试题和个人解答
- oracle 用myibatis 批量操作
- C语言实现迷宫求解
- 详解 Android 的 Activity 组件 转载
- BZOJ1529【DFS】