4/06/2017

Geeksforgeeks Solution For " Nearest Power "

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 :- Nearest Power 

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
int main()
 {
    long long t, n, m, p, ans, a, b;
    cin>>t;
    while(t--){
        cin>>n>>m;
        p=log(n)/log(m);
        a=pow(m,floor(p));
        b=a*m;
        if(b-n<=n-a)
            ans=b;
        else
            ans=a;
        cout<<ans<<endl;
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Nearest Power  "

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me

0 Comments: