题目链接:loj暂时还没挂,牛客要以考试的形式打开,比较麻烦
题目大意:给出一个正整数n,我们把1..n在k进制下的表示连起来记为s(n,k),例如s(16,16)=123456789ABCDEF10, s(5,2)=11011100101。现在对于给定的n和字符串t,我们想知道是否存在一个k(2 ≤ k ≤ 16),使得t是s(n,k)的子串(顺便把题面也给了吧)
题目思路:直接枚举k,连接起来,然后kmp就好,其实可以直接用str.find()的,因为只需要看是不是子串嘛,所以就是个傻逼题
#include <bits/stdc++.h>
using namespace std;
char ss[16] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};
int n,k;
char mo[1000005],xx[1000005],Next[1000005];
string str;
string to(int n,int zhi){
string strr = "";
int i = 0;
while(n){
xx[i] = ss[n%zhi];
n/=zhi;
i++;
}
for(int j = i-1;j >= 0;j--)
strr += xx[j];
return strr;
}
void getNext(){
int i = 0,j = -1,len = strlen(mo);
while(i < len){
if(j == -1||mo[i] == mo[j]) Next[++i] = ++j;
else j = Next[j];
}
}
int kmp(){
int i = 0,j = 0,len1 = strlen(mo),len2 = str.size();
int ans = 0;
while(i < len2){
if(j == -1||mo[j] == str[i]){
j++;
i++;
}
else j = Next[j];
if(j == len1) ans++;
}
if(ans >= 1) return 1;
return 0;
}
int main(){
cin>>n>>mo;
Next[0] = -1;
getNext();
for(int k = 2;k <= 16;k++){
str = "";
for(int i = 1;i <= n;i++){
str += to(i,k);
}
int ans = kmp();
if(ans == 1) {puts("yes");return 0;}
else continue;
}
puts("no");
return 0;
}