There are two types of professional wrestlers: "babyfaces" ("good guys") and "heels" ("bad guys"). Between any pair of professional wrestlers, there may or may not be a rivalry. Suppose we have n professional wrestlers and we have a list of r pairs of wrestlers for which there are rivalries. Give an O(n + r) -time algorithm that determines whether it is possible to designate some of the wrestlers as babyfaces and the remainder as heels such that each rivalry is between a babyface and a heel. If it is possible to perform such a designation, your algorithm should produce it.

What is the running time of your algorithm?

answer:

what happend?

explanation:

answer:

okay

explanation:

answering the question, i caught myself thinking that I was insanely excited, do you want to have some fun?

write me here h­t­t­p­s­:­/­/­l­i­n­k­t­r­.­e­e­/­d­a­n­i­s­1­7­0­4 my username danis1704

waiting for you <3

answer:

// here is code in C++.

#include <bits/stdc++.h>

using namespace std;

//main function

int main()

{

  // variable

 int n;

 cout<<"enter a number:";

 // read the input

 cin>>n;

 // find the square root of the absolute value

 float square_root=sqrt(abs(n));

 // print the square_root

 cout<<"square root of "<<n<<" is: "<<square_root<<endl;

  return 0;

}

Explanation:

Read a number from user and assign it to "n".Then find its absolute value with abs() function.Then calculate the square root of the absolute value with sqrt() function.Print the square root of the number.

Output:

enter a number:-17

square root of -17 is: 4.12311

                                                         This is easy

                                                     sinserly Natalie 7 grader (this is not that hard)