Submission #7077506

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <set> 
#include <map>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#define REP(i,n) for(int i=0; i<(n); ++i)
#define FOR(i,a,b) for(int i=(a); i<(b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const ll INFLL = 1001001001001001001;  // > 10^18
const ll MODLL = (ll)1e9 + 7;
const double EPS = 1e-9;

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

    if (s.length() < k) {
        cout << 0 << endl;
        return 0;
    } 

    set<string> sts;
    for (int i = 0; i < s.length() - k; i++) {
        string t = "";
        for (int j = 0; j < k; j++) {
            t += s[i+j];
        }
        sts.insert(t);
    }

    cout << sts.size() << endl;
    return 0;
}

Submission Info

Judge Result