


"""simple docstring"""







import os
import time

import pytest

from datasets.utils.filelock import FileLock, Timeout
def 					a__			(				SCREAMING_SNAKE_CASE    :    Optional[int]				):


  '''simple docstring'''







  lowerCAmelCase     :     List[Any]								=							FileLock(str(tmpdir / "foo.lock"				)				)
  lowerCAmelCase     :     Dict								=							FileLock(str(tmpdir / "foo.lock"				)				)
  lowerCAmelCase     :     int								=							0.01
  with locka.acquire():
    with pytest.raises(SCREAMING_SNAKE_CASE				):
      lowerCAmelCase     :     Dict								=							time.time()
      locka.acquire(SCREAMING_SNAKE_CASE				)
      assert time.time() - _start > timeout





def 					a__			(				SCREAMING_SNAKE_CASE    :    Optional[int]				):


  '''simple docstring'''







  lowerCAmelCase     :     List[str]								=							"a" * 1_0_0_0 + ".lock"
  lowerCAmelCase     :     Optional[Any]								=							FileLock(str(tmpdir / filename				)				)
  assert locka._lock_file.endswith(".lock"				)
  assert not locka._lock_file.endswith(SCREAMING_SNAKE_CASE				)
  assert len(os.path.basename(locka._lock_file				)				) <= 2_5_5
  lowerCAmelCase     :     List[str]								=							FileLock(tmpdir / filename				)
  with locka.acquire():
    with pytest.raises(SCREAMING_SNAKE_CASE				):
      locka.acquire(0				)












from itertools import permutations



def _a				(	lowerCamelCase:   tuple )	->						bool:







      '''simple docstring'''






      if num[3] % 2 != 0:
            return False

      if (num[2] + num[3] + num[4]) % 3 != 0:
            return False

      if num[5] % 5 != 0:
            return False

      __A          =				[7, 11, 13, 17]
      for i, test in enumerate(lowerCamelCase ):
            if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
                  return False
      return True



def _a				(	lowerCamelCase:   int = 10 )	->						int:







      '''simple docstring'''






      return sum(
          int(''''''.join(map(lowerCamelCase					,				lowerCamelCase ) ) )
          for num in permutations(range(lowerCamelCase ) )
          if is_substring_divisible(lowerCamelCase ) )


if __name__ == "__main__":
       print(f'{solution() = }')





