[noip2008tg] 笨小猴

题目链接

题解：模拟，模拟

#include <iostream>#include <cmath>#include <algorithm>#include <cstring>using namespace std;const int M=1005;string s;int mi=M,mx;int num[233];bool is_prime(int z){    if(z==0||z==1) return false;    if(z==2) return true;    for(int i=2;i<=sqrt(z)+1;i++)    if(z%i==0) return false;    return true;}void ask(){    if(!is_prime(mx-mi))    {        cout<<"No Answer"<<endl<<"0"<<endl;        return ;    }    cout<<"Lucky Word"<<endl<<mx-mi<<endl;}int main(){    cin>>s;    for(int i=0;i<s.size();i++)    num[s[i]]++;    for(int i='a';i<='z';i++)    {        if(num[i])        {            mx=max(num[i],mx);            mi=min(num[i],mi);        }    }    ask();    return 0;}