Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Notifications
Mark all as read
Sandbox

99 FizzBuzzes of Beer On Golf [cancelled]

+1
−1

Background

Randomly encountered this challenge on CGCC. Looks like a nice challenge, and since the 2 originating challenges are already here, why not add this to the fun?

Challenge

Recreate the "99 Bottles of Beer" song, however, "beer" is twisted by the FizzBuzz sequence, where if the value is divisible by 3, output "fizz", and if 5, then "buzz", and if both, output "fizzbuzz". Otherwise, print "beer":

99 bottles of fizz on the wall, 99 bottles of fizz.
Take one down and pass it around, 98 bottles of beer on the wall.

98 bottles of beer on the wall, 98 bottles of beer.
Take one down and pass it around, 97 bottles of beer on the wall.

97 bottles of beer on the wall, 97 bottles of beer.
Take one down and pass it around, 96 bottles of fizz on the wall.

96 bottles of fizz on the wall, 96 bottles of fizz.
Take one down and pass it around, 95 bottles of beer on the wall.

95 bottles of buzz on the wall, 95 bottles of buzz.
Take one down and pass it around, 94 bottles of buzz on the wall.

....

3 bottles of fizz on the wall, 3 bottles of fizz.
Take one down and pass it around, 2 bottles of beer on the wall.

2 bottles of beer on the wall, 2 bottles of beer.
Take one down and pass it around, 1 bottle of beer on the wall.

1 bottle of beer on the wall, 1 bottle of beer.
Go to the store and buy some more, 99 bottles of beer on the wall.

Rules

  • 0-byte answers aren't allowed. Although 1-byte answers are allowed while still abiding to not using loopholes, they won't be very interesting (unless you DO make it interesting).
  • Use any form of output in the program. Yes, the whole thing must be outputted up until you reach $n=1$.
  • Built-in functions and/or code for this specific challenge is pretty much allowed, only if you explain (even a little) how the code works (or not if you can't at all).
  • Since this is a code-golf challenge, the shortest program wins!
Why does this post require moderator attention?
You might want to add some details to your flag.

1 comment thread

Explain downvotes here! (1 comment)

This community is part of the Codidact network. We have other communities too — take a look!

You can also join us in chat!

Want to advertise this community? Use our templates!

Like what we're doing? Support us! Donate