求助,始终为No Answer
查看原帖
求助,始终为No Answer
560814
anaoai楼主2021/9/19 21:16

RT,不知道问题出在哪,代码有点乱

#include <bits/stdc++.h>
using namespace std;
int main(){
	string a;
	int base[25];
	memset(base,0,sizeof(base));
	getline(cin,a);
	int num=a.length();
	for(int i=0;i<num;i++){
		if(a[i]=='a'){
			base[0]++;
		}if(a[i]=='b'){
			base[1]++;
		}if(a[i]=='c'){
			base[2]++;
		}if(a[i]=='d'){
			base[3]++;
		}if(a[i]=='e'){
			base[4]++;
		}if(a[i]=='f'){
			base[5]++;
		}if(a[i]=='g'){
			base[6]++;
		}if(a[i]=='h'){
			base[7]++;
		}if(a[i]=='i'){
			base[8]++;
		}if(a[i]=='j'){
			base[9]++;
		}if(a[i]=='k'){
			base[10]++;
		}if(a[i]=='l'){
			base[11]++;
		}if(a[i]=='m'){
			base[12]++;
		}if(a[i]=='n'){
			base[13]++;
		}if(a[i]=='o'){
			base[14]++;
		}if(a[i]=='p'){
			base[15]++;
		}if(a[i]=='q'){
			base[16]++;
		}if(a[i]=='r'){
			base[17]++;
		}if(a[i]=='s'){
			base[18]++;
		}if(a[i]=='t'){
			base[19]++;
		}if(a[i]=='u'){
			base[20]++;
		}if(a[i]=='v'){
			base[21]++;
		}if(a[i]=='w'){
			base[22]++;
		}if(a[i]=='x'){
			base[23]++;
		}if(a[i]=='y'){
			base[24]++;
		}if(a[i]=='z'){
			base[25]++;
		}
	}
	sort(base,base+25);
	int maxn=base[24];
	for(int i=0;i<25;i++){
		if(base[i]==0){
			base[i]=9999999;
		}
	}
	sort(base,base+25);
	int minx=base[0];
	int quare=maxn-minx;
	bool omo=true;
	for(int j=2;j<sqrt(quare);j++){
		if(quare<2){
			omo=false;
			break;
		}
		if(quare%j==0){
			omo=false;
			break;
		}
	}if(omo==true){
		cout<<"Lucky Word"<<endl<<quare;
	}else{
		cout<<"No Answer"<<endl<<quare;
	}
	return 0;
}
2021/9/19 21:16
加载中...