题目62 笨小熊

     已AC代码：

#include<iostream>#include<algorithm>#include<cmath>using namespace std;bool isPrime(int n){    if(n==1 || n==0)        return false;    for(int k=2; k<=sqrt(double(n)); k++)    {        if((n%k)==0)            return false;    }    return true;}int main(){    int t;    cin >> t;    while(t--)    {        string s;        cin >> s;        int a[105]={0}, n, siz;        siz = s.size();        for(int i=0; i<siz; i++)        {            for(int j=0; j<siz; j++)            {                if(s[i] == s[j])                    a[i]++;            }        }        sort(a, a+siz);        n = a[siz-1] - a[0];        if(isPrime(n) == true)            cout << "Lucky Word" << endl << n << endl;        else            cout << "No Answer" << endl << "0" << endl;    }    return 0;}