<gh_stars>0
# Solution of;
# Project Euler Problem 211: Divisor Square Sum
# https://projecteuler.net/problem=211
# 
# For a positive integer n, let σ2(n) be the sum of the squares of its 
# divisors. For example,σ2(10) = 1 + 4 + 25 + 100 = 130. Find the sum of all 
# n, 0 < n < 64,000,000 such that σ2(n) is a perfect square.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


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

# Solution of;
# Project Euler Problem 211: Divisor Square Sum
# https://projecteuler.net/problem=211
# 
# For a positive integer n, let σ2(n) be the sum of the squares of its 
# divisors. For example,σ2(10) = 1 + 4 + 25 + 100 = 130. Find the sum of all 
# n, 0 < n < 64,000,000 such that σ2(n) is a perfect square.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 211
    timed.caller(dummy, n, i, prob_id)
# Solution of; # Project Euler Problem 211: Divisor Square Sum # https://projecteuler.net/problem=211 # # For a positive integer n, let σ2(n) be the sum of the squares of its # divisors. For example,σ2(10) = 1 + 4 + 25 + 100 = 130. Find the sum of all # n, 0 < n < 64,000,000 such that σ2(n) is a perfect square. # # by lcsm29 http://github.com/lcsm29/project-euler