题解

#include<bits/stdc++.h>
using namespace std;
int a[26];
bool isprime(int x){
if(x<=1) return false;
for(int i=2;i<x;i++){
if(x%i==0)return false;
}
return true;
}
int main(){
string x;
cin>>x;
for(int i=0;i<x.length();i++){
a[x[i]-'a'];
}
int maxn=-1000,minn=1000000000;
for(int i=0;i<26;i){
if(a[i]>maxn){
maxn=a[i];
}
if(a[i]<minn&&a[i]!=0){
minn=a[i];
}
}
if(isprime(maxn-minn)){
cout<<"Lucky Word"<<endl;
cout<<maxn-minn<<endl;
}else{
cout<<"No Answer"<<endl;
cout<<"0"<<endl;
}
return 0;
}