Mercurial > repo

view paste/paste.14653 @ 10176:00ca58f2763c

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
<oerjan> learn The `words dictionary framework was designed by H\xc3\xa5lgar Oslekk, Bick Noffrey, Guiston Degra\xc3\xaeme, Myyntti Raatalla, G\xc3\xb6lrika Rosenskild, Waslomir Siwovich, Gy\xc5\x91rvan S\xc3\xa1rbik, and Pastronella Gattrovezzi.
author HackBot
date Sat, 28 Jan 2017 18:46:09 +0000
parents 5db7fb79f86d
children
line wrap: on
line source

2008-09-02.txt:16:36:21: <AnMaster> 1> [ X || {a, X} <- [{a,1},{b,2},{c,3},{a,4},hello,"wow"]].
2009-06-05.txt:15:41:48: <AnMaster> 8> [ X || {a, X} <- [{a,1},{b,2},{c,3},{a,4},hello,"foo"]].
2009-06-25.txt:16:29:47: <ehird> > let primes = [ x | x <- [2..], not (any ((== 0) . (`mod` x)) primes) ] in primes
2009-10-05.txt:20:19:29: <ais523> [ x | x ] is lambda x . x
2010-03-09.txt:12:36:43: <ais523> alise: planned Feather syntax is [ x | f x ]
2010-03-09.txt:15:00:03: <AnMaster> <ais523> alise: planned Feather syntax is [ x | f x ] <-- yay Feather!
2013-02-21.txt:00:01:01: <nooga> i got let d n = [ x | x <- [1..n-1], n `mod` x == 0 ] and let sd n = sum $ d n
2013-02-21.txt:14:04:30: <nooga> http://projecteuler.net/problem=21 my solution: let sd n = sum [ x | x <- [1..n-1], n `mod` x == 0 ] in sum [x | x <- [1..10000], x /= sd x, (sd $ sd x) == x]