求一个hack数据

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define endt ' '
#define pll pair<ll, ll>
#define lowbit(emm) (emm & (-emm))
const int inf = 2147483647;
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    ll t;
    cin >> t;
    while (t--)
    {
        ll n, cnt = 0;
        cin >> n;
        string s;
        cin >> s;
        vector<ll> a(30, 0);
        string ss = "CHICKEN.";
        ll j = 0;
        for (ll i = 0; i < n; i++)
        {
            if (s[i] == ss[j])
            {
                j++;
            }
            else
            {
                a[s[i] - 'A']++;
            }
        }
        if (j != 7)
        {
            cout << "NO\n";
            continue;
        }
        sort(a.begin(), a.end(), greater<ll>());
        for (ll i = 0; i < 30; i++)
        {
            if (a[i] == 0)
            {
                a.erase(a.begin() + i, a.end());
                break;
            }
        }
        ll m = a.size();
        if (m == 0)
        {
            cout << "YES\n";
        }
        else
        {

            for (ll i = m - 1; i > 0; i--)
            {
                for (ll i = 0; i < m; i++)
                    cout << a[i] << endt;
                cout << endl;
                ll num = a[i] - a[i] / i * i;
                for (ll k = 0; k < i; k++)
                {
                    a[k] -= a[i] / i;
                    if (num > 0)
                    {
                        a[k]--;
                        num--;
                    }
                }
                a[i] = 0;
                sort(a.begin(), a.end(), greater<ll>());
            }
            if (a[0] != 0)
                cout << "NO\n";
            else
                cout << "YES\n";
        }
    }
    return 0;
}