Binary Strawberry
Time limit0.5sMemory limit512 MB
Given a turn number N, output the 4-beat binary strawberry chant, where each beat is V or strawberry according to the bouncing count from 1 to 15.
- Level
Easy3 of 10
- Topics
- Math, Implementation, Simulation, Bit manipulation
- Solved
- No attempts yet
Problem
I love strawberries! I love strawberries!
Hae-gang, who attended the freshman welcome party at Angjung University, has to survive a drinking game. Suddenly Binary Strawberry begins, and Hae-gang, who does not know the rules of Binary Strawberry, is in trouble! Tell Hae-gang what to say and save him!
The rules of Binary Strawberry are as follows. It uses 4 beats (1 bit per beat), writes the numbers 1 to 15 in binary, leaves the beat empty at 0, and shouts strawberry only at 1. An empty (silent) beat is written as "V". For 1 through 5, you shout as follows.
- VVVstrawberry
- VVstrawberryV
- VVstrawberrystrawberry
- VstrawberryVV
- VstrawberryVstrawberry
After 15 it goes back down to 14, 13, and when it reaches 1 it goes back up to 2, 3, and repeats this.
Input
The first line gives the number of test cases T (1 ≤ T ≤ 1,000).
Over the next T lines, N (1 ≤ N ≤ 1,000,000,000), the number of turns after the person who started Binary Strawberry at which Hae-gang must speak, is given as an integer.
Output
Print what Hae-gang must say. A resting beat is written as V.