P1125 [NOIP2008 提高组] 笨小猴

#include <iostream>
#include<cstring>
#include<cmath>
using namespace std;
int main() {
	char a[100];
	int b[26] = { 0 };
	cin >> a;
	int x = strlen(a);
	int prime;
	for (int i = 0; i<x; i++) {
		if(a[i]>='a'&&a[i<='z']){
		int f = a[i] - 'a';
			b[f]++;
		}
	}
	int maxn = b[0], minn = b[0];
	for (int i = 1; i < 26; i++) {
		if (maxn < b[i])
			maxn = b[i];
	}
	for (int i = 1; i < 26; i++) {
		if (minn > b[i])
			minn = b[i];
	}
	if (!minn) minn = 1;
	prime = maxn - minn;
	if (prime > 2) {
		for (int i = 2; i < sqrt(prime) + 1; i++)
		{
			if (prime % i == 0)
			{
				prime = 0;
				break;
			}
		}
	}
	else if (prime == 1)
		prime = 0;
	if (prime) {
		cout << "Lucky Word" << endl << prime;
	}
	else
		cout << "No Answer" << endl << prime;
	return 0;
}