这代码有力气

#include<iostream>
#include<string>
//awa
int t[26]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
bool z(int x){
    for(int i=1;i<=25;i++){
        if(x==t[i]){
            return 1;
        }
    }
    return 0;
}
using namespace std;
int main(){
    string s;
    cin>>s;
    int abc[27]={0};
    for(int i=0;i<=s.size();i++){
        abc[s[i]-'a'+1]++;
    }
    int maxn=-1,minn=101;
    for(int i=1;i<=26;i++){
        if(abc[i]>maxn){
            maxn=abc[i];
        }
        if(abc[i]<minn&&abc[i]){
            minn=abc[i];
        }
    }
    if(z(maxn-minn)){
        cout<<"Lucky Word"<<endl<<maxn-minn;
    }else{
        cout<<"No Answer"<<endl<<0;
    }
}