Submission #1359366

---

Source Code Expand

#include <stdio.h>
#include <bits/stdc++.h>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)

using namespace std;

const int N = 1000000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 31;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const double eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    //ll TL = 0.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    string s;
    cin >> s;
    rep(l, 0, sz(s))
    {
        rep(c, 0, ABC)
        {
            bool ok = true;
            rep(i, 0, sz(s) - l)
            {
                bool ok1 = false;
                rep(j, 0, l + 1)
                    if (s[i + j] - 'a' == c)
                        ok1 = true;
                if (!ok1)
                {
                    ok = false;
                    break;
                }
            }
            if (ok)
            {
                cout << l << endl;
                return 0;
            }
        }
    }
    return 0;
}

Submission Info

Judge Result