#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int m , n , a[16][300] , t[300] , tmp[300] ;
bool tell ;

void search( int p )
{
    int i ;
    if ( tell ) return ;
    if ( p == m )
    {
        for ( i = 0 ; i < n ; i++ )
            if ( !t[i] ) break ;
        if ( i == n ) tell = true ;
        return ;
    }
    search(p+1) ;
    for ( i = 0 ; i < n ; i++ )
    if ( t[i] && a[p][i] ) return ;
    else tmp[i] = (t[i]|a[p][i]) ;
    memcpy(t,tmp,sizeof(tmp)) ;
    search(p+1) ;
    for ( i = 0 ; i < n ; i++ )
    if ( a[p][i] ) t[i]-- ;
}

int main()
{
    int i , j , k ;
    while ( cin >> m >> n )
    {
        for ( i = 0 ; i < m ; i++ )
        for ( j = 0 ; j < n ; j++ )
            scanf( "%d" , &a[i][j] ) ;
        tell = false ;
        memset(t,0,sizeof(t)) ;
        search(0) ;
        if (tell) printf( "Yes, I found it\n" ) ;
        else printf( "It is impossible\n" ) ;
    }
}

• 郁闷之余发个好看点的。。 (805) 104GOGO 2011-10-11 10:20:58