P1125 80Pts 2个点WA

#include <bits/stdc++.h>
using namespace std;

bool isPrime(int n){
  if(n <= 1) return false;
  for (int i = 2;i <= sqrt(n);i++)
    if(n % i == 0) 
      return false;
  return true;
}

int main(){
    string word;
    cin >> word;
    int maxn = 0, minn = INT_MAX; 
    map<char, int> freq;
    for (char c : word) {
        freq[c]++;
        maxn = max(maxn, freq[c]);
        minn = min(minn, freq[c]);
    }
    if (isPrime(maxn - minn)) {
        cout << "Lucky Word" << endl;
        cout << maxn - minn << endl;
    } else {
        cout << "No Answer" << endl;
        cout << 0 << endl;
    }
    return 0;
}