






from __future__ import annotations

def     __lowercase(	UpperCAmelCase__   ,   UpperCAmelCase__   ,   UpperCAmelCase__ ):


      """simple docstring"""



      if days_between_payments <= 0:
            raise ValueError("days_between_payments must be > 0" )
      if daily_interest_rate < 0:
            raise ValueError("daily_interest_rate must be >= 0" )
      if principal <= 0:
            raise ValueError("principal must be > 0" )
      return principal * daily_interest_rate * days_between_payments

def     __lowercase(	UpperCAmelCase__   ,   UpperCAmelCase__   ,   UpperCAmelCase__   ,   ):


      """simple docstring"""



      if number_of_compounding_periods <= 0:
            raise ValueError("number_of_compounding_periods must be > 0" )
      if nominal_annual_interest_rate_percentage < 0:
            raise ValueError("nominal_annual_interest_rate_percentage must be >= 0" )
      if principal <= 0:
            raise ValueError("principal must be > 0" )

      return principal * (
          (1 + nominal_annual_interest_rate_percentage) ** number_of_compounding_periods
          - 1
      )

def     __lowercase(	UpperCAmelCase__   ,   UpperCAmelCase__   ,   UpperCAmelCase__   ,   ):


      """simple docstring"""



      if number_of_years <= 0:
            raise ValueError("number_of_years must be > 0" )
      if nominal_annual_percentage_rate < 0:
            raise ValueError("nominal_annual_percentage_rate must be >= 0" )
      if principal <= 0:
            raise ValueError("principal must be > 0" )

      return compound_interest(
          snake_case_   ,   nominal_annual_percentage_rate / 365   ,   number_of_years * 365 )


if __name__ == "__main__":
     import doctest

     doctest.testmod()




from __future__ import annotations

from collections import deque
from collections.abc import Iterator
from dataclasses import dataclass





@dataclass
class    lowerCamelCase__  :
     """simple docstring"""



     _A       =			42
     _A       =			42





class    lowerCamelCase__  :
     """simple docstring"""



     def __init__(self				,			__a    ):






           '''simple docstring'''



           lowerCamelCase								=		[[] for _ in range(__a    )]
           lowerCamelCase								=		size







     def __getitem__(self				,			__a    ):






           '''simple docstring'''



           return iter(self._graph[vertex]    )







     @property
     def 						_a      (self    ):






           '''simple docstring'''



           return self._size







     def 						_a      (self				,			__a				,			__a				,			__a    ):






           '''simple docstring'''



           if weight not in (0, 1):
                 raise ValueError("Edge weight must be either 0 or 1."    )

           if to_vertex < 0 or to_vertex >= self.size:
                 raise ValueError("Vertex indexes must be in [0; size)."    )

           self._graph[from_vertex].append(Edge(__a				,			__a    )    )







     def 						_a      (self				,			__a				,			__a    ):






           '''simple docstring'''



           lowerCamelCase								=		deque([start_vertex]    )
           lowerCamelCase								=		[None] * self.size
           lowerCamelCase								=		0

           while queue:
                 lowerCamelCase								=		queue.popleft()
                 lowerCamelCase								=		distances[current_vertex]
                 if current_distance is None:
                       continue

                 for edge in self[current_vertex]:
                       lowerCamelCase								=		current_distance + edge.weight
                       lowerCamelCase								=		distances[edge.destination_vertex]
                       if (
                           isinstance(__a				,			__a    )
                           and new_distance >= dest_vertex_distance
                       ):
                             continue
                       lowerCamelCase								=		new_distance
                       if edge.weight == 0:
                             queue.appendleft(edge.destination_vertex    )
                       else:
                             queue.append(edge.destination_vertex    )

           if distances[finish_vertex] is None:
                 raise ValueError("No path from start_vertex to finish_vertex."    )

           return distances[finish_vertex]


if __name__ == "__main__":
     import doctest

     doctest.testmod()