HDOJ--1049--Climbing Worm

题目描述：
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.
输入描述:
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.
输出描述:
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.
输入：
10 2 1
20 3 1
0 0 0
输出：
17
19
题意：
虫子爬坑，深为n，每爬一个休息一分钟，掉d，爬u
题解：
结构体排序
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int main(){
    int n,u,d;
    while(scanf("%d%d%d",&n,&u,&d)!=EOF){
        if(n == 0 && u == 0 && d == 0) break;
        int dis = 0;
        int t = 0;
        while(1){
            dis += u;
            t ++;
            if(dis >= n) break;
            dis -= d;
            t ++;
        }
        printf("%d\n",t);
    }
    return 0;
}