Merge pull request #1 from maryamdkh/maryamdkh-patch-1

Update challenge.py

Author: maryamdkh

tmu_ctf_too_many_challenge/challenge.py

@@ -1,26 +1,34 @@
 numbers = []
+dictionary ={}
+
 print ('starting')
 with open("numbers.txt") as f:
         content = f.readlines()
 for n in content:
-    numbers.append(int(n.strip()))
+  dictionary[int(n.strip())] = 0
+
+
 print ('numbers are ready')
 
+
+
 def func(x):
     print ('func started for %s' % x)
     # Returns the number of distinct pairs (y, z) from the numbers in the file "numbers.txt" whose y != z and (y + z) == x
     # Note that two pairs (y, z) and (z, y) are considered the same and are counted only once
     ans = set() 
     step = 0
-    for i in numbers:
+    for i in dictionary:
         j = x - i # we are looking for j where j+i == x
-        if j in numbers:
+        if j in dictionary:
             if j == i:
                 continue
             elif j > i:
                 ans.add((j,i))
             else:
                 ans.add((i,j))
+                
+    print(len(ans) )
     return len(ans)