






def    __lowerCAmelCase   (    __snake_case = 200							):
     __lowerCAmelCase             =       [1, 2, 5, 10, 20, 50, 100, 200]
     __lowerCAmelCase             =       [0] * (pence + 1)
     __lowerCAmelCase             =       1  # base case: 1 way to make 0 pence

     for coin in coins:
          for i in range(__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) == 73682














import os

# Precomputes a list of the 100 first triangular numbers
lowerCamelCase      :       str    =						[int(0.5 * n * (n + 1)) for n in range(1, 101)]





def    __lowerCAmelCase   (    ):
     __lowerCAmelCase             =       os.path.dirname(os.path.realpath(__snake_case							)							)
     __lowerCAmelCase             =       os.path.join(__snake_case       ,			"words.txt"							)

     __lowerCAmelCase             =       ""
     with open(__snake_case							) as f:
          __lowerCAmelCase             =       f.readline()

     __lowerCAmelCase             =       [word.strip("\""							) for word in words.strip("\r\n"							).split(","							)]
     __lowerCAmelCase             =       [
         word
         for word in [sum(ord(__snake_case							) - 64 for x in word							) for word in words]
         if word in TRIANGULAR_NUMBERS
     ]
     return len(__snake_case							)


if __name__ == "__main__":
 print(solution())






