Thursday, 6 April 2017

Geeksforgeeks Solution For " Sum of Consecutives "

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

Submit Your Solution :- Click Here 

Solution :- 

#include<bits/stdc++.h>
using namespace std;
bool Consec(unsigned int n)
{
    return ((n&(n-1)) && n);
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        unsigned long long int n;
        cin>>n;
        Consec(n)? cout << "1" :cout << "0";
        cout<<endl;
        
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Sum of Consecutives "

No comments:
Write comments

Recommended Posts × +