<commit_before><commit_msg>Added solution to problem 25<commit_after># https://projecteuler.net/problem=25

# set target length
length_to_find = 1000

# set starting length
length = 0

# starting term number
term = 2

# set starting fib numbers
n_minus_2 = 0
n_minus_1 = 1


# loop until found
while True:

   # calculate n 
   n = n_minus_1 + n_minus_2

   # calculate length
   length = len(str(n))

   if length == length_to_find:
      # found so break the loop
      break
   
   # set previous values for next loop
   n_minus_2 = n_minus_1
   n_minus_1 = n

   # increase term count
   term += 1

# print the result
print term
{'fraction_non_alphanumeric': 0.06962025316455696, 'fraction_numerical': 0.03164556962025317, 'mean_word_length': 3.031847133757962, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1737288', 'n_tokens_mistral': 228, 'n_tokens_neox': 208, 'n_words': 72}