AcWing 493. 笨小猴
原题链接
简单
作者:
Present.
,
2023-01-18 10:48:25
,
所有人可见
,
阅读 157
#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>
using namespace std;
unordered_map<char,int> mp;
vector<int> v;
bool check(int x)
{
if(x == 0) return false;
if(x == 1) return false;
if(x == 2) return true;
for(int i = 2;i * i <= x;i ++)
{
if(x % i == 0)
{
return false;
}
}
return true;
}
int main()
{
string s;
cin >> s;
for(int i = 0;i < s.size();i ++) mp[s[i]] ++;
for(auto tt : mp) v.push_back(tt.second);
sort(v.begin(),v.end());
int tmp = v[v.size() - 1] - v[0];
if(check(tmp))
{
cout << "Lucky Word" << endl;
cout << tmp << endl;
}
else
{
cout << "No Answer" << endl;
cout << "0" << endl;
}
return 0;
}