C++14(g++5.4) 解法, 执行用时: 2ms, 内存消耗: 376K, 提交时间: 2019-09-04 23:10:54

#include<cstdio>
const int N=100+10;
char s[N];
int ans,a[26],x,y=1e9;
int main()
{
	scanf("%s",s);
	for(int i=0;s[i];i++)a[s[i]-'a']++;
	for(int i=0;i<26;i++)
		if(a[i])
		{
			if(x<a[i])x=a[i];
			if(y>a[i])y=a[i];
		}
	ans=x-y;
	if(ans<2)
	{
		puts("No Answer\n0");
		return 0;
	}
	for(int i=2;i*i<=ans;i++)
		if(ans%i==0)
		{
			puts("No Answer\n0");
			return 0;
		}
	puts("Lucky Word");
	printf("%d",ans);
	return 0;
}

C++(clang++ 11.0.1) 解法, 执行用时: 3ms, 内存消耗: 436K, 提交时间: 2023-04-06 20:44:40

#include<bits/stdc++.h>
using namespace std;
int a[149];
int main(){
   char n[101];int x=0,i,j;
    cin>>n;
    for(i=0;i<strlen(n);i++) a[n[i]]++;
    sort(a,a+149);
    for(i=0;i<149;i++) if(a[i]>0) break;
    for(j=2;j<a[148]-a[i];j++){
        if((a[148]-a[i])%j==0) break;
    }
    if(j==a[148]-a[i]) cout<<"Lucky Word"<<endl<<a[148]-a[i];
    else cout<<"No Answer"<<endl<<"0";
}

pypy3 解法, 执行用时: 73ms, 内存消耗: 21164K, 提交时间: 2023-03-01 17:53:55

def check(x):
    if x < 2:
        return False
    for i in range(2,x-1,1):
        if(x % i == 0) :
            return False
    return True

st = input()
st = st.lower()
l = []
for i in st:
    l.append(st.count(i))
l.sort()
Max = l[len(st)-1]
Min = l[0]

if check(Max - Min):
    print('Lucky Word')
    print(Max - Min)
else:
    print('No Answer')
    print(0)
    

Python3 解法, 执行用时: 32ms, 内存消耗: 4596K, 提交时间: 2022-01-20 19:25:45

n=list(input())
slist=[]
for i in n:
    x=n.count(i)
    slist.append(x)
s=max(slist)-min(slist)
flag=0
for i in range(2,s+1):
    if(s%i==0):
        flag=1
if(flag==1):
    print("Lucky Word")
    print(s)
else:
    print("No Answer")
    print(0)