## WC '18 Contest 1 S2 - Essay Generator

View as PDF

Points: 7 (partial)
Time limit: 1.0s
Memory limit: 16M

Author:
Problem type
##### Woburn Challenge 2018-19 Round 1 - Senior Division

Alice has a -word essay due tomorrow , but she's too busy programming to bother with that! However, Alice happens to know that H.S. High School's English teacher is sick of reading and grading long essays, so she figures that if she just submits a "reasonable" essay which fulfills the requirements but is as short as possible, she may get some pity marks!

As such, Alice wants to write a program to generate a sequence of words to pass off as her essay, where each word is any string consisting of or more lowercase letters (az) (not necessarily a real English word). The essay will have no punctuation or formatting, as those seem unnecessary to Alice. In an attempt to disguise the essay's generated nature, Alice will insist that all words are distinct. Finally, for her plan to come together, she'll make the sum of the words' lengths as small as possible.

Help Alice generate any essay which meets the above requirements.

In test cases worth 5/20 of the points, .
In test cases worth another 5/20 of the points, .

#### Input Specification

The first and only line of input consists of a single integer, .

#### Output Specification

Output a single line containing Alice's essay: a sequence of distinct space-separated words, with the sum of their lengths minimized.

#### Sample Input

2

#### Sample Output

i a

#### Sample Explanation

The sum of the lengths of the two words i a is , which is the minimum possible total length of a two-word essay. Various other essays (such as x y) would also be accepted. However, the essay i i would not be accepted due to its words not being distinct, and the essay i am would not be accepted due to the total length of its words not being as small as possible.

If two words have the same letters, but a different order, do they count as separate words? For example, ba and ab?