Add solution 64

project_euler/problem_064/sol64.py

@@ -0,0 +1,40 @@
+#import time
+import time
+
+# square root function
+from math import sqrt
+
+# time at the start of program execution
+start = time.time()
+
+# function to calculate the continued fraction
+def cf(n):
+    mn = 0.0
+    dn = 1.0
+    a0 = int(sqrt(n))
+    an = int(sqrt(n))
+    period = 0
+    if a0 != sqrt(n):
+        while an != 2*a0:
+            mn = dn*an - mn
+            dn = (n - mn**2)/dn
+            an = int((a0 + mn)/dn)
+            period += 1
+    return period
+
+# counter
+counter = 0
+
+# for loop from 0 to 10000
+for i in xrange(10000):
+    if cf(i) % 2 != 0:
+        counter += 1
+
+# number of instances
+print counter
+
+# time at the end of program execution
+end = time.time()
+
+# total time taken to run the program
+print end - start