retagged by
636 views

3 Answers

12 votes
12 votes
Question is nothing but asking "Is there any odd length cycle in Bipartite graph ?"

Here set A is male, set B is female and there is an edge between A and B. Now as we know there will be no odd length cycle in Bipartite graph so cycle of length 1607 (odd length) must be ZERO.
4 votes
4 votes
Here there is an edge (u,v) if a male is a friend with a female

So, cycle should be like M-F-M-F-.......

But cycle of 1607 is a odd length cycle.

which could not be formed by  M-F-M-F........ as it is a even length cycle.

Number of simple cycle should be 0
0 votes
0 votes
This is bipartite graph and in a bipartite graph no odd cycle is possible so 0 .
Answer:

Related questions

1 votes
1 votes
1 answer
2
pC asked Jul 18, 2016
1,262 views
Implement Longest Increasing Subsequence with the help of 1-D array for dynamic programming. (Hint : MaxTill 1-D array)
1 votes
1 votes
1 answer
4
pC asked Jul 18, 2016
1,381 views
Implement a^b mod m where a,b and m can be huge. (Hint : O(log n))