题解

#include<bits/stdc++.h>
using namespace std;
char a1[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','o','p','q','r','s','t','u','v','w','x','y','z'};
int a[150],m=-99,m1=9999;
char s[101];
int is_prime(int a){
    int b=0;
    if(a<2)return 0;
    for(int i=a-1;i>1;i--)if(a%i==0)return 0;
    return 1;
}
int main(){
    cin>>s;
    int n = strlen(s);
    for(int j=0;j<n;j++)for(int i=0;i<26;i++)if(s[j]==a1[i])a[i]++;
    for(int i=0;i<26;i++){
        if(a[i]>=m)m=a[i];
        if(a[i]<=m1&&a[i]!=0)m1=a[i];
    }
    int m2=m-m1;
    if(is_prime(m2))cout<<"Lucky Word"<<endl<<m2;
    else cout<<"No Answer"<<endl<<0;
	return 0;
}