HDU : 1085 (Holding Bin-Laden Captive!)



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

// @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 1000
#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 Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

using namespace std;

int main ()
{
    int n [3];
    bool a [20000];

    while ( scanf ("%d %d %d", &n [0], &n [1], &n [2]) ) {
        if ( n [0] == 0 && n [1] == 0 && n [2] == 0 ) break;

        Set (a, false);
        a [0] = true;
        int coins [] = {1, 2, 5};

        for ( int i = 0; i < 3; i++ ) {
            for ( int j = 8000; j >= 0; j-- ) {
                if ( a [j] ) {
                    int ind = coins [i];
                    for ( int k = 0; k < n [i]; k++ ) { a [j + ind] = true; ind += coins [i]; }
                }
            }
        }

        int ind = 1;

        while ( a [ind] ) ind++;

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

	return 0;
}

// @END_OF_SOURCE_CODE
Advertisements

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