General FizzBuzz

From Rosetta Code
Task
General FizzBuzz
You are encouraged to solve this task according to the task description, using any language you may know.
Task

Write a generalized version of FizzBuzz that works for any list of factors, along with their words.

This is basically a "fizzbuzz" implementation where the user supplies the parameters.

The user will enter the max number, then they will enter the factors to be calculated along with the corresponding word to be printed.

For simplicity's sake, assume the user will input an integer as the max number and 3 factors, each with a word associated with them.


For example, given:

>20      #This is the maximum number, supplied by the user
>3 Fizz  #The user now enters the starting factor (3) and the word they want associated with it (Fizz)
>5 Buzz  #The user now enters the next factor (5) and the word they want associated with it (Buzz)
>7 Baxx  #The user now enters the next factor (7) and the word they want associated with it (Baxx)

In other words: For this example, print the numbers 1 through 20, replacing every multiple of 3 with "Fizz", every multiple of 5 with "Buzz", and every multiple of 7 with "Baxx".

In the case where a number is a multiple of at least two factors, print each of the words associated with those factors in the order of least to greatest factor.

For instance, the number 15 is a multiple of both 3 and 5; print "FizzBuzz".

If the max number was 105 instead of 20, you would print "FizzBuzzBaxx" because it's a multiple of 3, 5, and 7.

Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz



AppleScript[edit]

Translation of: JavaScript
-- GENERAL FIZZBUZZ ----------------------------------------------------------
 
-- fizz :: [[Int, String]] -> Int -> String
on fizz(lstRules, intMax)
 
-- fizzLine :: String -> Int -> String
script fizzline
on |λ|(strSeries, n)
 
-- Multiple rule matches -> single or concatenated words
-- wordIfRuleMatch :: String -> (Int, String) -> String
script wordIfRuleMatch
on |λ|(str, rulePair)
set {factor, noiseWord} to rulePair
 
cond(n mod factor > 0, str, str & noiseWord)
end |λ|
end script
 
set strPhrase to foldl(wordIfRuleMatch, "", lstRules)
 
strSeries & cond(strPhrase ≠ "", strPhrase, n as string) & linefeed
end |λ|
end script
 
foldl(fizzline, "", enumFromTo(1, intMax))
end fizz
 
-- TEST ----------------------------------------------------------------------
on run
 
fizz([[3, "Fizz"], [5, "Buzz"], [7, "Baxx"]], 20)
 
end run
 
-- GENERIC FUNCTIONS ---------------------------------------------------------
 
-- cond :: Bool -> a -> a -> a
on cond(bool, x, y)
if bool then
x
else
y
end if
end cond
 
-- enumFromTo :: Int -> Int -> [Int]
on enumFromTo(m, n)
if m > n then
set d to -1
else
set d to 1
end if
set lst to {}
repeat with i from m to n by d
set end of lst to i
end repeat
return lst
end enumFromTo
 
-- foldl :: (a -> b -> a) -> a -> [b] -> a
on foldl(f, startValue, xs)
tell mReturn(f)
set v to startValue
set lng to length of xs
repeat with i from 1 to lng
set v to |λ|(v, item i of xs, i, xs)
end repeat
return v
end tell
end foldl
 
-- Lift 2nd class handler function into 1st class script wrapper
-- mReturn :: Handler -> Script
on mReturn(f)
if class of f is script then
f
else
script
property |λ| : f
end script
end if
end mReturn
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

AWK[edit]

This is a two-step solution:

  • First, we get the parameters, and
    • generate a file with the list of numbers (writing directly to that file)
    • generate a custom awk-program for that special case (redirecting standard-output)
  • the custom program is run, and does the actual work to output the desired result

Input:

105
3 Fizz
5 Buzz
7 Baxx
Usage
awk  -f fizzbuzzGenerate.awk  input.txt > fizzbuzzCustom.awk
awk -f fizzbuzzCustom.awk numbers.txt
Program
# usage:  awk -f fizzbuzzGen.awk > fizzbuzzCustom.awk
#
function Print(s) {
print s > "/dev/stderr"
}
 
BEGIN { Print( "# FizzBuzz-Generate:" )
q2 = "\""
fN = "numbers.txt"
#fP = "fizzbuzzCustom.awk"
}
 
NF==1 { Print( "# " $1 " Numbers:" )
for( i=1; i <= $1; i++ )
print( i ) > fN # (!!) write to file not allowed in sandbox at ideone.com
 
Print( "# Custom program:" )
print "BEGIN {print " q2 "# CustomFizzBuzz:" q2 "} \n"
next
}
 
NF==2 { Print( "# " $1 "-->" $2 ) ##
print "$1 % "$1" == 0 {x = x "q2 $2 q2 "}"
next
}
 
END { print ""
print "!x {print $1; next}"
print " {print " q2 " " q2 ", x; x=" q2 q2 "} \n"
 
print "END {print " q2 "# Done." q2 "}"
Print( "# Done." )
}

Example output see FizzBuzz/AWK#Custom_FizzBuzz

Batch File[edit]

@echo off
setlocal enabledelayedexpansion
::Range variable
set range=20

::The input data [will not be validated]

::This is the strictly the data format...
set "data=3:Fizz 5:Buzz 7:Baxx"

::Parsing the data into 1-based pseudo-arrays...

set "data_cnt=0"
for %%A in (!data!) do (
set /a "data_cnt+=1"
for /f "tokens=1-2 delims=:" %%D in ("%%A") do (
set "fact!data_cnt!=%%D"
set "prnt!data_cnt!=%%E"
)
)

::Do the count...

for /l %%C in (1,1,!range!) do (
set "out="
for /l %%. in (1,1,!data_cnt!) do (
set /a "mod=%%C %% fact%%."
if !mod! equ 0 (
set "out=!out!!prnt%%.!"
)
)
if not defined out (echo.%%C) else (echo.!out!)
)
pause
exit /b 0
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz
Press any key to continue . . .


BBC BASIC[edit]

This implementation (unlike some of the ones given on this page...) fully obeys the specification, in that it prompts the user for the parameters at run time. It also allows users to specify as many factors as they want, rather than limiting them to three. Something is missing from this program. Fizz, baxx and buzz aren't defined anywhere.

REM >genfizzb
INPUT "Maximum number: " max%
INPUT "Number of factors: " n%
DIM factors%(n% - 1)
DIM words$(n% - 1)
FOR i% = 0 TO n% - 1
INPUT "> " factor$
factors%(i%) = VAL(LEFT$(factor$, INSTR(factor$, " ") - 1))
words$(i%) = MID$(factor$, INSTR(factor$, " ") + 1)
NEXT
FOR i% = 1 TO max%
matched% = FALSE
FOR j% = 0 TO n% - 1
IF i% MOD factors%(j%) = 0 THEN
PRINT words$(j%);
matched% = TRUE
ENDIF
NEXT
IF matched% THEN PRINT ELSE PRINT;i%
NEXT

Output:

Maximum number: 20
Number of factors: 3
> 3 Fizz
> 5 Buzz
> 7 Baxx
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

C[edit]

 
#include <stdio.h>
#include <stdlib.h>
 
struct replace_info {
int n;
char *text;
};
 
int compare(const void *a, const void *b)
{
struct replace_info *x = (struct replace_info *) a;
struct replace_info *y = (struct replace_info *) b;
return x->n - y->n;
}
 
void generic_fizz_buzz(int max, struct replace_info *info, int info_length)
{
int i, it;
int found_word;
 
for (i = 1; i < max; ++i) {
found_word = 0;
 
/* Assume sorted order of values in the info array */
for (it = 0; it < info_length; ++it) {
if (0 == i % info[it].n) {
printf("%s", info[it].text);
found_word = 1;
}
}
 
if (0 == found_word)
printf("%d", i);
 
printf("\n");
}
}
 
int main(void)
{
struct replace_info info[3] = {
{5, "Buzz"},
{7, "Baxx"},
{3, "Fizz"}
};
 
/* Sort information array */
qsort(info, 3, sizeof(struct replace_info), compare);
 
/* Print output for generic FizzBuzz */
generic_fizz_buzz(20, info, 3);
return 0;
}
 
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

C++[edit]

 
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
 
class pair {
public:
pair( int s, std::string z ) { p = std::make_pair( s, z ); }
bool operator < ( const pair& o ) const { return i() < o.i(); }
int i() const { return p.first; }
std::string s() const { return p.second; }
private:
std::pair<int, std::string> p;
};
void gFizzBuzz( int c, std::vector<pair>& v ) {
bool output;
for( int x = 1; x <= c; x++ ) {
output = false;
for( std::vector<pair>::iterator i = v.begin(); i != v.end(); i++ ) {
if( !( x % ( *i ).i() ) ) {
std::cout << ( *i ).s();
output = true;
}
}
if( !output ) std::cout << x;
std::cout << "\n";
}
}
int main( int argc, char* argv[] ) {
std::vector<pair> v;
v.push_back( pair( 7, "Baxx" ) );
v.push_back( pair( 3, "Fizz" ) );
v.push_back( pair( 5, "Buzz" ) );
std::sort( v.begin(), v.end() );
gFizzBuzz( 20, v );
return 0;
}
 
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

C#[edit]

Not extremely clever and doesn't use anything too fancy.

 
using System;
 
public class GeneralFizzBuzz
{
public static void Main()
{
int i;
int j;
int k;
 
int limit;
 
string iString;
string jString;
string kString;
 
Console.WriteLine("First integer:");
i = Convert.ToInt32(Console.ReadLine());
Console.WriteLine("First string:");
iString = Console.ReadLine();
 
Console.WriteLine("Second integer:");
j = Convert.ToInt32(Console.ReadLine());
Console.WriteLine("Second string:");
jString = Console.ReadLine();
 
Console.WriteLine("Third integer:");
k = Convert.ToInt32(Console.ReadLine());
Console.WriteLine("Third string:");
kString = Console.ReadLine();
 
Console.WriteLine("Limit (inclusive):");
limit = Convert.ToInt32(Console.ReadLine());
 
for(int n = 1; n<= limit; n++)
{
bool flag = true;
if(n%i == 0)
{
Console.Write(iString);
flag = false;
}
 
if(n%j == 0)
{
Console.Write(jString);
flag = false;
}
 
if(n%k == 0)
{
Console.Write(kString);
flag = false;
}
if(flag)
Console.Write(n);
Console.WriteLine();
}
}
}
 

Ceylon[edit]

shared void run() {
 
print("enter the max value");
assert(exists maxLine = process.readLine(),
exists max = parseInteger(maxLine));
 
print("enter your number/word pairs
enter a blank line to stop");
 
variable value divisorsToWords = map<Integer, String> {};
 
while(true) {
value line = process.readLine();
assert(exists line);
if(line.trimmed.empty) {
break;
}
value pair = line.trimmed.split().sequence();
if(exists first = pair.first,
exists integer = parseInteger(first),
exists word = pair[1]) {
divisorsToWords = divisorsToWords.patch(map {integer -> word});
}
}
 
value divisors = divisorsToWords.keys.sort(byIncreasing(Integer.magnitude));
for(i in 1..max) {
value builder = StringBuilder();
for(divisor in divisors) {
if(divisor.divides(i), exists word = divisorsToWords[divisor]) {
builder.append(word);
}
}
if(builder.empty) {
print(i);
} else {
print(builder.string);
}
}
}

Clojure[edit]

(defn fix [pairs]
(map second pairs))
 
(defn getvalid [pairs n]
(filter (fn [p] (zero? (mod n (first p))))
(sort-by first pairs)))
 
(defn gfizzbuzz [pairs numbers]
(interpose "\n"
(map (fn [n] (let [f (getvalid pairs n)]
(if (empty? f)
n
(apply str
(fix f)))))
numbers)))

Usage:

user#=> (def pairs [[5 "Buzz"] [3 "Fizz"] [7 "Baxx"]])
#'user/pairs
user#=> (println (apply str (gfizzbuzz pairs (range 1 21))))
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz
nil

Common Lisp[edit]

 
(defun fizzbuzz (limit factor-words)
(loop for i from 1 to limit
if (assoc-if #'(lambda (factor) (zerop (mod i factor))) factor-words)
do (loop for (factor . word) in factor-words
when (zerop (mod i factor)) do (princ word)
finally (fresh-line))
else do (format t "~a~%" i)))
 
(defun read-factors (&optional factor-words)
(princ "> ")
(let ((input (read-line t nil)))
(cond ((zerop (length input))
(sort factor-words #'< :key #'car))
((digit-char-p (char input 0))
(multiple-value-bind (n i) (parse-integer input :junk-allowed t)
(read-factors (acons n (string-trim " " (subseq input i))
factor-words))))
(t (write-line "Invalid input.")
(read-factors factor-words)))))
 
(defun main ()
(loop initially (princ "> ")
for input = (read-line t nil)
until (and (> (length input) 0)
(digit-char-p (char input 0))
(not (zerop (parse-integer input :junk-allowed t))))
finally (fizzbuzz (parse-integer input :junk-allowed t) (read-factors))))
 

D[edit]

import core.stdc.stdlib;
import std.stdio;
 
void main() {
int limit;
write("Max number (>0): ");
readf!"%d\n"(limit);
if (limit <= 0) {
writeln("The max number to consider must be greater than zero.");
exit(1);
}
 
int terms;
write("Terms (>0): ");
readf!"%d\n"(terms);
if (terms <= 0) {
writeln("The number of terms to consider must be greater than zero.");
exit(1);
}
 
int[] factors = new int[terms];
string[] words = new string[terms];
 
for (int i=0; i<terms; ++i) {
write("Factor ", i+1, " and word: ");
readf!"%d %s\n"(factors[i], words[i]);
if (factors[i] <= 0) {
writeln("The factor to consider must be greater than zero.");
exit(1);
}
}
 
foreach(n; 1..limit+1) {
bool print = true;
 
for (int i=0; i<terms; ++i) {
if (n % factors[i] == 0) {
write(words[i]);
print = false;
}
}
 
if (print) {
writeln(n);
} else {
writeln();
}
}
}
Output:
Max number (>0): 20
Terms (>0): 3
Factor 1 and word: 3 Fizz
Factor 2 and word: 5 Buzz
Factor 3 and word: 7 Baxx
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Elixir[edit]

Translation of: Ruby
defmodule General do
def fizzbuzz(input) do
[num | nwords] = String.split(input)
max = String.to_integer(num)
dict = Enum.chunk(nwords, 2) |> Enum.map(fn[n,word] -> {String.to_integer(n),word} end)
Enum.each(1..max, fn i ->
str = Enum.map_join(dict, fn {n,word} -> if rem(i,n)==0, do: word end)
IO.puts if str=="", do: i, else: str
end)
end
end
 
input = """
105
3 Fizz
5 Buzz
7 Baxx
"""
General.fizzbuzz(input)
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz
FizzBaxx
...
Buzz
101
Fizz
103
104
FizzBuzzBaxx

Forth[edit]

Uses GForth specific words ']]' and '[['. If your forth does not have them: Sequence ']] A B C .. [[' is equivalent with 'postpone A postpone B postpone C ..'

\ gfb.fs - generalized fizz buzz
: times ( xt n -- )
BEGIN dup WHILE
1- over swap 2>r execute 2r>
REPEAT
2drop
;
\ 'Domain Specific Language' compiling words
\ -- First comment: stack-effect at compile-time
\ -- Second comment: stack efect of compiled sequence
: ]+[ ( u ca u -- ) ( u f -- u f' )
2>r >r ]
]] over [[
r> ]] literal mod 0= IF [[
2r> ]] sliteral type 1+ THEN [ [[
;
: ]fb ( -- xt ) ( u f -- u+1 )
]] IF space ELSE dup u. THEN 1+ ; [[
;
: fb[ ( -- ) ( u -- u 0  ;'u' is START-NUMBER )
:noname 0 ]] literal [ [[
;
\ Usage: START-NUMBER COMPILING-SEQUENCE U times drop ( INCREASED-NUBER )
\ Example:
\ 1 fb[ 3 s" fizz" ]+[ 5 s" buzz" ]+[ 7 s" dizz" ]+[ ]fb 40 times drop
 
Output:
gforth gfb.fs --evaluate '1 fb[ ]fb 40 times drop cr bye'
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 
gforth gfb.fs --evaluate '1 fb[ 3 s" F" ]+[ 5 s" B" ]+[ 7 s" G" ]+[ ]fb 40 times drop cr bye'
1 2 F 4 B F G 8 F B 11 F 13 G FB 16 17 F 19 B FG 22 23 F B 26 F G 29 FB 31 32 F 34 BG F 37 38 F B 

Groovy[edit]

def log = ''
(1..40).each {Integer value -> log +=(value %3 == 0) ? (value %5 == 0)? 'FIZZBUZZ\n':(value %7 == 0)? 'FIZZBAXX\n':'FIZZ\n'
 :(value %5 == 0) ? (value %7 == 0)? 'BUZBAXX\n':'BUZZ\n'
 :(value %7 == 0) ?'BAXX\n'
 :(value+'\n')}
println log
 
1
2
FIZZ
4
BUZZ
FIZZ
BAXX
8
FIZZ
BUZZ
11
FIZZ
13
BAXX
FIZZBUZZ
16
17
FIZZ
19
BUZZ
FIZZBAXX
22
23
FIZZ
BUZZ
26
FIZZ
BAXX
29
FIZZBUZZ
31
32
FIZZ
34
BUZBAXX
FIZZ
37
38
FIZZ
BUZZ

Haskell[edit]

fizz :: (Integral a, Show a) => a -> [(a, String)] -> String
fizz a xs
| null result = show a
| otherwise = result
where result = concatMap (fizz' a) xs
fizz'
a (factor, str)
| a `mod` factor == 0 = str
| otherwise = ""
 
main = do
line <- getLine
let n = read line
contents <- getContents
let multiples = map (convert . words) $ lines contents
mapM_ (\ x -> putStrLn $ fizz x multiples) [1..n]
where convert [x, y] = (read x, y)
 

Or, as a function which takes a list of rules as an argument:

type Rule = (Int, String)
 
testFizz :: Int -> [String]
testFizz = fizz [(3, "Fizz"), (5, "Buzz"), (7, "Baxx")]
 
fizz :: [Rule] -> Int -> [String]
fizz rules n = foldr nextLine [] [1 .. n]
where
nextLine x a =
(if null noise
then show x
else noise) :
a
where
noise = foldl reWrite [] rules
reWrite s (m, k) =
s ++
(if rem x m == 0
then k
else [])
 
main :: IO ()
main = mapM_ putStrLn (testFizz 20)
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

J[edit]

The trick here involves looking for where the factors evenly divide the counting numbers. Where no factor is relevant we use the counting number, an in the remaining cases we use the string which corresponds to the factor:

genfb=:1 :0
:
b=. * x|/1+i.y
>,&":&.>/(m#inv"_1~-.b),(*/b)#&.>1+i.y
)

Example use:

   3 5 7 ('Fizz';'Buzz';'Baxx')genfb 20
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

For our example, b looks like this:

1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1
1 1 1 1 0 1 1 1 1 0 1 1 1 1 0 1 1 1 1 0
1 1 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 1 1

*/b gives us 1s where we want numbers and 0s where we want to plug in the strings:

   */*3 5 7|/1+i.20
1 1 0 1 0 0 0 1 0 0 1 0 1 0 0 1 1 0 1 0

m is our strings, and #inv expands values out to match a selection. So, in our example, m#inv"_1~-.b looks like this:

┌┬┬────┬┬────┬────┬────┬┬────┬────┬┬────┬┬────┬────┬┬┬────┬┬────┐
│││Fizz││ │Fizz│ ││Fizz│ ││Fizz││ │Fizz│││Fizz││ │
├┼┼────┼┼────┼────┼────┼┼────┼────┼┼────┼┼────┼────┼┼┼────┼┼────┤
│││ ││Buzz│ │ ││ │Buzz││ ││ │Buzz│││ ││Buzz│
├┼┼────┼┼────┼────┼────┼┼────┼────┼┼────┼┼────┼────┼┼┼────┼┼────┤
│││ ││ │ │Baxx││ │ ││ ││Baxx│ │││ ││ │
└┴┴────┴┴────┴────┴────┴┴────┴────┴┴────┴┴────┴────┴┴┴────┴┴────┘

All that remains is to assemble these pieces into the final result...

Java[edit]

public class FizzBuzz {
 
public static void main(String[] args) {
Sound[] sounds = {new Sound(3, "Fizz"), new Sound(5, "Buzz"), new Sound(7, "Baxx")};
for (int i = 1; i <= 20; i++) {
StringBuilder sb = new StringBuilder();
for (Sound sound : sounds) {
sb.append(sound.generate(i));
}
System.out.println(sb.length() == 0 ? i : sb.toString());
}
}
 
private static class Sound {
private final int trigger;
private final String onomatopoeia;
 
public Sound(int trigger, String onomatopoeia) {
this.trigger = trigger;
this.onomatopoeia = onomatopoeia;
}
 
public String generate(int i) {
return i % trigger == 0 ? onomatopoeia : "";
}
 
}
 
}


For serious stuff see FizzBuzz Enterprise Edition (aka jFizzBuzz)

JavaScript[edit]

ES5[edit]

In a functional style of JavaScript, with two nested reduce folds – one through the integer series, and one through the series of rules.

First as compacted by Google's Closure compiler:

function fizz(d, e) {
return function b(a) {
return a ? b(a - 1).concat(a) : [];
}(e).reduce(function (b, a) {
return b + (d.reduce(function (b, c) {
return b + (a % c[0] ? "" : c[1]);
}, "") || a.toString()) + "\n";
}, "");
}

and then in the original expanded form, for better legibility:

function fizz(lstRules, lngMax) {
 
return (
function rng(i) {
return i ? rng(i - 1).concat(i) : []
}
)(lngMax).reduce(
function (strSeries, n) {
 
// The next member of the series of lines:
// a word string or a number string
return strSeries + (
lstRules.reduce(
function (str, tplNumWord) {
return str + (
n % tplNumWord[0] ? '' : tplNumWord[1]
)
}, ''
) || n.toString()
) + '\n';
 
}, ''
);
}
 
fizz([[3, 'Fizz'], [5, 'Buzz'], [7, 'Baxx']], 20);
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz


ES6[edit]

(() => {
 
// fizz :: [[Int, String]] -> Int -> String
const fizz = (lstRules, lngMax) => range(1, lngMax)
.reduce((strSeries, n) =>
 
// The next member of the series of lines:
// a word string or a number string
strSeries + (
lstRules
.reduce((str, tplNumWord) =>
str + (
n % tplNumWord[0] ? '' : tplNumWord[1]
),
''
) || n.toString()
) + '\n', ''
);
 
// range :: Int -> Int -> [Int]
const range = (m, n) =>
Array.from({
length: Math.floor(n - m) + 1
}, (_, i) => m + i);
 
 
return fizz([
[3, 'Fizz'],
[5, 'Buzz'],
[7, 'Baxx']
], 20);
 
})();


Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Julia[edit]

For simplicity, assume that the user will enter valid input.

function fizzbuzz(triggers :: Vector{Tuple{Int, ASCIIString}}, upper :: Int)
for i = 1 : upper
triggered = false
 
for trigger in triggers
if i % trigger[1] == 0
triggered = true
print(trigger[2])
end
end
 
 !triggered && print(i)
println()
end
end
 
print("Enter upper limit:\n> ")
upper = parse(Int, readline())
 
triggers = Tuple{Int, ASCIIString}[]
print("Enter factor/string pairs (space delimited; ^D when done):\n> ")
while (r = readline()) != ""
input = split(r)
push!(triggers, (parse(Int, input[1]), input[2]))
print("> ")
end
 
println("EOF\n")
fizzbuzz(triggers, upper)
Output:
Enter upper limit:
> 20
Enter factor/string pairs (space delimited; ^D when done):
> 3 Fizz
> 5 Buzz
> 7 Baxx
> EOF

1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Kotlin[edit]

fun main(args: Array<String>) {
 
//Read the maximum number, set to 0 if it couldn't be read
val max = readLine()?.toInt() ?: 0
val words = mutableMapOf<Int, String>()
 
//Read input three times for a factor and a word
(1..3).forEach {
readLine()?.let {
val tokens = it.split(' ')
words.put(tokens[0].toInt(), tokens[1])
}
}
 
//Sort the words so they will be output in arithmetic order
val sortedWords = words.toSortedMap()
 
//Find the words with matching factors and print them, print the number if no factors match
for (i in 1..max) {
val wordsToPrint = sortedWords.filter { i % it.key == 0 }.map { it.value }
if (wordsToPrint.isNotEmpty()) {
wordsToPrint.forEach { print(it) }
println()
}
else
println(i)
}
}

LiveCode[edit]

function generalisedFizzBuzz m, f1, f2, f3
put f1 & cr & f2 & cr & f3 into factors
sort factors ascending numeric
repeat with i = 1 to m
put false into flag
if i mod (word 1 of line 1 of factors) = 0 then
put word 2 of line 1 of factors after fizzbuzz
put true into flag
end if
if i mod (word 1 of line 2 of factors) = 0 then
put word 2 of line 2 of factors after fizzbuzz
put true into flag
end if
if i mod (word 1 of line 3 of factors) = 0 then
put word 2 of line 3 of factors after fizzbuzz
put true into flag
end if
if flag is false then put i after fizzbuzz
put cr after fizzbuzz
end repeat
return fizzbuzz
end generalisedFizzBuzz
Example
put generalisedFizzBuzz(20,"7 baxx","3 fizz","5 buzz")


Lua[edit]

function genFizz (param)
local response
print("\n")
for n = 1, param.limit do
response = ""
for i = 1, 3 do
if n % param.factor[i] == 0 then
response = response .. param.word[i]
end
end
if response == "" then print(n) else print(response) end
end
end
 
local param = {factor = {}, word = {}}
param.limit = io.read()
for i = 1, 3 do
param.factor[i], param.word[i] = io.read("*number", "*line")
end
genFizz(param)


Without modulo[edit]

Translation of: Python
local function fizzbuzz(n, mods)
local res = {}
 
for i = 1, #mods, 2 do
local mod, name = mods[i], mods[i+1]
for i = mod, n, mod do
res[i] = (res[i] or '') .. name
end
end
 
for i = 1, n do
res[i] = res[i] or i
end
 
return table.concat(res, '\n')
end
 
do
local n = tonumber(io.read()) -- number of lines, eg. 100
local mods = {}
 
local n_mods = 0
while n_mods ~= 3 do -- for reading until EOF, change 3 to -1
local line = io.read()
if not line then break end
local s, e = line:find(' ')
local num = tonumber(line:sub(1, s-1))
local name = line:sub(e+1)
mods[#mods+1] = num
mods[#mods+1] = name
n_mods = n_mods + 1
end
 
print(fizzbuzz(n, mods))
end
 
Output:
> mods = {
>>   3, 'cheese ',
>>   2, 'broccoli ',
>>   3, 'sauce ',
>> }
> fizzbuzz(8, mods)
1
broccoli 
cheese sauce 
broccoli 
5
cheese broccoli sauce 
7
broccoli 

Nim[edit]

This solution has no input validation

 
import parseutils, strutils, algorithm
 
type FactorAndWord = tuple[factor:int, word: string]
 
var number: int
var factorAndWords: array[3, FactorAndWord]
 
#custom comparison proc for the FactorAndWord type
proc customCmp(x,y: FactorAndWord): int =
if x.factor < y.factor:
-1
elif x.factor > y.factor:
1
else:
0
 
echo "Enter max number:"
var input = readLine(stdin)
discard parseInt(input, number)
 
for i in 0..2:
 
echo "Enter a number and word separated by space:"
var input = readLine(stdin)
 
var tokens = input.split
discard parseInt(tokens[0], factorAndWords[i].factor)
factorAndWords[i].word = tokens[1]
 
#sort factors in ascending order
sort(factorAndWords, customCmp)
 
#implement fiz buz
for i in 1..number:
var written = false;
for item in items(factorAndWords):
if i mod item.factor == 0 :
write(stdout, item.word)
written = true
if written :
write(stdout, "\n")
else :
writeLine(stdout, i)
 
 
 


PARI/GP[edit]

Works with: PARI/GP version 2.8.0+

This version uses a variadic argument to allow more or less than 3 factors. It could be easily modified for earlier versions, either by taking a vector rather than bare arguments (making the call fizz(20,[[3,"Fizz"],[5,"Buzz"],[7,"Baxx"]])) or to support exactly factors (keeping the call the same).

fizz(n,v[..])=
{
v=vecsort(v,1);
for(k=1,n,
my(t);
for(i=1,#v,
if(k%v[i][1]==0,
print1(v[i][2]);
t=1
)
);
print(if(t,"",k))
);
}
fizz(20,[3,"Fizz"],[5,"Buzz"],[7,"Baxx"])
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Perl[edit]

 
#!bin/usr/perl
use 5.020;
use strict;
use warnings;
 
#Get a max number from the user
say("Please enter the maximum possible multiple. ");
my $max = <STDIN>;
 
#Get the factors from the user
my @factors = ();
my $buffer;
say("Now enter the first factor and its associated word. Ex: 3 Fizz ");
chomp($buffer = <STDIN>);
push @factors, $buffer;
say("Now enter the second factor and its associated word. Ex: 5 Buzz ");
chomp($buffer = <STDIN>);
push @factors, $buffer;
say("Now enter the third factor and its associated word. Ex: 7 Baxx ");
chomp($buffer = <STDIN>);
push @factors, $buffer;
 
#Counting from 1 to max
for(my $i = 1; $i <= $max; $i++)
{
#Create a secondary buffer as well as set the original buffer to the current index
my $oBuffer;
$buffer = $i;
#Run through each element in our array
foreach my $element (@factors)
{
#Look for white space
$element =~ /\s/;
#If the int is a factor of max, append it to oBuffer as a string to be printed
if($i % substr($element, 0, @-) == 0)
{
$oBuffer = $oBuffer . substr($element, @+ + 1, length($element));
#This is essentially setting a flag saying that at least one element is a factor
$buffer = "";
}
}
#If there are any factors for that number, print their words. If not, print the number.
if(length($buffer) > 0)
{
print($buffer . "\n");
}
else
{
print($oBuffer . "\n");
}
}
 
Output:
Please enter the maximum possible multiple. 
20
Now enter the first factor and its associated word. Ex: 3 Fizz 
3 Fizz
Now enter the second factor and its associated word. Ex: 5 Buzz 
5 Buzz
Now enter the third factor and its associated word. Ex: 7 Baxx 
7 Baxx
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Perl 6[edit]

Works with: rakudo version 2015-09-20
# General case implementation of a "FizzBuzz" class.
# Defaults to standard FizzBuzz unless a new schema is passed in.
class FizzBuzz {
has $.schema is rw = < 3 Fizz 5 Buzz >.hash;
method filter (Int $this) {
my $fb;
for $.schema.sort: { +.key } -> $p { $fb ~= $this %% +$p.key ?? $p.value !! ''};
return $fb || $this;
}
}
 
 
# Sub implementing the specific requirements of the task.
sub GeneralFizzBuzz (Int $upto, @schema?) {
my $ping = FizzBuzz.new;
$ping.schema = @schema.hash if @schema;
map { $ping.filter: $_ }, 1 .. $upto;
}
 
# The task
say 'Using: 20 ' ~ <3 Fizz 5 Buzz 7 Baxx>;
.say for GeneralFizzBuzz(20, <3 Fizz 5 Buzz 7 Baxx>);
 
say '';
 
# And for fun
say 'Using: 21 ' ~ <2 Pip 4 Squack 5 Pocketa 7 Queep>;
say join ', ', GeneralFizzBuzz(21, <2 Pip 4 Squack 5 Pocketa 7 Queep>);
Output:
Using: 20 3 Fizz 5 Buzz 7 Baxx
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Using: 21 2 Pip 4 Squack 5 Pocketa 7 Queep
1, Pip, 3, PipSquack, Pocketa, Pip, Queep, PipSquack, 9, PipPocketa, 11, PipSquack, 13, PipQueep, Pocketa, PipSquack, 17, Pip, 19, PipSquackPocketa, Queep

Here's the same program in a more functional idiom:

sub genfizzbuzz($n, +@fb) {
[Z~](
do for @fb || <3 fizz 5 buzz> -> $i, $s {
flat ('' xx $i-1, $s) xx *;
}
) Z|| 1..$n
}
 
.say for genfizzbuzz(20, <3 Fizz 5 Buzz 7 Baxx>);

Phix[edit]

procedure general_fizz_buzz(integer lim, sequence words, sequence facts)
for i=1 to lim do
string word = ""
for j=1 to length(facts) do
if remainder(i,facts[j])=0 then
word &= words[j]
end if
end for
if length(word)=0 then
word = sprintf("%d",i)
end if
printf(1,"%s\n",{word})
end for
end procedure
general_fizz_buzz(20, {"Fizz","Buzz","Baxx"}, {3,5,7})
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

PicoLisp[edit]

(de general (N Lst)
(for A N
(prinl
(or
(extract
'((L)
(and (=0 (% A (car L))) (cdr L)) )
Lst )
A ) ) ) )
 
(general 20 '((3 . Fizz) (5 . Buzz) (7 . Baxx)))
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

PowerShell[edit]

$limit = 20
$data = @("3 Fizz","5 Buzz","7 Baxx")
#An array with whitespace as the delimiter
#Between the factor and the word
 
for ($i = 1;$i -le $limit;$i++){
$outP = ""
foreach ($x in $data){
$data_split = $x -split " " #Split the "<factor> <word>"
if (($i % $data_split[0]) -eq 0){
$outP += $data_split[1] #Append the <word> to outP
}
}
if(!$outP){ #Is outP equal to NUL?
Write-HoSt $i
} else {
Write-HoSt $outP
}
}
Output:
PS> ./GENFB
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz
PS>

Python[edit]

def genfizzbuzz(factorwords, numbers):
factorwords.sort(key=lambda p: p[0])
lines = []
for num in numbers:
words = ''.join(wrd for fact, wrd in factorwords if (num % fact) == 0)
lines.append(words if words else str(num))
return '\n'.join(lines)
 
if __name__ == '__main__':
print(genfizzbuzz([(5, 'Buzz'), (3, 'Fizz'), (7, 'Baxx')], range(1, 21)))
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz


Alternative version - generator using counters instead of modulo

Works with: Python version 3.x
from collections import defaultdict
 
n = 100
mods = {
3: "Fizz",
5: "Buzz",
}
 
def fizzbuzz(n=n, mods=mods):
factors = defaultdict(list)
for mod in mods:
factors[mod].append(mod)
 
for i in range(1,n+1):
res = ''
for mod in sorted(factors[i]):
factors[i+mod].append(mod)
res += mods[mod]
del factors[i]
yield res or str(i)
 
if __name__ == '__main__':
n = int(input())
mods = { int(k): v for k,v in (input().split(maxsplit=1) for _ in range(3)) }
for line in fizzbuzz(n, mods):
print(line)
 


Another version, using ranges with step 3, 5, etc. Preserves order and duplicate moduli.

from collections import defaultdict
 
n = 100
mods = [
(3, 'Fizz'),
(5, 'Buzz'),
]
 
def fizzbuzz(n=n, mods=mods):
res = defaultdict(str)
 
for num, name in mods:
for i in range(num, n+1, num):
res[i] += name
 
return '\n'.join(res[i] or str(i) for i in range(1, n+1))
 
 
if __name__ == '__main__':
n = int(input())
 
mods = []
while len(mods) != 3: # for reading until EOF change 3 to -1
try:
line = input()
except EOFError:
break
idx = line.find(' ') # preserves whitespace
num, name = int(line[:idx]), line[idx+1:] # after the first space
mods.append((num, name)) # preserves order and duplicate moduli
 
print(fizzbuzz(n, mods))
 
Output:
>>> mods = [
...   (4, 'Four '),
...   (6, 'six '),
...   (2, 'Two '),
...   (8, 'eight... '),
...   (6, 'HA! SIX!'),
... ]
>>> print(fizzbuzz(16, mods))
1
Two 
3
Four Two 
5
six Two HA! SIX!
7
Four Two eight... 
9
Two 
11
Four six Two HA! SIX!
13
Two 
15
Four Two eight... 

Racket[edit]

Translation of: Python
#lang racket/base
 
(define (get-matches num factors/words)
(for*/list ([factor/word (in-list factors/words)]
[factor (in-value (car factor/word))]
[word (in-value (cadr factor/word))]
#:when (zero? (remainder num factor)))
word))
 
(define (gen-fizzbuzz from to factors/words)
(for ([num (in-range from to)])
(define matches (get-matches num factors/words))
(displayln (if (null? matches)
(number->string num)
(apply string-append matches)))))
 
(gen-fizzbuzz 1 21 '((3 "Fizz")
(5 "Buzz")
(7 "Baxx")))
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

REXX[edit]

idiomatic version[edit]

/*REXX program shows a generalized  FizzBuzz  program:  #1 name1    #2 name2   ···      */
parse arg h $ /*obtain optional arguments from the CL*/
if h='' | h="," then h=20 /*Not specified? Then use the default.*/
if $='' | $="," then $= "3 Fizz 5 Buzz 7 Baxx" /* " " " " " " */
 
do j=1 for h; _= /*traipse through the numbers to H. */
do k=1 by 2 for words($) % 2 /* " " " factors in J. */
if j//word($,k)==0 then _=_ || word($,k+1) /*Is it a factor? Then append it to _ */
end /*k*/ /* [↑] Note: the factors may be zero.*/
say word(_ j,1) /*display the number or its factors. */
end /*j*/ /*stick a fork in it, we're all done. */

output   when using the default inputs:

1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

optimized version[edit]

/*REXX program shows a generalized  FizzBuzz  program:  #1 name1    #2 name2   ···      */
parse arg h $ /*obtain optional arguments from the CL*/
if h='' | h="," then h=20 /*Not specified? Then use the default.*/
if $='' | $="," then $= "3 Fizz 5 Buzz 7 Baxx" /* " " " " " " */
factors=words($) % 2 /*determine number of factors to use. */
 
do i=1 by 2 for factors /*parse the number factors to be used. */
#.i=word($, i); @.i=word($, i+1) /*obtain the factor and its "name". */
end /*i*/
 
do j=1 for h; _= /*traipse through the numbers to H. */
do k=1 by 2 for factors /* " " " factors in J. */
if j//#.k==0 then _=_ || @.k /*Is it a factor? Then append it to _ */
end /*k*/ /* [↑] Note: the factors may be zero.*/
say word(_ j,1) /*display the number or its factors. */
end /*j*/ /*stick a fork in it, we're all done. */

output   is identical to the 1st REXX version.

Ring[edit]

This example is incorrect. Please fix the code and remove this message.
Details: Mappings are supposed to be parameterized, not hardwired as they are here.
 
for n = 1 to 20
if n % 3 = 0 see "" + n + " = " + "Fizz"+ nl
but n % 5 = 0 see "" + n + " = " + "Buzz" + nl
but n % 7 = 0 see "" + n + " = " + "Baxx" + nl
else see "" + n + " = " + n + nl ok
next
 
 

Ruby[edit]

def general_fizzbuzz(text)
num, *nword = text.split
num = num.to_i
dict = nword.each_slice(2).map{|n,word| [n.to_i,word]}
(1..num).each do |i|
str = dict.map{|n,word| word if i%n==0}.join
puts str.empty? ? i : str
end
end
 
text = <<EOS
20
3 Fizz
5 Buzz
7 Baxx
EOS

 
general_fizzbuzz(text)
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Rust[edit]

use std::io;
use std::io::BufRead;
 
fn parse_entry(l: &str) -> (i32, String) {
let params: Vec<&str> = l.split(' ').collect();
 
let divisor = params[0].parse::<i32>().unwrap();
let word = params[1].to_string();
(divisor, word)
}
 
fn main() {
let stdin = io::stdin();
let mut lines = stdin.lock().lines().map(|l| l.unwrap());
 
let l = lines.next().unwrap();
let high = l.parse::<i32>().unwrap();
 
let mut entries = Vec::new();
for l in lines {
if &l == "" { break }
let entry = parse_entry(&l);
entries.push(entry);
}
 
for i in 1..(high + 1) {
let mut line = String::new();
for &(divisor, ref word) in &entries {
if i % divisor == 0 {
line = line + &word;
}
}
if line == "" {
println!("{}", i);
} else {
println!("{}", line);
}
}
}

Sidef[edit]

class FizzBuzz(schema=Hash(<3 Fizz 5 Buzz>...)) {
method filter(this) {
var fb = ''
schema.sort_by {|k,_| k.to_i }.each { |pair|
fb += (pair[0].to_i `divides` this ? pair[1] : '')
}
fb.len > 0 ? fb : this
}
}
 
func GeneralFizzBuzz(upto, schema) {
var ping = FizzBuzz()
if (nil != schema) {
ping.schema = schema.to_hash
}
(1..upto).map {|i| ping.filter(i) }
}
 
GeneralFizzBuzz(20, <3 Fizz 5 Buzz 7 Baxx>).each { .say }
Output:
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Scala[edit]

object GenericFizzBuzz extends App {
 
val max = scala.io.StdIn.readInt()
val factors = scala.io.Source.stdin.getLines().toSeq.sorted.map(_.split(" ", 2)).map(f => f(0).toInt -> f(1))
 
1 to max foreach { i =>
val words = factors collect { case (k, v) if i % k == 0 => v }
println(if (words.nonEmpty) words.mkString else i)
}
 
}
Output:
$ scala GenericFizzBuzz.scala
20
3 Fizz
5 Buzz
7 Baxx
^D

1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

Tcl[edit]

Tcl excels at metaprogramming, so this task is trivial. For fun, the below implementation is a compatible extension of FizzBuzz#Tcl:

proc fizzbuzz {n args} {
if {$args eq ""} {
set args {{3 Fizz} {5 Buzz}}
}
while {[incr i] <= $n} {
set out ""
foreach rule $args {
lassign $rule m echo
if {$i % $m == 0} {append out $echo}
}
if {$out eq ""} {set out $i}
puts $out
}
}
fizzbuzz 20 {3 Fizz} {5 Buzz} {7 Baxx}

Ursa[edit]

This program reads a max number, then reads factors until the user enters a blank line.

#
# general fizzbuzz
#
decl int<> factors
decl string<> words
decl int max
 
# get the max number
out ">" console
set max (in int console)
 
# get the factors
decl string input
set input " "
while (not (= input ""))
out ">" console
set input (in string console)
if (not (= input ""))
append (int (split input " ")<0>) factors
append (split input " ")<1> words
end if
end while
 
# output all the numbers
decl int i
for (set i 1) (< i (+ max 1)) (inc i)
decl boolean foundfactor
set foundfactor false
for (decl int j) (< j (size factors)) (inc j)
if (= (mod i factors<j>) 0)
set foundfactor true
out words<j> console
end if
end for
set j 0
 
if (not foundfactor)
out i console
end if
out endl console
end for

Output:

>20
>3 Fizz
>5 Buzz
>7 Baxx
>
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

VBScript[edit]

'The Function
Function FizzBuzz(range, mapping)
data = Array()
 
'Parse the mapping and put to "data" array
temp = Split(mapping, ",")
ReDim data(UBound(temp),1)
For i = 0 To UBound(temp)
map = Split(temp(i), " ")
data(i, 0) = map(0)
data(i, 1) = map(1)
Next
 
'Do the loop
For i = 1 to range
noMatch = True
For j = 0 to UBound(data, 1)
If (i Mod data(j, 0)) = 0 Then
WScript.StdOut.Write data(j, 1)
noMatch = False
End If
Next
If noMatch Then WScript.StdOut.Write i
WScript.StdOut.Write vbCrLf
Next
End Function
 
'The Main Thing
WScript.StdOut.Write "Range? "
x = WScript.StdIn.ReadLine
WScript.StdOut.Write "Mapping? "
y = WScript.StdIn.ReadLine
WScript.StdOut.WriteLine ""
FizzBuzz x, y
Sample Run:
\Desktop>cscript /nologo fizzbuzz.vbs
Range? 20
Mapping? 3 Fizz,5 Buzz,7 Baxx

1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

\Desktop>

zkl[edit]

stop:=ask("Count: ").toInt();
fizzBuzzers:=List();
do(3){ n,txt:=ask(">").split(); fizzBuzzers.append(T(n.toInt(),txt)) }
foreach n in ([1..stop]){
s:=fizzBuzzers.filter('wrap([(fb,txt)]){ n%fb==0 }).apply("get",1).concat();
println(s or n);
}
Output:
$ zkl bbb
Count: 20
>3 Fizz 
>5 Buzz
>7 Baxx
1
2
Fizz
4
Buzz
Fizz
Baxx
8
Fizz
Buzz
11
Fizz
13
Baxx
FizzBuzz
16
17
Fizz
19
Buzz

ZX Spectrum Basic[edit]

Translation of: BBC_BASIC
10 INPUT "Maximum number: ";max
20 INPUT "Number of factors: ";n
30 DIM f(n): DIM w$(n,4)
40 FOR i=1 TO n
50 INPUT "Input value-ENTER-word: ";f(i);w$(i)
60 NEXT i
70 FOR i=1 TO max
80 LET matched=0
90 FOR j=1 TO n
100 IF FN m(i,f(j))=0 THEN LET matched=1: PRINT w$(j);
110 NEXT j
120 IF NOT matched THEN PRINT ;i: GO TO 140
130 PRINT
140 NEXT i
150 DEF FN m(a,b)=a-INT (a/b)*b