题解

#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
bool is_prime(int n){
for(int i=2;i*i<=n;i++)
{
if(n%i==0)
{
return false;
}
}
return true;
}

int main(){
string a;
int b[200]={0},max=0,min=200;
cin>>a;
for(int i=0;i<=a.size()-1;i++){
b[a[i]];
}
// for(int i=0;i<=122;i){
// cout <<b[i];
// }
for(int i=0;i<=122;i++){
if(b[i]!=0){
if(b[i]>max){
max=b[i];
}
if(b[i]<min){

			min=b[i];
		}
	}
}
	
if(is_prime(max-min) and (max-min)!=0 and (max-min)!=1){
	
	cout <<"Lucky Word"<<endl;
	cout <<max-min;
}else{
	cout <<"No Answer"<<endl;
	cout <<0;		
	
} 

return 0;

}