## Here is some Python code!

# sample Python code snippet # bonus points if you know what this is from __future__ import generators def firstn(g, n): for i in range(n): yield g.next() def intsfrom(i): while 1: yield i i = i + 1 def exclude_multiples(n, ints): for i in ints: if (i % n): yield i def sieve(ints): while 1: prime = ints.next() yield prime ints = exclude_multiples(prime, ints) if __name__ == '__main__': for i in firstn(sieve(intsfrom(2)), 400): print i

Advertisements

How did you do that?