/prog/ Challenge #9002

The task:

Print strings from "a" to "zzzzz" without using any loop or conditional statements. Don't just write all 1000 permutations out by hand. The output should look like this:
a
b
c
...
aa
ab
ac
...
zzzzx
zzzzy
zzzzz

inb4 lipthfags and dead dogs using some obscure functionality of their obscure languages.

>>61
Yeah with lookup tables or array initialization, or something that is a conditional but doesn't smell like it.

A purely recursive solution requires a decision in it to terminate so have fun with that.. well except the challenge never asked for termination.