Hacker Rank Fibonacci Modified

By -
# -*- coding: utf-8 -*-
"""
Created on 25-Aug-17 at 4:06 AM

@author: Pranta Sarker

Python Version 3

Task: Fibonacci Modified

"""  

inp = input().split(' ');
inp = list(map(int , inp));
#print(inp);

t1 = inp[0];
t2 = inp[1];
n = inp[2];

#print('t1 = ' , t1 , ' t2 = ' , t2 , ' n = ' , n);

fibo = [];

fibo.append(t1);
fibo.append(t2);

for i in range(3 , n+1):
    fibo.append(fibo[(i-2)-1] + (fibo[(i-1)-1]**2));
#print(fibo);
print(fibo[n-1]);

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";         pf("Case %d:\n",++tc);         getchar();         while(n--)         {             //cin >> c;             sf("%c",&c);             if(c == 'A')             {                 //cin >> x;           
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 )         {             digit [len++] = x% 10 ;             x/= 10 ;         }         for ( int i= 0 , j=len- 1 ; i<len; i++, j--)         {             if ( digit [i] != digit [j])             {  
Read more

Uva 10650 - Determinate Prime

By -
/*     Verdict : Accepted     Link: Determinate Prime Solution Link */ #include<bits/stdc++.h> #define limit 32009 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<int>vi; int prm[limit], plen=1; bitset<limit> bs; void sieve() {     LL i,j;     bs.set();     bs[1] = bs[0] = 0;     for(i=2; i<limit; i++)     {         if(bs[i])         {             if(i != 2)             {                 prm[plen++] = i;             }             for(j=i*i;j<limit;j+=i)             {                 bs[j] = 0;             }         }     } } struct dprime {     int dwn, up, dist; }; dprime ar[limit]; void ek() {     int i,pd;     for(i=1; i<plen; i++)     {         pd = prm[i+1] - prm[i];         ar[i].dwn = prm[i];         ar[i].up = prm[i+1];         ar[i].dist = pd;     }     //for(i=1; i<=10; i++)cout << ar[i].dwn << " " << ar[i].u
Read more