# Solution of;
# Project Euler Problem 292: Pythagorean Polygons
# https://projecteuler.net/problem=292
# 
# We shall define a pythagorean polygon to be a convex polygon with the 
# following properties:there are at least three vertices,no three vertices are 
# aligned,each vertex has integer coordinates,each edge has integer length. 
# For a given integer n, define P(n) as the number of distinct pythagorean 
# polygons for which the perimeter is ≤ n. Pythagorean polygons should be 
# considered distinct as long as none is a translation of another. You are 
# given that P(4) = 1, P(30) = 3655 and P(60) = 891045. Find P(120).
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


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