• Source
    1. #include<bits/stdc++.h>
    2. using namespace std;
    3. #define ll long long
    4. #define s second
    5. #define f first
    6. #define pii pair<int,int>
    7. #define pll pair<ll ,ll>
    8. #define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
    9. const double pi = 3.14159;
    10. #define pb push_back
    11. int main(){
    12. IOS;
    13. int t;
    14. cin>>t;
    15. while(t--){
    16. string s;
    17. cin>>s;
    18. ll n=s.length();
    19. ll cnt[26]={0};
    20. for(ll i=0;i<s.length();i++)
    21. cnt[s[i]-'A']++;
    22. sort(cnt,cnt+26,greater<ll>());
    23. ll mn=INT_MAX;
    24. for(int i=1;i<=26;i++){
    25. ll ans=0,pos=0;
    26. if(n%i!=0)continue;
    27. ll nfact=n/i;
    28. if(nfact > 26)continue;
    29. for(int j=0;j<i;j++){
    30. if(pos >=0 && cnt[j]<nfact){
    31. ll diff=(nfact-cnt[j]);
    32. if(diff <=pos){
    33. pos-=diff;
    34. }else{
    35. ans+=(diff-pos);
    36. pos=0;
    37. }
    38. }else
    39. ans+=abs((cnt[j]-nfact));
    40. if(cnt[j]>=nfact)
    41. pos+=(cnt[j]-nfact);
    42. }
    43. mn=min(mn,ans);
    44. }
    45. cout<<mn<<endl;
    46. }
    47. return 0;
    48. }
    49.