50
15
Create the shortest possible obfuscated FizzBuzz implementation.
To be considered obfuscated, it should satisfy at least one of the following:
- Does not contain any of the words "Fizz", "Buzz", or "FizzBuzz"
- Does not contain the numbers 3, 5, or 15.
- Use any of the above in a misleading way.
Remember: The goal is to be short and hard to follow.
The code sample which inspired this question follows:
public class Default
{
enum FizzBuzz
{
Buzz = 1,
Fizz,
FizzBuzz
}
public static void Main(string[] args)
{
byte[] foo =
Convert.FromBase64String("IAmGMEiCIQySYAiDJBjCIAmGMEiCIQySYA==");
MemoryStream ms = new MemoryStream(foo);
byte[] myByte = new byte[1];
do
{
FizzBuzz fb;
ms.Read(myByte, 0, 1);
for (int i = 0; i < 4; i++)
{
fb = (FizzBuzz)(myByte[0] >> (2 * i)
& (int)FizzBuzz.FizzBuzz);
Console.Out.WriteLine( (((int)fb > 0) ? "" + fb : ""
+ ((ms.Position - 1) * 4 + i + 1)));
}
} while (ms.Position < ms.Length);
}
}
mootinator
Posted 2011-01-28T01:55:09.600
Reputation: 1 171
How do you know the bound ? In your solution you have ms.Length but in some solutions there is no such bound... – Labo – 2015-11-10T09:20:29.683
I'm voting to close this question as off-topic because it does not have an objective validity criterion, making it impossible to indisputably decide whether a submission follows the rules. – Dennis – 2016-09-20T21:49:25.003