advent_of_code

advent of code solves
git clone https://git.pastanoggin.com/advent_of_code.git
Log | Files | Refs

a.py (527B)

      1 points = 0
      2 
      3 def contains(ran1, ran2):
      4     return ran1.start <= ran2.start and ran1.stop >= ran2.stop
      5 def overlap(ran1, ran2):
      6     return ran1.stop >= ran2.start and ran1.start <= ran2.stop
      7 
      8 #with open("example") as f:
      9 with open("input") as f:
     10     lines = f.readlines()
     11 for line in lines:
     12     r1, r2 = line.strip().split(",")
     13     r11, r12 = list(map(int, r1.split("-")))
     14     r21, r22 = list(map(int, r2.split("-")))
     15     ran1, ran2 = range(r11, r12), range(r21, r22)
     16     if overlap(ran1, ran2):
     17         points += 1
     18 print(points)