[ create a new paste ] login | about

Link: http://codepad.org/HZwVjALJ    [ raw code | output | fork ]

programmingpraxis - Scheme, pasted on Dec 11:
1
2
3
4
5
6
7
8
; modular factorial

(define (mod-fact n m)
  (let loop ((k 2) (p 1))
    (if (< n k) p
      (loop (+ k 1) (modulo (* p k) m)))))

(display (mod-fact 1000000 1001001779))


Output:
1
744950559


Create a new paste based on this one


Comments: