Merge branch 'master' of https://github.com/fschatbot/Advent-Calendar-Python

Author: fschatbot

.gitignore

@@ -3,4 +3,5 @@ config.py
 */inputs/*.txt
 Completed.md
 *.dump.*
-debug.html
+debug.html
+2024/14

2024/12.py

@@ -0,0 +1,61 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+def parse(data):
+	grid = {}
+	bounds = len(data.split('\n')[0]), len(data.split('\n'))
+	for y, line in enumerate(data.split('\n')):
+		for x, char in enumerate(line):
+			grid[(x, y)] = char
+	
+	return grid, bounds
+
+split_data = parse
+completed = 1
+raw_data = None # Not To be touched
+
+def part1(data):
+	grid, bounds = data
+	price = 0
+
+	def fencing(anchor):
+		x, y = anchor
+		area = 1
+		perimeter = 0
+		patch = set([(x, y)])
+		crop = grid[anchor]
+		movement = [(1, 0), (-1, 0), (0, 1), (0, -1)]
+		queue = [anchor]
+
+		while queue:
+			x, y = queue.pop(0)
+			for dx, dy in movement:
+				nx, ny = x + dx, y + dy
+				if not (0 <= nx < bounds[0] and 0 <= ny < bounds[1]):
+					perimeter += 1 # The border at the edge of the map
+				elif (nx, ny) in patch:
+					continue # Already seen this
+				elif grid[(nx, ny)] == crop:
+					area += 1
+					queue.append((nx, ny))
+					patch.add((nx, ny))
+				else:
+					perimeter += 1
+		
+		return area, perimeter, patch
+	
+	seen = set()
+
+	for y in range(bounds[1]):
+		for x in range(bounds[0]):
+			if (x, y) in seen: continue
+			area, perimeter, patch = fencing((x, y))
+			# print(f'A region of {grid[(x, y)]} plants with price {area} * {perimeter} = {area*perimeter}')
+			seen.update(patch)
+			price += area*perimeter
+
+	return price
+
+def part2(data):
+	grid, bounds = data
+	...

2024/13.py

@@ -0,0 +1,63 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+from re import findall
+
+def parse(data):
+	machines = []
+
+	for machine in data.split("\n\n"):
+		Ax,Ay,Bx,By,Px,Py = findall(r"(\d+)", machine)
+		machines.append((int(Ax),int(Ay),int(Bx),int(By),int(Px),int(Py)))
+
+	return machines
+
+split_data = parse
+completed = True
+raw_data = None # Not To be touched
+
+def part1(data):
+	# This can be solved quickly using some simple math
+	tokens = 0
+	for machine in data:
+		Ax,Ay,Bx,By,Px,Py = machine
+
+		for Bpress in range(101):
+			pending = Px - Bpress*Bx
+			if pending < 0: break # Looks like we are over shooting here...
+			Apress = pending / Ax
+			if Apress % 1 != 0 or Apress > 100:
+				continue # Not a valid solution
+
+			# By now Bpress is atmost 100, Apress is atmost 100 and both are integers
+			if Bpress*By + Apress*Ay == Py:
+				assert Apress*Ax + Bpress*Bx == Px # Just a flex!
+				tokens += Apress*3 + Bpress
+				break
+	
+	return int(tokens)
+
+def part2(data):
+	# We can do some simple math on paper and come up with the formula
+	# Ax * x + Bx * y = Px
+	# Ay * x + By * y = Py
+
+	# https://www.desmos.com/calculator/h566btcmir 
+
+	tokens = 0
+	for machine in data:
+		Ax,Ay,Bx,By,Px,Py = machine
+		Px += 10000000000000 # The only change
+		Py += 10000000000000 # The only change
+
+		aPress = ((By*Px) - (Bx*Py))/((By*Ax) - (Bx*Ay))
+		if aPress % 1 != 0 or aPress < 0: continue # We only accept integer solutions
+		bPress = (Px - aPress*Ax)/Bx
+		if bPress % 1 != 0 or aPress < 0: continue # We only accept integer solutions
+
+		# print(aPress, bPress)
+		assert aPress*Ax + bPress*Bx == Px and aPress*Ay + bPress*By == Py # Just a flex!
+		tokens += aPress*3 + bPress
+
+	
+	return int(tokens)

2024/14.py

@@ -0,0 +1,77 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+from PIL import Image
+import os
+
+def parse(data:str):
+	robots = []
+	for line in data.split("\n"):
+		p, v = line.split(' ')
+		p = p[2:].split(',')
+		v = v[2:].split(',')
+		robots.append(((int(p[0]), int(p[1])), (int(v[0]), int(v[1]))))
+	
+	return robots
+
+split_data = parse
+completed = True
+raw_data = None # Not To be touched
+
+def part1(data):
+	bx, by = 101, 103
+	quadrants = [0, 0, 0, 0]
+
+	# Simulation
+	for robot in data:
+		# Instant 100s simulation
+		((x, y), (vx, vy)) = robot
+		nx = (x + vx * 100) % bx
+		ny = (y + vy * 100) % by
+
+		# Figuring out which quadrant the robot is in.
+		if nx < bx // 2:
+			if ny < by // 2:
+				quadrants[0] += 1
+			elif ny > by // 2:
+				quadrants[1] += 1
+		elif nx > bx // 2:
+			if ny < by // 2:
+				quadrants[2] += 1
+			elif ny > by // 2:
+				quadrants[3] += 1
+	
+	# print(quadrants)
+	return quadrants[0] * quadrants[1] * quadrants[2] * quadrants[3]
+
+
+def part2(data):
+	bx, by = 101, 103
+
+	os.makedirs("2024/14", exist_ok=True)
+
+	# Simulation
+	robots = data
+	for i in range(1, 10_001):
+		nRobots = []
+
+		# Gray scale image
+		img = Image.new('L', (bx, by), 255)
+		for robot in robots:
+			# Instant 100s simulation
+			((x, y), (vx, vy)) = robot
+			nx = (x + vx) % bx
+			ny = (y + vy) % by
+
+			# Drawing the robot
+			img.putpixel((nx, ny), 0)
+
+			nRobots.append(((nx, ny), (vx, vy)))
+		
+		# Save the image
+		img.save(f"2024/14/{i}.png")
+		robots = nRobots
+	
+
+
+	print("Please open the folder 2024/14 and search for the file that forms a christmas tree. You will see 10,000 images and one of them forms the christmas tree.")

2024/7.py

@@ -0,0 +1,53 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+from typing import List
+from itertools import product
+
+split_data = True
+completed = True
+raw_data = None # Not To be touched
+
+def part1(data:List[str]):
+	result = 0
+
+	for line in data:
+		output, numbers = line.split(': ')
+		numbers = numbers.split(' ')
+
+		for operators in product(['+', '*'], repeat=len(numbers) - 1):
+			equation = int(numbers[0])
+			for op, num in zip(operators, numbers[1:]):
+				if op == '+':
+					equation += int(num)
+				else:
+					equation *= int(num)
+			
+			if equation == int(output):
+				result += int(output)
+				break
+	
+	return result
+
+def part2(data:List[str]):
+	result = 0
+
+	for line in data:
+		output, numbers = line.split(': ')
+		numbers = numbers.split(' ')
+
+		for operators in product(['+', '*', '||'], repeat=len(numbers) - 1):
+			equation = int(numbers[0])
+			for op, num in zip(operators, numbers[1:]):
+				if op == '+':
+					equation += int(num)
+				elif op == '*':
+					equation *= int(num)
+				else:
+					equation = int(str(equation)+num)
+			
+			if equation == int(output):
+				result += int(output)
+				break
+	
+	return result

2024/8.py

@@ -0,0 +1,59 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+from itertools import combinations
+
+def parse(data):
+	ants = {}
+	bounds = len(data.split('\n')[0]), len(data.split('\n'))
+	for y, line in enumerate(data.split('\n')):
+		for x, char in enumerate(line):
+			if char == '.': continue
+			if char not in ants: ants[char] = []
+			ants[char].append((x, y))
+	
+	return ants, bounds
+
+split_data = parse
+completed = True
+raw_data = None # Not To be touched
+
+def part1(data):
+	# Wow, this is pure math...
+	ants, bounds = data
+	antiNodes = set()
+	for nodes in ants.values():
+
+		for (a1x, a1y), (a2x, a2y) in combinations(nodes, r=2):
+			dx, dy = a2x - a1x, a2y - a1y
+			anti1 = (a1x - dx, a1y - dy)
+			anti2 = (a2x + dx, a2y + dy)
+
+			if 0 <= anti1[0] < bounds[0] and 0 <= anti1[1] < bounds[1]:
+				antiNodes.add(anti1)
+			if 0 <= anti2[0] < bounds[0] and 0 <= anti2[1] < bounds[1]:
+				antiNodes.add(anti2)
+
+	return len(antiNodes)
+
+def part2(data):
+	ants, bounds = data
+	antiNodes = set()
+	for nodes in ants.values():
+
+		for (a1x, a1y), (a2x, a2y) in combinations(nodes, r=2):
+			dx, dy = a2x - a1x, a2y - a1y
+
+			nx, ny = a1x, a1y
+			while 0 <= nx < bounds[0] and 0 <= ny < bounds[1]:
+				antiNodes.add((nx, ny))
+				nx -= dx
+				ny -= dy
+			
+			nx, ny = a1x, a1y
+			while 0 <= nx < bounds[0] and 0 <= ny < bounds[1]:
+				antiNodes.add((nx, ny))
+				nx += dx
+				ny += dy
+
+	return len(antiNodes)

Completed.md

@@ -2,11 +2,11 @@
 
 Over Here you can see the completion status of the project.
 
-Parts Completed: 301/500 (60.20%)
+Parts Completed: 310/500 (62.00%)
 <br>
-Days Completed: 147/250 (58.80%)
+Days Completed: 151/250 (60.40%)
 <br>
-Lines of code: 8577
+Lines of code: 8859
 
 ### Legend
 
@@ -17,7 +17,7 @@ Lines of code: 8577
 
 ||1|2|3|4|5|6|7|8|9|10|11|12|13|14|15|16|17|18|19|20|21|22|23|24|25|
 |---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
-|**2024**|✔|✔|✔|✔|✔|🚫|🚫|🚫|✔|✔|✔|🚫|🚫|🚫|🚫|🚫|✔|✔|🚫|🚫|🚫|🚫|🚫|🚫|🚫|
+|**2024**|✔|✔|✔|✔|✔|🚫|✔|✔|✔|✔|✔|½|✔|🚫|🚫|🚫|✔|✔|✔|🚫|🚫|🚫|🚫|🚫|🚫|
 |**2023**|✔|✔|✔|✔|½|✔|✔|✔|✔|½|✔|🚫|✔|✔|✔|✔|🚫|🚫|✔|🚫|½|🚫|🚫|🚫|🚫|
 |**2022**|✔|✔|✔|✔|✔|✔|✔|🚫|✔|✔|½|🚫|🚫|✔|🚫|🚫|🚫|✔|🚫|🚫|✔|½|✔|🚫|✔|
 |**2021**|✔|✔|✔|✔|✔|✔|✔|✔|✔|✔|✔|🚫|✔|✔|❌|🚫|🚫|🚫|🚫|🚫|🚫|🚫|🚫|🚫|🚫|

main.py

@@ -214,5 +214,8 @@ def formatTime(timeTaken:float) -> str:
 		if not raw_data:
 			print("Looks like the data doesn't exsist! Refetching data", end="\r")
 			collect_data(True)
+		elif args.submit:
+			print(f"Force Downloading data as it will be submitted", end="\r")
+			collect_data(True)
 		print("Running Code...",end="\r")
 		run_code()