Thursday, 6 April 2017

Geeksforgeeks Solution For " Palindrome numbers "

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

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        unsigned long long int n,n1,rem,i=1,binary=0,res=0,sum=0;
        cin>>n;
        while (n!=0)
        {
        rem=n%2;
        n/=2;
        binary+=rem*i;
        i*=10;
        }
        n1=binary;
        //cout<<binary;
        while (n1!=0)
        {
        res=n1%10;
        sum=sum*10+res;
        n1=n1/10;
        }
        //cout<<sum;
        if(binary==sum)
        cout<<"1\n";
        else
        cout<<"0\n";
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Palindrome numbers "

No comments:
Write comments

Recommended Posts × +