HDU : 1049 (Climbing Worm)



// http://acm.hdu.edu.cn/showproblem.php?pid=1049
// Runtime: 15ms
// Tag: Adhoc

/* 
 * File:   main.cpp
 * Author: shahab
 * Created on March 18, 2011, 10:46 AM
 */

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for ( int i = (a); i < (b); i++ )
#define Fors(i, sz) for ( size_t i = 0; i < sz.size (); i++ )
#define Set(a, s) memset (a, s, sizeof (a))

using namespace std;

int main(int argc, char** argv) {
    int n, u, d;

    while ( scanf ("%d %d %d", &n, &u, &d) ) {
        if ( n == 0 ) break;
        int ret = 0;

        while (n) {
            ret++;
            n -= u;
            if ( n <= 0 ) break;
            ret++;
            n += d;
        }

        printf ("%d\n", ret);
    }

    return 0;
}

// @END_OF_SOURCE_CODE

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s