题解 | #[NOIP2008]笨小猴#
[NOIP2008]笨小猴
https://www.nowcoder.com/practice/17865bc2a75c4944a872ef709958c56e
#include <stdio.h> #include <math.h> #include <ctype.h> int main() { int alp[128]={0}; char c; while((c = getchar()) != '\n') { alp[(int)c]+=1; } int max=0; int min=100; for(int i=0;i<128;i++) { if(alp[i]>max) max=alp[i]; if(alp[i] > 0 && alp[i] <= min) min=alp[i]; } int res=max-min,is_prime = 1; if(res<=1) { printf("No Answer\n%d",0); return 0; } else { for(int i=2;i<=sqrt(res);i++) { if(res % i == 0) { is_prime = 0; break; } } } if (is_prime) printf("Lucky Word\n%d",res); else printf("No Answer\n%d",0); return 0; }#小字典#