http://noi.openjudge.cn/ch0109/06/
我的代码
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string s1;
cin >> s1;
int len = s1.length();
char tag = 'a';
int minn = 200, maxn = 0;
int i = 0, j = 0;
for (i = 0; i < 26; i++,tag++)//26个字母
{
int n = 0;
for (j = 0; j<len; j++)//记录字母出现次数
{
if (s1[j] == tag) n++;
}
if (n == 0) continue;
if (n > maxn) maxn = n;
if (n < minn) minn = n;
}
bool isPrime(int);
if (isPrime(maxn - minn))
cout << "Lucky word" << endl << maxn - minn;
else
cout << "No Answer" << endl << "0";
return 0;
}
bool isPrime(int n)
{
if (n == 0 || n == 1) return false;
if (n == 2) return true;
int i = 0;
int w = sqrt(n);
for (i = 2; i <= w; i++)
{
if (n%i == 0) return false;
}
return true;
}
暴力循环每个字符,记录26个字母的出现次数,答案是5分,不知道哪里出错
参考代码
#include <iostream>
#include <cmath>
#include <cstring>
#include<string>
using namespace std;
bool isPrime(int n)
{
int i, len = sqrt(n);
for (i = 2; i < len; i++) {//这里我认为有错误,应该是i<=len
if (n%i == 0) return false;
}
return true;
}
int main()
{
int i, maxn = 0, minn = 100, table[26] = { 0 }, n;
string word;
cin >> word;
for (i = 0; i < word.size(); i++)
table[word[i] - 'a']++;
for (i = 0; i < 26; i++) {
if (table[i] > maxn) maxn = table[i];
if (table[i] < minn && table[i] != 0) minn = table[i];
}
n = maxn - minn;
if (n > 1 && isPrime(n)) {
cout << "Lucky Word" << endl;
cout << n << endl;
}
else {
cout << "No Answer" << endl << "0" << endl;
}
return 0;
}
参考代码我认为在质数判断上有问题,比如测试用例 aaaaab,maxn-minn=4,该代码认为是正确
oj也认为这个是AC
但参考代码比较 值得学习的地方
- 质数判断部分 i<=sqrt(n),而不是 i<n,减少了一半的循环
- 建立数组存放每个字母的出现次数 ,然后语句 table[word[i] - ‘a’]++; 刚好可以根据字母顺序将出现次数放入该位置