Submission #606256

---

Source Code Expand

#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
 
using namespace std;
 
#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
 
const int INF = 10000000;
const int mod = 1e9 + 7;
const double EPS = 1e-9;

int dx[] ={0,1,1, 1};
int dy[] ={1,1,0,-1};

int main(){
	string s;
	int k;

	cin>>s>>k;

	set<string> st;
	int ans = 0;
	string t;

	for(int i = 0; i < s.size() - k; i++){
		if(i + k >= s.size()) break;
		t = s.substr(i, k);
		if(st.count(t)) continue;
		st.insert(t);
		ans++;
	}

	cout<<ans<<endl;
}

Submission Info

Judge Result