- //By SiriusRen#include
- #include
- using namespace std;
- intcases,n,a[22][22],f[1024*1024],F;
- int main(){
- scanf("%d",&cases);
- while(cases--){
- scanf("%d",&n);
- for(inti=0;i<(1<0;
- for(inti=0;i)
- for(intj=0;j)
- scanf("%d",&a[i][j]);
- f[0]=1,F=0;
- for(inti=0;i<(1<if(f[i])
- for(intj=0;j)
- if(!(i&(1<1<<j)]){
- intres=0;
- for(intk=0;k)
- if(!(i&(1<a[j][k];
- if(res<0)f[i|(1<1;
- }
- for(inti=0;iif(f[((1<1)^(1<1;
- if(!F)puts("0");
- else for(inti=0;iif(f[((1<1)^(1<<i)])
- printf("%d%c",i+1,i==F-1'\n':' ');
- }
- }
来源: http://www.bubuko.com/infodetail-2004233.html