题解 | #[NOIP2008]笨小猴#
[NOIP2008]笨小猴
https://www.nowcoder.com/practice/17865bc2a75c4944a872ef709958c56e
#include <iostream>
using namespace std;
int main() {
string s;
cin>>s;
int maxn=0,minn=s.size()+1,count=0;
for(int i=0;i<s.size();i++){
count=0;
for(int j=0;j<s.size();j++){
if(s[i]==s[j])count++;
}
if(count>maxn)maxn=count;
if(count<minn)minn=count;
}
int sum=maxn-minn,temp=0;
for(int i=2;i<sum;i++){
if(sum%i==0)temp=1;
}
if(sum<2||temp==1){
cout<<"No Answer"<<endl;
cout<<0<<endl;
}
else{
cout<<"Lucky Word"<<endl;
cout<<sum<<endl;
}
return 0;
}
// 64 位输出请用 printf("%lld")


查看10道真题和解析