Submission #6908600

---

Source Code Expand

#include<math.h>
#include<map>
#include<iostream>
#include <algorithm>
#include <string>
#include<vector>
#include<array>
#include<tuple>
#include<queue>
#include<stack>
#include<iomanip>
#include<bitset>
#include <list>
#include<numeric>
//AtCoderC++.cpp

using namespace std;

inline int ceiling(int n, int d) {
	return n % d == 0 ? n / d : n / d + 1;
}


int main() {
	string s; int k; cin >> s >> k;
	auto found = map<string, bool>();
	auto answer = 0;
	for (size_t i = 0; i < s.length() - k + 1; i++) {
		if (found.find(s.substr(i, k)) == found.end())found[s.substr(i, k)] = true;
		++answer;
	}
	cout << answer << endl;
}

Submission Info

Judge Result