Language: C++

/*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for(ll (i) = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T>
bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;}
template <typename T>
bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;}
template <typename T>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const Vec1<T> &v){for(T i : v) cosp(i); cout << '\n';}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); cout << '\n';}
template <typename T>
void ce(const T n){cerr << n << endl;}
void sonic(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
constexpr ll INF = 1e9+1;
constexpr ll LINF = 1e18+1;
constexpr ll MOD = 1e9+7;
//constexpr ll MOD = 998244353;
constexpr ld PI = acos(-1);
constexpr ld EPS = 1e-11;

int main(void){
	ll h, w, k;
	cin >> h >> w >> k;
	VecS s(h);
	rep(i, h) cin >> s[i];

	ll ans = LINF;
	rep(bit, pow2(h - 1)){
		bitset<10> bits(bit);
		ll m = bits.count();
		Vec group(h);
		rep(i, h - 1) group[i + 1] = group[i] + bit[i];

		ll line = m;
		Vec sum(m + 1), cs(m + 1);
		rep(j, w){
			bool flg = true;
			rep(i, h) sum[group[i]] += s[i][j] - '0';
			if(flg){
				rep(i, m + 1) cs[i] += sum[i][j];
			}else{
				line++;
				rep(i, m + 1) cs[i] = sum[i][j];
			}
		}
		chmin(ans, line);
	}
	co(ans);

	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:73:60: error: invalid types 'll {aka long long int}[ll {aka long long int}]' for array subscript
   73 |                 rep(i, h - 1) group[i + 1] = group[i] + bit[i];
      |                                                            ^
a.cc:81:62: error: invalid types '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type {aka long long int}[ll {aka long long int}]' for array subscript
   81 |                                 rep(i, m + 1) cs[i] += sum[i][j];
      |                                                              ^
a.cc:84:61: error: invalid types '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type {aka long long int}[ll {aka long long int}]' for array subscript
   84 |                                 rep(i, m + 1) cs[i] = sum[i][j];
      |                                                             ^