Submission #3248012

---

Source Code Expand

#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
#include <map>
#include <utility>
#include <list>
#include <climits>
#include <bitset>
#include <numeric>

using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
#define repi(i, n) for(auto i = (n).begin(); i != (n).end(); i++)
#define in_arr(type, a, n) copy_n(istream_iterator<type>(cin), n, (a).begin());
#define ll long long int

int main(){
    string s;
    cin >> s;
    string tmp, origin;
    origin.resize(s.size());
    copy(s.begin(), s.end(), origin.begin());
    int ans = INT_MAX;
    for(char a = 'a'; a <= 'z'; ++a){
        s.resize(origin.size());
        copy(origin.begin(), origin.end(), s.begin());
        int num;
        rep(i, 101){
            bool end = true;
            char f = s[0];
            repi(i, s){
                if(*i != f){
                    end = false;
                    break;
                }
            }
            if(end){
                num = i;
                break;
            }
            tmp.resize(s.size() - 1);
            rep(j, s.size() - 1){
                if(s[j] == a){
                    tmp[j] = s[j];
                }else{
                    tmp[j] = s[j + 1];
                }
            }
            s = tmp;
        }
        ans = min(num, ans);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result