Submission #70227402

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
using vl=vector<ll>; using vvl=vector<vector<ll>>; using vvvll=vector<vector<vector<ll>>>;
using vi=vector<int>; using vvi=vector<vector<int>>; using vvvi=vector<vector<vector<int>>>;
using vd=vector<double>; using vvd=vector<vector<double>>;
using vc=vector<char>; using vvc=vector<vector<char>>;
using vs=vector<string>; 
constexpr int dx[]={1,0,-1,0};
constexpr int dy[]={0,1,0,-1};
constexpr ll INF=1000000001000000001;
constexpr ll Inf=100010001;
//#define MINT1000000007
//#define MINT998244353
#ifdef MINT1000000007
    constexpr ll MOD=1000000007;using mint=modint1000000007;
#elif defined(MINT998244353)
    constexpr ll MOD=998244353;using mint=modint998244353;
#else
    using mint=modint;
#endif
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define Ft first
#define Sd second
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define rep(i,N) for(ll i=0;i<N;i++)
#define repp(i,N) for(ll i=1;i<=N;i++)
#define ALL(A) A.begin(),A.end()

int main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);cout<<setprecision(12);

    int n,k;  cin>>n>>k;
    string s;  cin>>s;
    map<string,int> M;
    rep(i,n-k+1){
        string ss=s.substr(i,k);
        M[ss]++;
    }

    int ans=0;
    for(auto[ss,num]:M){
        chmax(ans,num);
    }
    cout<<ans<<endl;
    vs S;
    for(auto[ss,num]:M){
        if(num==ans)S.emplace_back(ss);
    }
    sort(ALL(S));
    for(string ss:S){
        cout<<ss<<' ';
    }
}

Submission Info

Judge Result