【NOIP2008】【Luogu1125】笨小猴

problem

solution

codes

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int a[30];
int main(){
    string str;  cin>>str;
    for(int i = 0; i < str.size(); i++)
        a[str[i]-'a']++;
    int minn = 0xffffff, maxn = 0;
    for(int i = 0; i < 26; i++){
        maxn = max(maxn, a[i]);
        if(a[i])minn = min(minn, a[i]);
    }
    int t = maxn-minn, flag = 1;
    if(t == 0 || t == 1)flag = 0;
    for(int i = 2; i*i < t; i++)if(t%i==0){
        flag = 0; break;
    }
    if(flag)cout<<"Lucky Word\n"<<t;
    else cout<<"No Answer\n"<<0;
    return 0;
}
  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80450441