def interactive(args):
adapters = ifaddr.get_adapters(include_unconfigured=True)
options = {}
suggestion_local = ''
suggestion_internet = None
for adapter in adapters:
name = adapter.name
description = '' if adapter.nice_name == adapter.name else adapter.nice_name
if adapter.ips:
ips_ = []
for ip in adapter.ips:
ips_.append("%s/%s" % (ip.ip, ip.network_prefix))
description += 'IP addresses: ' + ', '.join(ips_)
suggestion_internet = name
else:
description += 'No IP addresses assigned to this interface.'
suggestion_local = name
options[name] = description
args.local_interface = tools.choose('Available network interfaces',
'Select local_interface', options,
suggestion_local, False)
args.internet_interface = tools.choose(
'Do you want to create a bridge to allow internet access in your created network over another '
'network interface?', 'Select internet_interface or None', options,
suggestion_internet, True)
if not args.pxe:
args.pxe = tools.ask(
'Do you want to enable booting over PXE? Enter filename to boot from',
args.pxe, str, True)
if args.pxe:
args.tftp_rootdir = tools.ask('Set root directory of TFTP server',
args.tftp_rootdir, str, False)
return args
def solution(size: int) -> int:
"""Calculate number of paths for a given lattice size using combinatorics.
The answer for grids of different sizes correspond to cells in Pascale's
Triangle, and the value of cells in Paascale's traingle can be calculated
directly (without needing recursion or memoization) with n choose k
combinatorics.
Specifically, the cell of Pascale's triangle we're interested in is the
size * 2th row and the size'th column.
"""
return choose(size * 2, size)
import tools
if __name__ == "__main__":
n = 20 # number of nodes on each side
print tools.choose(2*n, n)
import tools
if __name__ == "__main__":
n = 20 # number of nodes on each side
print tools.choose(2 * n, n)
