steloflute

In newLISP (slice (randomize (sequence 1 45)) 0 6) ; 로또 1등이 얼마나 되기 어려운지 실험 (define (lotto) (slice (randomize (sequence 1 45)) 0 6)) (let (i 0) (while (!= n '(1 2 3 4 5 6)) (++ i) (setq n (lotto)) (println i " " n)))

In Paren (set contains? (fn (x lst) (set found false) (set i (dec (length lst))) (while (&& (>= i 0) (! found)) (when (== x (nth i lst)) (set found true)) (-- i)) found)) (set lotto (fn () (set r (list)) (while (< (length r) 6) (set x (inc (int (* (rand) 45)))) (when (! (contains? x r)) (set r (cons x r)))) (prn r))) (lotto)

(take 5 (shuffle (range 1 46)))

In Parenjs (set nums []) (set r []) (while (< r.length 6) (set n (floor (inc (* (rand) 45)))) (when (! nums[n]) (set nums[n] true) (r.push n))) (r.sort -)

#lang racket (let loop ([r (set)]) (cond [(>= (set-count r) 6) (display r)] [else (loop (set-add r (add1 (random 45))))]))

package main import ( "fmt" "math/rand" "time" ) func main() { r := map[int]bool{} rand.Seed(time.Now().UnixNano()) for len(r) < 6 { r[rand.Intn(45)+1] = true } for x := range r { fmt.Println(x) } }

nums = []; r = []; while (r.length < 6) { n = Math.floor(Math.random() * 45 + 1); if (!nums[n]) { nums[n] = true; r.push(n); } } r.sort(function(a,b){return a-b}); document.writeln(r); Output:

import random; print(sorted(random.sample(range(1,46),6)))

import java.util.TreeSet; public class Lotto { public static void main(String[] args) { for (int x : lottoNums()) System.out.print(x + " "); } public static TreeSet lottoNums() { TreeSet r = new TreeSet(); while (r.size() < 6) r.add((int) (Math.random() * 45 + 1)); return r; } }