General FizzBuzz: Difference between revisions

{{trans|Python}}

 

V sfactorwords = sorted(factorwords, key' p -> p[0])

[String] lines

R lines.join("\n")

 

 

{{out}}

 

=={{header|Action!}}==

DEFINE MAX_LEN="20"

DEFINE MAX_FACTORS="5"

PutE()

PrintResult(max,n,factors,texts)

{{out}}

[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/General_FizzBuzz.png Screenshot from Atari 8-bit computer]

 

=={{header|Ada}}==

with Ada.Text_IO; use Ada.Text_IO;

with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;

general_fizz_buzz (20, fizzy);

end Main;

{{output}}

<pre>

=={{header|ALGOL 68}}==

Uses a modified version of the Algol 68 Quicksort task sample.

# prompts for an integer, reads it and returns it #

PROC read integer = ( STRING prompt )INT:

print( ( text, newline ) )

OD

{{out}}

<pre>

=={{header|AppleScript}}==

 

 

-- fizzEtc :: [(Int, String)] -> [Symbol]

set my text item delimiters to dlm

s

{{Out}}

<pre>1

=={{header|Arturo}}==

 

facts: map 1..3 'x -> split.words strip input ~"Enter factor |x|: "

loop 1..maxNum 'i [

]

print (printNum)? -> i -> ""

 

{{out}}

 

=={{header|AutoHotkey}}==

max := 20, fizz := 3, buzz := 5, baxx := 7

 

FileAppend %output%`n, *

}

{{Out}}

<pre>

 

;Usage:

 

;Program:

<!-- http://ideone.com/fACMfK -->

<!-- (!!) Note: the sandbox at ideone.com does not allow output to files -->

#

function Print(s) {

print "END {print " q2 "# Done." q2 "}"

Print( "# Done." )

 

Example output see [[FizzBuzz/AWK#Custom_FizzBuzz]]

 

=={{header|Batch File}}==

rem input range

set /p "range=> "

)

pause

{{Out}}

<pre>> 20

=={{header|BBC BASIC}}==

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.

INPUT "Maximum number: " max%

INPUT "Number of factors: " n%

NEXT

IF matched% THEN PRINT ELSE PRINT;i%

Output:

<pre>Maximum number: 20

 

=={{header|BQN}}==

Example usage:

 

=={{header|C}}==

#include <stdio.h>

#include <stdlib.h>

return 0;

}

{{out}}

<pre>

=={{header|C sharp}}==

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

using System;

 

}

}

 

=={{header|C++}}==

#include <algorithm>

#include <iostream>

return 0;

}

{{out}}

<pre>

 

=={{header|Caché ObjectScript}}==

; loop until max, casting numeric to avoid errors

for i=1:1:+MAX {

} ; next value until MAX

 

 

 

=={{header|Ceylon}}==

print("enter the max value");

}

}

 

=={{header|Clojure}}==

(map second pairs))

 

(apply str

(fix f)))))

 

'''Usage:'''

 

=={{header|Common Lisp}}==

(defun fizzbuzz (limit factor-words)

(loop for i from 1 to limit

(not (zerop (parse-integer input :junk-allowed t))))

finally (fizzbuzz (parse-integer input :junk-allowed t) (read-factors))))

 

=={{header|Crystal}}==

counter = 0

 

exit

end

 

=={{header|D}}==

import std.stdio;

 

}

}

 

{{out}}

=={{header|Elixir}}==

{{trans|Ruby}}

def fizzbuzz(input) do

[num | nwords] = String.split(input)

7 Baxx

"""

 

{{out}}

 

=={{header|Erlang}}==

%%% @doc Implementation of General FizzBuzz

%%% @see https://rosettacode.org/wiki/General_FizzBuzz

[fizzbuzz(X, Factors, []) || X <- lists:seq(1, N)]

).

'''Usage:'''

<pre>

 

=={{header|Factor}}==

math.ranges prettyprint sequences splitting ;

IN: rosetta-code.general-fizzbuzz

: main ( -- ) get-input [ fizzbuzz ] with each ;

 

{{out}}

<pre>

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 ..'

: times ( xt n -- )

BEGIN dup WHILE

\ Example:

\ 1 fb[ 3 s" fizz" ]+[ 5 s" buzz" ]+[ 7 s" dizz" ]+[ ]fb 40 times drop

{{out}}

<pre>

=={{header|FreeBASIC}}==

{{trans|BBC BASIC}}

' compile with: fbc -s console

 

Print : Print "hit any key to end program"

Sleep

{{out}}

<pre>Enter maximum number, if number < 1 then the program wil end 110

 

=={{header|Go}}==

package main

 

}

 

 

=={{header|Groovy}}==

(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+'\n')}

println log

<pre>

1

=={{header|Haskell}}==

 

fizz a xs

| null result = show a

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:

 

 

----------------- FIZZETC (USING RULE SET) ---------------

main :: IO ()

main = mapM_ putStrLn $ take 20 fizzTest

{{Out}}

<pre>1

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:

 

:

b=. * x|/1+i.y

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

 

Example use:

 

1

2

Fizz

19

 

For our example, b looks like this:

 

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

 

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

 

 

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

 

│││Fizz││ │Fizz│ ││Fizz│ ││Fizz││ │Fizz│││Fizz││ │

├┼┼────┼┼────┼────┼────┼┼────┼────┼┼────┼┼────┼────┼┼┼────┼┼────┤

├┼┼────┼┼────┼────┼────┼┼────┼────┼┼────┼┼────┼────┼┼┼────┼┼────┤

│││ ││ │ │Baxx││ │ ││ ││Baxx│ │││ ││ │

 

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

 

=={{header|Java}}==

 

public static void main(String[] args) {

}

 

 

 

 

First as compacted by Google's Closure compiler:

return function b(a) {

return a ? b(a - 1).concat(a) : [];

}, "") || a.toString()) + "\n";

}, "");

 

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

 

 

return (

}

 

 

{{out}}

===ES6===

 

const range = (min, max) =>

Array.from({ length: max - min }, (_, i) => min + i)

).join('\n')

 

 

{{Out}}

=={{header|Julia}}==

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

for i = 1 : upper

triggered = false

 

println("EOF\n")

 

{{out}}

=={{header|Kotlin}}==

 

 

//Read the maximum number, set to 0 if it couldn't be read

println(i)

}

 

=={{header|LiveCode}}==

put f1 & cr & f2 & cr & f3 into factors

sort factors ascending numeric

end repeat

return fizzbuzz

 

=={{header|Lua}}==

local response

print("\n")

param.factor[i], param.word[i] = io.read("*number", "*line")

end

 

=== Without modulo ===

{{trans|Python}}

local res = {}

 

print(fizzbuzz(n, mods))

end

 

{{out}}

 

===Fast Version without Modulo===

 

local num = arg[1] or tonumber(arg[1]) or 110

io.write(", ")

end

{{out}}

<pre>

 

=={{header|Maple}}==

local i;

i := 1:

if (not factored) then printf("%d", i): end if:

printf("\n");

{{Out|Output}}

<pre>1

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

runTo=(*LCM@@list[[All,1]]+1*)20;

Column@Table[

Select[list,Mod[x,#[[1]]]==0&][[All,2]]/.{}->{x}

,{x,1,runTo}

 

<pre>1

This implementation improves slightly over the proposed task, making the prompts a little friendlier.

 

 

maxNr = val(input("Max number? "))

end for

if matchingWords then print matchingWords else print nr

 

Sample session:

 

=={{header|Modula-2}}==

FROM Conversions IMPORT StrToInt;

FROM FormatString IMPORT FormatString;

 

ReadChar

 

=={{header|Nanoquery}}==

{{trans|Ursa}}

words = {}

 

end

println

 

{{out}}

=={{header|Nim}}==

This solution has no input validation

import parseutils, strutils, algorithm

 

 

 

 

=={{header|OCaml}}==

Original version by [http://rosettacode.org/wiki/User:Vanyamil User:Vanyamil]

(* Task : General_FizzBuzz *)

 

 

gen_fizz_buzz 20 [(3, "Fizz"); (5, "Buzz"); (7, "Baxx")] ;;

{{out}}

<pre>

{{works with|PARI/GP|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 <code>fizz(20,[[3,"Fizz"],[5,"Buzz"],[7,"Baxx"]])</code>) or to support exactly factors (keeping the call the same).

{

v=vecsort(v,1);

);

}

{{out}}

<pre>1

 

=={{header|Perl}}==

#!bin/usr/perl

use 5.020;

}

}

 

{{out}}

 

=={{header|Phix}}==

<span style="color: #008080;">procedure</span> <span style="color: #000000;">general_fizz_buzz</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">lim</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">sequence</span> <span style="color: #000000;">words</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">facts</span><span style="color: #0000FF;">)</span>

<span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #000000;">lim</span> <span style="color: #008080;">do</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">procedure</span>

<span style="color: #000000;">general_fizz_buzz</span><span style="color: #0000FF;">(</span><span style="color: #000000;">20</span><span style="color: #0000FF;">,</span> <span style="color: #0000FF;">{</span><span style="color: #008000;">"Fizz"</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Buzz"</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"Baxx"</span><span style="color: #0000FF;">},</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">3</span><span style="color: #0000FF;">,</span><span style="color: #000000;">5</span><span style="color: #0000FF;">,</span><span style="color: #000000;">7</span><span style="color: #0000FF;">})</span>

{{out}}

<pre>

 

=={{header|PHP}}==

 

$max = 20;

}

 

{{out}}

<pre>1

 

=={{header|Picat}}==

print("> "),

MaxNum = read_int(),

end

end,

 

Testing:

 

=={{header|PicoLisp}}==

(for A N

(prinl

A ) ) ) )

 

 

{{out}}

 

=={{header|PowerShell}}==

$data = @("3 Fizz","5 Buzz","7 Baxx")

#An array with whitespace as the delimiter

Write-HoSt $outP

}

{{Out}}

<pre>PS> ./GENFB

=={{header|Prolog}}==

Assuming the user specifies as input two facts of the form:

 

A simple Prolog solution to the generalised FizzBuzz problem is as follows:

 

 

loop(B,B,_).

fizzbuzz(N,[(F,S)|Fs],Res) :-

fizzbuzz(N,Fs,OldRes),

 

The program can be launched by querying the predicate

 

It is worth noting that

corresponds to basic FizzBuzz and that the proposed solution can handle an arbitrary number of factors.

 

===Elegant naive version===

 

# sort entries by factor

factorwords.sort(key=lambda factor_and_word: factor_and_word[0])

 

if __name__ == '__main__':

 

{{out}}

 

===One-liner using generator expressions===

mappings = {3: "Fizz", 5: "Buzz", 7: "Baxx"}

 

===Generator using counters instead of modulo===

{{works with|Python|3.x}}

 

N = 100

for line in fizzbuzz(n, mods):

print(line)

 

===Sieve of Eratosthenes===

'''This variant uses ranges with step 3, 5, etc. Preserves order and duplicate moduli.'''

 

n = 100

 

print(fizzbuzz(n, mods))

 

{{Out}}

===... solution===

The task asks that we assume 3 factors for the sake of simplicity. However, R makes the k factors case not much more complicated, so we will do that. The only major downside is that checking for malformed user input becomes so difficult that we will not bother.

{

args <- list(...)

}

genFizzBuzz(105, c(3, "Fizz"), c(5, "Buzz"), c(7, "Baxx"))

 

===Names solution===

If we deviate from the task's example of how to input parameters and instead use R's names facilities to make our (number, name) pairs, we get a much cleaner solution.

{

factors <- sort(namedNums)#Required by the task: We must go from least factor to greatest.

namedGenFizzBuzz(105, namedNums)

shuffledNamedNums <- c(Buzz=5, Prax=9, Fizz=3, Baxx=7)

 

=={{header|Racket}}==

{{trans|Python}}

 

(define (get-matches num factors/words)

(gen-fizzbuzz 1 21 '((3 "Fizz")

(5 "Buzz")

{{out}}

<pre>1

 

===Alternate Solution===

(require racket/match)

 

(void))

 

 

{{out}}

(formerly Perl 6)

{{works with|rakudo|2015-09-20}}

# Defaults to standard FizzBuzz unless a new schema is passed in.

class FizzBuzz {

# And for fun

say 'Using: 21 ' ~ <2 Pip 4 Squack 5 Pocketa 7 Queep>;

{{Out}}

<pre>Using: 20 3 Fizz 5 Buzz 7 Baxx

 

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

[Z~](

do for @fb || <3 fizz 5 buzz> -> $i, $s {

}

 

 

=={{header|Red}}==

 

nmax: to-integer ask "Max number: "

print either empty? res [n] [res]

]

{{Out}}

<pre>Max number: 21

=={{header|REXX}}==

=== idiomatic version ===

parse arg h $ /*obtain optional arguments from the CL*/

if h='' | h="," then h= 20 /*Not specified? Then use the default.*/

end /*k*/ /* [↑] Note: the factors may be zero.*/

say word(z j, 1) /*display the number or its factors. */

{{out|output|text=&nbsp; when using the default input:}}

<pre>

 

=== optimized version ===

parse arg h $ /*obtain optional arguments from the CL*/

if h='' | h="," then h= 20 /*Not specified? Then use the default.*/

end /*k*/ /* [↑] Note: the factors may be zero.*/

say word(Z j, 1) /*display the number or its factors. */

{{out|output|text=&nbsp; is identical to the 1^st REXX version.}} <br><br>

 

=={{header|Ring}}==

limit = 20

for n = 1 to limit

next

 

 

=={{header|Ruby}}==

num, *nword = text.split

num = num.to_i

EOS

 

 

{{out}}

=={{header|Rust}}==

 

use std::io::BufRead;

 

}

}

 

This solution stores the Fizz Buzz state in a struct, leveraging types and the standard library for a more general solution:

 

use std::fmt::{self, Write};

use std::io::{self, Stdin};

assert_eq!(expected, &printed);

}

 

=={{header|Scala}}==

===Simple===

 

 

object GeneralFizzBuzz extends App {

println(if (words.nonEmpty) words.mkString else i)

}

 

===LazyList (f/k/a Stream)===

 

 

object GeneralFizzBuzz extends App {

.sorted

fizzBuzz(factors).take(max).foreach(println)

 

===Scala 3 (Dotty)===

 

{{trans|LazyList (f/k/a Stream)}}

 

def fizzBuzzTerm(n: Int, factors: Seq[(Int, String)]): String | Int =

.map { case Array(k, v) => k.toInt -> v }

.sorted

 

=={{header|Sidef}}==

method filter(this) {

var fb = ''

}

 

{{out}}

<pre>

This is not a particularly efficient solution, but it gets the job done.

 

/*

This code is an implementation of "General FizzBuzz" in SQL ORACLE 19c

;

/

 

{{out}}

=={{header|Swift}}==

 

 

print("Input max number: ", terminator: "")

 

print("\(factors.isEmpty ? String(i) : factors)")

 

{{out}}

 

=={{header|Tailspin}}==

def input: {N: 110"1", words: [ { mod: 3"1", word: 'Fizz' }, { mod: 5"1", word: 'Buzz'}, {mod:7"1", word: 'Baxx'}]};

 

[ 1"1"..$input.N -> '$->sayWords;' ] -> \[i](<=''> $i ! <> $ !\) -> '$;

' -> !OUT::write

{{out}}

<pre>

For fun, the below implementation is a compatible extension of [[FizzBuzz#Tcl]]:

 

if {$args eq ""} {

set args {{3 Fizz} {5 Buzz}}

}

}

 

=={{header|Ursa}}==

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

# general fizzbuzz

#

end if

out endl console

Output:

<pre>>20

 

=={{header|VBA}}==

Option Explicit

 

If StrPtr(UserChoice.Name) <> 0 And UserChoice.Number < MaxNumber Then ok = True

Loop

{{out}}

With the entry :

 

=={{header|VBScript}}==

Function FizzBuzz(range, mapping)

data = Array()

y = WScript.StdIn.ReadLine

WScript.StdOut.WriteLine ""

{{Out|Sample Run}}

<pre>\Desktop>cscript /nologo fizzbuzz.vbs

 

=={{header|Visual Basic .NET}}==

 

Module Program

Next

End Sub

 

{{out}}

 

=={{header|Vlang}}==

fn main() {

divisible = false

}

{{out}}

<pre>Max: 20

=={{header|Wren}}==

{{libheader|Wren-sort}}

import "/sort" for Sort

 

if (s == "") s = i.toString

System.print(s)

 

{{out}}

 

=={{header|zkl}}==

fizzBuzzers:=List();

do(3){ n,txt:=ask(">").split(); fizzBuzzers.append(T(n.toInt(),txt)) }

s:=fizzBuzzers.filter('wrap([(fb,txt)]){ n%fb==0 }).apply("get",1).concat();

println(s or n);

{{out}}

<pre>

=={{header|ZX Spectrum Basic}}==

{{trans|BBC_BASIC}}

20 INPUT "Number of factors: ";n

30 DIM f(n): DIM w$(n,4)

130 PRINT

140 NEXT i