C++ 解法, 执行用时: 4ms, 内存消耗: 412K, 提交时间: 2022-02-22 22:35:15

#include<bits/stdc++.h>
using namespace std;
int c[128];
char ch;
bool ok(int n)
{
	if(n==0||n==1)return 0;
	for(int i=2;i*i<=n;i++){
		if(n%i==0)return 0;
	}
	return 1;
}
int main()
{
	int minn=999999999,maxn=0;	
	while(cin>>ch)c[ch]++;
	
	for(ch='a';ch<='z';ch++){
		maxn=max(maxn,c[ch]);
		if(c[ch]>0)minn=min(minn,c[ch]);
	}

	if(ok(maxn-minn)){
		cout<<"Lucky Word"<<endl;
		cout<<maxn-minn;
	}
	else {
		cout<<"No Answer"<<endl;
		cout<<0;
	}
} 

Python3 解法, 执行用时: 41ms, 内存消耗: 4584K, 提交时间: 2022-05-12 19:33:39

def su(x):
    if x<2:
        return False
    for i in range(2,x):
        if x%i==0:
            return False
    return True
s=input()
maxn=s.count(max(s,key=s.count));minn=s.count(min(s,key=s.count))
if su(maxn-minn)==True:
    print("Lucky Word");print(maxn-minn)
else:
    print("No Answer");print("0")