






"""simple docstring"""



import sys




def 						lowerCamelCase_				(  __A  :		int			,	__A  :		list[int]			):
					if not numbers:
										return 0
					if target == 0 and target in numbers:
										return 0
					if not isinstance(__A			,	(list, tuple)			) or not all(
					    isinstance(__A			,	__A			) for number in numbers			):
										raise ValueError('numbers must be an iterable of integers'			)

					lowerCamelCase__				=lowerCamelCase__				=lowerCamelCase__				=0
					lowerCamelCase__				=sys.maxsize

					while right < len(__A			):
										curr_sum += numbers[right]
										while curr_sum >= target and left <= right:
															lowerCamelCase__				=min(__A			,	right - left + 1			)
															curr_sum -= numbers[left]
															left += 1
										right += 1

					return 0 if min_len == sys.maxsize else min_len







"""simple docstring"""



from doctest import testmod
from math import sqrt




def 						lowerCamelCase_				(  __A  :		int			):
					lowerCamelCase__				=[]
					if num < 1:
										return facs
					facs.append(1			)
					if num == 1:
										return facs
					facs.append(__A			)
					for i in range(2			,	int(sqrt(__A			)			) + 1			):
										if num % i == 0:  # If i is a factor of num
															facs.append(__A			)
															lowerCamelCase__				=num // i  # num//i is the other factor of num
															if d != i:  # If d and i are distinct
																				facs.append(__A			)  # we have found another factor
					facs.sort()
					return facs


if __name__ == "__main__":
						testmod(name="factors_of_a_number", verbose=True)