project euler

import math
import time

def problem3(x):
    i = 1
    while i<x:
        i += 1
        if x % i == 0:
            print i,
            break
    if x != 1:
        problem3(x/i)

def problem4():
    for i in range(1,901,1):
        a = 1000-i
        splitNum = a%10,a%100/10,a/100
        num = a*1000+splitNum[0]*100+splitNum[1]*10+splitNum[2]
        for i in range(100,1000,1):
            if num % i == 0 and num/i < 1000:
                print num / i,'*',i,'=',num
                return


def problem5():
    number = 1
    while(number % 5 !=0 or number % 7 !=0
            or number % 9 !=0 or number % 11 !=0
            or number % 11 !=0 or number % 13 !=0
            or number % 16 !=0 or number % 17 !=0
            or number % 19 !=0):
        number += 1
    print number

def problem6():
    x = 0
    y = 0
    for i in range(1,101,1):
        x += i**2
        y += i
    print y**2-x

liste = ['','']
def problem7(x):
    for h in range(1,x+1,1):
        liste.append(True)

    for i in range(2,int(math.sqrt(x)),1):
        if liste[i] == True:
            for j in range(i**2,x,i):
                liste[j] = False

    prim = []
    c = 1
    while len(prim)<10001:
        if liste[c] == True:
            prim.append(c)
        c += 1
    print prim[-1]


def problem8():
    tal = '''73167176531330624919225119674426574742355349194934
    96983520312774506326239578318016984801869478851843
    85861560789112949495459501737958331952853208805511
    12540698747158523863050715693290963295227443043557
    66896648950445244523161731856403098711121722383113
    62229893423380308135336276614282806444486645238749
    30358907296290491560440772390713810515859307960866
    70172427121883998797908792274921901699720888093776
    65727333001053367881220235421809751254540594752243
    52584907711670556013604839586446706324415722155397
    53697817977846174064955149290862569321978468622482
    83972241375657056057490261407972968652414535100474
    82166370484403199890008895243450658541227588666881
    16427171479924442928230863465674813919123162824586
    17866458359124566529476545682848912883142607690042
    24219022671055626321111109370544217506941658960408
    07198403850962455444362981230987879927244284909188
    84580156166097919133875499200524063689912560717606
    05886116467109405077541002256983155200055935729725
    71636269561882670428252483600823257530420752963450'''
    Tal = tal.replace('\n    ','')
    x = 1
    for i in range(1,997,1):
        y=int(Tal[-1+i:i])*int(Tal[i:i+1])*int(Tal[i+1:i+2])*int(Tal[i+2:i+3])*int(Tal[i+3:i+4])
        if y > x:
            x = y
    print x

def problem9():
    a = 1
    b = 0
    while True:
        b+=1
        for i in range(1,999,1):
            a = i
            c = math.sqrt(a**2+b**2)
            if a+b+c == 1000:
                print a*b*c,a,b,c
                return

liste = [False,False]
def problem10(x):
    for h in range(1,x+1,1):
        liste.append(True)

    for i in range(2,int(math.sqrt(x)),1):
        if liste[i] == True:
            for j in range(i**2,x,i):
                liste[j] = False

    Sum = []
    for ind in range(1,x,1):
        if liste[ind] == True:
            Sum.append(ind)
    print sum(Sum)

def problem11():
    grid = '''08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
    49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
    81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
    52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
    22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
    24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
    32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
    67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
    24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
    21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
    78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
    16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
    86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
    19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
    04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
    88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
    04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
    20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
    20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
    01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48'''
    grid = grid.replace('\n   ','')
    liste = grid.split(' ')
    item = 0
    G = [[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[]]
    for i in range(0,20,1):
        for j in range(0,20,1):
            G[i].append(int(liste[item]))
            item += 1
    y = 0
    x = 0
    horizontal = [0]
    vertical = [0]
    diagonalh = [0]
    diagonalv = [0]
    while True:
        try:
            producth = G[y][x]*G[y][x+1]*G[y][x+2]*G[y][x+3]
            productv = G[x][y]*G[x][y+1]*G[x][y+2]*G[x][y+3]
            x+=1
            if producth > horizontal[0]:
                horizontal[0] = producth
            if productv > vertical[0]:
                vertical[0] = productv
        except:
            y+=1
            x=0
        if y == 20:
            break
    y = 0
    x = 0
    while True:
        try:
            producth = G[y][x]*G[y+1][x+1]*G[y+2][x+2]*G[y+3][x+3]
            productv = G[x+3][y]*G[x+2][y+1]*G[x+1][y+2]*G[x][y+3]
            x+=1
            if producth > diagonalh[0]:
                diagonalh[0] = producth
            if productv > diagonalv[0]:
                diagonalv[0] = productv
        except:
            y+=1
            x=0
        if y == 20:
            break
    print max([horizontal[0],vertical[0],diagonalh[0],diagonalv[0]])

def problem12():
    pass