子串：模拟+KMP

题目链接

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f
ll n;
ll nt[inf];
ll lent,lens;
string t,s;
ll flag;
void Next()
{
    ll i=0;ll j=-1;nt[0]=-1;
    while(i<lent)
    {
        if(j==-1||t[i]==t[j])
        {
            i++;j++;
            nt[i]=j;
        }
        else j=nt[j];
    }
}
ll kmp()
{
    ll i=0;ll j=0;
    Next();
    while(i<lens)
    {
        if(j==-1||s[i]==t[j])
        {
            i++;j++;
        }
        else j=nt[j];
        if(j==lent) return 1;
    }
    return 0;
}
int main()
{
    cin>>n;
    cin>>t;
    lent=t.size();
    for(ll k=2;k<=16;k++)
    {
        string p;
        s=p;//这里很重要，完成对s串的清空
        lens=0;
        for(ll i=1;i<=n;i++)
        {
            ll cnt=0;ll num[100];
            ll tmp=i;
            while(tmp)
            {
                num[cnt++]=tmp%k;
                tmp/=k;
            }
            for(ll j=cnt-1;j>=0;j--)
            {
                if(num[j]<10) s+=num[j]+'0';
                else s+=num[j]-10+'A';
            }
        }
        lens=s.size();
        if(kmp())
        {
            flag=1;
            break;
        }
    }
    if(flag) cout<<"yes"<<endl;
    else cout<<"no"<<endl;
    return 0;
}