Submission #8554598

---

Source Code Expand

N, M = map(int,input().split())
A = list(list(map(int,input().split()))for i in range(N))

def func(p):
    if sum(p) == 0:
        return M
    count = [0]*M
    for l in A:
        i = 0
        while p[l[i]-1] == 0:
            i += 1
        count[l[i]-1] += 1
    hoge = max(count)
    ret = hoge
    for i in range(M):
        if count[i] == hoge:
            q = p[:]
            q[i] = 0
            ret = min(func(q),ret)
    return ret

print(func([1]*M))

Submission Info

Judge Result