Last active
July 12, 2019 01:59
-
-
Save hikarin522/a54eb03c4cb558e73967d5110ca1bc74 to your computer and use it in GitHub Desktop.
Fibonacci
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <tuple> | |
//#include <boost/multiprecision/cpp_int.hpp> | |
#include <boost/multiprecision/gmp.hpp> | |
namespace mp = boost::multiprecision; | |
//typedef mp::cpp_int mpint; | |
typedef mp::mpz_int mpint; | |
mpint fib(uint32_t n); | |
std::tuple<mpint, mpint> fib2(uint32_t n); | |
int main() | |
{ | |
std::cout << "Hello World!\n"; | |
uint32_t n = ~(uint32_t)0; | |
std::cout << "msb(fib(" << n << ")) = " << mp::msb(fib(n)) << std::endl; | |
} | |
mpint fib(uint32_t n) | |
{ | |
if (n == 0) | |
{ | |
return 0; | |
} | |
auto tmp = fib2(n >> 1); | |
auto m = std::get<0>(tmp); | |
auto m1 = std::get<1>(tmp); | |
if ((n & 1) == 0) | |
{ | |
return ((m1 << 1) + m) * m; | |
} | |
else | |
{ | |
return (m * (m + m1) << 1) + m1 * m1; | |
} | |
} | |
std::tuple<mpint, mpint> fib2(uint32_t n) | |
{ | |
if (n == 0) | |
{ | |
return std::make_tuple(0, 1); | |
} | |
auto tmp = fib2(n >> 1); | |
auto m = std::get<0>(tmp); | |
auto m1 = std::get<1>(tmp); | |
return (n & 1) == 0 | |
? std::make_tuple<mpint, mpint>(((m1 << 1) + m) * m, m * m + m1 * m1) | |
: std::make_tuple<mpint, mpint>((m * (m + m1) << 1) + m1 * m1, ((m1 << 1) + m) * m); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
using System.Numerics; | |
namespace Fib | |
{ | |
internal class Program | |
{ | |
private static void Main(string[] args) | |
{ | |
Console.WriteLine("Hello World!"); | |
uint n; | |
do | |
{ | |
Console.Write("\nn = "); | |
} | |
while (!uint.TryParse(Console.ReadLine(), out n)); | |
Console.WriteLine($"Fib({n}) = {fib(n)}"); | |
Console.ReadLine(); | |
} | |
private static BigInteger fib(uint n) | |
=> fib2(n).Item1; | |
private static (BigInteger, BigInteger) fib2(uint n) | |
{ | |
if (n == 0) | |
{ | |
return (BigInteger.Zero, BigInteger.One); | |
} | |
var (m, m1) = fib2(n >> 1); | |
return (n & 1) == 0 | |
? (((m1 << 1) + m) * m, m * m + m1 * m1) | |
: ((m * (m + m1) << 1) + m1 * m1, ((m1 << 1) + m) * m); | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment