Project Euler Problem 12

euler_12.py

#!/usr/bin/env python

import math as m

def check_div(num):
    ret = 0
    sq = m.sqrt(num)
    for i in range(1, int(round(sq))+1):
        if num % i == 0:
            ret += 1
    ret *= 2
    if sq * sq == num:
        ret += 1
    return ret

def eval(num):
    tri = (sum(range(1,x+1)) for x in range(10000000))
    tri.next()
    while True:
        val = tri.next()
        if check_div(val) > num:
            break
    return val

if __name__ == '__main__':
    print eval(500)