Uva 10236 - The Fibonacci Primes

By - 

 /// formula : fibonacci_prime = fibonacci [ prime[k] ];

/// 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<utility>
#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 mx4 2500010
#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;
typedef pair<int, int> pii;

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;}

LL prime[mx4],prm[(mx4/2)+1],plen=1;

void seieve(ull n)
{
    LL i,j,x=(ul)sqrt(double(n)) + 1;

    prime[0]=setbit<LL>(prime[0],0);
    prime[0]=setbit<LL>(prime[0],1);

    for(i=4;i<=n;i+=2)
    {
        prime[i>>5]=setbit<LL>(prime[i>>5],i&31);
    }

    for(i=3;i<x;i+=2)
    {
        if(!(checkbit<LL>(prime[i>>5],i&31)))
        {
            for(j=i*i;j<=n;j+=i)
            {
                prime[j>>5]=setbit<LL>(prime[j>>5],j&31);
            }
        }
    }

    for(i=2;i<=n;i++)
    {
        if(!(checkbit<LL>(prime[i>>5],i&31)))
        {
            prm[plen++]=i;
        }
    }

    //for(i=1;i<=plen;i++)cp(prm[i]);
}

double fibo[mx4]; // take it as double to adjust the size of Fibonacci numbers

void fib()
{
    bool f=false;

    //fibo[0]=1;
    fibo[1]=1;
    fibo[2]=1;

    for(LL i=3;i<=mx4;i++)
    {
        if(f)
        {
            f=false;
            fibo[i]=fibo[i-1] + fibo[i-2] / 10;
        }

        else
        {
            fibo[i]=fibo[i-1] + fibo[i-2];
        }

        if(fibo[i] > 1e9)
        {
            f=true;
            fibo[i] /= 10;
        }
    }

    //f=false;
}

int main()
{
    seieve(mx4);
    fib();
    LL n;
    while(1==sf("%lld",&n))
    {
        if(n==1)
        {
            pf("2\n");
        }

        else if(n==2)
        {
            pf("3\n");
        }

        else
        {
            pf("%lld\n",(LL)fibo[prm[n]]);
        }
    }

    return 0;
}

Comments

Post a Comment

Popular posts from this blog

SPOJ-CMG - Collecting Mango

By -
#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<queue> #include<stack> #include<map> #include<cmath> #include<algorithm> #define psb push_back #define ppb pop_back #define all(x) x.begin(),x.end() #define N 1000100 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<LL>vll; LL ar[N] , num[N]; int main() {     int t , tc=0;     //cin >> t;     sf("%d",&t);     while(t--)     {         LL n, x, arlen=-1, nmlen=-1 , i , maxi=-1 , zar;         char c;         //cin >> n;         sf("%lld",&n);         //cout << "Case " << ++tc << ":\n";       ...
Read more

LeetCode Palindrome Number

By -
 Problem Description Link:  https://leetcode.com/problems/palindrome-number/ Accepted Solution /* The solution is easy, and I believe everyone knows the process. However, one problem is that x is a number. If it is a string, in that case, we can get the result after reversing it. Therefore, to solve the problem, we have to find the digits by modulating 10, store them in an array, and finally compare from both sides. If we find any discrepancy, we can tell it is not a palindrome. Note that any negative integer would never be a palindrome since it should contain a minus (-) sign. */ class Solution { public:     bool isPalindrome ( int x ) {         int digit [ 50 ], len= 0 ;         bool f = true ;         if (x < 0 ) {             return false ;         }         while (x> 0 )         {       ...
Read more

Hacker Rank The Power Sum

By -
Problem Link: The Power Sum #include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(0) #define bfast cin.tie(0) #define outs(x) cout << x << " " #define outn(x) cout << x << "\n" #define sf scanf #define pf printf #define pfn(x , k) printf(k , x) #define nl puts("") #define psb push_back #define mset(c,v) memset(c , v , sizeof c) #define loop0(n) for(int i=0; i<n; i++) #define loop1(n) for(int i=1; i<=n; i++) #define mpair(x , y) make_pair(x , y) #define all(x) x.begin(), x.end() #define pi acos(-1.0) #define psb push_back #define clr clear() typedef unsigned long long ull; typedef long long LL; typedef vector<int>vii; typedef vector<LL>vll; typedef vector<string>vs; typedef map<int, int>mpii; typedef map<string, int>mpsi; typedef map<char, int>mpci; typedef map<LL, LL>mpll; const int mod = 1000007; const int high = 1002; int x = 0 , y; int getWay(L...
Read more