GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Change Bits
Submit Your Solution :- Click Here
Solution :-
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--)
{
long long int n,m,p,c=0;
cin >> m;
n = m;
while(n)
{
n = n >> 1;
c++;
}
p = (c == 0) ? 0 : (pow(2, c)-1);
cout << (p-m) << " " << p << endl;
}
return 0;
}
Output:-
0 Comments: