From a456605d3f46b10d945277ac44197169a9f7ece0 Mon Sep 17 00:00:00 2001
From: Yuval Adam <yuv.adm@gmail.com>
Date: Fri, 15 Apr 2011 12:47:41 +0300
Subject: optimized - cut time in half

---
 2010/af_qual/a/3.out | 10 +++++-----
 2010/af_qual/a/a.py  |  6 +++---
 2 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/2010/af_qual/a/3.out b/2010/af_qual/a/3.out
index 2f34439..4ce6de3 100644
--- a/2010/af_qual/a/3.out
+++ b/2010/af_qual/a/3.out
@@ -6,11 +6,11 @@ Case #5: 11 56
 Case #6: 84 240
 Case #7: 413 584
 Case #8: 28 80
-Case #9: 634 634
+Case #9: 380 633
 Case #10: 190 242
-Case #11: 1117 1117
+Case #11: 450 667
 Case #12: 7 126
-Case #13: 764 764
+Case #13: 208 636
 Case #14: 301 831
 Case #15: 243 649
 Case #16: 258 429
@@ -26,9 +26,9 @@ Case #25: 3 94
 Case #26: 425 484
 Case #27: 623 923
 Case #28: 219 656
-Case #29: 442 442
+Case #29: 133 242
 Case #30: 691 800
-Case #31: 706 706
+Case #31: 317 338
 Case #32: 207 485
 Case #33: 63 64
 Case #34: 13 206
diff --git a/2010/af_qual/a/a.py b/2010/af_qual/a/a.py
index 541f6ed..1d6e22d 100644
--- a/2010/af_qual/a/a.py
+++ b/2010/af_qual/a/a.py
@@ -12,9 +12,9 @@ for j in range(n):
     
     res = (0, 0)
     for k in range(len(P)):
-        for l in range(len(P)-1):
-            if P[k]+P[l+1]==c:
-                res = [k+1, l+2]
+        for l in range(k+1, len(P)):
+            if P[k]+P[l]==c:
+                res = [k+1, l+1]
                 res.sort()
                 res = ' '.join(map(str, res))
                 break
-- 
cgit v1.3.1