|
Matcom Online Grader
Faculty of Mathematics and Computer Science of University of Havana
ℹ️ We've recently migrated MOG to a new server with a different grader. As a result, some features—especially those related to submission evaluation—might not work correctly. If you encounter any issues, please report them by clicking the exclamation icon in the bottom right corner of the website.
MOG Training #4Ended |
H - Hash Code Hacker
Languages: C, C++, Java, Haskell, Pascal, Python, JavaScript, Tiger, C#
Time & Memory limits: (details)
According to Java standard library documentation, the hash code of $\texttt{String}$ is computed as
$\\\verb| s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]|$
Here $\texttt{s[i]}$ is the $i$-th character of the string, $\verb|n|$ is the length of the string, and $\verb|^|$ indicates exponentiation. Computation uses signed 32-bit integers in two's complement form.
Heather is going to hack the servers of Not Entirely Evil Recording Company (NEERC). To perform an attack she needs $k$ distinct query strings that have equal hash codes. Unfortunately, NEERC servers accept query string containing lower- and uppercase English letters only.
Heather hired you to write a program that generates such query strings for her.
Input
The single line of the input file contains integer $k$ — the number of required query strings to generate ($2 \le k \le 1000$).
Output
Output $k$ lines. Each line should contain a single query string. Each query string should be non-empty and its length should not exceed 1000 characters. Query string should contain only lower- and uppercase English letters. All query strings should be distinct and should have equal hash codes.
Sample test(s)
Input
4
Output
edHs
mENAGeS
fEHs
edIT