day04_solve_puzzle1.py

"""
a few key facts about the password:

- It is a six-digit number.
- The value is within the range given in your puzzle input.
- Two adjacent digits are the same (like 22 in 122345).
- Going from left to right, the digits never decrease; they only ever increase or stay the same (like 111123 or 135679).

How many different passwords within the range given in your puzzle input meet these criteria?
"""

def is_ascending(numbers):
	ns = str(numbers)
	return all([ns[i] <= ns[i+1] for i in range(len(ns)-1)])

def has_same_adjacent(numbers):
	ns = str(numbers)
	return any([ns[i] == ns[i+1] for i in range(len(ns)-1)])


def check_rules(password, _min=0, _max=999999, length=6):
	return all((
		len(str(password)) == length,
		password <= _max,
		password >= _min,
		is_ascending(password),
		has_same_adjacent(password)
	))
	 


assert check_rules(111111) == True
assert check_rules(223450) == False
assert check_rules(123789) == False

_MIN = 146810
_MAX = 612564

print("puzzle 1:\t",sum([check_rules(i, _MIN, _MAX) for i in range(_MIN, _MAX+1)]))