TLE '16 Contest 8 P2 - Dank Meme

View as PDF

Submit solution


Points: 3 (partial)
Time limit: 2.0s
Memory limit: 256M

Author:
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
Fax and Flaco enjoying Dank Meme.

Fax McClad, Croneria's smartest bounty hunter, is playing a game of Dank Meme with his wingmate Flaco so that he can keep his thinking skills sharp.

In Dank Meme, players take turns reciting integers in their binary representations without leading zeros, but they replace every instance of 1 with dank and every instance of 0 with meme.

It's Fax's turn to recite a number, and it happens to be N. Fax can't seem to figure out how to recite this number. Can you tell him?

Input Specification

The first line of input will contain T (1 \le T \le 1\,000), the number of times Fax will recite a number.

T lines of input will follow. Each line will contain N (0 \le N \le 10^9).

Output Specification

For each of the T inputs, output a single line of space-separated strings specifying what Fax should recite.

Sample Input

2
3
5

Sample Output

dank dank
dank meme dank

Explanation for Sample Output

The binary representation of 3 is 11.

The binary representation of 5 is 101.


Comments

There are no comments at the moment.