


def       _a			(				SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




		lowercase__						=				current_set.copy()
		for row_index, row in enumerate(SCREAMING_SNAKE_CASE					):
				lowercase__						=				row[0]
				for column_index, column in enumerate(SCREAMING_SNAKE_CASE					):
						if magnitude == 0:
								lowercase__						=				column
								continue
						lowercase__						=				column / magnitude
    # Subtract to cancel term
		lowercase__						=				current_set[0]
		lowercase__						=				[first_row]
		lowercase__						=				current_set[1::]
		for row in current_set:
				lowercase__						=				[]
				# If first term is 0, it is already in form we want, so we preserve it
				if row[0] == 0:
						final_set.append(SCREAMING_SNAKE_CASE					)
						continue
				for column_index in range(len(SCREAMING_SNAKE_CASE					)					):
						temp_row.append(first_row[column_index] - row[column_index]					)
				final_set.append(SCREAMING_SNAKE_CASE					)
		# Create next recursion iteration set
		if len(final_set[0]					) != 3:
				lowercase__						=				final_set[0]
				lowercase__						=				[]
				lowercase__						=				[]
				for row in final_set[1::]:
						current_first_column.append(row[0]					)
						next_iteration.append(row[1::]					)
				lowercase__						=				simplify(SCREAMING_SNAKE_CASE					)
				for i in range(len(SCREAMING_SNAKE_CASE					)					):
						resultant[i].insert(0						,    current_first_column[i]					)
				resultant.insert(0						,    SCREAMING_SNAKE_CASE					)
				lowercase__						=				resultant
		return final_set
def       _a			(				SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




		if len(SCREAMING_SNAKE_CASE					) == 0:
				raise IndexError('''solve_simultaneous() requires n lists of length n+1'''					)
		lowercase__						=				len(SCREAMING_SNAKE_CASE					) + 1
		if any(len(SCREAMING_SNAKE_CASE					) != _length for item in equations					):
				raise IndexError('''solve_simultaneous() requires n lists of length n+1'''					)
		for row in equations:
				if any(not isinstance(SCREAMING_SNAKE_CASE						,    (int, float)					) for column in row					):
						raise ValueError('''solve_simultaneous() requires lists of integers'''					)
		if len(SCREAMING_SNAKE_CASE					) == 1:
				return [equations[0][-1] / equations[0][0]]
		lowercase__						=				equations.copy()
		if any(0 in row for row in data_set					):
				lowercase__						=				data_set.copy()
				lowercase__						=				[]
				for row_index, row in enumerate(SCREAMING_SNAKE_CASE					):
						if 0 not in row:
								lowercase__						=				data_set.pop(SCREAMING_SNAKE_CASE					)
								break
				if not full_row:
						raise ValueError('''solve_simultaneous() requires at least 1 full equation'''					)
				data_set.insert(0						,    SCREAMING_SNAKE_CASE					)
		lowercase__						=				data_set.copy()
		lowercase__						=				simplify(SCREAMING_SNAKE_CASE					)
		lowercase__						=				simplified[::-1]
		lowercase__						=				[]
		for row in simplified:
				lowercase__						=				row[-1]
				if not solutions:
						if row[-2] == 0:
								solutions.append(0					)
								continue
						solutions.append(current_solution / row[-2]					)
						continue
				lowercase__						=				row.copy()[: len(SCREAMING_SNAKE_CASE					) - 1 :]
				while temp_row[0] == 0:
						temp_row.pop(0					)
				if len(SCREAMING_SNAKE_CASE					) == 0:
						solutions.append(0					)
						continue
				lowercase__						=				temp_row[1::]
				lowercase__						=				temp_row[::-1]
				for column_index, column in enumerate(SCREAMING_SNAKE_CASE					):
						current_solution -= column * solutions[column_index]
				solutions.append(SCREAMING_SNAKE_CASE					)
		lowercase__						=				[]
		for item in solutions:
				final.append(float(round(SCREAMING_SNAKE_CASE						,    5					)					)					)
		return final[::-1]


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			lowerCAmelCase	=							[
			    [2, 1, 1, 1, 1, 4],
			    [1, 2, 1, 1, 1, 5],
			    [1, 1, 2, 1, 1, 6],
			    [1, 1, 1, 2, 1, 7],
			    [1, 1, 1, 1, 2, 8],
			]
			print(solve_simultaneous(eq))
			print(solve_simultaneous([[4, 2]]))






def       _a			(				SCREAMING_SNAKE_CASE = 10_00					):


		"""simple docstring"""




		return sum(e for e in range(3						,    SCREAMING_SNAKE_CASE					) if e % 3 == 0 or e % 5 == 0					)


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


