Made all problems executable for a Linux pc.

problem24.py

+#!/usr/bin/env python
 from itertools import permutations
 
 for i, p in enumerate(permutations(range(10))):

problem243.py

+#!/usr/bin/env python
 def is_resilient(n, d):
     if n == 1:
         return True

problem26.py

+#!/usr/bin/env python
 from decimal import Decimal as D
 import re
 

problem29.py

+#!/usr/bin/env python
 def combos(A, B):
     c = set()
 

problem364.py

+#!/usr/bin/env python
 from copy import copy
 from sys import argv, exit, setrecursionlimit
 

problem41.py

+#!/usr/bin/env python
 def is_prime(n):
     if n == 2:
         return True

problem42.py

+#!/usr/bin/env python
 words = open('words.txt', 'r').read()[1:-1].split('","')
 
 def word_value(word):

problem81.py

+#!/usr/bin/env python
 from numpy import array
 
 m = array([l.split(',') for l in open('matrix.txt', 'r').readlines()],

problem92.py

+#!/usr/bin/env python
 def digits(n):
     return [n] if n < 10 else digits(n / 10) + [n % 10]