求调,必关,全WA,在编译器中测试是正确的
查看原帖
求调,必关,全WA,在编译器中测试是正确的
1419017
z1443888087楼主2024/9/18 20:12
#include<iostream>
using namespace std;
int main(){
    int arr[26]={0},maxi=0,mini=101,i=0;
    int prime[25]={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 ch[100];
    while(cin>>ch[i]){
        arr[122-ch[i]]++;
        if(arr[122-ch[i]]>maxi)maxi=arr[122-ch[i]];
        if(arr[122-ch[i]]<mini&&arr[122-ch[i]]>0)mini=arr[122-ch[i]];
       // cout<<"maxi:"<<maxi<<endl<<"mini:" <<mini;
    }
    for(int j=0;j<25;j++){
        if(maxi-mini==prime[j]){
            cout<<"Lucky Word"<<endl<<maxi-mini;
        }
        else{
            cout<<"No Answer"<<endl<<"0";
        }
    }
}
2024/9/18 20:12
加载中...