From 4f25c213b0eb164023b5c8f8e1793b8e4b3f20db Mon Sep 17 00:00:00 2001
From: Ignotus404 <s2002251@sendai-nct.jp>
Date: Mon, 14 Oct 2024 00:29:18 +0900
Subject: [PATCH] =?UTF-8?q?merge:=E9=80=B2=E6=8D=97=E3=82=92=E5=90=8C?=
 =?UTF-8?q?=E6=9C=9F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 2024ProconTemporary/MainAlgorithm.cs | 96 ----------------------------
 1 file changed, 96 deletions(-)

diff --git a/2024ProconTemporary/MainAlgorithm.cs b/2024ProconTemporary/MainAlgorithm.cs
index a66265e..e58d328 100644
--- a/2024ProconTemporary/MainAlgorithm.cs
+++ b/2024ProconTemporary/MainAlgorithm.cs
@@ -376,99 +376,3 @@ public static void IndexCount(List<List<int>> Ques)
 
     }
 }
-<<<<<<< HEAD
-
-=======
-using System;
-
-namespace _2024ProconTemporary
-{
-
-    public class MainAlgorithm
-    {
-        Case cases = new Case();
-        Practice practice = new Practice();
-        Pattern _pattern = new Pattern();
-        List<List<int>> MatchInfo = new List<List<int>>();
-        List<List<int>> MatchInfos = new List<List<int>>();
-        delegate List<List<int>> DieCutting(List<List<int>> queues, float[,] pattern, int pointX, int pointY);
-
-        public static void MatchCalculate()
-        {
-
-            Case cases = new Case();
-            List<List<int>> matchInfo = new List<List<int>>();
-
-            float maxMatch = 0f;
-            int u = 0;
-            var queues = new List<List<int>>();
-            DieCutting dieCutting;
-            while (u < 10)
-            {
-                for (int direction = 0; direction < 4; direction++)
-                {
-
-                    if (direction == 0)
-                    {
-                        dieCutting = Case.DieCuttingUp;
-                    }
-                    else if (direction == 1)
-                    {
-                        dieCutting = Case.DieCuttingDown;
-                    }
-                    else if (direction == 2)
-                    {
-                        dieCutting = Case.DieCuttingLeft;
-                    }
-                    else
-                    {
-
-                        dieCutting = Case.DieCuttingRight;
-                    }
-                    for (int i = 0; i < 281; i++)
-                    {
-                        for (int y = 0; y < Practice.pieceY; y++)
-                        {
-                            for (int x = 0; x < Practice.pieceX; x++)
-                            {
-                                float matchR = MainAlgorithm.Check(Practice.answer, dieCutting(Practice.queues, Pattern.patternList[i], x, y));
-                                if (matchR > maxMatch)
-                                {
-                                    maxMatch = matchR;
-                                    queues = dieCutting(Practice.queues, Pattern.patternList[i], x, y);
-                                    matchInfo.Add(new List<int> { i, x, y, direction });
-                                }
-
-                            }
-                        }
-                    }
-                }
-                u++;
-                Console.WriteLine(maxMatch);
-            }
-        }
-        public static float Check(List<List<int>> ans, List<List<int>> queues)
-        {
-            var mass = Practice.pieceX * Practice.pieceY;
-            float match = 100f / mass;
-            float matchR = 0;
-            for (int y = 0; y < Practice.pieceY; y++)
-            {
-                for (int x = 0; x < Practice.pieceX; x++)
-                {
-                    if (ans[y][x] == queues[y][x])
-                    {
-                        matchR += match;
-                    }
-
-                }
-            }
-            return matchR;
-        }
-
-    }
-
-}
->>>>>>> 1a102b62e7acb715c63e48a9e9b68013bee04a6b:2024ProconTemporary/MainAlgorithm.cs
-=======
->>>>>>> c4db61f9c724339da4c913283f88617ff36fa6df