Thursday, 6 April 2017

Geeksforgeeks Solution For " Finding Position "

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 :- Finding Position

Submit Your Solution :- Click Here 

Solution :- 

#include <iostream>
#include <cmath>
using namespace std;

int main() 
{
int t,n;
cin>>t;
while(t--)
{
   cin>>n;
   int x=log2(n);
   int res=pow(2,x);
   cout<<res<<"\n";
   
}
return 0;
}

Output:-



Geeksforgeeks Solution For " Finding Position "

No comments:
Write comments

Recommended Posts × +