In this

**HackerEarth Making friends problem solution**You opened a school with N students. Each student will either belong to Team Red or Team Blue. The students in each team are friends with each other. However, you want them to make friends with students from the opposite team too. For example, if a student belongs to Team Red, you want that student to make friends with students from Team Blue.**Note:**Friendship is mutual. If A is B's friend, then B is automatically A's friend.

You give each student a number M that represents the number of friends that the student should have from the opposite team. Your task is to determine whether it is possible for each student to have the number of friends represented by the number M.

## HackerEarth Making friends problem solution.

`#include<bits/stdc++.h>`

using namespace std;

int32_t main()

{

ios::sync_with_stdio(0);

cin.tie(0);

cout.tie(0);

int t =1;

cin >> t;

while(t--)

{

int n;

cin >> n;

int m; cin >> m;

bool flag=0;

if( n%2 == 0 && m <= n/2 || m ==0)

cout <<"Yes\n";

else

cout <<"No\n";

}

return 0;

}

## 0 Comments