From ca5e80f8f4690b38832551381255769d2927437b Mon Sep 17 00:00:00 2001
From: Yuval Adam <yuv.adm@gmail.com>
Date: Fri, 13 May 2011 13:11:36 +0300
Subject: got the right algorithm down

---
 2010/1c/a.py | 13 +++++++------
 1 file changed, 7 insertions(+), 6 deletions(-)

(limited to '2010')

diff --git a/2010/1c/a.py b/2010/1c/a.py
index eb1bb67..1dd162d 100644
--- a/2010/1c/a.py
+++ b/2010/1c/a.py
@@ -12,12 +12,13 @@ for t in xrange(T):
     wires.sort(key=lambda wire: wire[0])
     
     cross = 0
-    bwires = [x[1] for x in wires]
-    print bwires
-    bwd = [bwires[i+1]-bwires[i] for i in range(len(bwires)-1)]
-    print bwd
-    res = len([x for x in bwd if x < 0])
+    bw = [x[1] for x in wires]
     
-    s = "Case #%d: %s\n" % (t+1, res)
+    for i in range(len(bw)):
+        for j in range(i+1, len(bw)):
+            if bw[i] > bw[j]:
+                cross += 1
+    
+    s = "Case #%d: %s\n" % (t+1, cross)
     print s
     #o.write(s)
-- 
cgit v1.3.1