Post History

84%

+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 divisi...

21 answers · posted 4y ago by Dion‭ · last activity 7mo ago by xrs‭

Question code-golf kolmogorov-complexity

#4: Post edited by

Dion‭ · 2020-12-02T05:08:52Z (about 4 years ago)

Copy Link

Raw

Markdown

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
* This is code-golf, so lowest byte-count *in each language* is the winner.

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.

#3: Post edited by

Dion‭ · 2020-11-25T06:31:38Z (about 4 years ago)

Copy Link

Raw

Markdown

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
* This is code-golf, so lowest byte-count *in each language* is the winner.

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.

#2: Post edited by

Dion‭ · 2020-11-20T04:44:19Z (about 4 years ago)

Copy Link

Raw

Markdown

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+000A`) or a newline (`U+0020`).~~
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 must not produce any error on from start to finish~~
* This is code-golf, so lowest byte-count *in each language* is the winner.

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
* This is code-golf, so lowest byte-count *in each language* is the winner.

#1: Initial revision by

Dion‭ · 2020-11-19T08:21:11Z (about 4 years ago)

Copy Link

Raw

Markdown

1, 2, Fizz, 4, Buzz!

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+000A`) or a newline (`U+0020`).

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 must not produce any error on from start to finish
 * This is code-golf, so lowest byte-count *in each language* is the winner.

code-golf kolmogorov-complexity

Communities

Post History