


def 	_lowerCamelCase  (		A_  :	str      )			->			str:

   '''simple docstring'''






   UpperCamelCase__ :			Tuple 						=word.upper()
   UpperCamelCase__ :			Union[str, Any] 						=0
   UpperCamelCase__ :			List[Any] 						={}
   UpperCamelCase__ :			Union[str, Any] 						=[]

   for letter in word:
      if letter not in letter_nums:
         UpperCamelCase__ :			Tuple 						=str(A_      )
         next_num += 1
      word_pattern.append(letter_nums[letter]      )
   return ".".join(A_      )


if __name__ == "__main__":
     import pprint
     import time

     __UpperCAmelCase      			=  time.time()
     with open("""dictionary.txt""") as in_file:
          __UpperCAmelCase      			=  in_file.read().splitlines()

     __UpperCAmelCase      			=  {}
     for word in word_list:
          __UpperCAmelCase      			=  get_word_pattern(word)
          if pattern in all_patterns:
               all_patterns[pattern].append(word)
          else:
               __UpperCAmelCase      			=  [word]

     with open("""word_patterns.txt""", """w""") as out_file:
          out_file.write(pprint.pformat(all_patterns))

     __UpperCAmelCase      			=  round(time.time() - start_time, 2)
     print(F"""Done!  {len(all_patterns):,} word patterns found in {total_time} seconds.""")
     # Done!  9,581 word patterns found in 0.58 seconds.





def 	_lowerCamelCase  (		A_  :	float							,  A_  :	float							,  A_  :	int      )			->			float:

   '''simple docstring'''






   UpperCamelCase__ :			Union[str, Any] 						=[1 / first_term]
   UpperCamelCase__ :			Tuple 						=1 / first_term
   for _ in range(number_of_terms - 1      ):
      first_term += common_difference
      arithmetic_progression.append(A_      )
   UpperCamelCase__ :			List[str] 						=[1 / step for step in arithmetic_progression]
   return sum(A_      )


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     print(sum_of_harmonic_progression(1 / 2, 2, 2))

