View difference between Paste ID: cUk08bbg and m9ns8ZgJ

 from __future__ import division
 import itertools as it
 import numpy as np
 l = input('How many lattices?_')
 m = input('How many markers?_')
 sums = 0
 sumcount = 0
 pos = 1
 neg = -1
-L = list(it.product([-1,1], repeat =l))
+L = it.product([-1,1], repeat =l)
-M = range(0,l) # makes a list from 0 to l-1, giving l entries, starting with 0 just like the indices of the lattices.
+M = range(0,l)
-Markers = list(it.combinations(M, m))
+markers = it.combinations(M, m)
-i = 0
+
-j = 0
+for ring in L:
     for marker in markers:
-while i < len(L):
+        while k < 2*len(ring):
-    Ring = L[i]
+            ring = list(np.roll(ring,1))
-    while j < len(Markers):
+            for x in marker:
-        while k < 2*len(Ring):
+                t = ring.pop(x)
-            Marker = Markers[j]
+
-            Ring = list(np.roll(Ring,1))
+                    ring.insert(x,pos)
-            for x in Marker:
+
-                t = Ring.pop(x)
+                    ring.insert(x,neg)
                 else:
-                    Ring.insert(x,pos)
+
                 sums = sums + abs(sum(ring))
-                    Ring.insert(x,neg)
+                sumcount = sumcount + 1
                 k = k + 1
         k = 0
-            sums = sums + abs(sum(Ring))
+
-            sumcount = sumcount + 1
+
-            k = k + 1
+