Solutions of some puzzles in Scheme (Lisp), my first experience with it.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

56 lines
1.4 KiB

10 months ago
#!/usr/bin/guile -s
!#
(use-modules (ice-9 rdelim))
(define (read-lines)
(let loop ((line (read-line)))
(if
(eof-object? line)
'()
(cons line (loop (read-line))))))
(define (id value) value)
10 months ago
(define (compose result-transformer f argument-transformer)
(lambda (value)
(result-transformer (f (argument-transformer value)))))
(define Y (lambda (f) (f (lambda (x) ((Y f) x)))))
(define (reduce-right reducer initial) (Y
(lambda (f) (lambda (list)
(if (null? list) initial (reducer (car list) (f (cdr list))))))))
(define (map mapper)
(reduce-right
(lambda (current accumulator) (cons (mapper current) accumulator))
'()))
10 months ago
(define (combine combiner)
(lambda (a b) (if (null? a) b (if (null? b) a (combiner a b)))))
10 months ago
(define sum (reduce-right + 0))
10 months ago
(define (repeat value) (Y
(lambda (f) (lambda (n)
(if (= n 0) '() (cons value (f (- n 1))))))))
10 months ago
10 months ago
(define (is-numeric-char char) (if (char-numeric? char) #t #f))
10 months ago
(define (first-last predicate) (compose
id
(reduce-right
(combine (lambda (left right) (cons (car left) (cdr right))))
'())
(map (lambda (entry) (if (predicate entry) ((repeat entry) 2) '())))))
(define solve-line (compose
(lambda (first-last-result) (string->number (list->string first-last-result)))
(first-last is-numeric-char)
string->list))
(define (solve-all lines) (sum ((map solve-line) lines)))
10 months ago
(display (solve-all (read-lines)))