长度为n的不同子串数量
O(n)
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
new POJ1200().solve();
}
}
class POJ1200 {
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
final int N = 16000008 ;
boolean[] vis = new boolean[N] ;
char[] word = new char[N] ;
int[] idx = new int[588] ;
void solve() {
int n = in.nextInt() ;
int nc = in.nextInt() ;
word = in.next().toCharArray() ;
int len = word.length ;
Arrays.fill(idx , -1) ;
int k = 0 ;
for(int i = 0 ; i < len ; i++){
if(idx[word[i]] == -1) idx[word[i]] = k++ ;
}
Arrays.fill(vis , false) ;
int h = 0 ;
int base = nc ;
for(int i = 0 ; i < n -1 ; i++){
base *= nc ;
h = h * nc + idx[word[i]] ;
}
int res = 0 ;
for(int i = n - 1 ; i < len ; i++){
h = h * nc + idx[word[i]] ;
h %= base ;
if(! vis[h]){
vis[h] = true ;
res++ ;
}
}
out.println(res) ;
out.flush() ;
}
}
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = new StringTokenizer("");
}
private void eat(String s) {
tokenizer = new StringTokenizer(s);
}
public String nextLine() {
try {
return reader.readLine();
} catch (Exception e) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String s = nextLine();
if (s == null)
return false;
eat(s);
}
return true;
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public BigInteger nextBigInteger() {
return new BigInteger(next());
}
}