aboutsummaryrefslogtreecommitdiff
path: root/Semestr 2/racket/l14z22/solution.rkt
diff options
context:
space:
mode:
authorFranciszek Malinka <franciszek.malinka@gmail.com>2021-10-05 21:49:54 +0200
committerFranciszek Malinka <franciszek.malinka@gmail.com>2021-10-05 21:49:54 +0200
commitc5fcf7179a83ef65c86c6a4a390029149e518649 (patch)
treed29ffc5b86a0d257453cedcf87d91a13d8bf3b0d /Semestr 2/racket/l14z22/solution.rkt
parentf8a88b6a4aba1f66d04711a9330eaba49a50c463 (diff)
Duzy commit ze smieciami
Diffstat (limited to 'Semestr 2/racket/l14z22/solution.rkt')
-rw-r--r--Semestr 2/racket/l14z22/solution.rkt87
1 files changed, 0 insertions, 87 deletions
diff --git a/Semestr 2/racket/l14z22/solution.rkt b/Semestr 2/racket/l14z22/solution.rkt
deleted file mode 100644
index 480c772..0000000
--- a/Semestr 2/racket/l14z22/solution.rkt
+++ /dev/null
@@ -1,87 +0,0 @@
-#lang racket
-
-(require racklog)
-
-(provide solve)
-
-;; transpozycja tablicy zakodowanej jako lista list
-(define (transpose xss)
- (cond [(null? xss) xss]
- ((null? (car xss)) (transpose (cdr xss)))
- [else (cons (map car xss)
- (transpose (map cdr xss)))]))
-
-;; procedura pomocnicza
-;; tworzy listę n-elementową zawierającą wyniki n-krotnego
-;; wywołania procedury f
-(define (repeat-fn n f)
- (if (eq? 0 n) null
- (cons (f) (repeat-fn (- n 1) f))))
-
-;; tworzy tablicę n na m elementów, zawierającą świeże
-;; zmienne logiczne
-(define (make-rect n m)
- (repeat-fn m (lambda () (repeat-fn n _))))
-
-;; predykat binarny
-;; (%row-ok xs ys) oznacza, że xs opisuje wiersz (lub kolumnę) ys
-(define %row-ok
- (%rel (xs ys zs n)
- [(null null)]
- [(xs (cons '_ ys))
- (%row-ok xs ys)]
- [((cons n xs) ys)
- (%stars ys n)
- (%cut-first-n ys zs n)
- (%row-ok xs zs)]))
-
-
-(define %suffix
- (%rel (xs ys x)
- [(xs xs)]
- [((cons x xs) ys)
- (%suffix xs ys)]))
-
-(define %cut-first-n
- (%rel (xs ys n yl)
- [(xs xs 0)]
- [(xs ys n)
- (%suffix xs ys)
- (%is #t (= (- (length xs) (length ys)) n))]))
-
-
-;; usun n pierwszych elementow z xs
-(define (suffix xs n)
- (if (= n 0)
- xs
- (suffix (cdr xs) (- n 1))))
-
-
-;; sprawdza czy pierwsze n elementów listy to gwiazdki (dokladnie n)
-(define %stars
- (%rel (xs m n)
- [(null 0)]
- [((cons '_ xs) n)
- (%is n 0)]
- [((cons '* xs) n)
- (%is m (- n 1))
- (%stars xs m)]))
-
-(define %board-ok
- (%rel (xss xs yss ys)
- [(null null)]
- [((cons xs xss) (cons ys yss))
- (%row-ok xs ys)
- (%board-ok xss yss)]))
-
-;; funkcja rozwiązująca zagadkę
-(define (solve rows cols)
- (define board (make-rect (length cols) (length rows)))
- (define tboard (transpose board))
- (define ret (%which (xss)
- (%= xss board)
- (%board-ok rows board)
- (%board-ok cols tboard)))
- (and ret (cdar ret)))
-
-