5 条题解
-
2
#include<bits/stdc++.h> using namespace std;
int main() { string s; cin>>s; int len=s.length(); int a[26]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; for(int i=0;i<=len-1;i++) { if(s[i]'a') a[0]++; if(s[i]'b') a[1]++; if(s[i]'c') a[2]++;; if(s[i]'d') a[3]++; if(s[i]'e') a[4]++; if(s[i]'f') a[5]++; if(s[i]'g') a[6]++; if(s[i]'h') a[7]++; if(s[i]'i') a[8]++; if(s[i]'j') a[9]++; if(s[i]'k') a[10]++; if(s[i]'l') a[11]++; if(s[i]'m') a[12]++; if(s[i]'n') a[13]++; if(s[i]'o') a[14]++; if(s[i]'p') a[15]++; if(s[i]'q') a[16]++; if(s[i]'r') a[17]++; if(s[i]'s') a[18]++; if(s[i]'t') a[19]++; if(s[i]'u') a[20]++; if(s[i]'v') a[21]++; if(s[i]'w') a[22]++; if(s[i]'x') a[23]++; if(s[i]'y') a[24]++; if(s[i]'z') a[25]++; } int maxn=0,minn=9999; for(int i=0;i<=25;i++) { if(a[i]0) { continue; } if(a[i]!=0) { maxn=max(maxn,a[i]); minn=min(minn,a[i]); } } int k=maxn-minn; int ans=0; if(k0||k1) { cout<<"No Answer"<<endl; cout<<0; return 0; } for(int i=2;i<k;i++) { if(k%i0) { ans++; } } if(ans==0) { cout<<"Lucky Word"<<endl; cout<<k; } else { cout<<"No Answer"<<endl; cout<<0; }
return 0;
}其实也不多
信息
- ID
- 265
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 7
- 标签
- 递交数
- 1585
- 已通过
- 405
- 上传者