# Solution of;
# Project Euler Problem 187: Semiprimes
# https://projecteuler.net/problem=187
# 
# A composite is a number containing at least two prime factors. For example, 
# 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3. There are ten composites below thirty 
# containing precisely two, not necessarily distinct, prime factors:4, 6, 9, 
# 10, 14, 15, 21, 22, 25, 26. How many composite integers, n < 108, have 
# precisely two, not necessarily distinct, prime factors?
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


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