兄弟们错两个点咋整

奈

2023-10-06 09:18:12

发布于：台湾

106阅读

0回复

0点赞

送上代码：

#include <iostream>
#include <cstring>
using namespace std;

bool isPrime(int num) {
    if (num < 2) return false;
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) return false;
    }
    return true;
}

int main() {
    string s;
    cin >> s;
    int count[26] = {0}, maxn = 0, minn = 100;
    for (int i = 0; i < s.size(); i++) {
        count[s[i] - 'a']++;
        maxn = max(maxn, count[s[i] - 'a']);
        minn = min(minn, count[s[i] - 'a']);
    }
    if (isPrime(maxn - minn)) {
        cout << "Lucky Word" << endl;
        cout << maxn - minn << endl;
    } else {
        cout << "No Answer" << endl;
        cout << 0 << endl;
    }
    return 0;
}

有帮助，赞一个

去预览

0/2000

全部评论 3

「欢愉」花火
你不能在桶排序的时候判断大小，要分开写@营业执照思密达
你看一个叫 @营业执照思密达的题解你看看。

2024-02-01 来自广东
1
135****3838
#include<bits/stdc++.h>
using namespace std;
bool prime(int x);
int main()
{
string str;
int a[26]= {0};
int max=0,min=9999;
int i;
cin>>str;
for(i=0; i<str.length(); i++)
a[str[i]-'a']+=1;
for(i=0; i<26; i++)
{
if(max<a[i])
max=a[i];
if(min>a[i]&&a[i]!=0)
min=a[i];
}
if(prime(max-min))
cout<<"Lucky Word"<<endl<<(max-min)<<endl;
else
cout<<"No Answer"<<endl<<0<<endl;
return 0;
}

bool prime(int x)
{
int i;
if(x<2)
return false;
else
for(i=2; i<=sqrt(x); i++)
if(x%i==0)
return false;
return true;
}

1周前来自浙江
0
nb
#include <iostream>
#include <cstring>
using namespace std;

bool isPrime(int num) {
if (num < 2) return false;
for (int i = 2; i * i <= num; i++) {
if (num % i == 0) return false;
}
return true;
}

int main() {
string s;
cin >> s;
int count[26] = {0}, maxn = 0, minn = 100;
for (int i = 0; i < s.size(); i++) {
count[s[i] - 'a'];
}for(int i = 0; i < 26; i){
maxn = max(maxn, count[i]);
if(count[i]) minn = min(minn, count[i]);
}
if (isPrime(maxn - minn)) {
cout << "Lucky Word" << endl;
cout << maxn - minn << endl;
} else {
cout << "No Answer" << endl;
cout << 0 << endl;
}
return 0;
}

2025-08-07 来自浙江
0