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 :- Poisoned Sweet
Submit Your Solution :- Click Here
Solution :-
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,res=0;
cin>>n;
res=ceil(log(n)/log(2));
cout<<res<<endl;;
}
return 0;
}
Output:-
0 Comments: