B9: hiroshima

Problem

Print the pattern:

#O##
OO##
#OOO
####
OOOO
####
#OOO
OO##

59. B8: play_button & B9: hiroshima, Comet 64

Solution

Use a string to encode the pattern. Check whether the character at index i is x and print the boolean result. This solution is optimal, according to the game.

str = xoxxooxxxoooxxxxooooxxxxxoooooxx;  // Encoded pattern.
char = str[int];  // Character at index i.
check char = x;   // Is character = x?
output = bool;    // Print boolean result.
int++;            // Increment index.