Post History
Disclaimer This challenge also exists in CGCC, but if you want to compete here (too), then hop in! Challenge Recreate "99 Bottles of Beer on the Wall", using the least bytes possible. Lyrics: ...
#4: Post edited
by
General Sebast1an
·
2021-08-06T06:05:49Z (over 3 years ago)
> It looks like the challenge is good to go! This quote will be deleted after a while. Just a little notice.- # Disclaimer
- This challenge also exists in [CGCC](https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer), but if you want to compete here (too), then hop in!
- # Challenge
- Recreate "99 Bottles of Beer on the Wall", using the least bytes possible.
- Lyrics:
- ```lang-none
- 99 bottles of beer on the wall, 99 bottles of beer.
- 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 beer on the wall.
- 96 bottles of beer on the wall, 96 bottles of beer.
- Take one down and pass it around, 95 bottles of beer on the wall.
- 95 bottles of beer on the wall, 95 bottles of beer.
- Take one down and pass it around, 94 bottles of beer on the wall.
- ....
- 3 bottles of beer on the wall, 3 bottles of beer.
- 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](https://codegolf.codidact.com/posts/282788), 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).
- - Shortest program of each language used is the winner.
- # Disclaimer
- This challenge also exists in [CGCC](https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer), but if you want to compete here (too), then hop in!
- # Challenge
- Recreate "99 Bottles of Beer on the Wall", using the least bytes possible.
- Lyrics:
- ```lang-none
- 99 bottles of beer on the wall, 99 bottles of beer.
- 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 beer on the wall.
- 96 bottles of beer on the wall, 96 bottles of beer.
- Take one down and pass it around, 95 bottles of beer on the wall.
- 95 bottles of beer on the wall, 95 bottles of beer.
- Take one down and pass it around, 94 bottles of beer on the wall.
- ....
- 3 bottles of beer on the wall, 3 bottles of beer.
- 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](https://codegolf.codidact.com/posts/282788), 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).
- - Shortest program of each language used is the winner.
#3: Post edited
by
General Sebast1an
·
2021-08-06T00:43:37Z (over 3 years ago)
> This is a test release of the challenge onto the main category. If this doesn't feel like enough, we could always talk in the [sandbox](https://codegolf.codidact.com/posts/282881).- # Disclaimer
- This challenge also exists in [CGCC](https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer), but if you want to compete here (too), then hop in!
- # Challenge
- Recreate "99 Bottles of Beer on the Wall", using the least bytes possible.
- Lyrics:
- ```lang-none
- 99 bottles of beer on the wall, 99 bottles of beer.
- 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 beer on the wall.
- 96 bottles of beer on the wall, 96 bottles of beer.
- Take one down and pass it around, 95 bottles of beer on the wall.
- 95 bottles of beer on the wall, 95 bottles of beer.
- Take one down and pass it around, 94 bottles of beer on the wall.
- ....
- 3 bottles of beer on the wall, 3 bottles of beer.
- 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](https://codegolf.codidact.com/posts/282788), 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).
- - Shortest program of each language used is the winner.
- > It looks like the challenge is good to go! This quote will be deleted after a while. Just a little notice.
- # Disclaimer
- This challenge also exists in [CGCC](https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer), but if you want to compete here (too), then hop in!
- # Challenge
- Recreate "99 Bottles of Beer on the Wall", using the least bytes possible.
- Lyrics:
- ```lang-none
- 99 bottles of beer on the wall, 99 bottles of beer.
- 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 beer on the wall.
- 96 bottles of beer on the wall, 96 bottles of beer.
- Take one down and pass it around, 95 bottles of beer on the wall.
- 95 bottles of beer on the wall, 95 bottles of beer.
- Take one down and pass it around, 94 bottles of beer on the wall.
- ....
- 3 bottles of beer on the wall, 3 bottles of beer.
- 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](https://codegolf.codidact.com/posts/282788), 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).
- - Shortest program of each language used is the winner.
#2: Post edited
by
General Sebast1an
·
2021-08-05T21:32:26Z (over 3 years ago)
- # Disclaimer
- This challenge also exists in [CGCC](https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer), but if you want to compete here (too), then hop in!
- # Challenge
- Recreate "99 Bottles of Beer on the Wall", using the least bytes possible.
- Lyrics:
- ```lang-none
- 99 bottles of beer on the wall, 99 bottles of beer.
- 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 beer on the wall.
- 96 bottles of beer on the wall, 96 bottles of beer.
- Take one down and pass it around, 95 bottles of beer on the wall.
- 95 bottles of beer on the wall, 95 bottles of beer.
- Take one down and pass it around, 94 bottles of beer on the wall.
- ....
- 3 bottles of beer on the wall, 3 bottles of beer.
- 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](https://codegolf.codidact.com/posts/282788), 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).
- - Shortest program of each language used is the winner.
- > This is a test release of the challenge onto the main category. If this doesn't feel like enough, we could always talk in the [sandbox](https://codegolf.codidact.com/posts/282881).
- # Disclaimer
- This challenge also exists in [CGCC](https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer), but if you want to compete here (too), then hop in!
- # Challenge
- Recreate "99 Bottles of Beer on the Wall", using the least bytes possible.
- Lyrics:
- ```lang-none
- 99 bottles of beer on the wall, 99 bottles of beer.
- 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 beer on the wall.
- 96 bottles of beer on the wall, 96 bottles of beer.
- Take one down and pass it around, 95 bottles of beer on the wall.
- 95 bottles of beer on the wall, 95 bottles of beer.
- Take one down and pass it around, 94 bottles of beer on the wall.
- ....
- 3 bottles of beer on the wall, 3 bottles of beer.
- 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](https://codegolf.codidact.com/posts/282788), 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).
- - Shortest program of each language used is the winner.
#1: Initial revision
by
General Sebast1an
·
2021-08-05T21:26:38Z (over 3 years ago)
99 Shortened Bottles of Beer
# Disclaimer This challenge also exists in [CGCC](https://codegolf.stackexchange.com/questions/64198/99-bottles-of-beer), but if you want to compete here (too), then hop in! # Challenge Recreate "99 Bottles of Beer on the Wall", using the least bytes possible. Lyrics: ```lang-none 99 bottles of beer on the wall, 99 bottles of beer. 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 beer on the wall. 96 bottles of beer on the wall, 96 bottles of beer. Take one down and pass it around, 95 bottles of beer on the wall. 95 bottles of beer on the wall, 95 bottles of beer. Take one down and pass it around, 94 bottles of beer on the wall. .... 3 bottles of beer on the wall, 3 bottles of beer. 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](https://codegolf.codidact.com/posts/282788), 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). - Shortest program of each language used is the winner.