Name: Anonymous 2012-01-21 6:59
How come it isn't used outside of academia?
(for-each (lambda (thread)
(for-each (lambda (post)
(if (eq (mod (number post) 11) 0)
(reply :thread thread
:name ""
:email "sage"
:text ">>%d nice dubz bro[i]![/i]")))
(post-list thread)))
thread-list)
(defun repeated-digits-unit (digits)
(if (eq digits 1)
1
(+ (expt (repeated-digits-unit (- digits 1)) 10) 1)))
(defun maximum-repeating-postfix-digits (num)
(labels ((check-digits (digits)
(cond ((eq digits 1) 1)
((eq (mod (mod num (expt 10 digits))
(repeated-digits-unit digits))
0)
digits)
(t check-digits (- digits 1)))))
(check-digits (ceiling (log 10 num)))))
(for-each (lambda (thread)
(for-each (lambda (post)
(let* ((post-number (number post)))
((arity (maximum-repeating-postfix-digits post-number)))
(if (> arity 1)
(reply :thread thread
:name ""
:email "sage"
:text (concat ">>"
(string post-number)
" "
(cond ((eq? arity 2) "nice double bro[i]![/i]")
((eq? arity 3) "whoa shit! trips! nice trips bro!")
((eq? arity 4) "quads! fucken quads! screen cap this shit /b/ros!")
((eq? arity 5) "Lok@demQUINTS! EPIC QUINTS BRO!")
((eq? arity 6) "those are some sexy sextupples bro.")
(t "I don't even know the name for that many tuppels bro.")))))))
(post-list thread)))
thread-list)
(define reversed-digit-stream (num base)
(lambda ()
(if (= num 0)
#f
(let ((value (mod num base)))
(set! num (/ num base))
value))))
(define (maximum-repeating-prefix-length stream)
(letrec ((first-value (stream)))
((helper (lambda (count)
(if (eq? (stream) first-value)
(helper (+ count 1))
count)))))
(if (eq? first-value #f)
0
(helper 1))))
(define (maximum-repeating-postfix-digits num base)
(maximum-repeating-prefix-length (reversed-digit-stream num base)))
(defn dubz? [d]
(>=
(count (filter
(fn equal-parts? [n]
(= 1 (count (distinct (partition n (str d))))))
(rest
((fn factorize [n]
(map
#(/ n %)
(filter #(zero? (rem n %)) (range 1 (+ n 1)))))
(count (str d))))))
1))
(dubz? 1)
=> false
(dubz? 11)
=> true
(dubz? 123)
=> false
(dubz? 123123)
=> true
(dubz? 'dubzdubzdubz)
=> true
(defn tupz [d]
(let [d (str d) l (count d)]
(reduce (fn [tuples size]
(if (= 1 (count (distinct (partition size d))))
(assoc tuples (/ l size) (subs d 0 size))
tuples))
{}
((fn factorize [n]
(filter #(zero? (rem n %)) (range 1 n)))
l))))
(defn dubz? [n] (contains? (tupz n) 2))
(defn quadz? [n] (contains? (tupz n) 4))
(dubz? 123123)
=> true
(dubz? 123123123123)
=> true
(quadz? 123123)
=> false
(quadz? 123123123123)
=> true
(tupz 123123123123)
=> {2 "123123", 4 "123"}
#include <string.h>
int dubs(char *dubs) {
size_t n = strlen(dubs);
if (n < 2) return 0;
if (dubs[n-1] == dubs[n-2]) return 1;
return 0;
}
+/∧\⊖N[⍴N]⍷N←((⌈10⍟1+N)/10)⊤N←1123456777=/10 10⊤12344