Factorial in haiku!

Question

Task

Create a program that calculates the factorial of a number using no built-in factorial functions. Easy? The catch is that you must write your entire program (including testing it) in haiku form.

You can use as many haikus as you need, but when pronounced, they must follow the 5-7-5 syllable format.

Scoring

This is a popularity-contest, so you must get the most upvotes to win. Your program must consist of at least one full haiku, and all haikus must be complete.

When reading code, the first line of each haiku will have 5 syllables, the second will have 7, and the third will have 5.

Answer 1

Befunge-93

Three haikus:

0&>:v
-:|:>1>
v#>$\
>:>>v
>$.@v<<
^#v*_
#>>>v
<<:\<>^
<#<#<

Last line is admittedly kind of cheaty.

Try here: http://www.bedroomlan.org/tools/befunge-93-playground

Answer 2

C

Least beautiful haiku ever.

int main(int argc,           
char *argv[]){int in,out;
sscanf(argv

[1],"%d",
&in);out=1;while 
(in > 

1){out*=
in--;}printf(
"%d",out);}//done

/*
Int main, int argc,
char star argv. Int in out.
Sscanf argv 

sub one, percent d, 
and in. Out equals one. While 
in is greater than

one, out times equals
in minus minus. Printf
percent d out. Done
*/

Answer 3

Perl - 3 Haikus

This one useds some clever formatting and pronunciations - it also disregards symbols.

print "Enter number: ";
chomp(my $num = <STDIN>);
$result = 1;
for $x (1..$num) {
  $new = $x * $result;
  $result = $new;
}
if (1) { print "$result\n .
Is the factorial of\n";
if ($result) { print "$num"; }

Haiku:

Print: En-ter num-ber
Chomp: my num e-quals STD (stand)-IN
Re-sult e-quals one

For x one to num (or 'one range num')
New e-quals x times re-sult
re-sult e-quals new

If one: print re-sult
Is the fac-to-ri-al of
If re-sult: print num

Let me know if I messed up anywhere.

Answer 4

Mathematica - One Haiku (+1 extra (2 counting title))

factorial[n_]
 := Product @@
  Range[1, n]

fac-tor-i-al en

set de-layed pro-duct ap-ply

range from one to en

From some simple words

Complex functions can arise

Mathematica

Answer 5

C (GCC), 4 haikus

int fac(int number) { // int fac int number
        if (number == 0) { // if number equals zero
                puts("Done."); return 1; // puts done return one
        }

        else return number // else return number
                * fac(number - 1); // times fac number minus one
        puts("Unreachable"); // puts unreachable
}

main(argc, argv) // main arg-c arg-v
        char ** argv; { // char pointer pointer arg-v
        char c = getchar(); // char c is getchar

        printf("%" // print-f ampersand
                "d", fac(c - '0')); // d fac c minus zero
        return +0; // return plus zero
}

Try It Online!

Answer 6

Clojure

(defn fact [n] (if                  # def-fun fact n if
  (zero? n) 1                       # zero question mark n 1
  (* n (fact (dec n)))))            # times n fact dec n

Answer 7

Python 2

print(reduce(lambda              # print reduce lambda
    a,b: a * b, range(1,         # a b a times b range one
        1 + input()), 1))        # one plus input, one

Answer 8

Python - Two Haikus

val = int(input())        -> val is int(input())
for hi in range(1,n):   -> for hi in range one to n
    val *= hi           -> val is val times hi

# Still a cool haiku    -> Just read it
print(n)                -> print val in parentheses
# Completed haiku       -> Just read it   

Try it online!