结束语_KattisBeekeeper

篇首语：本文由编程笔记#小编为大家整理，主要介绍了Kattis-Beekeeper相关的知识，希望对你有一定的参考价值。

Beekeeper – Kattis, Kattis

It’s Bill the beekeeper again. In this problem, we learn that didn’t choose his career for the best reason. Bill chose to be a beekeeper because he really, really likes the look of the double e’s in the word “beekeeper”. Your task is to help identify other words Bill will really like.

Bill’s affinity for a word is determined by how many pairs of double vowels it has, where vowels are the letters a,e,i,o,u,y. Given a list of words, find the word that has the most pairs of double vowels, as it will be Bill’s favorite word.

Notes:

• It is guaranteed that there will be a unique correct answer. That is, one word in the list will have strictly more pairs of vowels than all other words in the list.

• No word in the input will have three or more of the same vowel consecutively, because that would just be too much for poor Bill.

Input

The input will contain multiple test cases, up to 10. The first line of each case contains N, the number of words in that case (0

Output

For each case, print Bill’s favorite word. Each output should be printed on its own line.

#include<iostream>
#include
#include
#include

结束语
好兄弟好兄弟&＃xff0c;留下你的关注和点赞&＃xff0c;666走一波&＃xff01;&＃xff01;&＃xff01;&＃xff01;&＃xff01;