Solve problem 92

python/e099.py

@@ -0,0 +1,24 @@
+
+
+# def lower_upper_bound(a, b):
+#     print(a, b)
+#     return 0
+
+
+def euler_099():
+    with open("../txt/EulerProblem099.txt", "r") as f:
+        pairs = [(int(s[0]), int(s[1]), i)
+                 for i, line in enumerate(f.readlines())
+                 if (s := line.split(","))]
+
+    # pairs.sort()
+
+    print(pairs[:2])
+    return 0
+
+
+
+if __name__ == "__main__":
+    solution = euler_099()
+    print("e099.py: " + str(solution))
+    assert(solution == 0)