


"""simple docstring"""

from itertools import permutations


def lowerCAmelCase_      (				UpperCamelCase__	: tuple ):






 """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

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


def lowerCAmelCase_      (				UpperCamelCase__	: int = 10 ):






 """simple docstring"""







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


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




"""simple docstring"""

def lowerCAmelCase_      (				UpperCamelCase__	: str				,   UpperCamelCase__	: str ):






 """simple docstring"""







 assert x is not None
 assert y is not None

 __lowercase									=	len(UpperCamelCase__ )
 __lowercase									=	len(UpperCamelCase__ )

 # declaring the array for storing the dp values
 __lowercase									=	[[0] * (n + 1) for _ in range(m + 1 )]  # noqa: E741

 for i in range(1				,   m + 1 ):
  for j in range(1				,   n + 1 ):
   __lowercase									=	1 if x[i - 1] == y[j - 1] else 0

   __lowercase									=	max(l[i - 1][j]				,   l[i][j - 1]				,   l[i - 1][j - 1] + match )

 __lowercase									=	""""""
 __lowercase							,		__lowercase									=	m, n
 while i > 0 and j > 0:
  __lowercase									=	1 if x[i - 1] == y[j - 1] else 0

  if l[i][j] == l[i - 1][j - 1] + match:
   if match == 1:
    __lowercase									=	x[i - 1] + seq
   i -= 1
   j -= 1
  elif l[i][j] == l[i - 1][j]:
   i -= 1
  else:
   j -= 1

 return l[m][n], seq


if __name__ == "__main__":
       UpperCAmelCase__  							="AGGTAB"
       UpperCAmelCase__  							="GXTXAYB"
       UpperCAmelCase__  							=4
       UpperCAmelCase__  							="GTAB"

       UpperCAmelCase__							,      UpperCAmelCase__  							=longest_common_subsequence(a, b)
       print("len =", ln, ", sub-sequence =", subseq)
       import doctest

       doctest.testmod()
