P1125 [NOIP2008 提高组] 笨小猴
查看原帖
P1125 [NOIP2008 提高组] 笨小猴
1034056
XieXiangLa楼主2023/7/16 09:18

四十分求助!!!!!!!!!谢谢!!

#include<bits/stdc++.h>
using namespace std;
map<char, int> mp;
int prime(int n) {
	if(n <= 1)	return 0;
	for(int i = 2; i <= sqrt(n); ++i)
		if(!(n % i))	return 0;
	return 1;
}
int main() {
	string s;
	cin>>s;
	int maxn=0, minn=101;
	for(int i=0; i<s.size(); i++) {
		mp[s[i]]++;
		maxn=max(maxn, mp[s[i]]);
		minn=min(minn, mp[s[i]]);
	}
	int d=maxn-minn;
	if(prime(d)) {
		cout<<"Lucky Word"<<endl;
	} else {
		cout<<"No Answer"<<endl;
	}
	cout<<d<<endl;
	return 0;
}
2023/7/16 09:18
加载中...