From 9a66dc053e5223a6d9c93988c39d53c5e52e107c Mon Sep 17 00:00:00 2001
From: Jimin Yeon <gmini.y@gmail.com>
Date: Mon, 27 May 2019 15:47:01 +0900
Subject: [PATCH] [ingleby]190527 algorithm

---
 190527/ingleby/mouigosa.py | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 190527/ingleby/mouigosa.py

diff --git a/190527/ingleby/mouigosa.py b/190527/ingleby/mouigosa.py
new file mode 100644
index 0000000..bb4a765
--- /dev/null
+++ b/190527/ingleby/mouigosa.py
@@ -0,0 +1,24 @@
+def solution(answers):
+    patternA = [1, 2, 3, 4, 5]
+    patternB = [2, 1, 2, 3, 2, 4, 2, 5]
+    patternC = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
+    i = 0
+    a = 0
+    b = 0
+    c = 0
+    for s in answers :
+        if patternA[i%5] == s:
+            a=a+1
+        if patternB[i%8] == s:
+            b=b+1
+        if patternC[i%10] == s:
+            c=c+1
+        i = i+1
+    answer2 = [a,b,c]
+    maxt = max(answer2)
+    answer = []
+    i = 1
+    for idx in range(len(answer2)):
+        if answer2[idx] == maxt:
+            answer.append(idx + 1)
+    return answer