CodeForces 189A Cut Ribbon

题目链接:http://codeforces.com/problemset/problem/189/A

#include<stdio.h>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#include<functional>
#include<vector>
#include<iomanip>
#include<math.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<set>
#include<bitset>
using namespace std;
int main()
{
    cin.sync_with_stdio(false);
    int n,a,b,c,F[8005];
    for (int i=0;i<8005;i++)
        F[i]=-1;
    cin>>n>>a>>b>>c;
    F[n]=0;
    for (int i=n;i>=0;i--)
    {
        if (F[i+a]!=-1)
            F[i]=max(F[i],F[i+a]+1);
        if (F[i+b]!=-1)
            F[i]=max(F[i],F[i+b]+1);
        if (F[i+c]!=-1)
            F[i]=max(F[i],F[i+c]+1);
    }
    cout<<F[0];
    return 0;
}