





# this script reports modified .py files under the desired list of top-level sub-dirs passed as a list of arguments, e.g.:
#   python ./utils/get_modified_files.py utils src tests examples
#
# it uses git to find the forking point and which files were modified - i.e. files not under git won't be considered
# since the output of this script is fed into Makefile commands it doesn't print a newline after the results

import re
import subprocess
import sys


__A     =    subprocess.check_output("git merge-base main HEAD".split()).decode("utf-8")
__A     =    subprocess.check_output(f'git diff --name-only {fork_point_sha}'.split()).decode("utf-8").split()

__A     =    "|".join(sys.argv[1:])
__A     =    re.compile(Rf'^({joined_dirs}).*?\.py$')

__A     =    [x for x in modified_files if regex.match(x)]
print(" ".join(relevant_modified_files), end="")








def 					lowerCAmelCase_			(	__a     ,   __a		)					->		Tuple:







  """simple docstring"""





  assert x is not None
  assert y is not None

  lowerCamelCase__:				Any        =len(__a		)
  lowerCamelCase__:				int        =len(__a		)

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

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

      lowerCamelCase__:				str        =max(l[i - 1][j]     ,   l[i][j - 1]     ,   l[i - 1][j - 1] + match		)

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

    if l[i][j] == l[i - 1][j - 1] + match:
      if match == 1:
        lowerCamelCase__:				Any        =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__":
     __A     =    "AGGTAB"
     __A     =    "GXTXAYB"
     __A     =    4
     __A     =    "GTAB"

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

     doctest.testmod()

