





'''simple docstring'''


def 							UpperCAmelCase_  (						__lowerCamelCase					:					str ):
   if n_term == "":
      return []
   lowercase_			:list    			= []
   for temp in range(int(__lowerCamelCase ) ):
      series.append(F'1/{temp + 1}' if series else "1" )
   return series


if __name__ == "__main__":
 lowerCAmelCase					:     Optional[int]												=input('''Enter the last number (nth term) of the Harmonic Series''')
 print('''Formula of Harmonic Series => 1+1/2+1/3 ..... 1/n''')
 print(harmonic_series(nth_term))









'''simple docstring'''


lowerCAmelCase					:     Optional[int]												=256
# Modulus to hash a string
lowerCAmelCase					:     Tuple												=1_000_003
def 							UpperCAmelCase_  (						__lowerCamelCase					:					str	,__lowerCamelCase					:					str ):
   lowercase_			:Dict    			= len(__lowerCamelCase )
   lowercase_			:int    			= len(__lowerCamelCase )
   if p_len > t_len:
      return False

   lowercase_			:Any    			= 0
   lowercase_			:Dict    			= 0
   lowercase_			:int    			= 1

   # Calculating the hash of pattern and substring of text
   for i in range(__lowerCamelCase ):
      lowercase_			:Union[str, Any]    			= (ord(pattern[i] ) + p_hash * alphabet_size) % modulus
      lowercase_			:Tuple    			= (ord(text[i] ) + text_hash * alphabet_size) % modulus
      if i == p_len - 1:
         continue
      lowercase_			:Tuple    			= (modulus_power * alphabet_size) % modulus

   for i in range(0	,t_len - p_len + 1 ):
      if text_hash == p_hash and text[i : i + p_len] == pattern:
         return True
      if i == t_len - p_len:
         continue
      # Calculate the https://en.wikipedia.org/wiki/Rolling_hash
      lowercase_			:Tuple    			= (
          (text_hash - ord(text[i] ) * modulus_power) * alphabet_size
          + ord(text[i + p_len] )
      ) % modulus
   return False
def 							UpperCAmelCase_  (						):
   lowercase_			:List[Any]    			= "abc1abc12"
   lowercase_			:List[str]    			= "alskfjaldsabc1abc1abc12k23adsfabcabc"
   lowercase_			:int    			= "alskfjaldsk23adsfabcabc"
   assert rabin_karp(__lowerCamelCase	,__lowerCamelCase ) and not rabin_karp(__lowerCamelCase	,__lowerCamelCase )

   # Test 2)
   lowercase_			:Union[str, Any]    			= "ABABX"
   lowercase_			:Optional[Any]    			= "ABABZABABYABABX"
   assert rabin_karp(__lowerCamelCase	,__lowerCamelCase )

   # Test 3)
   lowercase_			:Dict    			= "AAAB"
   lowercase_			:int    			= "ABAAAAAB"
   assert rabin_karp(__lowerCamelCase	,__lowerCamelCase )

   # Test 4)
   lowercase_			:Tuple    			= "abcdabcy"
   lowercase_			:Union[str, Any]    			= "abcxabcdabxabcdabcdabcy"
   assert rabin_karp(__lowerCamelCase	,__lowerCamelCase )

   # Test 5)
   lowercase_			:Tuple    			= "Lü"
   lowercase_			:List[Any]    			= "Lüsai"
   assert rabin_karp(__lowerCamelCase	,__lowerCamelCase )
   lowercase_			:str    			= "Lue"
   assert not rabin_karp(__lowerCamelCase	,__lowerCamelCase )
   print("Success." )


if __name__ == "__main__":
 test_rabin_karp()


