-
Notifications
You must be signed in to change notification settings - Fork 1
/
uva11205.cpp
73 lines (72 loc) · 980 Bytes
/
uva11205.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
//子集生成
//判断至少需要几列才能区别各行
#include <iostream>
#include <cstring>
int arry[101];
int pos[16];
bool vis[1<<15];
int main()
{
int casenum;
std::cin>>casenum;
while( casenum-- )
{
int p,n;
std::cin>>p>>n;
int min=p;
memset(arry, 0, sizeof(arry));
for( int i=1 ; i<=n ; ++i )
{
for( int j=1 ; j<=p ; ++j )
{
int tmp;
std::cin>>tmp;
int & tar=arry[i];
tar<<=1;
tar+=tmp;
}
}
for( int i=1 ; i!=1<<p ; ++i )
{
memset(vis, 0, sizeof(vis));
int jump=0;
for( int j=1 ; j<=n ; ++j )
{
int tmp=i&arry[j];
if( vis[tmp] )
{
jump=1;
}
else
vis[tmp]=1;
if( jump )
{
break;
}
}
if( jump )
{
continue;
}
else
{
int leng=0;
int tmp=i;
while( tmp )
{
if( tmp&1 )
{
++leng;
}
tmp>>=1;
}
if( leng<min )
{
min=leng;
}
}
}
std::cout<<min<<std::endl;
}
return 0;
}