Vit Cutting

#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);}
#define MX 55
string s;
int N,dp[MX];
bool pf(ll a){
    while(!(a%5))a/=5;
    return !(a-1);
}
int dyn(int u){
    if(u==N)return 0;
    if(s[u]==48)return INF;
    int &v(dp[u]);
    ll S(0);
    if(~v)return v;
    v=INF;
    FT(u,N){
        S<<=1,S+=s[k]==49;
        if(pf(S))v=min(v,1+dyn(k+1));
    }
    return v;
}
class CuttingBitString{
    public:
int getmin(string S){

    s=S;CL(dp,-1),N=S.size();
    N=dyn(0);
    return N==INF?-1:N;
}
};