'''simple docstring'''

from .dependency_versions_table import deps
from .utils.versions import require_version, require_version_core


# define which module versions we always want to check at run time
# (usually the ones defined in `install_requires` in setup.py)
#
# order specific notes:
# - tqdm must be checked before tokenizers

lowerCAmelCase_ : Optional[int]						  =      [
    'python',
    'tqdm',
    'regex',
    'requests',
    'packaging',
    'filelock',
    'numpy',
    'tokenizers',
    'huggingface-hub',
    'safetensors',
    'accelerate',
    'pyyaml',
]

for pkg in pkgs_to_check_at_runtime:
       if pkg in deps:
              if pkg == "tokenizers":
                     # must be loaded here, or else tqdm check may fail
                     from .utils import is_tokenizers_available

                     if not is_tokenizers_available():
                            continue  # not required, check version only if installed
              elif pkg == "accelerate":
                     # must be loaded here, or else tqdm check may fail
                     from .utils import is_accelerate_available

                     # Maybe switch to is_torch_available in the future here so that Accelerate is hard dep of
                     # Transformers with PyTorch
                     if not is_accelerate_available():
                            continue  # not required, check version only if installed

              require_version_core(deps[pkg])
       else:
              raise ValueError(F'''can\'t find {pkg} in {deps.keys()}, check dependency_versions_table.py''')


def __a (	__lowerCamelCase			:						Any ,		__lowerCamelCase			:						Any=None				)	->							Optional[Any]:
      '''simple docstring'''


      require_version(deps[pkg] ,		lowerCamelCase_				)



'''simple docstring'''

def __a (	__lowerCamelCase			:						int = 200				)	->							int:
      '''simple docstring'''


      lowercase_     =      [1, 2, 5, 10, 20, 50, 100, 200]
      lowercase_     =      [0] * (pence + 1)
      lowercase_     =      1  # base case: 1 way to make 0 pence

      for coin in coins:
            for i in range(__lowerCamelCase ,		pence + 1 ,		1				):
                  number_of_ways[i] += number_of_ways[i - coin]
      return number_of_ways[pence]


if __name__ == "__main__":
       assert solution(200) == 73_682






