Problem:
Score : 500 points

Problem Statement

We have a chocolate bar partitioned into H horizontal rows and W vertical columns of squares.

The square (i, j) at the i-th row from the top and the j-th column from the left is dark if S_{i,j} is 0, and white if S_{i,j} is 1.

We will cut the bar some number of times to divide it into some number of blocks. In each cut, we cut the whole bar by a line running along some boundaries of squares from end to end of the bar.

How many times do we need to cut the bar so that every block after the cuts has K or less white squares?

Constraints

1 \leq H \leq 10

1 \leq W \leq 1000

1 \leq K \leq H \times W

S_{i,j} is 0 or 1.

Input

Input is given from Standard Input in the following format:

H W K
S_{1,1}S_{1,2}...S_{1,W}
:
S_{H,1}S_{H,2}...S_{H,W}

Output

Print the number of minimum times the bar needs to be cut so that every block after the cuts has K or less white squares.

Sample Input 1

3 5 4
11100
10001
00111

Sample Output 1

2

For example, cutting between the 1-st and 2-nd rows and between the 3-rd and 4-th columns - as shown in the figure to the left - works.

Note that we cannot cut the bar in the ways shown in the two figures to the right.

Sample Input 2

3 5 8
11100
10001
00111

Sample Output 2

0

No cut is needed.

Sample Input 3

4 10 4
1110010010
1000101110
0011101001
1101000111

Sample Output 3

3

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io::*;

fn main() {
    let mut s: String = String::new();
    std::io::stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let h: usize = itr.next().unwrap().parse().unwrap();
    let w: usize = itr.next().unwrap().parse().unwrap();
    let k: usize = itr.next().unwrap().parse().unwrap();
    let d: Vec<Vec<char>> = (0..h)
        .map(|_| itr.next().unwrap().chars().collect())
        .collect();
    let mut s: Vec<Vec<usize>> = vec![vec![0; w + 5]; h + 5];
    for i in 0..h {
        for j in 0..w {
            s[i + 1][j + 1] = (d[i][j] == '1') as usize;
        }
    }
    for i in 1..h + 1 {
        for j in 1..w + 1 {
            s[i][j + 1] += s[i][j];
        }
    }
    for i in 1..h + 1 {
        for j in 1..w + 1 {
            s[i + 1][j] += s[i][j];
        }
    }

    let mut ans = 1 << 30;
    // hの選び方では絶対達成できない場合がある？
    for bit in 0..(1 << h - 1) {
        let mut count = 0;
        let mut x = 0;
        let mut good = true;
        for i in 0..w {
            let mut ok = true;
            let mut y = 0;
            for j in 0..h {
                if bit >> j & 1 == 1 || j == h - 1 {
                    if s[j + 1][i + 1] + s[y][x] - s[j + 1][x] - s[y][i + 1] > k {
                        ok = false;
                    }
                    y = j + 1;
                }
            }
            if !ok {
                count += 1;
                x = i;
                if i == w - 1 {
                    good = false;
                }
            }
        }
        if good {
            ans = std::cmp::min(ans, count + (bit as u32).count_ones());
        }
    }

    println!("{}", ans);
}