Problem p02733 (python)

Fixed submission:
import sys
from collections import defaultdict
def input(): return sys.stdin.readline().rstrip()

def main():
    H, W, K = map(int, input().split())
    S = [input() for _ in range(H)]

    ans = 10 ** 9

    for bit in range(1 << (H-1)):
        canSolve = True
        ord = defaultdict(int)
        N = 0
        for i in range(H):
            if bit & 1 << i:
                ord[i+1] = ord[i] + 1
                N += 1
            else:
                ord[i+1] = ord[i]
        add = 0
        nums = defaultdict(int)
        for w in range(W):
            one = defaultdict(int)
            ok = True
            for h in range(H):
                one[ord[h]] += int(S[h][w])
                nums[ord[h]] += int(S[h][w])
                if one[ord[h]] > K:
                    canSolve = False
                if nums[ord[h]] > K:
                    ok = False
            if not ok:
                add += 1
                nums = one
        if canSolve and ans > N + add:
            ans = N + add
    print(ans)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    H, W, K = map(int, input().split())
    S = [input() for _ in range(H)]

    ans = 10 ** 9

    for bit in range(1 << (H-1)):
        canSolve = True
        ord = [0] * (H + 1)
        N = 0
        for i in range(H):
            if bit & 1 << i:
                ord[i+1] = ord[i] + 1
                N += 1
            else:
                print(i)
                ord[i+1] = ord[i]
        nums = [0] * N
        for w in range(W):
            one = [0] * N
            overK = False
            for h in range(H):
                one[ord[h]] += int(S[h][w])
                nums[ord[h]] += int(S[h][w])
                if one[ord[h]] > K:
                    canSolve = False
                if nums[ord[h]] > K:
                    overK = True
            if not canSolve:
                break
            if overK:
                N += 1
                nums = one
        if canSolve and ans > N:
            ans = N
    print(ans)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    H, W, K = map(int, input().split())
    S = [input() for _ in range(H)]

    ans = 10 ** 9

    for bit in range(1 << (H-1)):
        canSolve = True
        ord = [0] * H
        N = 0
        for i in range(H):
            if bit & 1 << i:
                ord[i+1] = ord[i] + 1
                N += 1
            else:
                ord[i+1] = ord[i]
        nums = [0] * H
        for w in range(W):
            one = [0] * H
            overK = False
            for h in range(H):
                one[ord[h]] += int(S[h][w])
                nums[ord[h]] += int(S[h][w])
                if one[ord[h]] > K:
                    canSolve = False
                if nums[ord[h]] > K:
                    overK = True
            if not canSolve:
                break
            if overK:
                N += 1
                nums = one
        if canSolve and ans > N:
            ans = N
    print(ans)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
from collections import defaultdict, Counter
def input(): return sys.stdin.readline().rstrip()

def main():
    H, W, K = map(int, input().split())
    choco = [input() for _ in range(H)]

    ans = 10 ** 9
    for i in range(2 ** (H-1)):
        opt = 0
        memoCounter = Counter({})
        for j in range(W):
            c = 0
            memo = defaultdict(int)
            for k in range(H):
                if i & 1 << k:
                    c += 1
                memo[c] += int(choco[k][j])
            if max(memo) > K:
                    break
            memo = Counter(memo)
            memoCounter += memo
            if memoCounter.most_common()[0][1] > K:
                opt += 1
                memoCounter = Counter(memo)
        else:
            opt += format(i, 'b').count('1')
            if ans > opt:
                ans = opt
    print(ans)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
from collections import defaultdict, Counter
def input(): return sys.stdin.readline().rstrip()

def main():
    H, W, K = map(int, input().split())
    choco = [input() for _ in range(H)]

    ans = 10 ** 9
    for i in range(2 ** (H-1)):
        opt = 0
        memoCounter = Counter({})
        for j in range(W):
            c = 0
            memo = defaultdict(int)
            for k in range(H):
                if i & 1 << k:
                    c += 1
                memo[c] += int(choco[k][j])
            if max(memo) > K:
                    break
            memoCounter += memo
            if memoCounter.most_common()[0][1] > K:
                opt += 1
                memoCounter = Counter(memo)
        else:
            opt += format(i, 'b').count('1')
            if ans > opt:
                ans = opt
    print(ans)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys
from collections import defaultdict, Counter
def input(): return sys.stdin.readline().rstrip()

def main():
    H, W, K = map(int, input().split())
    choco = [input() for _ in range(H)]

    ans = 10 ** 9
    for i in range(2 ** (H-1)):
        opt = 0
        memoCounter = Counter({})
        for j in range(W):
            c = 0
            memo = defaultdict(int)
            for k in range(H):
                if i & 1 << k:
                    c += 1
                memo[c] += int(choco[k][j])
            if max(memo) > K:
                    break
            memoCounter += memo
            if memoCounter.most_common()[0][1] > K:
                opt += 1
                memoCounter = Counter(memo)
        else:
            opt += format(i, 'b').count('1')
            if ans > opt:
                ans = opt
    print(ans)


if __name__ == '__main__':
    main()