Description
Recently, scientists find that there is love between any of two people. For example, between A and B, if A don’t love B, then B must love A, vice versa. And there is no possibility that two people love each other, what a crazy world!
Now, scientists want to know whether or not there is a “Triangle Love” among N people. “Triangle Love” means that among any three people (A,B and C) , A loves B, B loves C and C loves A.
Your problem is writing a program to read the relationship among N people firstly, and return whether or not there is a “Triangle Love”.
Now, scientists want to know whether or not there is a “Triangle Love” among N people. “Triangle Love” means that among any three people (A,B and C) , A loves B, B loves C and C loves A.
Your problem is writing a program to read the relationship among N people firstly, and return whether or not there is a “Triangle Love”.
Input
The first line contains a single integer t (1 <= t <= 15), the number of test cases.
For each case, the first line contains one integer N (0 < N <= 2000).
In the next N lines contain the adjacency matrix A of the relationship (without spaces). A i,j = 1 means i-th people loves j-th people, otherwise A i,j = 0.
It is guaranteed that the given relationship is a tournament, that is, A i,i= 0, A i,j ≠ A j,i(1<=i, j<=n,i≠j).
For each case, the first line contains one integer N (0 < N <= 2000).
In the next N lines contain the adjacency matrix A of the relationship (without spaces). A i,j = 1 means i-th people loves j-th people, otherwise A i,j = 0.
It is guaranteed that the given relationship is a tournament, that is, A i,i= 0, A i,j ≠ A j,i(1<=i, j<=n,i≠j).
Output
For each case, output the case number as shown and then print “Yes”, if there is a “Triangle Love” among these N people, otherwise print “No”.
Take the sample output for more details.
Take the sample output for more details.
Sample Input
2 5 00100 10000 01001 11101 11000 5 01111 00000 01000 01100 01110
Sample Output
Case #1: Yes Case #2: N0
#include<stdio.h> #include<string.h> #include<queue> using namespace std; char st[2010][2010]; int in[2010]; int n; int topo() { int i,j,m=0,t; queue<int>q; for(i=0;i<n;i++) if(in[i]==0) q.push(i); while(!q.empty()) { t=q.front(); in[t]=-1; m++; q.pop(); for(i=0;i<n;i++) if(st[t][i]=='1') { in[i]--; if(in[i]==0) q.push(i); } } if(m==n) return 0; else return 1; } int main() { int t,i,j,l,sum; scanf("%d",&t); for(l=1;l<=t;l++) { scanf("%d",&n); memset(in,0,sizeof(in)); for(i=0;i<n;i++) { scanf("%s",st[i]); for(j=0;j<n;j++) if(st[i][j]=='1') in[j]++; } sum=topo(); if(sum) printf("Case #%d: Yes\n",l); else printf("Case #%d: No\n",l); } return 0; }