view paste/paste.14653 @ 9554:23f43464694e

<Zarutian> le/rn Frams\xc3\xb3knarflokkurinn/A, now defunct, political party in Iceland. Like its sister party Sj\xc3\xa1lfst\xc3\xa6\xc3\xb0isflokkurinn it is named by the antonym of what it is. (The name means the Progressive Party but they have nearly always been highly regressive). Think dumb Hill-Billies in ill fitting suits and you get their constiuents.
author HackBot
date Sun, 30 Oct 2016 14:33:24 +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]