【HDOJ】1049 Climbing Worm

经典贪心，够水。搞清楚方程即可。

#include <stdio.h>

#define MAXNUM 105

int inches[MAXNUM];

int main(void)
{
    int n, u, d;
    int i;

    while (scanf("%d %d %d", &n, &u, &d)!=EOF && n) {
        memset(inches, 0, sizeof(inches));

        for (i=1; i<=n; ++i) {
            if (i <= u)
                inches[i] = 1;
            else
                inches[i] = 2 + inches[i-u+d];
        }

        printf("%d\n",inches[n]);
    }

    return 0;
}