这样的思路可以吗

#include<iostream>
#include<cstring>
using namespace std;
int arr[27];
char w[101];
bool isPrime(int num){
	if(num<2) return false;
	for(int i=2;i*i<=num;i++)
		if(num%i==0) return false;
	return true;
}
int main(){
	cin >>w;
	for(int i=0;i<strlen(w);i++){
		arr[w[i]-'a']++;
	}
	int maxx=1,minn=100;
	for(int i=0;i<26;i++){
		if(maxx<arr[i]) maxx=arr[i];
		if(arr[i]>0&&minn>arr[i]) minn=arr[i];
	}
	int c=maxx-minn;
	if(isPrime(c)) cout <<"Lucky Word" <<endl <<c <<endl;
	else  cout <<"No Answer" <<endl <<0 <<endl;
	return 0;
}