# Solution of;
# Project Euler Problem 203: Squarefree Binomial Coefficients
# https://projecteuler.net/problem=203
# 
# The binomial coefficients $\displaystyle \binom n k$ can be arranged in 
# triangular form, Pascal's triangle, like 
# this:111121133114641151010511615201561172135352171. . . . . . . . . It can 
# be seen that the first eight rows of Pascal's triangle contain twelve 
# distinct numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35. A positive 
# integer n is called squarefree if no square of a prime divides n. Of the 
# twelve distinct numbers in the first eight rows of Pascal's triangle, all 
# except 4 and 20 are squarefree. The sum of the distinct squarefree numbers 
# in the first eight rows is 105. Find the sum of the distinct squarefree 
# numbers in the first 51 rows of Pascal's triangle.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 203
    timed.caller(dummy, n, i, prob_id)
