Submission #4240378

---

Source Code Expand

n,m=map(int,input().split())
h=[i+1 for i in range(n)]
nkm=set()
for i in range(m):
    x,y=map(int,input().split())
    nkm.add((x,y))
    nkm.add((y,x))
mx=-1
for x in range(2**n):
    hbt=[]
    for i in range(n):
        if x&(1<<i):
            hbt.append(i+1)
    f=True
    for i in range(len(hbt)):
        for j in range(i+1,len(hbt)):
            if i==j:
                continue
            if (hbt[i],hbt[j]) not in nkm:
                f=False
    if f:
        mx=max(mx,len(hbt))
print(mx)

Submission Info

Judge Result