(no subject)
I wrote this obfuscated scheme program. It's beyond obfuscated actually, it's really just silly. Don't even try to figure out what it's doing, I promise it's not worth your time.
(require (lib "list.ss"))
(define (g n) (if (> n 11) '() (cons n (g (+ n 1)))))
(define (h n) (or (< n 4) (odd? n) (> (/ (log n) (log 3)) 2)))
(define (i n) (foldr string-append "" (map number->string (map char->integer (string->list n)))))
(define (j n) (if (equal? n "") '() (cons (substring n 0 2) (j (substring n 2 (string-length n))))))
(define (k n) (map (lambda (m) (map (lambda (o) (- (char->integer o) 48)) (string->list m))) n))
(for-each (lambda (x) (display (integer->char x))) (map (lambda (l) (+ 106 (apply * (map (lambda (x)
(list-ref (filter h (g -1)) x)) l)))) (k (j (i "ƤMôF<Į^ǂĝŴ")))))
(require (lib "list.ss"))
(define (g n) (if (> n 11) '() (cons n (g (+ n 1)))))
(define (h n) (or (< n 4) (odd? n) (> (/ (log n) (log 3)) 2)))
(define (i n) (foldr string-append "" (map number->string (map char->integer (string->list n)))))
(define (j n) (if (equal? n "") '() (cons (substring n 0 2) (j (substring n 2 (string-length n))))))
(define (k n) (map (lambda (m) (map (lambda (o) (- (char->integer o) 48)) (string->list m))) n))
(for-each (lambda (x) (display (integer->char x))) (map (lambda (l) (+ 106 (apply * (map (lambda (x)
(list-ref (filter h (g -1)) x)) l)))) (k (j (i "ƤMôF<Į^ǂĝŴ")))))