From d56bb32696e8152daa8fe65917b48fbe1a9c11c3 Mon Sep 17 00:00:00 2001 From: daviddoji Date: Wed, 28 Sep 2022 20:30:06 +0200 Subject: [PATCH] Adopted new convention from template --- src/Python/Problems001-050/Problem026.py | 13 +++++++------ 1 file changed, 7 insertions(+), 6 deletions(-) diff --git a/src/Python/Problems001-050/Problem026.py b/src/Python/Problems001-050/Problem026.py index 0687ba8..abfc519 100644 --- a/src/Python/Problems001-050/Problem026.py +++ b/src/Python/Problems001-050/Problem026.py @@ -1,4 +1,4 @@ -#!/usr/bin/env python3 +#!/usr/bin/env python """ Created on 11 Sep 2019 @@ -34,8 +34,9 @@ def compute(): Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part. """ + cycle_length = 0 - number_d = 0 + ans = 0 for number in range(3, 1000, 2): if number % 5 == 0: continue @@ -43,10 +44,10 @@ def compute(): while 10**p % number != 1: p += 1 if p > cycle_length: - cycle_length, number_d = p, number - return number_d + cycle_length, ans = p, number + + return ans if __name__ == "__main__": - - print(f"Result for Problem 26: {compute()}") \ No newline at end of file + print(f"Result for Problem 26 is {compute()}")