In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main ( ), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId ( ) which returns the id of the manager if present or else returns -1. The function managerId ( ) takes two arguments - the square matrix of N *N and its size N. Call managerId ( ) from the main ( ) output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company.
In a company, there are several branches. Let us consider a branch of that company having N
employees, if the manager is allotted to that branch(s) then he is known to everyone else in that
branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find
the manager in that branch. Input from the user in main ( ), the square matrix M where if an element
of row i and column j is set to 1 it means that ith person knows jth person. You need to write a
function managerId ( ) which returns the id of the manager if present or else returns -1. The function
managerId ( ) takes two arguments - the square matrix of N *N and its size N. Call managerId ( )
from the main ( ) output the information about the manager. Assume all diagonal elements to be 1
(as everyone knows him/herself) and there is at most one manager in the company.
Step by step
Solved in 2 steps with 1 images
