14.[NOIP2008 提高组] 笨小猴 难度：普及/提高- 来源：-- AC代码（C++）： 没有注释，自行学习。 注释有了，自行食用 by：yanghaozhe 你的点赞和关注就是我更新题解的最大动力！ ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ -----------------------------点个赞吧 ↓ ！-----------------------------

#include <iostream> #include <cstdio> #include <cmath> #include <cstring> using namespace std; bool prime(int n){ if(n0||n1){ return false; } if(n2){ return true; } for(int i=3;i<sqrt(n);i++){ if(n%i0){ return false; } } return true; } int main(){ char s[1000]; cin>>s; int a[24]={0},maxn=-999,minn=999; for(int i=0;i<strlen(s);i++){ a[s[i]-'a']; } for(int i=0;i<24;i){ if(a[i]>maxn){ maxn=a[i]; } if(a[i]<minn&&a[i]!=0){ minn=a[i]; } } int p=maxn-minn; if(prime(p)){ cout<<"Lucky Word"<<endl; cout<<p; }else{ cout<<"No Answer"<<endl; cout<<0; } return 0; }

#include<bits/stdc++.h> using namespace std; #define int long long #define str string #define output cout inline int input() { int x=0,f=1; char ch=getchar(); while(!isdigit(ch)) { if(ch=='-') { f=-1; } ch=getchar(); } while(isdigit(ch)) { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); } return xf; } str strn; int len,flag,maxn,minn=2e6+5; int arr[1000010]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; int cnt[1000010]; signed main() { getline(cin,strn); len=strn.size(); for(int i=0;i<=len-1;i++) { cnt[strn[i]-'a']; maxn=max(maxn,cnt[strn[i]-'a']); } for(int i=0;i<=len-1;i) { if(cnt[i]!=0) { if(cnt[i]<minn) { minn=cnt[i]; } } } maxn-=minn; if(maxn0 or maxn1) { cout<<"No Answer\n0"; return 0; } for(int i=2;ii<=maxn;i++) { if(maxn%i==0) { cout<<"No Answer\n0"; return 0; } } cout<<"Lucky Word\n"; cout<<maxn; return 0; }

很经典的一道题，这道题主要就是如何判断素数，这里可以用暴力法 素数会判断了，下面就好办了，直接亮出AC代码，不懂可看注释或评论 点个赞再走吧

#include<bits/stdc++.h> using namespace std; #define int long long #define str string #define output cout inline int input() { int x=0,f=1; char ch=getchar(); while(!isdigit(ch)) { if(ch=='-') { f=-1; } ch=getchar(); } while(isdigit(ch)) { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); } return xf; } str strn; int len,flag,maxn,minn=2e6+5; int arr[1000010]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; int cnt[1000010]; signed main() { getline(cin,strn); len=strn.size(); for(int i=0;i<=len-1;i++) { cnt[strn[i]-'a']; maxn=max(maxn,cnt[strn[i]-'a']); } for(int i=0;i<=len-1;i) { if(cnt[i]!=0) { if(cnt[i]<minn) { minn=cnt[i]; } } } maxn-=minn; if(maxn0 or maxn1) { cout<<"No Answer\n0"; return 0; } for(int i=2;ii<=maxn;i++) { if(maxn%i==0) { cout<<"No Answer\n0"; return 0; } } cout<<"Lucky Word\n"; cout<<maxn; return 0; }

暗区突围万岁

边输入边处理字符串，用stl的map<char,int>可以统计每个字符出现的次数，然后实时更新maxn；注意：，minn要在字符串输入完之后在遍历更新，不然会是1；处理完后剩下的素数判断就简单了

#include<bits/stdc++.h> using namespace std; #define int long long #define str string #define output cout inline int input() { int x=0,f=1; char ch=getchar(); while(!isdigit(ch)) { if(ch=='-') { f=-1; } ch=getchar(); } while(isdigit(ch)) { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); } return xf; } str strn; int len,flag,maxn,minn=2e6+5; int arr[1000010]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; int cnt[1000010]; signed main() { getline(cin,strn); len=strn.size(); for(int i=0;i<=len-1;i++) { cnt[strn[i]-'a']; maxn=max(maxn,cnt[strn[i]-'a']); } for(int i=0;i<=len-1;i) { if(cnt[i]!=0) { if(cnt[i]<minn) { minn=cnt[i]; } } } maxn-=minn; if(maxn0 or maxn1) { cout<<"No Answer\n0"; return 0; } for(int i=2;ii<=maxn;i++) { if(maxn%i==0) { cout<<"No Answer\n0"; return 0; } } cout<<"Lucky Word\n"; cout<<maxn; return 0; }

@营业执照思密达 你自己看看

#include<bits/stdc++.h> using namespace std; int a[26]; int main(){ char tmp; int k=0,i; while(tmp=getchar(),tmp!='\n'){ a[tmp-'a']; } sort(a,a+26); for(i=0;i<26;i){ if(a[i]!=0) break; } int t=a[25]-a[i]; i=-1; for(i=2;i<t;i++){ if(t%i0) break; } if(it) cout<<"Lucky Word\n"<<t; else cout<<"No Answer\n"<<0; return 0; }

以上代码可以加快cin和cout的速度（不用也能AC）。 AC代码↓

#include<bits/stdc++.h> using namespace std; #define int long long #define str string #define output cout inline int input(){ int x=0,f=1; char ch=getchar(); while(!isdigit(ch)){ if(ch=='-'){ f=-1; } ch=getchar(); } while(isdigit(ch)){ x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); } return xf; } str strn; int len,flag,maxn,minn=2e6+5; int arr[1000010]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; int cnt[1000010]; signed main(){ getline(cin,strn); len=strn.size(); for(int i=0;i<=len-1;i++){ cnt[strn[i]-'a']; maxn=max(maxn,cnt[strn[i]-'a']); } for(int i=0;i<=len-1;i){ if(cnt[i]!=0){ if(cnt[i]<minn){ minn=cnt[i]; } } } maxn-=minn; if(maxn0 or maxn1){ cout<<"No Answer\n0"; return 0; } for(int i=2;ii<=maxn;i++){ if(maxn%i==0){ cout<<"No Answer\n0"; return 0; } } cout<<"Lucky Word\n"; cout<<maxn; return 0; }

#include<bits/stdc++.h> using namespace std; #define int long long #define str string #define output cout inline int input() { int x=0,f=1; char ch=getchar(); while(!isdigit(ch)) { if(ch=='-') { f=-1; } ch=getchar(); } while(isdigit(ch)) { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); } return xf; } str strn; int len,flag,maxn,minn=2e6+5; int arr[1000010]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; int cnt[1000010]; signed main() { getline(cin,strn); len=strn.size(); for(int i=0;i<=len-1;i++) { cnt[strn[i]-'a']; maxn=max(maxn,cnt[strn[i]-'a']); } for(int i=0;i<=len-1;i) { if(cnt[i]!=0) { if(cnt[i]<minn) { minn=cnt[i]; } } } maxn-=minn; if(maxn0 or maxn1) { cout<<"No Answer\n0"; return 0; } for(int i=2;ii<=maxn;i++) { if(maxn%i==0) { cout<<"No Answer\n0"; return 0; } } cout<<"Lucky Word\n"; cout<<maxn; return 0; }

桶排序是个好东西

#include<bits/stdc++.h> using namespace std; int t[30]; int sushu(int n){ if(n <= 1) return false; for(int i = 2;i < n;i++){ if(n % i == 0) return false; } return true; } int main(){ string a; cin >> a; for(int i = 0;i < a.size();i++){ t[a[i]-96]; } int minn = 105 , maxn = 0; for(int i = 1;i <= 26;i){ if(minn > t[i] && t[i] != 0) minn = t[i]; if(maxn < t[i]) maxn = t[i]; } if(sushu(maxn - minn)) cout << "Lucky Word" << endl << maxn - minn; else cout << "No Answer" << endl << 0; return 0; }

#include <bits/stdc++.h> using namespace std; int cnt[27]; int main() { std::string str; cin >> str; for (int i = 0; i < str.length(); i) { cnt[str[i] - 'a']; } int max, min; max = -0x3f3f3f3f; min = 0x3f3f3f3f; for (int i = 0; i < 26; ++i) { if (cnt[i] > max) { max = cnt[i]; } if (cnt[i] < min && cnt[i] >= 1) { min = cnt[i]; } } int av = max - min; if (av < 2) { cout << "No Answer" << endl << '0' << endl; exit(0); } if (av == 2) { cout << "Lucky Word" << endl << av << endl; exit(0); } for (int i = 3; i <= sqrt(av); ++i) { if (av % i == 0) { cout << "No Answer" << endl << '0' << endl; exit(0); } } }