2 条题解

  • 7
    @ 2022-12-19 13:55:27
    #include <iostream>
    #include <string>
    using namespace std;
    int main()
    {
    	int maxn = -1, minn = 101, s[31] = {0};
    	string a;
    	cin >> a;
    	for (int i = 0; i < a.size(); i++)
        {
    		s[a[i] - 97]++;
    	}
    	for (int i = 0; i < 26; i++)
        {
    		if (s[i] > maxn)
            {
    			maxn = s[i];
    		}
    		if ((s[i] < minn) && (s[i] != 0))
            {
    			minn = s[i];
    		}	
    	}
    	if ((maxn - minn > 1) && (a[maxn - minn]))
        {
    		cout << "Lucky Word" << endl << maxn - minn;
    	}	
    	else
        {
    		cout << "No Answer" << endl << "0";
    	}	
    	return 0;
    }
    
    • 0
      @ 2024-2-2 18:16:31
      #include <bits/stdc++.h>
      using namespace std;
      string s;
      int a[150],minn=INT_MAX,maxx=INT_MIN;
      bool prime(int x){
          if (x<2)return 0;
          for (int i=2;i*i<=x;i++){
              if (x==i)return 0;
          }
          return 1;
      }
      int main(){
          cin>>s;
          for (int i=0;i<(int)s.size();i++)a[(int)s[i]]++;
          for (int i=97;i<=122;i++){
              if (a[i]!=0){
                  maxx=max(a[i],maxx);
                  minn=min(a[i],minn);
              }
          }
          if (prime(maxx-minn))cout<<"Lucky Word"<<endl<<maxx-minn;
          else cout<<"No Answer"<<endl<<0;
          return 0;
      }
      
      • 1

      信息

      ID
      1611
      时间
      1000ms
      内存
      256MiB
      难度
      2
      标签
      递交数
      47
      已通过
      30
      上传者