Submission #2180163

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define int long long  
#define INF 1145141919810893
signed main(){
    string S;
    int G[104][104][30]={};
    cin >> S;
    bool c=0;
    int N=S.size();
    REP(i,N){
        G[0][i][S[i]-'a']=1;
    }
    REP(i,N){
        if(i==0)continue;
        REP(j,N-i){
            REP(k,26){
                if(G[i-1][j][k]==1 || G[i-1][j+1][k]==1){
                    G[i][j][k]=1;
                }
            }
        }
    }
    REP(i,N){
        REP(k,26){
            c=0;
            REP(j,N-i){
                if(G[i][j][k]==0){
                    c=1;
                }
            }
            if(c==0){
                cout << i << endl;
                return 0;
            }
        }
    }
    
	return 0;
}

Submission Info

Judge Result