summaryrefslogtreecommitdiff
path: root/2025/aoc2025-d02.py
blob: a35e776a71d7327c89d6b37a8f14d4f9a39da7f1 (plain)
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
26
#advent of code 2025
#day 02

part1=0;
part2=0;
PuzzleInput=open("02.in","r").read();
for IDrange in PuzzleInput.split(","):
	IDs=[int(val) for val in IDrange.split("-")];
	for num in range(IDs[0],IDs[1]+1):
		strnum=str(num);
		numlen=len(strnum);
		half=numlen//2;
		for step in range(half,0,-1):
			sublist=[];
			i=0;
			while i < numlen:
				substring=strnum[i:i+step];
				sublist.append(substring);
				i+=step;
			subset=set(sublist);
			if len(subset)==1 and sublist.count(sublist[0])==len(sublist):
				if step==half and len(sublist)==2: part1+=num;
				part2+=num;
				break;
print("part 1",part1);
print("part 2",part2);