第二周 HDU 1049

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

问题简述：输入井高度n，一分钟往上爬u，然后必须休息一分钟并向下滑d，输出几分钟后爬出井口。
问题分析：如果在往上爬的过程中爬出井口，则不再计算下滑过程。所以要在结束时判断好。
程序说明：for循环计算了最后一次之前的循环的分钟数，然后当累计的路程a加上向上路程u大于n时，下一次将爬出井口。输出累计分钟数i加最后向上的一分钟。

#include <iostream>
using namespace std;

int main()
{
	int n, u, d;
	while (cin >> n >> u >> d)
	{
		int i = 0; if (n == 0)break;
		for(int a=0; a + u < n;i+=2)
	
			a = a + u - d;
			
		
		 cout << i+1 << endl;

	}

	return 0;
}