Uva 12802 - Gift From the Gods


 /*******************
* Accepted
********************/
// Header file begin
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
// End
//..........
// Macro
#define sf scanf
#define pf printf
#define sfint(a,b) scanf("%d %d",&a,&b)
#define sfl(a,b) scanf("%ld %ld",&a,&b)
#define sfll(a,b) scanf("%lld %lld",&a,&b)
#define sfd(a,b) scanf("%lf %lf",&a,&b)
#define sff(a,b) scanf("%f %f",&a,&b)
#define lp1(i,n) for(i=0;i<n;i++)
#define lp2(i,n) for(i=1;i<=n;i++)
#define mem(c,v) memset(c,v,sizeof(c))
#define cp(a) cout<<" "<<a<<" "<<endl
#define nl puts("")
#define sq(x) ((x)*(x))
#define all(x) x.begin(),x.end()
#define sz size()
#define gc getchar()
#define pb push_back
// End.........

// Size
#define mx7 20000100
#define mx6 1500000
#define mx5 100005
#define inf 1<<30                                           //infinity value
#define eps 1e-9
#define mx (65540)
#define mod 1000000007
#define pi acos(-1.0)



using namespace std;
//..................................................................................................................
typedef long long LL;
typedef long L;
typedef unsigned long long ull;
typedef unsigned long ul;
typedef unsigned int ui;
template<class T> T setbit(T n, T pos){n=n|(1<<pos); return n;}
template<class T> T checkbit(T n, T pos){n=n&(1<<pos); return n;}
template<class T> T gcd(T a, T b ) {return b==0?a:gcd(b,a%b);}
template<class T> T large(T a, T b ) {return a>b?a:b;}
template<class T> T small(T a, T b ) {return a<b?a:b;}

bool isPrime(ull n)
{
    if(n<2) return false;

    bool f = false;

    for(ull i=2;i<=sqrt(n);i++)
    {
        if(n % i == 0)
        {
            f = true;
            break;
        }
    }

    if(f)
    {
        return false;
    }

    else
    {
        return true;
    }

    f=false;
    //return false;
}

char ch[mx6];

bool pallin(ull n)
{
    if(isPrime(n))
    {
        ull i,j;

        sprintf(ch,"%llu", n);

        ull len=strlen(ch);

        bool f=false;

        for(i=0,j=len-1;i<len/2;i++,j--)
        {
            if(ch[i]!=ch[j])
            {
                f=true;
                break;
            }
        }

        if(f)
        {
            return false;
        }

        else
        {
            return true;
        }
    }

    else
    {
        return false;
    }
}

int main()
{
    ull n;
    while(1==sf("%llu",&n))
    {
        //(!isPrime(n))?cout <<"no\n":cout <<"yes\n";

        if(pallin(n))
        {
            pf("%llu\n",n*2);
            break;
        }

        else
        {
            pf("%llu\n",2*n);
        }
    }

    return 0;
}

Comments

Popular posts from this blog

SPOJ-CMG - Collecting Mango

LeetCode Palindrome Number

Hacker Rank The Power Sum