Submission #7096799

---

Source Code Expand

N, M = map(int,input().split())
ls = [[i] for i in range(N)]
for _ in range(M):
    x,y = map(int,input().split())
    ls[x-1].append(y-1)
    ls[y-1].append(x-1)
def asc_all(x, l):
    return all([x in ls[y] for y in l])
ans = 1
for i in range(2**N):
    l = []
    for j in range(N):
        if (i >> j) & 1:
            l.append(j)
    fl = False
    for j in range(len(l)):
        if not asc_all(l[j], l[j+1:]):
            fl = True
            break
    if fl:
        continue
    ans = max(ans, len(l))
print(ans)

Submission Info

Judge Result