"""simple docstring"""






def   a_						(					):
				return [list(range(1_0_0_0 - i					,			-1_0_0_0 - i					,			-1       )       ) for i in range(1_0_0_0       )]


lowerCAmelCase__  :  Any						     =	generate_large_matrix()
lowerCAmelCase__  :  Any						     =	(
    [[4, 3, 2, -1], [3, 2, 1, -1], [1, 1, -1, -2], [-1, -1, -2, -3]],
    [[3, 2], [1, 0]],
    [[7, 7, 6]],
    [[7, 7, 6], [-1, -2, -3]],
    grid,
)



def   a_						(					lowerCamelCase       ):
				assert all(row == sorted(lowerCamelCase					,			reverse=lowerCamelCase       ) for row in grid       )
				assert all(list(lowerCamelCase       ) == sorted(lowerCamelCase					,			reverse=lowerCamelCase       ) for col in zip(*lowerCamelCase       )       )



def   a_						(					lowerCamelCase       ):
				UpperCAmelCase__             =							0
				UpperCAmelCase__             =							len(lowerCamelCase       ) - 1

				# Edge cases such as no values or all numbers are negative.
				if not array or array[0] < 0:
								return 0

				while right + 1 > left:
								UpperCAmelCase__             =							(left + right) // 2
								UpperCAmelCase__             =							array[mid]

								# Num must be negative and the index must be greater than or equal to 0.
								if num < 0 and array[mid - 1] >= 0:
												return mid

								if num >= 0:
												UpperCAmelCase__             =							mid + 1
								else:
												UpperCAmelCase__             =							mid - 1
    # No negative numbers so return the last index of the array + 1 which is the length.
				return len(lowerCamelCase       )



def   a_						(					lowerCamelCase       ):
				UpperCAmelCase__             =							0
				UpperCAmelCase__             =							len(grid[0]       )

				for i in range(len(lowerCamelCase       )       ):
								UpperCAmelCase__             =							find_negative_index(grid[i][:bound]       )
								total += bound
				return (len(lowerCamelCase       ) * len(grid[0]       )) - total



def   a_						(					lowerCamelCase       ):
				return len([number for row in grid for number in row if number < 0]       )



def   a_						(					lowerCamelCase       ):
				UpperCAmelCase__             =							0
				for row in grid:
								for i, number in enumerate(lowerCamelCase       ):
												if number < 0:
																total += len(lowerCamelCase       ) - i
																break
				return total



def   a_						(					):
				from timeit import timeit

				print('Running benchmarks'       )
				UpperCAmelCase__             =							(
				    'from __main__ import count_negatives_binary_search, '
				    'count_negatives_brute_force, count_negatives_brute_force_with_break, grid'
				)
				for func in (
				    "count_negatives_binary_search",  # took 0.7727 seconds
				    "count_negatives_brute_force_with_break",  # took 4.6505 seconds
				    "count_negatives_brute_force",  # took 12.8160 seconds
				):
								UpperCAmelCase__             =							timeit(f'''{func}(grid=grid)'''					,			setup=lowerCamelCase					,			number=5_0_0       )
								print(f'''{func}() took {time:0.4f} seconds'''       )


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						benchmark()







UpperCAmelCase__   	=							8.31_44_62  # Unit - J mol-1 K-1
def 				UpperCAmelCase_					(							__snake_case     ,						__snake_case     ,						__snake_case						)     ->			float:







 """simple docstring"""


 if moles < 0 or kelvin < 0 or volume < 0:
  raise ValueError('''Invalid inputs. Enter positive value.'''						)
 return moles * kelvin * UNIVERSAL_GAS_CONSTANT / volume
def 				UpperCAmelCase_					(							__snake_case     ,						__snake_case     ,						__snake_case						)     ->			float:







 """simple docstring"""


 if moles < 0 or kelvin < 0 or pressure < 0:
  raise ValueError('''Invalid inputs. Enter positive value.'''						)
 return moles * kelvin * UNIVERSAL_GAS_CONSTANT / pressure


if __name__ == "__main__":
  from doctest import testmod

  testmod()

