Problem G
Name Generation 2
Saabina is the founder and CEO of car manufacturer Golvo. Golvo has many different car models to offer. Saabina wants to give each of them a human-readable name, to make it easy to remember. But doing this by hand is a very time consuming job.
To make the names readable, they must satisfy the following:
-
Each name has length $4$, and only consists of lowercase English letters.
-
Each name consists of two vowels and two consonants. Here we consider a, e, i, o, u vowels, while the remaining $21$ letters are consonants.
-
No two names are too similar. Two names are said to be too similar if they differ in only one position. For example, “nail” and “mail” are too similar, whereas “seal” and “sale” are not.
Your task is to generate as many names as possible. Your program will get a score depending on how many different names you manage to generate.
Input
There is no input in this problem.
Output
First, print one line with the integer $N$. Then print the names on the following $N$ lines.
Scoring
There is only one testcase in this problem, and you will get a score depending on the value of $N$ in your output. The score is calculated as follows:
\[ \text{score}= \begin{cases} 100, & N \geq 3150,\\[6pt] 40\Big(\frac{N-2000}{1149}\Big)^{3}+30, & 2000 \le N < 3150,\\[10pt] \dfrac {3}{200}\, N, & N < 2000. \end{cases} \]In other words, if $N \geq 3150$ you will get $100$ points. If $N$ is between $2000$ and $3149$, you will get between $30$ and $70$ points. Otherwise, you will get between $0$ and $30$ points.
| Sample Input 1 | Sample Output 1 |
|---|---|
6 yoyo yooh lima dili baku juba |
