




import math

def      _SCREAMING_SNAKE_CASE     (				lowercase      :			int	):


      '''simple docstring'''



      lowerCamelCase_							=       0
      lowerCamelCase_							=       0
      while num > 0:
            lowerCamelCase_							=       num % 8
            lowerCamelCase_							=       octal + (remainder * math.floor(math.pow(10      ,				lowercase	)	))
            counter += 1
            lowerCamelCase_							=       math.floor(num / 8	)  # basically /= 8 without remainder if any
            # This formatting removes trailing '.0' from `octal`.
      return f"""0o{int(lowercase	)}"""

def      _SCREAMING_SNAKE_CASE     (				):


      '''simple docstring'''



      print('\n2 in octal is:'	)
      print(decimal_to_octal(2	)	)  # = 2
      print('\n8 in octal is:'	)
      print(decimal_to_octal(8	)	)  # = 10
      print('\n65 in octal is:'	)
      print(decimal_to_octal(65	)	)  # = 101
      print('\n216 in octal is:'	)
      print(decimal_to_octal(2_16	)	)  # = 330
      print('\n512 in octal is:'	)
      print(decimal_to_octal(5_12	)	)  # = 1000
      print('\n'	)


if __name__ == "__main__":
 main()











'''simple docstring'''







from __future__ import annotations





def 		_UpperCAmelCase (				__A				: str    ,		__A				: str   ):
				a_		:	int									=   get_failure_array(__A   )

				# 2) Step through text searching for pattern
				a_					,      a_		:	Any									=   0, 0  # index into text, pattern
				while i < len(__A   ):
								if pattern[j] == text[i]:
												if j == (len(__A   ) - 1):
																return True
												j += 1

								# if this is a prefix in our pattern
								# just go back far enough to continue
								elif j > 0:
												a_		:	Any									=   failure[j - 1]
												continue
								i += 1
				return False





def 		_UpperCAmelCase (				__A				: str   ):
				a_		:	Optional[Any]									=   [0]
				a_		:	Any									=   0
				a_		:	int									=   1
				while j < len(__A   ):
								if pattern[i] == pattern[j]:
												i += 1
								elif i > 0:
												a_		:	List[Any]									=   failure[i - 1]
												continue
								j += 1
								failure.append(__A   )
				return failure


if __name__ == "__main__":
		# Test 1)
		__lowerCAmelCase									=   'abc1abc12'
		__lowerCAmelCase									=   'alskfjaldsabc1abc1abc12k23adsfabcabc'
		__lowerCAmelCase									=   'alskfjaldsk23adsfabcabc'
		assert kmp(pattern, texta) and not kmp(pattern, texta)

		# Test 2)
		__lowerCAmelCase									=   'ABABX'
		__lowerCAmelCase									=   'ABABZABABYABABX'
		assert kmp(pattern, text)

		# Test 3)
		__lowerCAmelCase									=   'AAAB'
		__lowerCAmelCase									=   'ABAAAAAB'
		assert kmp(pattern, text)

		# Test 4)
		__lowerCAmelCase									=   'abcdabcy'
		__lowerCAmelCase									=   'abcxabcdabxabcdabcdabcy'
		assert kmp(pattern, text)

		# Test 5)
		__lowerCAmelCase									=   'aabaabaaa'
		assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]




