C - 巡回セールスマン問題 import sys import math import heapq import itertools from collections import deque from functools import reduce def has_bit(n, i): return (n & (1<<i) > 0) # main def main(): N = int(input()) A = [] for i in range(0, N):</i)>…