archive
/
aoc-2015
Watch 1
Star 0
Fork 0
Code Issues 0 Pull Requests 0 Releases 0 Wiki Activity
Advent of code 2015 solutions https://adventofcode.com/2015/
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
19 Commits
1 Branch
Branch: master
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'master'
${ noResults }
aoc-2015/20.py

20.py 420B
Permalink History Raw

1234567891011 
  1. from itertools import chain

  2. 

  3. target = 34000000

  4. 

  5. flatten = chain.from_iterable

  6. factors = lambda n: set(flatten((i, n//i) for i in range(1, int(n**0.5)+1) if n % i == 0))

  7. presents1 = lambda n: 10 * sum(x for x in factors(n))

  8. presents2 = lambda n: sum(11 * x for x in factors(n) if n // x <= 50)

  9. 

  10. print(next(i for i in range(target) if presents1(i) > target))

  11. print(next(i for i in range(target) if presents2(i) > target))