From c9e9eb6c6179573825ac2a37d81985fe7b6a8c55 Mon Sep 17 00:00:00 2001
From: tebarius <tba@gmx.li>
Date: Wed, 13 Dec 2023 20:34:08 +0100
Subject: [PATCH] =?UTF-8?q?13-1....=20ist=20Bl=C3=B6dsinn?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .idea/misc.xml |  1 -
 13/13-1.py     | 16 +++++++++++-----
 2 files changed, 11 insertions(+), 6 deletions(-)

diff --git a/.idea/misc.xml b/.idea/misc.xml
index 9313b0a..85992c8 100644
--- a/.idea/misc.xml
+++ b/.idea/misc.xml
@@ -1,4 +1,3 @@
-<?xml version="1.0" encoding="UTF-8"?>
 <project version="4">
   <component name="Black">
     <option name="sdkName" value="Python 3.11 (AdventOfCode2023)" />
diff --git a/13/13-1.py b/13/13-1.py
index fb82ba6..e2df38a 100644
--- a/13/13-1.py
+++ b/13/13-1.py
@@ -3,7 +3,7 @@
 data = []
 
 # parse input
-input_file = open("input-ex", "r")
+input_file = open("input", "r")
 pattern = []
 for line in input_file:
     line = line.strip()
@@ -43,6 +43,7 @@ def find_vertikal_mirror(matrix):
                 p1 = p1[::-1]
                 p1 = p1[:len(p2)]
      #           print("2: ",s,p1,p2)
+           # print(p1,p2)
             if p1 != p2:
                 is_mirror = False
         if is_mirror:
@@ -57,18 +58,23 @@ def find_horizontal_mirror(matrix):
     #for n in new_matrix:
     #   print(n)
     print("_____________________")
-    return find_vertikal_mirror(new_matrix)
-
+    t = find_vertikal_mirror(new_matrix)
+    if t<=len(matrix[0])/2:
+        return t+1
+    else:
+        return t
 
 solution = 0
 for m in data:
     #print(m)
+    horz =0
     for mn in m:
         print(mn)
     vert = find_vertikal_mirror(m)
-    horz = find_horizontal_mirror(m)
+    if vert == 0:
+        horz = find_horizontal_mirror(m)
     print(vert, horz)
-    solution += 100 * find_horizontal_mirror(m)
+    solution += 100 * horz
     solution += vert
 
 print("Lösung:", solution)