from datetime import datetime

import requests







def 						A__  (					__A	):







    '''simple docstring'''
    _lowerCamelCase     :		Union[str, Any] 						=						"""https://downloadgram.net/wp-json/wppress/video-downloader/video?url="""
    _lowerCamelCase     :		Any 						=						requests.get(base_url + url	).json()[0]["""urls"""][0]["""src"""]
    return requests.get(__A	).content


if __name__ == "__main__":
    lowerCAmelCase			:							int     =input("Enter Video/IGTV url: ").strip()
    lowerCAmelCase			:							str     =F"""{datetime.now():%Y-%m-%d_%H:%M:%S}.mp4"""
    with open(file_name, "wb") as fp:
        fp.write(download_video(url))
    print(F"""Done. Video saved to disk as {file_name}.""")





def 						A__  (					__A   , __A	):







    '''simple docstring'''
    _enforce_args(__A   , __A	)
    if n == 0:
        return 0
    _lowerCamelCase     :		Tuple 						=						float("""-inf"""	)
    for i in range(1   , n + 1	):
        _lowerCamelCase     :		Any 						=						max(
            __A   , prices[i - 1] + naive_cut_rod_recursive(n - i   , __A	)	)

    return max_revue







def 						A__  (					__A   , __A	):







    '''simple docstring'''
    _enforce_args(__A   , __A	)
    _lowerCamelCase     :		Optional[Any] 						=						[float("""-inf"""	) for _ in range(n + 1	)]
    return _top_down_cut_rod_recursive(__A   , __A   , __A	)







def 						A__  (					__A   , __A   , __A	):







    '''simple docstring'''
    if max_rev[n] >= 0:
        return max_rev[n]
    elif n == 0:
        return 0
    else:
        _lowerCamelCase     :		int 						=						float("""-inf"""	)
        for i in range(1   , n + 1	):
            _lowerCamelCase     :		Optional[Any] 						=						max(
                __A   , prices[i - 1] + _top_down_cut_rod_recursive(n - i   , __A   , __A	)   , )

        _lowerCamelCase     :		Optional[Any] 						=						max_revenue

    return max_rev[n]







def 						A__  (					__A   , __A	):







    '''simple docstring'''
    _enforce_args(__A   , __A	)

    # length(max_rev) = n + 1, to accommodate for the revenue obtainable from a rod of
    # length 0.
    _lowerCamelCase     :		List[Any] 						=						[float("""-inf"""	) for _ in range(n + 1	)]
    _lowerCamelCase     :		Any 						=						0

    for i in range(1   , n + 1	):
        _lowerCamelCase     :		Any 						=						max_rev[i]
        for j in range(1   , i + 1	):
            _lowerCamelCase     :		List[Any] 						=						max(__A   , prices[j - 1] + max_rev[i - j]	)

        _lowerCamelCase     :		int 						=						max_revenue_i

    return max_rev[n]







def 						A__  (					__A   , __A	):







    '''simple docstring'''
    if n < 0:
        _lowerCamelCase     :		Any 						=						F"""n must be greater than or equal to 0. Got n = {n}"""
        raise ValueError(__A	)

    if n > len(__A	):
        _lowerCamelCase     :		List[Any] 						=						(
            """Each integral piece of rod must have a corresponding price. """
            F"""Got n = {n} but length of prices = {len(__A	)}"""
        )
        raise ValueError(__A	)







def 						A__  (					):







    '''simple docstring'''
    _lowerCamelCase     :		str 						=						[6, 10, 12, 15, 20, 23]
    _lowerCamelCase     :		List[str] 						=						len(__A	)

    # the best revenue comes from cutting the rod into 6 pieces, each
    # of length 1 resulting in a revenue of 6 * 6 = 36.
    _lowerCamelCase     :		Tuple 						=						36

    _lowerCamelCase     :		Any 						=						top_down_cut_rod(__A   , __A	)
    _lowerCamelCase     :		Dict 						=						bottom_up_cut_rod(__A   , __A	)
    _lowerCamelCase     :		List[str] 						=						naive_cut_rod_recursive(__A   , __A	)

    assert expected_max_revenue == max_rev_top_down
    assert max_rev_top_down == max_rev_bottom_up
    assert max_rev_bottom_up == max_rev_naive


if __name__ == "__main__":
    main()




