Submission #17582186

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int l[305],f[305][305][305],g[305][305][305],sum[305][305][305],lim0[305],lim1[305];
bool flag[305];
int const p=1e9+7;
int mod(int x){return x>=p?x-p:x;}
int main()
{
    string s;
    cin>>s;
    reverse(s.begin(),s.end());
    int len=s.size(),n=0,ans=0,tmp=len;
    while(tmp)
    {
        int now=0,c=1;
        for(int i=0;i<s.size();i++)
            if((!flag[i])&&s[i]-'0'==c)now++,flag[i]=1,c^=1;
        if(!now){puts("0");return 0;}
        l[++n]=now;tmp-=now;
    }
    g[len][0][0]=1;
    for(int i=1;i<=len;i++)sum[i][0][0]=1;
    for(int i=1;i<=len;i++)
    {
        lim0[i]=lim0[i-1]+(l[i]>>1),lim1[i]=lim1[i-1]+((l[i]+1)>>1);
        int t=len/i;
        for(int j=1;j<=t;j++)
            for(int a=0;a<=lim0[i];a++)
                for(int b=a;b<=lim1[i];b++)
                {
                    int t0=a-j/2,t1=b-(j+1)/2;
                    if(t0<0||t1<0)continue;
                    f[j][a][b]=sum[j][t0][t1];
                }
        for(int a=0;a<=lim0[i];a++)
            for(int b=a;b<=lim1[i];b++)
            {
                sum[t][a][b]=f[t][a][b];
                for(int j=t-1;j>=1;j--)sum[j][a][b]=mod(sum[j+1][a][b]+f[j][a][b]);
            }
        if(i>=n)ans=mod(ans+sum[1][lim0[i]][lim1[i]]);
    }
    printf("%d",ans);
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   16 |         for(int i=0;i<s.size();i++)
      |                     ~^~~~~~~~~

Judge Result