全部评论 2

  • 你不能在桶排序的时候判断大小,要分开写@营业执照思密达
    你看一个叫 @营业执照思密达的题解 你看看。

    2024-02-01 来自 广东

    1
  • #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;
    }

    昨天 来自 浙江

    0
首页