
from __future__ import annotations

lowercase__		:Any   =    1.60_21E-19  # units = C



def        UpperCamelCase    (							lowerCAmelCase__ ,			lowerCAmelCase__ ,			lowerCAmelCase__ ,			):
					'''simple docstring'''
					if (conductivity, electron_conc, mobility).count(0		) != 1:
										raise ValueError('''You cannot supply more or less than 2 values'''		)
					elif conductivity < 0:
										raise ValueError('''Conductivity cannot be negative'''		)
					elif electron_conc < 0:
										raise ValueError('''Electron concentration cannot be negative'''		)
					elif mobility < 0:
										raise ValueError('''mobility cannot be negative'''		)
					elif conductivity == 0:
										return (
										    "conductivity",
										    mobility * electron_conc * ELECTRON_CHARGE,
										)
					elif electron_conc == 0:
										return (
										    "electron_conc",
										    conductivity / (mobility * ELECTRON_CHARGE),
										)
					else:
										return (
										    "mobility",
										    conductivity / (electron_conc * ELECTRON_CHARGE),
										)


if __name__ == "__main__":
							import doctest

							doctest.testmod()











def 			A__							(    SCREAMING_SNAKE_CASE__ = 200)   ->    int:
  __snake_case:						Optional[int]   =						[1, 2, 5, 10, 20, 50, 100, 200]
  __snake_case:						List[Any]   =						[0] * (pence + 1)
  __snake_case:						int   =						1  # base case: 1 way to make 0 pence

  for coin in coins:
    for i in range(SCREAMING_SNAKE_CASE__					,					pence + 1					,					1):
      number_of_ways[i] += number_of_ways[i - coin]
  return number_of_ways[pence]


if __name__ == "__main__":
      assert solution(200) == 73_682






