Submission #606251

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;

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

int main(){
	string s;
	int n;
	cin >> s >> n;

	map<string, bool> m;
	for(int i=0;i+n<s.size();i++){
		string str="";
		FOR(j, i, i+n){
			str+=s[j];
		}
		m[str]=true;
	}

	cout << m.size() << endl;
}

Submission Info

Judge Result