蓝桥杯算法提高VIP-笨小猴 （C++代码）挺简单的水题

解题思路:

看题目应该也可以理解了

注意事项:

参考代码:
#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
int a[26];
int isprime(int x){//判断素数的函数
              for (int i = 2; i < (int)(sqrt(x) + 1); i++){
                          if (x%i == 0)return 0;
              }
              if (x <= 1)return 0;
              return 1;
}
int main(){
             string s;
             getline(cin, s);
             int k = s.size();
             for (int i = 0; i < k; i++){
                         a[(int)(s[i] - 'a')]++;//相应字母的个数++
              }
              int mmax = *max_element(a, a + 26);//找数组范围最大值的函数，在头文件#include<algorithm>
              //#include<functional>   中          

             for (int i = 0; i < 26; i++){
                        if (a[i] == 0){
                                a[i] = 10000;
                          }
              }
              int mmin = *min_element(a, a + 26);//找数组范围最小值函数
              if (isprime(mmax - mmin)){
                         cout << "Lucky Word\n" << mmax - mmin<<endl;
               }
               else{
                           cout << "No Answer\n"<<0<<endl;
                }
                return 0;
}