Multitasking Easy

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
int dp[66][66][66];
int dyn(int a,int b,int c){
    a=max(a,0),b=max(b,0),c=max(c,0);
    if(!(a|b|c))return 0;
    int &v(dp[a][b][c]),s[]={1,3,9};
    if(~v)return v;
    v=INF;
    do v=min(v,1+dyn(a-*s,b-s[1],c-s[2])); while(next_permutation(s,s+3));
    return v;
}
class MutaliskEasy{
    public:
    int minimalAttacks(vector<int> a){
        while(a.size()<3)a.PB(0);
        CL(dp,-1);
        return dyn(a[0],a[1],a[2]);
    }
}H;
//int main(void){
//    int a;
//    vi v;
//    while(cin>>a)v.PB(a);
//    D(H.minimalAttacks(v))
//    return 0;
//}