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
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Users Search
Help Dashboard Sign In Sign Up
Challenges Q&A Sandbox Meta
Challenges
Posts Tags Edits
Post Challenge

1, 2, Fizz, 4, Buzz!

+9
−0

The task

Output the first 100 elements of the infamous FizzBuzz sequence.

How?

The FizzBuzz sequence is the sequence of decimal integers from 1 to 100 inclusive, but:

  • If the integer is divisible both by 3 and 5, output the string FizzBuzz
  • Else, if the integer is divisible by 3, output the string Fizz instead
  • Else, if the integer is divisible by 5, output the string Buzz instead
  • Else, output the integer itself

Output

The output will be a list of these elements separated by either a space (U+0020) or a newline (U+000A).

Here is a sample output with newline separation:

1
2
Fizz
4
Buzz
Fizz
7
8
Fizz
Buzz
11
Fizz
13
14
FizzBuzz
16
17
Fizz
19
Buzz
Fizz
22
23
Fizz
Buzz
26
Fizz
28
29
FizzBuzz
31
32
Fizz
34
Buzz
Fizz
37
38
Fizz
Buzz
41
Fizz
43
44
FizzBuzz
46
47
Fizz
49
Buzz
Fizz
52
53
Fizz
Buzz
56
Fizz
58
59
FizzBuzz
61
62
Fizz
64
Buzz
Fizz
67
68
Fizz
Buzz
71
Fizz
73
74
FizzBuzz
76
77
Fizz
79
Buzz
Fizz
82
83
Fizz
Buzz
86
Fizz
88
89
FizzBuzz
91
92
Fizz
94
Buzz
Fizz
97
98
Fizz
Buzz

Rules

  • Your code may not print anything to STDERR. Warnings are fine.
  • This is code-golf, so lowest byte-count in each language is the winner.
code-golf kolmogorov-complexity
posted about 4 years ago
4y ago
user card
Dion‭
171 reputation 2 2 17 3
History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.
Why should this post be closed?

1 comment thread

General comments (7 comments)

21 answers

Score Active Age
+0
−0

AWK, 62 61 60 56 bytes

{for(;i++<$1;)print i%3?i%5?i:y="Buzz":i%5?x="Fizz":x y}

{for(;i++<$0;)print i%15?i%5?i%3?i:"Fizz":"Buzz":"FizzBuzz"}

{for(;i++<$0;x=""){i%3||x="Fizz";i%5||x=x"Buzz";print x?x:i}}

{for(;i++<$0;){i%3?x="":x="Fizz";i%5?J:x=x"Buzz";print x?x:i}}

Try it online!

This code relies on passing the value 100 (or any number desired) to process. We take advantage of string concatenation and ternary operators.

A self-contained version:

BEGIN{for(;i++<100;x=""){i%3||x="Fizz";i%5||x=x"Buzz";print x?x:i}}
posted 6 months ago
6mo ago
user card
xrs‭
41 reputation 0 9 4 17
History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.

0 comment threads

Sign up to answer this question »