From fbf3d5c6dc06db2c8e3bae1f25e4c46c8bd644d2 Mon Sep 17 00:00:00 2001
From: Mohammad S Anwar <mohammad.anwar@yahoo.com>
Date: Mon, 24 Aug 2020 12:30:32 +0100
Subject: - Moved Python solutions to the correct folder.

---
 challenge-075/roger-bell-west/python/ch-1.py  | 34 +++++++++++++++++++++++++++
 challenge-075/roger-bell-west/python/ch-2.py  | 24 +++++++++++++++++++
 challenge-075/roger-bell-west/python3/ch-1.py | 34 ---------------------------
 challenge-075/roger-bell-west/python3/ch-2.py | 24 -------------------
 4 files changed, 58 insertions(+), 58 deletions(-)
 create mode 100755 challenge-075/roger-bell-west/python/ch-1.py
 create mode 100755 challenge-075/roger-bell-west/python/ch-2.py
 delete mode 100755 challenge-075/roger-bell-west/python3/ch-1.py
 delete mode 100755 challenge-075/roger-bell-west/python3/ch-2.py

diff --git a/challenge-075/roger-bell-west/python/ch-1.py b/challenge-075/roger-bell-west/python/ch-1.py
new file mode 100755
index 0000000000..42d6b8dac2
--- /dev/null
+++ b/challenge-075/roger-bell-west/python/ch-1.py
@@ -0,0 +1,34 @@
+#! /usr/bin/python3
+
+import unittest
+
+def coinsum(c,s):
+    m=list()
+    for i in range(len(c)):
+        m.append(int(s/c[i]))
+    out=list()
+    b=[0 for i in range(len(c))]
+    of=1
+    while of:
+        v=sum(c[i]*b[i] for i in range(len(c)))
+        if v==s:
+            out.append(b.copy())
+        i=0
+        while 1:
+            b[i]+=1
+            if b[i]>m[i]:
+                b[i]=0
+                i+=1
+                if i>len(b)-1:
+                    of=0
+                    break;
+            else:
+                break;
+    return len(out)
+            
+class TestMajority(unittest.TestCase):
+
+    def test_ex(self):
+        self.assertEqual(coinsum((1,2,4),6),6,'example')
+
+unittest.main()
diff --git a/challenge-075/roger-bell-west/python/ch-2.py b/challenge-075/roger-bell-west/python/ch-2.py
new file mode 100755
index 0000000000..a87d8288fa
--- /dev/null
+++ b/challenge-075/roger-bell-west/python/ch-2.py
@@ -0,0 +1,24 @@
+#! /usr/bin/python3
+
+import unittest
+
+def lrhist(c):
+    bestarea=0
+    n=[0,0]
+    for a in range(len(c)-1):
+        for b in range(a+1,len(c)):
+            area=(b-a+1)*min(c[h] for h in range(a,b+1))
+            if (area>bestarea):
+                bestarea=area
+                n=[a,b]
+    return bestarea
+
+class TestMajority(unittest.TestCase):
+
+    def test_ex1(self):
+        self.assertEqual(lrhist((2,1,4,5,3,7)),12,'example 1')
+
+    def test_ex2(self):
+        self.assertEqual(lrhist((3,2,3,5,7,5)),15,'example 2')
+
+unittest.main()
diff --git a/challenge-075/roger-bell-west/python3/ch-1.py b/challenge-075/roger-bell-west/python3/ch-1.py
deleted file mode 100755
index 42d6b8dac2..0000000000
--- a/challenge-075/roger-bell-west/python3/ch-1.py
+++ /dev/null
@@ -1,34 +0,0 @@
-#! /usr/bin/python3
-
-import unittest
-
-def coinsum(c,s):
-    m=list()
-    for i in range(len(c)):
-        m.append(int(s/c[i]))
-    out=list()
-    b=[0 for i in range(len(c))]
-    of=1
-    while of:
-        v=sum(c[i]*b[i] for i in range(len(c)))
-        if v==s:
-            out.append(b.copy())
-        i=0
-        while 1:
-            b[i]+=1
-            if b[i]>m[i]:
-                b[i]=0
-                i+=1
-                if i>len(b)-1:
-                    of=0
-                    break;
-            else:
-                break;
-    return len(out)
-            
-class TestMajority(unittest.TestCase):
-
-    def test_ex(self):
-        self.assertEqual(coinsum((1,2,4),6),6,'example')
-
-unittest.main()
diff --git a/challenge-075/roger-bell-west/python3/ch-2.py b/challenge-075/roger-bell-west/python3/ch-2.py
deleted file mode 100755
index a87d8288fa..0000000000
--- a/challenge-075/roger-bell-west/python3/ch-2.py
+++ /dev/null
@@ -1,24 +0,0 @@
-#! /usr/bin/python3
-
-import unittest
-
-def lrhist(c):
-    bestarea=0
-    n=[0,0]
-    for a in range(len(c)-1):
-        for b in range(a+1,len(c)):
-            area=(b-a+1)*min(c[h] for h in range(a,b+1))
-            if (area>bestarea):
-                bestarea=area
-                n=[a,b]
-    return bestarea
-
-class TestMajority(unittest.TestCase):
-
-    def test_ex1(self):
-        self.assertEqual(lrhist((2,1,4,5,3,7)),12,'example 1')
-
-    def test_ex2(self):
-        self.assertEqual(lrhist((3,2,3,5,7,5)),15,'example 2')
-
-unittest.main()
-- 
cgit