Submission #606258

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <numeric>
#include <functional>
#include <cmath>

#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()

using namespace std;
typedef long long ll; typedef vector<int> VI;
typedef pair<int,int> pii;


int main()
{
	
	cin.tie(0); ios_base::sync_with_stdio(false);
	int k; string s;
	set<string> st;
	cin >>s >>k;
	int n=sz(s);
	rep(i,n-k+1){
		st.insert(s.substr(i,k));
	}
cout << sz(st) <<endl;
	return 0;
}

Submission Info

Judge Result