| from math import pow, sqrt | |
| MAX = 10000 | |
| MAX_PRIME = int(sqrt(sqrt(MAX))) | |
| primes = [prime for prime | |
| in [2] + range(3, MAX_PRIME, 2) | |
| if all(prime%i != 0 for i in range(2, prime))] | |
| for n in range(MAX_PRIME): | |
| if n in primes: | |
| perfectNumber = pow(2, n-1) * (pow(2, n)-1) |
| from PIL import Image | |
| from collections import Counter | |
| print Counter(Image.open('Santa.png').getdata()).most_common(10)[-1] |
| from itertools import permutations | |
| def largestPrimeFactor(n, i=2): | |
| while i * i <= n: | |
| i, n = (i+1, n) if n % i else (i, n//i) | |
| return n | |
| print min([largestPrimeFactor(int("".join(n))) for n in permutations("123456789")]) |
| with open('kilma_data_blindern.txt', 'r') as f: | |
| data = [fields for fields | |
| in [l.strip().split() for l in f.readlines()] | |
| if len(fields) >= 2 | |
| if fields[1][3:5] == "12"] | |
| print min(data, key=lambda x: float(x[3].replace(",", ".")))[1] |
| BLACK, WHITE, SIZE, MOVES = True, False, 10, [[-2,-1],[-2,1],[-1,-2],[-1,2],[1,-2],[1,2],[2,-1],[2,1]] | |
| pos, board = [0, 0], [[WHITE for _ in range(SIZE)] for _ in range(SIZE)] | |
| for _ in range(200): | |
| x, y = pos | |
| moves = map(lambda move: [x+move[0], y+move[1]], MOVES) | |
| validMoves = filter(lambda pos: SIZE > pos[0] >= 0 and SIZE > pos[1] >= 0, moves) | |
| sameColorMoves = filter(lambda move: board[x][y] == board[move[0]][move[1]], validMoves) | |
| pos = sameColorMoves[0] if sameColorMoves else validMoves[-1] |
| BLACK = True | |
| WHITE = False | |
| SIZE = 10 | |
| pos = [0, 0] | |
| board = [[WHITE for _ in range(SIZE)] for _ in range(SIZE)] | |
| def moves(x,y): | |
| return [[x-2, y-1],[x-2, y+1],[x-1, y-2],[x-1, y+2], | |
| [x+1, y-2],[x+1, y+2],[x+2, y-1],[x+2, y+1]] |
| MIN, MAX = 10, 100 | |
| primes = [str(prime) for prime | |
| in range(MIN, MAX) | |
| if all(prime%i != 0 for i in range(2, prime))] | |
| def takeLowest(n, primes): | |
| for i, prime in enumerate(primes): | |
| if prime.startswith(n): | |
| return primes.pop(i) | |
| raise Exception("No such number exists") |
| def palindrom(x): return x == x[::-1] | |
| print len([i for i | |
| in range(1,1000000) | |
| if palindrom(str(i)) and palindrom("{0:o}".format(i))]) |
| # Wicd template for eduroam (University of Bergen / Universitetet I Bergen) | |
| name = eduroam UIB | |
| author = Vegard Veiset | |
| version = 1 | |
| require username *Username password *Password | |
| ----- | |
| ctrl_interface=/var/run/wpa_supplicant | |
| network={ | |
| ssid="eduroam" |