依旧题解

#include <bits/stdc++.h>
/*
#include <iostream>
#include <cctype>
#include <string.h>
#include <algorithm>
*/
using namespace std;
string s1;
int maxn = -114514,minn = 2147483646,l1;
int nlp[26];
int lucky,zs,cnt;
string alp = "abcdefghijklmnopqrstuvwxyz"; // 26个字母
string sa = "Lucky Word";
string o = "No Answer"; // 答案错误
int i,j;
int print(int x)
{
for (i = 1; i <= x; i++)
{
if (x % i == 0)
{
zs++;
}
}
return zs;
}
int main(void)
{
cin >> s1; // getline(cin,s1);
l1 = s1.size();
for (i = 0; i < l1; i++)
{
for (j = 0; j < 26; j++)
{
if (s1[i] == alp[j])
{
nlp[j];
}
}
}
for (i = 0; i < 26; i)
{
if (nlp[i] <= minn and nlp[i] != 0)
{
minn = nlp[i];
}
if (nlp[i] >= maxn)
{
maxn=nlp[i];
}
}
// cout << nlp[0]; // 检验
lucky = maxn - minn;
print(lucky);
if (zs == 2)
{
cout << sa << endl << lucky;
}
else
{
cout << o << endl << 0;
}
return 0;
}