80分求大佬分析
查看原帖
80分求大佬分析
570537
Lruler楼主2023/2/5 21:06
#include<bits/stdc++.h>
using namespace std;

string a;
	int b[1005];

int isPrime(int i) {
	if(i==0||i==1)return 0;
	int ret = 1;
	int k;
	for (k = 2; k < i - 1; k++) {
		if (i % k == 0) {
			ret = 0;
			break;
		}
	}
	return ret;
}

int main(){
	
	getline(cin,a);
	for(int i = 0; i < a.size(); i++){
		int te = a[i] - '0';
		b[te]++;
	}
	int max = 0;
	int min = 110;
	for(int i = 0; i < 1005; i++){
		if(max < b[i])max = b[i];
		if(min > b[i])min = b[i];
	}
	if(min == 0)min++;
	int ans = max - min;
	if(isPrime(ans)	){
		cout<<"Lucky Word"<<endl;
		cout<<ans;
	}else{
		cout<<"No Answer"<<endl;
		cout<<"0";
	}
	
	
	return 0;
}
2023/2/5 21:06
加载中...