day 2 part 1 solved!
parent
3adc1f38b9
commit
5a814f6c47
|
|
@ -0,0 +1,19 @@
|
||||||
|
raw_input = open('input.txt', "r").read().split(',')
|
||||||
|
input = []
|
||||||
|
|
||||||
|
for item in raw_input:
|
||||||
|
input.append(item.split('-'))
|
||||||
|
|
||||||
|
answer = 0
|
||||||
|
invalid_numbers = []
|
||||||
|
|
||||||
|
for item in input:
|
||||||
|
for i in range(int(item[0]), int(item[1]) + 1):
|
||||||
|
str_i = str(i)
|
||||||
|
if len(str_i) % 2 == 0:
|
||||||
|
halfway = int(len(str_i)/2)
|
||||||
|
if str_i[0:halfway] == str_i[halfway:]:
|
||||||
|
answer += i
|
||||||
|
invalid_numbers.append(i)
|
||||||
|
|
||||||
|
print(answer)
|
||||||
Loading…
Reference in New Issue