QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#233763#7512. Almost Prefix ConcatenationikefumyAC ✓424ms106444kbC++2017.0kb2023-10-31 22:20:002023-11-07 14:49:45

Judging History

你现在查看的是最新测评结果

  • [2023-11-07 14:49:45]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:424ms
  • 内存:106444kb
  • [2023-10-31 22:20:01]
  • 评测
  • 测评结果:100
  • 用时:424ms
  • 内存:107536kb
  • [2023-10-31 22:20:00]
  • 提交

answer

#include<bits/stdc++.h>

#include <algorithm>
#include <cassert>
#include <numeric>
#include <string>
#include <vector>

namespace atcoder {

namespace internal {

std::vector<int> sa_naive(const std::vector<int>& s) {
    int n = int(s.size());
    std::vector<int> sa(n);
    std::iota(sa.begin(), sa.end(), 0);
    std::sort(sa.begin(), sa.end(), [&](int l, int r) {
        if (l == r) return false;
        while (l < n && r < n) {
            if (s[l] != s[r]) return s[l] < s[r];
            l++;
            r++;
        }
        return l == n;
    });
    return sa;
}

std::vector<int> sa_doubling(const std::vector<int>& s) {
    int n = int(s.size());
    std::vector<int> sa(n), rnk = s, tmp(n);
    std::iota(sa.begin(), sa.end(), 0);
    for (int k = 1; k < n; k *= 2) {
        auto cmp = [&](int x, int y) {
            if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];
            int rx = x + k < n ? rnk[x + k] : -1;
            int ry = y + k < n ? rnk[y + k] : -1;
            return rx < ry;
        };
        std::sort(sa.begin(), sa.end(), cmp);
        tmp[sa[0]] = 0;
        for (int i = 1; i < n; i++) {
            tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);
        }
        std::swap(tmp, rnk);
    }
    return sa;
}

// SA-IS, linear-time suffix array construction
// Reference:
// G. Nong, S. Zhang, and W. H. Chan,
// Two Efficient Algorithms for Linear Time Suffix Array Construction
template <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>
std::vector<int> sa_is(const std::vector<int>& s, int upper) {
    int n = int(s.size());
    if (n == 0) return {};
    if (n == 1) return {0};
    if (n == 2) {
        if (s[0] < s[1]) {
            return {0, 1};
        } else {
            return {1, 0};
        }
    }
    if (n < THRESHOLD_NAIVE) {
        return sa_naive(s);
    }
    if (n < THRESHOLD_DOUBLING) {
        return sa_doubling(s);
    }

    std::vector<int> sa(n);
    std::vector<bool> ls(n);
    for (int i = n - 2; i >= 0; i--) {
        ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);
    }
    std::vector<int> sum_l(upper + 1), sum_s(upper + 1);
    for (int i = 0; i < n; i++) {
        if (!ls[i]) {
            sum_s[s[i]]++;
        } else {
            sum_l[s[i] + 1]++;
        }
    }
    for (int i = 0; i <= upper; i++) {
        sum_s[i] += sum_l[i];
        if (i < upper) sum_l[i + 1] += sum_s[i];
    }

    auto induce = [&](const std::vector<int>& lms) {
        std::fill(sa.begin(), sa.end(), -1);
        std::vector<int> buf(upper + 1);
        std::copy(sum_s.begin(), sum_s.end(), buf.begin());
        for (auto d : lms) {
            if (d == n) continue;
            sa[buf[s[d]]++] = d;
        }
        std::copy(sum_l.begin(), sum_l.end(), buf.begin());
        sa[buf[s[n - 1]]++] = n - 1;
        for (int i = 0; i < n; i++) {
            int v = sa[i];
            if (v >= 1 && !ls[v - 1]) {
                sa[buf[s[v - 1]]++] = v - 1;
            }
        }
        std::copy(sum_l.begin(), sum_l.end(), buf.begin());
        for (int i = n - 1; i >= 0; i--) {
            int v = sa[i];
            if (v >= 1 && ls[v - 1]) {
                sa[--buf[s[v - 1] + 1]] = v - 1;
            }
        }
    };

    std::vector<int> lms_map(n + 1, -1);
    int m = 0;
    for (int i = 1; i < n; i++) {
        if (!ls[i - 1] && ls[i]) {
            lms_map[i] = m++;
        }
    }
    std::vector<int> lms;
    lms.reserve(m);
    for (int i = 1; i < n; i++) {
        if (!ls[i - 1] && ls[i]) {
            lms.push_back(i);
        }
    }

    induce(lms);

    if (m) {
        std::vector<int> sorted_lms;
        sorted_lms.reserve(m);
        for (int v : sa) {
            if (lms_map[v] != -1) sorted_lms.push_back(v);
        }
        std::vector<int> rec_s(m);
        int rec_upper = 0;
        rec_s[lms_map[sorted_lms[0]]] = 0;
        for (int i = 1; i < m; i++) {
            int l = sorted_lms[i - 1], r = sorted_lms[i];
            int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;
            int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;
            bool same = true;
            if (end_l - l != end_r - r) {
                same = false;
            } else {
                while (l < end_l) {
                    if (s[l] != s[r]) {
                        break;
                    }
                    l++;
                    r++;
                }
                if (l == n || s[l] != s[r]) same = false;
            }
            if (!same) rec_upper++;
            rec_s[lms_map[sorted_lms[i]]] = rec_upper;
        }

        auto rec_sa =
            sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);

        for (int i = 0; i < m; i++) {
            sorted_lms[i] = lms[rec_sa[i]];
        }
        induce(sorted_lms);
    }
    return sa;
}

}  // namespace internal

std::vector<int> suffix_array(const std::vector<int>& s, int upper) {
    assert(0 <= upper);
    for (int d : s) {
        assert(0 <= d && d <= upper);
    }
    auto sa = internal::sa_is(s, upper);
    return sa;
}

template <class T> std::vector<int> suffix_array(const std::vector<T>& s) {
    int n = int(s.size());
    std::vector<int> idx(n);
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int l, int r) { return s[l] < s[r]; });
    std::vector<int> s2(n);
    int now = 0;
    for (int i = 0; i < n; i++) {
        if (i && s[idx[i - 1]] != s[idx[i]]) now++;
        s2[idx[i]] = now;
    }
    return internal::sa_is(s2, now);
}

std::vector<int> suffix_array(const std::string& s) {
    int n = int(s.size());
    std::vector<int> s2(n);
    for (int i = 0; i < n; i++) {
        s2[i] = s[i];
    }
    return internal::sa_is(s2, 255);
}

// Reference:
// T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park,
// Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its
// Applications
template <class T>
std::vector<int> lcp_array(const std::vector<T>& s,
                           const std::vector<int>& sa) {
    int n = int(s.size());
    assert(n >= 1);
    std::vector<int> rnk(n);
    for (int i = 0; i < n; i++) {
        rnk[sa[i]] = i;
    }
    std::vector<int> lcp(n - 1);
    int h = 0;
    for (int i = 0; i < n; i++) {
        if (h > 0) h--;
        if (rnk[i] == 0) continue;
        int j = sa[rnk[i] - 1];
        for (; j + h < n && i + h < n; h++) {
            if (s[j + h] != s[i + h]) break;
        }
        lcp[rnk[i] - 1] = h;
    }
    return lcp;
}

std::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {
    int n = int(s.size());
    std::vector<int> s2(n);
    for (int i = 0; i < n; i++) {
        s2[i] = s[i];
    }
    return lcp_array(s2, sa);
}

// Reference:
// D. Gusfield,
// Algorithms on Strings, Trees, and Sequences: Computer Science and
// Computational Biology
template <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {
    int n = int(s.size());
    if (n == 0) return {};
    std::vector<int> z(n);
    z[0] = 0;
    for (int i = 1, j = 0; i < n; i++) {
        int& k = z[i];
        k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);
        while (i + k < n && s[k] == s[i + k]) k++;
        if (j + z[j] < i + z[i]) j = i;
    }
    z[0] = n;
    return z;
}

std::vector<int> z_algorithm(const std::string& s) {
    int n = int(s.size());
    std::vector<int> s2(n);
    for (int i = 0; i < n; i++) {
        s2[i] = s[i];
    }
    return z_algorithm(s2);
}

}  // namespace atcoder


#include <algorithm>

#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {

namespace internal {

// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

}  // namespace atcoder

#include <cassert>
#include <vector>

namespace atcoder {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

}  // namespace atcoder

using namespace std;
using namespace atcoder;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define int128 __int128_t
#define pii128 pair<int128,int128>
const int inf = 1 << 30;
const ll linf = 1e18;
const ll mod = 998244353;
const db EPS = 1e-10;
const db pi = acos(-1);
template<class T> bool chmin(T& x, T y){
    if(x > y) {
        x = y;
        return true;
    } else return false;
}
template<class T> bool chmax(T& x, T y){
    if(x < y) {
        x = y;
        return true;
    } else return false;
}

// overload macro
#define CAT( A, B ) A ## B
#define SELECT( NAME, NUM ) CAT( NAME, NUM )

#define GET_COUNT( _1, _2, _3, _4, _5, _6 /* ad nauseam */, COUNT, ... ) COUNT
#define VA_SIZE( ... ) GET_COUNT( __VA_ARGS__, 6, 5, 4, 3, 2, 1 )

#define VA_SELECT( NAME, ... ) SELECT( NAME, VA_SIZE(__VA_ARGS__) )(__VA_ARGS__)

// rep(overload)
#define rep( ... ) VA_SELECT(rep, __VA_ARGS__)
#define rep2(i, n) for (int i = 0; i < int(n); i++)
#define rep3(i, a, b) for (int i = a; i < int(b); i++)
#define rep4(i, a, b, c) for (int i = a; i < int(b); i += c)

// repll(overload)
#define repll( ... ) VA_SELECT(repll, __VA_ARGS__)
#define repll2(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repll3(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define repll4(i, a, b, c) for (ll i = a; i < (ll)(b); i += c)

// rrep(overload)
#define rrep( ... ) VA_SELECT(rrep, __VA_ARGS__)    
#define rrep2(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep3(i, a, b) for (int i = b - 1; i >= a; i--)
#define rrep4(i, a, b, c) for (int i = b - 1; i >= a; i -= c)

// rrepll(overload)
#define rrepll( ... ) VA_SELECT(rrepll, __VA_ARGS__)
#define rrepll2(i, n) for (ll i = (ll)(n) - 1; i >= 0ll; i--)
#define rrepll3(i, a, b) for (ll i = b - 1; i >= (ll)(a); i--)
#define rrepll4(i, a, b, c) for (ll i = b - 1; i >= (ll)(a); i -= c)

// for_earh
#define fore(e, v) for (auto&& e : v)

// vector
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

template<long long mod>
struct modint{
    long long num;

    constexpr modint(long long x = 0) : num((x + mod) % mod) {}

    constexpr modint &operator += (const modint& rhs){
        num = (num + rhs.num) % mod;
        return *this;
    }
    constexpr modint &operator -= (const modint& rhs){
        num  -= rhs.num;
        while(num < 0) num += mod;
        num %= mod;
        return *this;
    }
    constexpr modint &operator *= (const modint& rhs){
        num = num * rhs.num % mod;
        return *this;
    }
    constexpr modint &operator /= (modint rhs){
        int exp = mod - 2;
        while(exp > 0){
            if(exp % 2){
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }

    constexpr modint operator ++ (){
        num = (num + 1) % mod;
        return *this;
    }
    constexpr modint operator ++ (int n){
        (void)n;
        modint tmp = *this;
        ++(*this);
        return tmp;
    }
    constexpr modint operator -- (){
        num = (num + mod - 1) % mod;
        return *this;
    }
    constexpr modint operator -- (int n){
        (void)n;
        const modint tmp = *this;
        --(*this);
        return tmp;
    }

    void modpow(ll y){
        modint tmp = (*this);
        (*this) = 1;
        while(y > 0){
            if(y % 2){
                (*this) *= tmp;
            }
            tmp *= tmp;
            y /= 2;
        }
    }

    constexpr modint operator + (const modint& rhs) const {
        return modint(*this) += rhs;
    }
    constexpr modint operator - (const modint& rhs) const {
        return modint(*this) -= rhs;
    }
    constexpr modint operator * (const modint& rhs) const {
        return modint(*this) *= rhs;
    }
    constexpr modint operator / (const modint& rhs) const {
        return modint(*this) /= rhs;
    }

    
    friend ostream &operator << (ostream& lhs, const modint& rhs){
        return lhs << rhs.num;
    }

    friend istream &operator >> (istream& lhs, modint& rhs){
        lhs >> rhs.num;
        return lhs;
    }
};

#define mint modint<mod>

mint modpow(mint x, ll y){
    if(y == 0) return 1;
    mint e = modpow(x, y / 2);
    e = e * e;
    return e * (y % 2 == 0 ? 1 : x);
}

int op(int a, int b) {
    return min(a, b);
}

int e() {
    return inf;
}

string S, T;
int sidx[1000010], tidx[1000010], lens[1000010];
mint nsum[1000010], cnt[1000010], ans[1000010];
int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cin >> S >> T;
    string ST = S + "#" + T;
    auto sa = suffix_array(ST);
    auto lcp = lcp_array(ST, sa);
    segtree<int, op, e> st(lcp);
    rep (i, sa.size()) {
        if (sa[i] == (int)S.size()) continue;
        else if (sa[i] < (int)S.size()) sidx[sa[i]] = i;
        else tidx[sa[i] - S.size() - 1] = i;
    }

    cnt[0]++, cnt[1]--;
    rep (i, S.size()) {
        int len = st.prod(min(sidx[i], tidx[0]), max(sidx[i], tidx[0]));
        if (len < (int)min(S.size() - i, T.size())) len++;
        if (len < (int)min(S.size() - i, T.size())) len += st.prod(min(sidx[i + len], tidx[len]), max(sidx[i + len], tidx[len]));
        cnt[i + 1] += cnt[i];
        cnt[i + len + 1] -= cnt[i];

        nsum[i + 1] += nsum[i] + cnt[i];
        nsum[i + len + 1] -= nsum[i] + cnt[i];

        cnt[i + 1] += cnt[i];
        nsum[i + 1] += nsum[i];

        lens[i] = len;
    }

    rep (i, 1, S.size() + 1) {
        int len = lens[i];
        ans[i + 1] += ans[i];
        ans[i] += nsum[i] * 2 - cnt[i];
        ans[i + 1] += ans[i];
        ans[i + len + 1] -= ans[i];
    }

    cout << ans[S.size()] << endl;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 9712kb

input:

ababaab
aba

output:

473

result:

ok 1 number(s): "473"

Test #2:

score: 0
Accepted
time: 0ms
memory: 9792kb

input:

ac
ccpc

output:

5

result:

ok 1 number(s): "5"

Test #3:

score: 0
Accepted
time: 1ms
memory: 9996kb

input:

qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq...

output:

75038697

result:

ok 1 number(s): "75038697"

Test #4:

score: 0
Accepted
time: 1ms
memory: 9760kb

input:

lvvvllvllvllvllllllllvvvllvlllvvlvlvllvlvvlvvvvlvvllllllvvlvlvvlllvvlvlvllllllvlvvvvvvlllvvvllvlvvvlvvlllvvvvvvlvlllvvvvlvvvvvlvvlvvlllvvllvvllvlvlvlvlvllllvvllvvllvlllvvvllllvvlvvllvvvvlvlvvlvvlllvvvvvvvvlvvlvlllvllvvvvllvvvlvvvvvvlvlllvllllvllllllllvvllllllvlvvlvvvlvllllvllvlvvllllllvlvvvlvlvlvvvl...

output:

538419149

result:

ok 1 number(s): "538419149"

Test #5:

score: 0
Accepted
time: 1ms
memory: 9996kb

input:

fzztyyyfztzzfzyztftyfzyyzzzztyyfzttzttztyzztyyyfyyftyfyfzzffyzffytttzttyzzftyfyfyftyyfzyzffyfyyzztzyyttyfyztfyfzyfzfzyftttfyyfyytzyyzfyyyzztfttzyyytzzffytyzyyyyfzfftftzzztyfftfzfzytftfttytfyzfytzfzztttttzzyztyftzzzfzfzfffttyztzfftfftyfyffztzyffttyyfyfzytytyyttfzzfyyytzzftzyyfftftyytyffzffztfytfyyyty...

output:

867833603

result:

ok 1 number(s): "867833603"

Test #6:

score: 0
Accepted
time: 0ms
memory: 9840kb

input:

xauxlgtqbsianlzjzglalnbtlujfrkfdqgczpmididmtamzeablrbrbjgtsdkzzcfhvcpdawqkrgdsereirlxbizhbsxlcbtgwwshekbhatqonvgupswcowythifpoubxkuoxuuisnzolzwektdcaouxbkhofvdqzmjulmhgqjxwzhgrzmorhqkgekntbzsxgvjtehfbterrhhjhqggzrqiqmcshzwpfoburpyfoehqgtitesyaekhlzcvxzdqmunyrlrhbrjoigdjzpcgptyoiowwnmqrxucxixxydurbdh...

output:

301464023

result:

ok 1 number(s): "301464023"

Test #7:

score: 0
Accepted
time: 0ms
memory: 10076kb

input:

tttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttt...

output:

816920406

result:

ok 1 number(s): "816920406"

Test #8:

score: 0
Accepted
time: 2ms
memory: 10268kb

input:

cxccxccccxccxccxcxxxccxxcxcxcxcxxcccxcxccccccxccccxccxcxcxxcxxcxcxxxcxcccxcxxxxxccxxcccxxccxxxccxccxxxxcxxccccxccxxcccxcccxxxccccxcxcxccccxxxxccxxxxxcxxxxxxcxxccxxcxcxcxxxxxcxxccxcxxxcccxcxxxccccccccxxxcccxcxxcxxxxccxxxcccccxcccxccccccxxcccxxcccxxxccxxcxccxcccxxxccxccxxxccxcxxxxccxxcxcxxcxxccxxxcxcx...

output:

206627037

result:

ok 1 number(s): "206627037"

Test #9:

score: 0
Accepted
time: 2ms
memory: 10300kb

input:

vmqvvbbmvmmmqqvqvmmbbvqbqvbmmbqmvvbmmmqvqvbvqqmvbbmmvmvqbvmqqbqvqqvmvmmbqvvbvmvbqmqqbqqqbqqmvvmmbvvvbvvvbmqqvbqbmvvmvqqvbqbvvvqmvvvmvqqmvqbmbvmvmqmmbmqqqbbmvqbqbbqqbmmvmmqqqvvvqqqqqmmvvvvqmvmmmmvmqmqbbvbvvqmmmqbbmvqvmvmqbqbbbmqbqbqmqbqmqbmvvqmmvbmmbvbqqvmmmbbmbbmvmmvbmqmqbbqqbqqbbqmbmmmqbqbmvbmvmmmm...

output:

460659355

result:

ok 1 number(s): "460659355"

Test #10:

score: 0
Accepted
time: 0ms
memory: 10336kb

input:

xthikaxiescbqjzrpgtcpigqjsojlsxsiowkkzsdsgscoolhdtglvpgcoggzqnnjmocvanrogbzqjcmijoukjicadaakehxgjphjgnskjvfneoyaucfadilscsucjgweuzcdfapfnrfffdowxvzkvgqzmtszjldylvehzjlvmhproaehqhuwdoadenqdrqwrlxxfouzqolwbopmkpjshczocnnsxktxozahzwqpwbmvexguvjhbvbjwsdtgaitoqwsfzkwnzgeidkamgcfhzhitfxenunlcsbsesbczvmmbu...

output:

906223232

result:

ok 1 number(s): "906223232"

Test #11:

score: 0
Accepted
time: 16ms
memory: 21376kb

input:

bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...

output:

39285513

result:

ok 1 number(s): "39285513"

Test #12:

score: 0
Accepted
time: 39ms
memory: 20168kb

input:

hghggghghhghhgghgggghhghhhgghggghghhhhghghgggghhggggghhgghggghhhghggghghghggghggghgghhhghgggghghghgggghhhhhgghhgghhhghhghhhghhhhhhghghhgggggghghgggghghhghhgghhghhhhhhghgghhghghgggghgggggghghhhhhghhhhhhhgghhggggghhgghhhhhhhhghggggggghhghhghhghhgghhghgghhhhgghghghhhhhghggghhhhhhhgggggghgghghhhhghhgggg...

output:

58618935

result:

ok 1 number(s): "58618935"

Test #13:

score: 0
Accepted
time: 33ms
memory: 17328kb

input:

nnttcybbmnrnsuybrkmkmtumcyuyrrmbtybutunsyrkmunmncmkuknttmmtkymtcybttrmyrtckscttcksbtymtyukbbynnnbukttncmbutscbrytbrutnuyuknmtymckkttrrnsbtrkbnnnkbrccrcyybmnnybbkkbcbbccycsrcytnuucbbyytckrycktsmkymruycksrscytkskscbtbccbrurmumrkbkbttkcynmymbbmbkrksmnusryumsmmyrcsmusumbrkkbmsbyytmmruubskccsusnntcuntrrt...

output:

46252951

result:

ok 1 number(s): "46252951"

Test #14:

score: 0
Accepted
time: 40ms
memory: 19760kb

input:

ittaztseqcdirziayobnnxuzipvteycmgjbupnlxuheulnmzsdeymctprlxvkvzjwrotsauxagyrqcwzuwqyodrqsupwpyrmbwjqlvfdsrocneigxvnjfiseotxmutzwacfutqlmzmxwuqgjugwkafnxvzutgbrweqrdshwneksgxzzinnmbbioqdvbmavukaegvkpwauuoysklelsqhytlikpdpymbwhmbdmrycaiywtwjjqtecwoofyjhbumjtipwyopkuralejvopitpjcdswcvsugimgbrlibrteaqtb...

output:

838361918

result:

ok 1 number(s): "838361918"

Test #15:

score: 0
Accepted
time: 157ms
memory: 88556kb

input:

llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll...

output:

774442405

result:

ok 1 number(s): "774442405"

Test #16:

score: 0
Accepted
time: 395ms
memory: 92848kb

input:

nnnddndnndnddddndnnddnddnndddndndnnndnndndndnnnddndndnddnnddnndndndnnnndndddndnndndnndddndnnddnndndnnddnnddnddndddnnnndnnndddnndnddnnnddndddnndnnndndndndnddnddnndddndddnnndddnnndnndnndnnnddnnddnndnnndnnnddnnddddnndnnddnndnnnddddnddnnndnnddddddndndnnnnndnnnndddddnddnnndddndnnddndnnnddddnndndnndndndnd...

output:

478212008

result:

ok 1 number(s): "478212008"

Test #17:

score: 0
Accepted
time: 407ms
memory: 90308kb

input:

ievnetxypatirsocqrmgmhfxnkgzrscclietylohbcshjjxfmqhlxvebythkwllhjxwjngxbjeivttdgjttmyqgxsqotxueuvzrslcqpranaucprjmfczshtoqggczmbuwixllhnlcjhrvfixisvqdlxxmevucbvzolweshgvxeocppggthqkljyiszeqkpnybogisosqzdasfqgpuzudnnabwoqtrpxllqkxlbwsexwduvutufncthrmywlsqlccetggdflmgewzvhsmpyznzsxcftkoyfhgmgvliwxbywi...

output:

702291108

result:

ok 1 number(s): "702291108"

Test #18:

score: 0
Accepted
time: 156ms
memory: 90940kb

input:

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

301945039

result:

ok 1 number(s): "301945039"

Test #19:

score: 0
Accepted
time: 401ms
memory: 106444kb

input:

gggggcgcgggcgccgggcgcccgccccggcccgcggccccggcccccggccgccccccggcccgggcccgggggcccgggggcgggccgcccccccgcgcggggggggggcggggggcggccgcccggggccgccccgcgcgggcggggccgcgcggcggccgggccgccgcggcccgcccggcgccgccgggcgggggcggggccgccgcccccgccccccgggggcgcgcgccggccggcggcggggcgccggcgccccggccgggggccgccccccccgcggcgcggggggcgccc...

output:

602912498

result:

ok 1 number(s): "602912498"

Test #20:

score: 0
Accepted
time: 424ms
memory: 95252kb

input:

zdomsivxdzqlpexdauxxrjvembwqtchcxcpboqwmilagfpnrzyicztptfvdlqehajqoxcqvtoglsusgfioxtwheivlmgapepuoevghzmdadbkkkrdusnvxmansofunrgmppyktkxcottuiolirqlsflpnkghhxngutoovfzluiboooswqknpedyiaspikpveswjqnqitfbynjgiqymkrldekgmkavalduxlscjewmpoctbxjujtxlavpibkyerspcfchiticgjsvmzvtadhimnvacljbhmzikeabhjoszfig...

output:

435002470

result:

ok 1 number(s): "435002470"

Test #21:

score: 0
Accepted
time: 311ms
memory: 86400kb

input:

aabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaab...

output:

571187577

result:

ok 1 number(s): "571187577"

Test #22:

score: 0
Accepted
time: 317ms
memory: 92000kb

input:

abacabaabacababacabaabacabacabaabacababacabaabacabaabacababacabaabacabacabaabacababacabaabacababacabaabacabacabaabacababacabaabacabaabacababacabaabacabacabaabacababacabaabacabacabaabacababacabaabacabaabacababacabaabacabacabaabacababacabaabacababacabaabacabacabaabacababacabaabacabaabacababacabaabacab...

output:

785945100

result:

ok 1 number(s): "785945100"

Test #23:

score: 0
Accepted
time: 349ms
memory: 91000kb

input:

abaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaa...

output:

501555951

result:

ok 1 number(s): "501555951"

Test #24:

score: 0
Accepted
time: 333ms
memory: 90752kb

input:

abbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaababbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaab...

output:

483421416

result:

ok 1 number(s): "483421416"

Test #25:

score: 0
Accepted
time: 327ms
memory: 89116kb

input:

abbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbc...

output:

610522803

result:

ok 1 number(s): "610522803"

Test #26:

score: 0
Accepted
time: 355ms
memory: 94384kb

input:

bacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaaba...

output:

688840647

result:

ok 1 number(s): "688840647"

Test #27:

score: 0
Accepted
time: 354ms
memory: 88368kb

input:

abbababbabaababbababbabaabbababbabaababbababbabaababbabaabbababbabaababbababbabaababbababbabaabbababbabaababbababbabaababbabaabbababbabaababbababbabaabbababbabaababbababbabaababbababbabaabbababbabaababbababbabaababbabaabbababbabaababbababbabaabbababbabaababbababbabaababbabaabbababbabaababbababbabaab...

output:

185974021

result:

ok 1 number(s): "185974021"

Test #28:

score: 0
Accepted
time: 354ms
memory: 89312kb

input:

abacabadabacabaeabacabadabacabafabacabadabacabaeabacabadabacabagabacabadabacabaeabacabadabacabafabacabadabacabaeabacabadabacabahabacabadabacabaeabacabadabacabafabacabadabacabaeabacabadabacabagabacabadabacabaeabacabadabacabafabacabadabacabaeabacabadabacabaiabacabadabacabaeabacabadabacabafabacabadabac...

output:

881963869

result:

ok 1 number(s): "881963869"

Test #29:

score: 0
Accepted
time: 364ms
memory: 89716kb

input:

aabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabbaaddaabbaaccaabbaaffaabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabbaaddaabbaaccaabbaaggaabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabbaaddaabbaaccaabbaaffaabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabbaaddaabbaaccaabbaahhaabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabb...

output:

647864259

result:

ok 1 number(s): "647864259"

Test #30:

score: 0
Accepted
time: 322ms
memory: 87356kb

input:

ddrddrdddrddrdddrddrddrdddrddrdddrddrddrdddrddrdddrddrdddrddrddrdddrddrdddrddrddrdddrddrdddrddrdddrddrddrdddrddrdddrddrddrdddrddrdddrddrddrdddrddrdddrddrdddrddrddrdddrddrdddrddrddrdddrddrdddrddrdddrddrddrdddrddrdddrddrddrdddrddrdddrddrddrdddrddrdddrddrdddrddrddrdddrddrdddrddrddrdddrddrdddrddrdddrddr...

output:

611194463

result:

ok 1 number(s): "611194463"

Test #31:

score: 0
Accepted
time: 333ms
memory: 92200kb

input:

hehfhehhehfhehehfhehhehfhehfhehhehfhehehfhehhehfhehhehfhehehfhehhehfhehfhehhehfhehehfhehhehfhehehfhehhehfhehfhehhehfhehehfhehhehfhehhehfhehehfhehhehfhehfhehhehfhehehfhehhehfhehfhehhehfhehehfhehhehfhehhehfhehehfhehhehfhehfhehhehfhehehfhehhehfhehehfhehhehfhehfhehhehfhehehfhehhehfhehhehfhehehfhehhehfhe...

output:

350121745

result:

ok 1 number(s): "350121745"

Test #32:

score: 0
Accepted
time: 330ms
memory: 88496kb

input:

nmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnmnnmnnmnmnnmnn...

output:

533553735

result:

ok 1 number(s): "533553735"

Test #33:

score: 0
Accepted
time: 338ms
memory: 85988kb

input:

joojojjoojjojoojojjojoojjoojojjoojjojoojjoojojjojoojojjoojjojoojojjojoojjoojojjojoojojjoojjojoojjoojojjoojjojoojojjojoojjoojojjoojjojoojjoojojjojoojojjoojjojoojjoojojjoojjojoojojjojoojjoojojjojoojojjoojjojoojojjojoojjoojojjoojjojoojjoojojjojoojojjoojjojoojojjojoojjoojojjojoojojjoojjojoojjoojojjoojjo...

output:

177198028

result:

ok 1 number(s): "177198028"

Test #34:

score: 0
Accepted
time: 330ms
memory: 94788kb

input:

qddhdhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhqddhdhqddhdhqddhqddhdhqddhqddhdhqddhdh...

output:

101237979

result:

ok 1 number(s): "101237979"

Test #35:

score: 0
Accepted
time: 325ms
memory: 93764kb

input:

dqvqqvqdqvqqdqvqdqvqqdqvqqvqdqvqqdqvqdqvqqvqdqvqqdqvqqvqdqvqqdqvqdqvqqdqvqqvqdqvqqdqvqdqvqqvqdqvqqdqvqqvqdqvqqdqvqdqvqqvqdqvqqdqvqdqvqqdqvqqvqdqvqqdqvqdqvqqvqdqvqqdqvqqvqdqvqqdqvqdqvqqdqvqqvqdqvqqdqvqdqvqqvqdqvqqdqvqdqvqqdqvqqvqdqvqqdqvqdqvqqvqdqvqqdqvqqvqdqvqqdqvqdqvqqvqdqvqqdqvqdqvqqdqvqqvqdqvqqdq...

output:

292588879

result:

ok 1 number(s): "292588879"

Test #36:

score: 0
Accepted
time: 333ms
memory: 87984kb

input:

axxaxaxxaxaaxaxxaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaaxaxxaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaaxaxxaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaaxaxxaxaaxxaxaxxaxaaxaxxaxaxxaxaax...

output:

663737748

result:

ok 1 number(s): "663737748"

Test #37:

score: 0
Accepted
time: 359ms
memory: 88820kb

input:

pgpepgpwpgpepgpopgpepgpwpgpepgptpgpepgpwpgpepgpopgpepgpwpgpepgpdpgpepgpwpgpepgpopgpepgpwpgpepgptpgpepgpwpgpepgpopgpepgpwpgpepgphpgpepgpwpgpepgpopgpepgpwpgpepgptpgpepgpwpgpepgpopgpepgpwpgpepgpdpgpepgpwpgpepgpopgpepgpwpgpepgptpgpepgpwpgpepgpopgpepgpwpgpepgpypgpepgpwpgpepgpopgpepgpwpgpepgptpgpepgpwpgpe...

output:

488572018

result:

ok 1 number(s): "488572018"

Test #38:

score: 0
Accepted
time: 347ms
memory: 94716kb

input:

rrwwrraarrwwrrssrrwwrraarrwwrrjjrrwwrraarrwwrrssrrwwrraarrwwrriirrwwrraarrwwrrssrrwwrraarrwwrrjjrrwwrraarrwwrrssrrwwrraarrwwrrggrrwwrraarrwwrrssrrwwrraarrwwrrjjrrwwrraarrwwrrssrrwwrraarrwwrriirrwwrraarrwwrrssrrwwrraarrwwrrjjrrwwrraarrwwrrssrrwwrraarrwwrrddrrwwrraarrwwrrssrrwwrraarrwwrrjjrrwwrraarrww...

output:

686260254

result:

ok 1 number(s): "686260254"

Test #39:

score: 0
Accepted
time: 337ms
memory: 88704kb

input:

jmgfgawmrduominxypmrqdincccsmkfkkoqrzzmpnfnbtyxetgmfvyjugkvjvlfkjikyakiwuwjepviiwfgbenzycnqndaukmyknehgmlizltmebgvgmoebwijqvtwngbmojualcabcbafifsbmbtidqsjhxwyqautkjqztkhmusuixxanobxuaqlrmtmkprqpofxtkqviqqjgqcwrkbgdomrdtvjrjduuocsaxftjjulzpexmeigvmoxksccoepcjqdtcbbthjgdnsmnwklfrvlhazvcrbmkegnmmvdpcap...

output:

293683143

result:

ok 1 number(s): "293683143"

Test #40:

score: 0
Accepted
time: 364ms
memory: 92072kb

input:

dfddeeadfbgfcadcbbaaefgcchdhfcbagaedgdhafdhbffggfechccdhadbcchgeaeagfaaagfbeabffdaeefaaabbggffghbgfhbcahhdfdgccgegdgdhafhcdgbebcbbggegcachhefhcgfgcaececacagedaacfbcdgecghfedffchhaeabfbeehfeeddfecfefahbfaghbhbhdgddfgcdbfbeaahbcdhfdbeebhfbehggcfbabbfchggchhahehgfgbhaeebafbdacccffdfgfbhecebgfeeebdacaaa...

output:

896912463

result:

ok 1 number(s): "896912463"

Test #41:

score: 0
Accepted
time: 337ms
memory: 88852kb

input:

djkdjdlkbamfcmacgaekgbgmimadajicdbgmiejaacggablfgejfgmafmhbcifaehamkadfcglbmhhblgalklhglicmhakfjaafidjmihmghgbhdhjfdllmaekkeklccadieaibeiddjefjleaiegkllmeglgedeleabgghdaidgehdacemkbaddalkamgiffgdcbhhckhmacimaeamehiigfggmglccidaffjcjijafmbehlgglcmacifjgmdfcdahfljdhfjkijcdebkkhgbdlijcabjbgefchjdbfigbi...

output:

866183470

result:

ok 1 number(s): "866183470"

Test #42:

score: 0
Accepted
time: 330ms
memory: 88540kb

input:

akejekgcbkkajhbmklibdmdfmllhgheagfjjbbifdjeglcmmbhmglebljhfmdidckdjebldeffdelakbfckhdmlmickdfedimjjmjdhlmikgabblgifdcbacgkchmfkhflgggakalkihlllakglmaeldhjljfhegalcmgkhleahciagicfljkkkdajbdkhelfmlmcgmdegkaekdmckbfhgjdmhgbkihahbgmgbiadkidijecgdambchefefjklfhdhjamhkeefedffjlckfhjdfkimelbfjliamccfkaljck...

output:

490416632

result:

ok 1 number(s): "490416632"

Test #43:

score: 0
Accepted
time: 351ms
memory: 90020kb

input:

dccfccebfcbbabcddeecfeaecfdbbbdfadcdafbfbbeeefgceegabdbbdeacbafdbdgaegadfddeaegcbcgcdggeefffecfaadabdbeaeebfbagdggfbbfeddgedcfgfafecedgffadeagggeababdfdbcbdeafabdggaccaaacedccegccaadebdebdfabaffcbdcbcfcdgabcabdcebfcbgecgdddcedaaeeefgfbgbdbbfeffadbecddffedddffadbeeaegaacegegcagefcffababbdaafdfgegfdbb...

output:

885724660

result:

ok 1 number(s): "885724660"

Test #44:

score: 0
Accepted
time: 361ms
memory: 93488kb

input:

aehhddeelhbahadgalifaklhccaefgcbhglheiaeahgffkblkafhcfdebggdkdhdjgkjaekhflfehlkdcbejagigdlcabkblijfecgdbikehhekhihehhebalgjfjcehkdajcakehbiedbcjdfhacdhcckhdjbfjdllaajdckhjaglbdaalbihbjlheklkiaabkfjbhchjlkealbdlgkdahihgigcfdjflfdhejbedgajbfbhlkhgcglkdhclcelgkldegkgfekajdljfiaagbkkdbfdafdkcfgjhlfjdidd...

output:

421010120

result:

ok 1 number(s): "421010120"

Test #45:

score: 0
Accepted
time: 324ms
memory: 88592kb

input:

ikiajgmoobiibgmncbfmmabkagcegdloelekkeaebjcemcklemhiiomiabiihmccignhfifmdccmgdljhdlglbamfaafgddehngkimkflcdijdclhjookhnkdjkooalhchiikgjcemmigkhbkoafnglokmdkmcmmdgdfngcgfcglbkifnhaflfgdmdchdbaofhnhiadfoocoljghnbdfcohgeimonabgbjiekfdogkbdlfaiomkclaklnbeolnfhamekgdkmbfmjfofkkkoknlifehgaeimbaaahfdhekkbb...

output:

249065158

result:

ok 1 number(s): "249065158"

Test #46:

score: 0
Accepted
time: 361ms
memory: 90160kb

input:

bbidjtskemfoqflkgitiksamhiskmkdbieeethgsisgruqdjrbepunqfrorcmgaomlrntjjcrgobhmkjsfjqbschsfamsjsgcqishmaanbkhaechktgejonmnoltjgsunjpjicuplglpsgeiqtfrpbrmrbajenmeceikhgndkigrbubjdnlmpikpnpcsprmefffpmmmrcbmhghpjaanksmldikhobiajjpgfbnjnqgibdelmhhtqeshlmhsbunjcahmnjgpfphhcrfkinleassgogqjlecefedhfsicioksi...

output:

696887551

result:

ok 1 number(s): "696887551"

Test #47:

score: 0
Accepted
time: 324ms
memory: 90404kb

input:

amdhpchjhekifhphbcmhhhdiomjnbogojfqaknelnpjqlioflclmobhpofqfafnnogjblabnnignbclfcmhgooaeiohadbeihmbpgollbkaiipaaoophogjmodiqmjagjoqlnbkagfgpfiedbijagqhmfbigekqppielgcdfkennghqelpmelfepfgelqehnogggaobqclnamimfcooikpcliiglolhjcnoekqqfkhbnjafdfipjdlphcpidlbchdapjblaebchmamlhgllbipgqhlbhpfcnnjodgjdfcqmp...

output:

243281615

result:

ok 1 number(s): "243281615"

Test #48:

score: 0
Accepted
time: 312ms
memory: 89624kb

input:

dbeafaheacadbefjhabeegbaicejbbdgjbeghjbhdhddachigjffakkdkeahciadejkfkfaccdgjkfkdkkgcbggibagikedhejecahhchhkcebbidihjbkjegaakikdfihfhebbccfikhacdedaiaffhfkecagbcbjgbbffafdacfeeibdjhjjddjhkdkihhdhgijdjfdcjagjfafdahfjgkkjachjcdicaieeafhdfjfhchahiidhhfkaghbegbgcfefkijhdebejjjidcadkchgigdeiecfjhfjkefiekk...

output:

678667698

result:

ok 1 number(s): "678667698"

Test #49:

score: 0
Accepted
time: 354ms
memory: 91412kb

input:

deoojpgcgpkoholhlcfddeohkqoihkcalfngpkcabbkimgpkccaqapjcciehchiqbjqjpkbenflbbmqlgogkkqlaoaenoahilflhjrkibcjpndignjkjdilkfjcgonlhfhqokdkqfcooddnqraffljggmefpjaqgdqbhgfkpcionmhnkieocrokobhgnpkkqamjdalqjnefhofndmgialqhmfjnkjnqhmcjnddbkmdnbfokfmbihnnobcakhjmnfmrfganfhicdlmlgqfdqrcnidldqpkpniojdkabeorrci...

output:

640377934

result:

ok 1 number(s): "640377934"

Test #50:

score: 0
Accepted
time: 344ms
memory: 91412kb

input:

rcplswkqluujkpofiplijbkfamjnpmwbetfaolnjlwjeklpmqnuduqdlbvohfebccbdgsmlumlsbmepaqcsdhsdiqmcgmrtmkneoqitmiiamfkcakoqivniqkarnptorecjpnhjrilbhqlqsiiqcaoequooccldcicgjgvesjkothbqrkmwqjmgpiviesqdsbvcvwbkewqkdjathbpodcwbcaapijiwmdalphlerftsvpctpgilajbthfclwhnpaqrmpulnkouchahefqhuodqudvvlkhuqjbfirnbomnblm...

output:

66403201

result:

ok 1 number(s): "66403201"

Test #51:

score: 0
Accepted
time: 358ms
memory: 89696kb

input:

kcelopohpkauakpqbkkffonjqopuccmehqsssbscqgkmbkmrhccdriukchfjhooedrpidupnhrruqjhlcolrtsjehqqtpknjqsgklfjpirsnqfjlhscetstgrlilmdicgaafhasapptemkeaonlohgrtnoqtaghbbmaskprseerhsdrsacrscpgkbrlqeesgdhabhklbapimgnbidlskjhacqbfgbbgjhbqqjmksatqqcrfpqplttotunndmlmcifiqkdfkbeoofkueargstanfpoqjcgipqbhqsisqqupua...

output:

674574764

result:

ok 1 number(s): "674574764"

Test #52:

score: 0
Accepted
time: 344ms
memory: 89064kb

input:

lokefigibdllifnkjkhnimgelligecajbonifkiahfaglcabobfnjiaffhkjebdcmflhimlfdofookcmmoaehhhjiiolglcdemjlmiimjelihecabcecbehmlefaackglgkelkihnlbgnhhodeeejnokhknomgibjjiglacgkanjmeiejagggbledmhgaaekimngheheihggogbjfldlbfoelngooilkenmkmlbliejdfhgalhbfihkicbnckjlfnfmcfcgojmcnnifkhfafmhohohkfchibbbmmbhhanhbc...

output:

102969525

result:

ok 1 number(s): "102969525"

Test #53:

score: 0
Accepted
time: 332ms
memory: 88404kb

input:

jhuuccdtstliggpntpafkqniscpsoprtdoekmrrdilfcgfjmjmmdtfblsabqnubkufsmscrbosqpsbidqfjtgaaaiafmkjqjkhqaqrtooaujonhdjebsfakbhqnitrgjlgaiknktoktjsdiktcotccnrpefcbnqnhmlapoiamukspsufbumacjikgpehhhbnkirtnmtamckhfhcuhbflosfhhlqipupjkhcdbgakqpcjrpfmlmtkrtibuhrndkrurjgpqlglsggtetiathbtnckdqgofakuiumsfqmchppao...

output:

305160976

result:

ok 1 number(s): "305160976"

Test #54:

score: 0
Accepted
time: 299ms
memory: 87320kb

input:

pghtgnactijlrpguqmmclmonmvptpqlcrnuktgdvephiiklfdrrtrhnejnqceimfjuinqeuhhqkauvktipashuvjthvcgdlqsorggmrlemsncuqbjmjkahmhmhhjbjsgbbhsrpttdkhfcbdjemovvbmeaifrneritlqvurjdjmjjvppitgckjmdtldoimosvrdlqqqvnsurlilhecbsdnvncsdqbvddodohpofabdpcekvokkgtbppoapfliiriaouldpbrsfhnagsjojejcuithqsjoelpqsjnaurulpsar...

output:

564861703

result:

ok 1 number(s): "564861703"

Test #55:

score: 0
Accepted
time: 348ms
memory: 93824kb

input:

oihhieeoadhlkggfalmodcmedfmdbfedcflnlbfjjcbgccifnmieinnbkcfjegkdmcaoenbjhgihdgodoamklmklhgcoiemjahgnmaamdkjnafmdegfdhaefggjbonegcmmkldjlhgdofhfbaloiljelongglooakkccbgholfbooobjfocekldinlokadkdonkibanjomeonialbhhokaniadhijldmnilcmebabohaeeicimjemlajcbkojoonenhlabobhfajenedjdoniejlkincbdjifbajkcakgmnl...

output:

487389185

result:

ok 1 number(s): "487389185"

Test #56:

score: 0
Accepted
time: 335ms
memory: 94020kb

input:

mbecsnmaqpqeehmgmfdoaobhqkpmgqariegclsokjnosbbbgdgggcelaamnjoqbqglbsqhafppihnocmalqanasodafckknjpajdabinmgicqionaffaajppfdfibanfjhdforpikceonnaciharfmmsnesknfchhnorkkminlmhkcsijaescaqjbckgicsffecdchbdieomkbsqalncjllhpiphmprsehrlqfjaedbbojqblaaprsoldfjqqckesbomjdgqokdmrpoffhjfbeckkcofmcphbmqeokflmjrq...

output:

429687603

result:

ok 1 number(s): "429687603"

Test #57:

score: 0
Accepted
time: 339ms
memory: 89272kb

input:

aabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaabaabaaabaabaaabaabaabaaabaabaaabaabaaabaab...

output:

394014419

result:

ok 1 number(s): "394014419"

Test #58:

score: 0
Accepted
time: 359ms
memory: 92284kb

input:

abacabaabacababacabaabacabacabaabacababacabaabacabaabacababacabaabacabacabaabacababacabaabacababacabaabacabacabaabacababacabaabacabaabacababacabaabacabacabaabacababacabaabacabacabaabacababacabaabacabaabacababacabaabacabacabaabacababacabaabacababacabaabacabacabaabacababacabaabacabaabacababacabaabacab...

output:

142112521

result:

ok 1 number(s): "142112521"

Test #59:

score: 0
Accepted
time: 348ms
memory: 90688kb

input:

abaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaa...

output:

610603128

result:

ok 1 number(s): "610603128"

Test #60:

score: 0
Accepted
time: 346ms
memory: 90384kb

input:

abbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaababbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaab...

output:

918562310

result:

ok 1 number(s): "918562310"

Test #61:

score: 0
Accepted
time: 322ms
memory: 96328kb

input:

abbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbcabbcabbcbcabbcabbcbcabbcbc...

output:

130166950

result:

ok 1 number(s): "130166950"

Test #62:

score: 0
Accepted
time: 343ms
memory: 92228kb

input:

bacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaaba...

output:

49748557

result:

ok 1 number(s): "49748557"

Test #63:

score: 0
Accepted
time: 320ms
memory: 90376kb

input:

abbababbabaababbababbabaabbababbabaababbababbabaababbabaabbababbabaababbababbabaababbababbabaabbababbabaababbababbabaababbabaabbababbabaababbababbabaabbababbabaababbababbabaababbababbabaabbababbabaababbababbabaababbabaabbababbabaababbababbabaabbababbabaababbababbabaababbabaabbababbabaababbababbabaab...

output:

402359251

result:

ok 1 number(s): "402359251"

Test #64:

score: 0
Accepted
time: 327ms
memory: 98224kb

input:

abacabadabacabaeabacabadabacabafabacabadabacabaeabacabadabacabagabacabadabacabaeabacabadabacabafabacabadabacabaeabacabadabacabahabacabadabacabaeabacabadabacabafabacabadabacabaeabacabadabacabagabacabadabacabaeabacabadabacabafabacabadabacabaeabacabadabacabaiabacabadabacabaeabacabadabacabafabacabadabac...

output:

606717779

result:

ok 1 number(s): "606717779"

Test #65:

score: 0
Accepted
time: 342ms
memory: 98940kb

input:

aabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabbaaddaabbaaccaabbaaffaabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabbaaddaabbaaccaabbaaggaabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabbaaddaabbaaccaabbaaffaabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabbaaddaabbaaccaabbaahhaabbaaccaabbaaddaabbaaccaabbaaeeaabbaaccaabb...

output:

369483026

result:

ok 1 number(s): "369483026"

Test #66:

score: 0
Accepted
time: 321ms
memory: 88176kb

input:

zztzztzzztzztzzztzztzztzzztzztzzztzztzztzzztzztzzztzztzzztzztzztzzztzztzzztzztzztzzztzztzzztzztzzztzztzztzzztzztzzztzztzztzzztzztzzztzztzztzzztzztzzztzztzzztzztzztzzztzztzzztzztzztzzztzztzzztzztzzztzztzztzzztzztzzztzztzztzzztzztzzztzztzztzzztzztzzztzztzzztzztzztzzztzztzzztzztzztzzztzztzzztzztzzztzzt...

output:

992544336

result:

ok 1 number(s): "992544336"

Test #67:

score: 0
Accepted
time: 327ms
memory: 89508kb

input:

wlwdwlwwlwdwlwlwdwlwwlwdwlwdwlwwlwdwlwlwdwlwwlwdwlwwlwdwlwlwdwlwwlwdwlwdwlwwlwdwlwlwdwlwwlwdwlwlwdwlwwlwdwlwdwlwwlwdwlwlwdwlwwlwdwlwwlwdwlwlwdwlwwlwdwlwdwlwwlwdwlwlwdwlwwlwdwlwdwlwwlwdwlwlwdwlwwlwdwlwwlwdwlwlwdwlwwlwdwlwdwlwwlwdwlwlwdwlwwlwdwlwlwdwlwwlwdwlwdwlwwlwdwlwlwdwlwwlwdwlwwlwdwlwlwdwlwwlwdwl...

output:

563930358

result:

ok 1 number(s): "563930358"

Test #68:

score: 0
Accepted
time: 325ms
memory: 89956kb

input:

edeededeedeededeededeedeededeedeededeededeedeededeededeedeededeedeededeededeedeededeedeededeededeedeededeededeedeededeedeededeededeedeededeededeedeededeedeededeededeedeededeedeededeededeedeededeededeedeededeedeededeededeedeededeedeededeededeedeededeededeedeededeedeededeededeedeededeededeedeededeedee...

output:

819287506

result:

ok 1 number(s): "819287506"

Test #69:

score: 0
Accepted
time: 336ms
memory: 94636kb

input:

ikkikiikkiikikkikiikikkiikkikiikkiikikkiikkikiikikkikiikkiikikkikiikikkiikkikiikikkikiikkiikikkiikkikiikkiikikkikiikikkiikkikiikkiikikkiikkikiikikkikiikkiikikkiikkikiikkiikikkikiikikkiikkikiikikkikiikkiikikkikiikikkiikkikiikkiikikkiikkikiikikkikiikkiikikkikiikikkiikkikiikikkikiikkiikikkiikkikiikkiik...

output:

42989448

result:

ok 1 number(s): "42989448"

Test #70:

score: 0
Accepted
time: 328ms
memory: 96512kb

input:

jrrvrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvjrrvrvjrrvrvjrrvjrrvrvjrrvjrrvrvjrrvrv...

output:

511801172

result:

ok 1 number(s): "511801172"

Test #71:

score: 0
Accepted
time: 296ms
memory: 92028kb

input:

fmqmmqmfmqmmfmqmfmqmmfmqmmqmfmqmmfmqmfmqmmqmfmqmmfmqmmqmfmqmmfmqmfmqmmfmqmmqmfmqmmfmqmfmqmmqmfmqmmfmqmmqmfmqmmfmqmfmqmmqmfmqmmfmqmfmqmmfmqmmqmfmqmmfmqmfmqmmqmfmqmmfmqmmqmfmqmmfmqmfmqmmfmqmmqmfmqmmfmqmfmqmmqmfmqmmfmqmfmqmmfmqmmqmfmqmmfmqmfmqmmqmfmqmmfmqmmqmfmqmmfmqmfmqmmqmfmqmmfmqmfmqmmfmqmmqmfmqmmfm...

output:

857036567

result:

ok 1 number(s): "857036567"

Test #72:

score: 0
Accepted
time: 331ms
memory: 89792kb

input:

zllzlzllzlzzlzllzlzllzlzzllzlzllzlzzlzllzlzllzlzzlzllzlzzllzlzllzlzzlzllzlzllzlzzlzllzlzllzlzzllzlzllzlzzlzllzlzllzlzzlzllzlzzllzlzllzlzzlzllzlzllzlzzllzlzllzlzzlzllzlzllzlzzlzllzlzllzlzzllzlzllzlzzlzllzlzllzlzzlzllzlzzllzlzllzlzzlzllzlzllzlzzllzlzllzlzzlzllzlzllzlzzlzllzlzzllzlzllzlzzlzllzlzllzlzzl...

output:

230615864

result:

ok 1 number(s): "230615864"

Test #73:

score: 0
Accepted
time: 324ms
memory: 92684kb

input:

ifinifiqifinificifinifiqifinifioifinifiqifinificifinifiqifinifijifinifiqifinificifinifiqifinifioifinifiqifinificifinifiqifinifivifinifiqifinificifinifiqifinifioifinifiqifinificifinifiqifinifijifinifiqifinificifinifiqifinifioifinifiqifinificifinifiqifinifiuifinifiqifinificifinifiqifinifioifinifiqifin...

output:

51302050

result:

ok 1 number(s): "51302050"

Test #74:

score: 0
Accepted
time: 307ms
memory: 89764kb

input:

vvxxvvssvvxxvveevvxxvvssvvxxvvllvvxxvvssvvxxvveevvxxvvssvvxxvvmmvvxxvvssvvxxvveevvxxvvssvvxxvvllvvxxvvssvvxxvveevvxxvvssvvxxvvffvvxxvvssvvxxvveevvxxvvssvvxxvvllvvxxvvssvvxxvveevvxxvvssvvxxvvmmvvxxvvssvvxxvveevvxxvvssvvxxvvllvvxxvvssvvxxvveevvxxvvssvvxxvvjjvvxxvvssvvxxvveevvxxvvssvvxxvvllvvxxvvssvvxx...

output:

634001192

result:

ok 1 number(s): "634001192"

Test #75:

score: 0
Accepted
time: 225ms
memory: 71332kb

input:

abbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaababbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaab...

output:

327030361

result:

ok 1 number(s): "327030361"

Test #76:

score: 0
Accepted
time: 292ms
memory: 80284kb

input:

cqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqcqccqccqcqccqccqcqccqcqccqccqcqccqcqccqccqcqccqcc...

output:

599913991

result:

ok 1 number(s): "599913991"

Test #77:

score: 0
Accepted
time: 178ms
memory: 45392kb

input:

ekbtexackowxdkmbpffebstnkjwoewmrgxdbwcrarbjbgesfpmfdjcedhyrwgpjnefhemdojwiajfkxcnfpwjiwsasqpupokeyhxwanhugsvcdptihwjmqmdcblintuixjxyryrttgdblrknpfvrnsqroiamiqccddaadywptfylpmjwpyhkvseovifclpljiltbgmwnlxcjdrbjkcsenevntkpwilcjbksftujbwibjgkgcvodpeaslqjfaguxhumjixwlvlrlelusixwxccsmumfvngxuhfrlrwkhdymwl...

output:

724817065

result:

ok 1 number(s): "724817065"

Test #78:

score: 0
Accepted
time: 307ms
memory: 80968kb

input:

lkchjaaggjefgljejihfeacbaikhflajdaaafflaedlikafijekegfikdjjjgbcedggckifejeigficlbljhhlhlabfalhhfgcklejcllghdkcehhihgihajlkfdjglahglbegeiakacfdkbkaebaddhegjedfbialbkkbfeciablgjdjlifhcdcldbkjfcbhejfifjhldkdlhjfjiaakajjakbbiijiklbgegjaibcaccjlljghfjfbhccjdelblkdecfjlbeiihekdjiikkgkjlkgghjaldcjfbfjkgbel...

output:

356464990

result:

ok 1 number(s): "356464990"

Test #79:

score: 0
Accepted
time: 311ms
memory: 81296kb

input:

afidajdabcahgleladgilaaiahaalgeckacgdhikedajfllaiecedciibehahihgaabjfiiaigddhecjdilekfekgcheiblkikhgdjgklhbcibideelhefjbddeififeeadfdkcbhcfecdckakhgghcdljcbccafjaffelkdfhjidkdcdeaadlekehfclkejlbekglhiacilkjalbfikejliaefhffgigdcbjllgcikaejabjkikdakdllkbdhkkfdcjglkefhliaceebbbhgfjehjahkdllbdagichkgfhc...

output:

786753770

result:

ok 1 number(s): "786753770"

Test #80:

score: 0
Accepted
time: 240ms
memory: 70624kb

input:

accbabadbdcccccccbddccaadbacacccaadcdbbdbccccbbcabaaccabbbaaccacccdaacdbacacadcacdabdacdbabcaadbcbbddbbaadbcaadddbddddcdcaaacddaaadaacccbdbdcaadabdbbacaadaadaacbaadddbaabdcaaccdccbdbbbadbdaabacdbddaadabdcdbdbabcbbadabdcdbbbcbaadcbdaaadbdcbadaaaacdbacbdbbbadbbcbababaabbacbdcccaadbaddcdaccaabbbaaccccc...

output:

622832899

result:

ok 1 number(s): "622832899"

Test #81:

score: 0
Accepted
time: 345ms
memory: 84660kb

input:

umsbsreehuqiftiwodqedbdftdojqdpockjytlxkmgqhhrciwgqakumdmgjouxibshxsexdmkhjdogcufbufhbvltpsihhxmiueudffqusahvsdtkbfhbyfyhamkywerueygoduedisurxovabyldsxmeneoafkoraxddqvkjyojuomgeqfauvtxfdrbosimvskjnnroandqxraxqmgwjpymfuctwsatvjjimpqflkdrppjjsdoajbptdvgjjbqtqhmtwjxeryosylnlfrgqkidfiiurrftjwbsiwdwflcvl...

output:

984859699

result:

ok 1 number(s): "984859699"

Test #82:

score: 0
Accepted
time: 286ms
memory: 83332kb

input:

yyggyyvvyyggyyssyyggyyvvyyggyymmyyggyyvvyyggyyssyyggyyvvyyggyyccyyggyyvvyyggyyssyyggyyvvyyggyymmyyggyyvvyyggyyssyyggyyvvyyggyyxxyyggyyvvyyggyyssyyggyyvvyyggyymmyyggyyvvyyggyyssyyggyyvvyyggyyccyyggyyvvyyggyyssyyggyyvvyyggyymmyyggyyvvyyggyyssyyggyyvvyyggyyuuyyggyyvvyyggyyssyyggyyvvyyggyymmyyggyyvvyygg...

output:

577529235

result:

ok 1 number(s): "577529235"

Test #83:

score: 0
Accepted
time: 249ms
memory: 80272kb

input:

abbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaababbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaab...

output:

949570995

result:

ok 1 number(s): "949570995"

Test #84:

score: 0
Accepted
time: 251ms
memory: 79848kb

input:

bacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaabacabacaacabacaabacaacabacaabacabacaacabacaabacabacaabacaacabacaaba...

output:

70666325

result:

ok 1 number(s): "70666325"

Test #85:

score: 0
Accepted
time: 349ms
memory: 83316kb

input:

gjhcbbgakfgjeejbedjgigkcjdekfekgfekfhkjciggedbbgaadfdeddgacchekjhgkkjejfjjhaecbjfbfkhebajafdcchbhbkhkeghbiekgiacejkhfkfgkehdcaeehchbadakifccabbaebfhkidadejejjaiakjchichgjjfdbgdgjdkjkbejgdbdfdbeciijbjkjfaikggbbjdahgdbfhjccdeabdekkgkgbcebaedeccfagffgkbebgdadfjigcgicebbffbcdabeibaejcbbikekkjbgbecejekgd...

output:

978261270

result:

ok 1 number(s): "978261270"

Test #86:

score: 0
Accepted
time: 213ms
memory: 51872kb

input:

mxoqseznvejisedcoyhvsedqzejrrkxsccggacwxilvzboekmtbniujaityhqqdclnxypzsxfaikjrtocuwttlhkxdljcslhqorjrjyovtsmcinyajmhmhkdekcfpgzdtnfvdmoudufsoudxiyopjstfqycabjuzcxhbkcjuztxghpmbrslfzsninxpncmitkkceqqlxysofkwtmyptbftxqzdjmapryouubgwhpquiywyzorfvktiopndysqpgzupoveearrffknqjvoquagvyeykyiwtbmotwtgpblelvu...

output:

656167218

result:

ok 1 number(s): "656167218"

Test #87:

score: 0
Accepted
time: 224ms
memory: 72100kb

input:

uiggbevurnlkjvwbbrdfhjofvetlkddgqnqgnbunouebddomhsgrfrswjljmjfelokchaffkaouvfowddrihkhkrginsjiiustlenqtbatbngblpovopartfomukttjqvqhbmjuumahkcenebcpawklekgklbcsdfcrfpriroudnnvavothbcsaeedmucshvfhwtcbekcrncprsopdegsdmmfldemtowsnmdhcsvcspotpqdjurkjhkdiuarbwfawrwejfgohnptwrevucfubiajrwhoglmjewqpjbaldwtn...

output:

47222561

result:

ok 1 number(s): "47222561"

Test #88:

score: 0
Accepted
time: 225ms
memory: 68008kb

input:

hagiiddcbggaffcceecgcgeafcgggcchcfegaadfeecffciebcccbagaaaggcifeiehbahccebbaifhbeihcfcdfgiaadcecaeiegcgcchidifcffdaccbadedhgibcdaddafadfedeihiaafghggfidaaeghcdeaaghggdbddbfaachhdaagecggidibffdfifedgdegeeafgeacieihbhcagffbddaicgigdfdhhggedfheabddeggdecbciefbeccfbifacgbiccgghbdhadchefhchicagbibehhdgae...

output:

411089792

result:

ok 1 number(s): "411089792"

Test #89:

score: 0
Accepted
time: 207ms
memory: 54544kb

input:

jpmvlgmjppvgojjqjlomqpljoqpmlmlomvggmomvojjloglvvvojmqoomvplvpvjljmpojpgoqvlgopqmlqjqqllqqpmloglplpqqopplggmqmlgmvvgvvpvmolmjqvomomqvqpmjvoglpollglglgovomomgopqplppvmovlqoqpgqvovpgomjvqoovqojgmmvopjqggvgglpgmpojqlvmooppmvllvjgojjjjlqlqoqqvpppgolomoolvooqvlqgovqjgllpojpqmlgmoolmjmmmpljjmgpgpmvvqvovjp...

output:

704049420

result:

ok 1 number(s): "704049420"

Test #90:

score: 0
Accepted
time: 55ms
memory: 40276kb

input:

crjcrmmknrhfgjecnanrpiphalheosdbkgcggfjmlllcrgrjjfbpkehajhakhnlgrbcfmhlpgopnrdhqkcimiqdbidnscgjseoishaqfrbhagclieprqbcddrmsjrfdhnlhmqogjmikkmaonkjqqjpfphobsncoalorfbmgcsmkqkloaplggnemrlqdeqelhhihgrciefioicnarocmablgoqbbeehckfloejssibfifokslrlonbshnisjshchqdllsihrekcbeefmqomnphhgfgnjeprcmlsdonkplcrpq...

output:

737440505

result:

ok 1 number(s): "737440505"

Test #91:

score: 0
Accepted
time: 1ms
memory: 9712kb

input:

xdaaaeabbbcdaaaeabbbcdaaaeabbbcdaaaeabbbcdaaaeabbbcdaaaeabbbcdaaaeabbbcdaaaeabbbc
yabcaabaaaaabcaabaaaaabcaabaaaaabcaabaaaaabcaabaaaaabcaabaaaaabcaabaaaaabcaabaaaa

output:

165017868

result:

ok 1 number(s): "165017868"

Test #92:

score: 0
Accepted
time: 73ms
memory: 33048kb

input:

ylommmmmmmmmmmmmmlommmmmmmmmmmmmmzlommmmmmmmmmmmmmmlommmmmmmmmmmmmmmylpmmmmmmmmmmmmmmlpmmmmmmmmmmmmmmzlpmmmmmmmmmmmmmmmlpmmmmmmmmmmmmmmmylrmmmmmmmmmmmmmmlrmmmmmmmmmmmmmmznnmllnlmommnnkmlnnnmllnlmommnnkmlnylmmnkmmnokmmnlnmlmmnkmmnokmmnlnmznnmmmmlmlllmmnllonnmmmmlmlllmmnlloymnknmnmnmlmonmknmnknmnmnmlm...

output:

837490821

result:

ok 1 number(s): "837490821"

Test #93:

score: 0
Accepted
time: 279ms
memory: 84044kb

input:

alommmmmmlommmmmmalpmmmmmmlpmmmmmmalrmmmmmmlrmmmmmmaltmmmmmmltmmmmmmalxmmmmmmlxmmmmmmanlmmkommpmkmmlnlnlmmkommpmkmmlnlatrnpnjoptrnpnjopanoqpkkivnoqpkkivaprqnncmtprqnncmtahqnihpmshqnihpmsalrqnnsjklrqnnsjkamjigjkjrmjigjkjraiolhtiqkiolhtiqkaihlljpqsihlljpqsagsjjjmnjgsjjjmnjatniqrnlftniqrnlfakqmptltrkqm...

output:

38724908

result:

ok 1 number(s): "38724908"

Test #94:

score: 0
Accepted
time: 290ms
memory: 86236kb

input:

anlmmmmmmnlmmmmmmalommmmmmlommmmmmalpmmmmmmlpmmmmmmalrmmmmmmlrmmmmmmaltmmmmmmltmmmmmmapnlhnmjkpnlhnmjkarlplmjmorlplmjmoapkrolmkmpkrolmkmaljkmgookljkmgookakmpnqnjhkmpnqnjhampoljoplmpoljoplajlqoknlpjlqoknlpaiiinmmopiiinmmopaljjnnoipljjnnoipahpnnomkjhpnnomkjaogmnlqnkogmnlqnkaommnrjklommnrjklakkpnkmgnkk...

output:

865985560

result:

ok 1 number(s): "865985560"

Test #95:

score: 0
Accepted
time: 190ms
memory: 69588kb

input:

anmommnllmnikmlknnmommnllmnikmlknanmkmqlnmmimlmonmnmkmqlnmmimlmonmalmmmmlmlklnjqmmllmmmmlmlklnjqmmlanmmnnnnomlojlmnjnmmnnnnomlojlmnjapnmmjlonnmjllkonpnmmjlonnmjllkonaokmlonnllnplljnnokmlonnllnplljnnalnoknlmoljjmjmpmlnoknlmoljjmjmpmamlljlmjmmmjlllpnmlljlmjmmmjlllpnaokknnkmmjnllnonkokknnkmmjnllnonkalr...

output:

73348695

result:

ok 1 number(s): "73348695"

Extra Test:

score: 0
Extra Test Passed