
'''simple docstring'''
lowerCAmelCase :  Optional[int]      =      {
    'A': ('ABCDEFGHIJKLM', 'NOPQRSTUVWXYZ'),
    'B': ('ABCDEFGHIJKLM', 'NOPQRSTUVWXYZ'),
    'C': ('ABCDEFGHIJKLM', 'ZNOPQRSTUVWXY'),
    'D': ('ABCDEFGHIJKLM', 'ZNOPQRSTUVWXY'),
    'E': ('ABCDEFGHIJKLM', 'YZNOPQRSTUVWX'),
    'F': ('ABCDEFGHIJKLM', 'YZNOPQRSTUVWX'),
    'G': ('ABCDEFGHIJKLM', 'XYZNOPQRSTUVW'),
    'H': ('ABCDEFGHIJKLM', 'XYZNOPQRSTUVW'),
    'I': ('ABCDEFGHIJKLM', 'WXYZNOPQRSTUV'),
    'J': ('ABCDEFGHIJKLM', 'WXYZNOPQRSTUV'),
    'K': ('ABCDEFGHIJKLM', 'VWXYZNOPQRSTU'),
    'L': ('ABCDEFGHIJKLM', 'VWXYZNOPQRSTU'),
    'M': ('ABCDEFGHIJKLM', 'UVWXYZNOPQRST'),
    'N': ('ABCDEFGHIJKLM', 'UVWXYZNOPQRST'),
    'O': ('ABCDEFGHIJKLM', 'TUVWXYZNOPQRS'),
    'P': ('ABCDEFGHIJKLM', 'TUVWXYZNOPQRS'),
    'Q': ('ABCDEFGHIJKLM', 'STUVWXYZNOPQR'),
    'R': ('ABCDEFGHIJKLM', 'STUVWXYZNOPQR'),
    'S': ('ABCDEFGHIJKLM', 'RSTUVWXYZNOPQ'),
    'T': ('ABCDEFGHIJKLM', 'RSTUVWXYZNOPQ'),
    'U': ('ABCDEFGHIJKLM', 'QRSTUVWXYZNOP'),
    'V': ('ABCDEFGHIJKLM', 'QRSTUVWXYZNOP'),
    'W': ('ABCDEFGHIJKLM', 'PQRSTUVWXYZNO'),
    'X': ('ABCDEFGHIJKLM', 'PQRSTUVWXYZNO'),
    'Y': ('ABCDEFGHIJKLM', 'OPQRSTUVWXYZN'),
    'Z': ('ABCDEFGHIJKLM', 'OPQRSTUVWXYZN'),
}







def 						A_(			A		:						str):
							return [alphabet[char] for char in key.upper()]







def 						A_(			A		:						str						,			A		:						str):
							UpperCamelCase					       =			''
							UpperCamelCase					       =			0
							UpperCamelCase					       =			generate_table(A)
							for char in words.upper():
														cipher += get_opponent(table[count]						,			A)
														UpperCamelCase					       =			(count + 1) % len(A)
							return cipher







def 						A_(			A		:						str						,			A		:						str):
							return encrypt(A						,			A)







def 						A_(			A		:						tuple[str, str]						,			A		:						str):
							UpperCamelCase					       =			0 if char in table[0] else 1
							UpperCamelCase					       =			table[row].index(A)
							return row, col







def 						A_(			A		:						tuple[str, str]						,			A		:						str):
							UpperCamelCase       ,     UpperCamelCase					       =			get_position(A						,			char.upper())
							if row == 1:
														return table[0][col]
							else:
														return table[1][col] if row == 0 else char


if __name__ == "__main__":
						import doctest

						doctest.testmod()  # Fist ensure that all our tests are passing...
						lowerCAmelCase :  str      =      input('Enter key: ').strip()
						lowerCAmelCase :  Any      =      input('Enter text to encrypt: ').strip()
						lowerCAmelCase :  int      =      encrypt(key, text)

						print(f"""Encrypted: {cipher_text}""")
						print(f"""Decrypted with key: {decrypt(key, cipher_text)}""")






'''simple docstring'''
def 						A_(			A		:						list[list[int]]):
							if len(A) == 0 or not all(len(A) == 2 for pair in coordinates):
														raise ValueError('The program cannot work out a fitting polynomial.')

							if len({tuple(A) for pair in coordinates}) != len(A):
														raise ValueError('The program cannot work out a fitting polynomial.')

							UpperCamelCase					       =			{x for x, _ in coordinates}
							if len(A) == 1:
														return f'''x={coordinates[0][0]}'''

							if len(A) != len(A):
														raise ValueError('The program cannot work out a fitting polynomial.')

							UpperCamelCase					       =			len(A)

							UpperCamelCase					       =			0
							UpperCamelCase					       =			[]
							# put the x and x to the power values in a matrix
							while count_of_line < x:
														UpperCamelCase					       =			0
														UpperCamelCase					       =			coordinates[count_of_line][0]
														UpperCamelCase					       =			[]
														while count_in_line < x:
																					count_line.append(a ** (x - (count_in_line + 1)))
																					count_in_line += 1
														matrix.append(A)
														count_of_line += 1

							UpperCamelCase					       =			0
							# put the y values into a vector
							UpperCamelCase					       =			[]
							while count_of_line < x:
														vector.append(coordinates[count_of_line][1])
														count_of_line += 1

							UpperCamelCase					       =			0

							while count < x:
														UpperCamelCase					       =			0
														while zahlen < x:
																					if count == zahlen:
																												zahlen += 1
																					if zahlen == x:
																												break
																					UpperCamelCase					       =			matrix[zahlen][count] / matrix[count][count]
																					for counting_columns, item in enumerate(matrix[count]):
																												# manipulating all the values in the matrix
																												matrix[zahlen][counting_columns] -= item * bruch
																					# manipulating the values in the vector
																					vector[zahlen] -= vector[count] * bruch
																					zahlen += 1
														count += 1

							UpperCamelCase					       =			0
							# make solutions
							UpperCamelCase					       =			[]
							while count < x:
														solution.append(str(vector[count] / matrix[count][count]))
														count += 1

							UpperCamelCase					       =			0
							UpperCamelCase					       =			'f(x)='

							while count < x:
														UpperCamelCase					       =			solution[count].split('E')
														if len(A) > 1:
																					UpperCamelCase					       =			f'''{remove_e[0]}*10^{remove_e[1]}'''
														solved += f'''x^{x - (count + 1)}*{solution[count]}'''
														if count + 1 != x:
																					solved += "+"
														count += 1

							return solved


if __name__ == "__main__":
						print(points_to_polynomial([]))
						print(points_to_polynomial([[]]))
						print(points_to_polynomial([[1, 0], [2, 0], [3, 0]]))
						print(points_to_polynomial([[1, 1], [2, 1], [3, 1]]))
						print(points_to_polynomial([[1, 3], [2, 3], [3, 3]]))
						print(points_to_polynomial([[1, 1], [2, 2], [3, 3]]))
						print(points_to_polynomial([[1, 1], [2, 4], [3, 9]]))
						print(points_to_polynomial([[1, 3], [2, 6], [3, 11]]))
						print(points_to_polynomial([[1, -3], [2, -6], [3, -11]]))
						print(points_to_polynomial([[1, 5], [2, 2], [3, 9]]))




