60分[C++]
查看原帖
60分[C++]
594405
Unaccepted_Error楼主2022/12/1 15:35
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 100 + 5;
const int MAXM = 50;
const int pri[26]={0,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};
char a[MAXN];
int num[MAXM];

int listt(char eng){
	if(eng == 'a')
		return 1;
	else if(eng == 'b')
		return 2;
	else if(eng == 'c')
		return 3;
	else if(eng == 'd')
		return 4;
	else if(eng == 'e')
		return 5;
	else if(eng == 'f')
		return 6;
	else if(eng == 'g')
		return 7;
	else if(eng == 'h')
		return 8;
	else if(eng == 'i')
		return 9;
	else if(eng == 'j')
		return 10;
	else if(eng == 'k')
		return 11;
	else if(eng == 'l')
		return 12;
	else if(eng == 'm')
		return 13;
	else if(eng == 'n')
		return 14;
	else if(eng == 'o')
		return 15;
	else if(eng == 'p')
		return 16;
	else if(eng == 'q')
		return 17;
	else if(eng == 'r')
		return 18;
	else if(eng == 's')
		return 19;
	else if(eng == 't')
		return 20;
	else if(eng == 'u')
		return 21;
	else if(eng == 'v')
		return 22;
	else if(eng == 'w')
		return 23;
	else if(eng == 'x')
		return 24;
	else if(eng == 'y')
		return 25;
	else if(eng == 'z')
		return 26;
} 

int main(){
	scanf("%s",a);
	int Lo = strlen(a);
	for(int i = 0;i < Lo;i++)
		num[listt(a[i])]++;
	sort(num + 1,num + 1 + 26);
//	printf("%d %d %d",num[26] - num[1],num[26],num[1]);
	int count = 0;
	for(int i = 0;i < 26;i++){
		if(num[i] != 0)
			break;
		count++;
	}
	int ans = num[26] - num[count];
	for(int i = 0;i < 26;i++){
		if(ans == pri[i] && ans != 0){
//			printf("pri[%d]:%d ans:%d\n",i,pri[i],ans);
			printf("Lucky Word\n%d",ans);
			return 0;
		}
	}
	printf("No Answer\n%d",ans);
    return 0;
}
2022/12/1 15:35
加载中...