uva 1252

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int M=11,N=130,inf=0x3f3f3f3f;
int f[1<<M][1<<M],p[N],
n,m;
int dp(int s1,int s2) {
    if(f[s1][s2]!=inf) return f[s1][s2];
    int cnt=0;

    fo(i,0,n-1)
        if((s1&p[i])==s2) ++cnt;
    if(cnt<=1) {f[s1][s2]=0;return f[s1][s2];} 

    for(int i=0;i<m;i++) {
        if(s1&(1<<i)) continue;
        int& d=f[s1][s2];
        int nextq=(s1|(1<<i));
        d=min(d,max(dp(nextq,s2),dp(nextq,s2^(1<<i)))+1);
    }
    return f[s1][s2];   
}
int main() {
//  freopen("stdin","r",stdin);
//  freopen("stdout","w",stdout);
    char s[N];
    while(scanf("%d%d",&m,&n)&&(m||n)) {
        memset(f,inf,sizeof(f));
        memset(p,0,sizeof(p));

        for(int i=0;i<n;i++) {
            scanf("%s",s);
            for(int j=0;s[j];j++) if(s[j]=='1') p[i]|=1<<j;
        }   

        printf("%d\n",dp(0,0)); 
    }
} 

分析有时间更~~这是一个好题orz