Submission #4245054

---

Source Code Expand

#!usr/bin/env python3
from collections import defaultdict
import math
import bisect
import random
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007

# A
'''
data = input()
data = data.split(" ")
a = int(data[0])
b = int(data[1])
print(max(a, b))
'''

# B
'''
s = input()
list = "aiueo"
for i in range(len(list)):
    s = s.replace(list[i],"")
for i in range(len(s)):
    print(s[i], end = "")
'''

# C
"""
x,y,a,b,c,d = LI()
print(abs((a-x)*(d-y)-(b-y)*(c-x))/2)
"""
# D
n,m = LI()
f = [[0 if i != j else 1 for j in range(n)] for i in range(n)]
for i in range(m):
    x,y = LI()
    x -= 1
    y -= 1
    f[x][y] = 1
    f[y][x] = 1
bi = [bin(i)[2:] for i in range(1,2**n)]

li = []
for i in range(2**n-1):
    a = []
    for j in range(len(bi[i])):
        if bi[i][len(bi[i])-1-j] == "1":
            a.append(j)
    li.append(a)

ans = 0
for l in li:
    st = False
    for i in range(1,len(l)):
        for j in range(i):
            if not f[l[i]][l[j]]:
                st = True
                break
        if st:
            break
    if not st:
        ans = max(ans,len(l))
print(ans)

Submission Info

Judge Result