76 lines
1.5 KiB
C++
76 lines
1.5 KiB
C++
|
#include <iostream>
|
||
|
|
#include <cstring>
|
||
|
|
#include <vector>
|
||
|
|
#include <algorithm>
|
||
|
|
#include "number.h"
|
||
|
|
|
||
|
|
Number fib(int n)
|
||
|
|
{
|
||
|
|
Number a = 0; // F0
|
||
|
|
Number b = 1; // F1
|
||
|
|
for (int i = 1; i <= n; ++i) {
|
||
|
|
if (i % 2) {
|
||
|
|
a += b;
|
||
|
|
} else {
|
||
|
|
b += a;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (n % 2) {
|
||
|
|
return b;
|
||
|
|
}
|
||
|
|
return a;
|
||
|
|
}
|
||
|
|
|
||
|
|
Number factorial(int n)
|
||
|
|
{
|
||
|
|
Number result {
|
||
|
|
1};
|
||
|
|
for (int i = 2; i < n + 1; ++i) {
|
||
|
|
result = Number(i) * result;
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
void grad(Number n)
|
||
|
|
{
|
||
|
|
|
||
|
|
std::cout << "n = " << n;
|
||
|
|
Number max = n;
|
||
|
|
unsigned long long int steps = 0;
|
||
|
|
while (n != Number(1)) {
|
||
|
|
if (n > max) {
|
||
|
|
#ifdef _DEBUG_COMP
|
||
|
|
std::cout << n << " is greater than " << max << std::endl;
|
||
|
|
#endif
|
||
|
|
max = n;
|
||
|
|
}
|
||
|
|
if (n.isEven()) {
|
||
|
|
n.div2();
|
||
|
|
} else {
|
||
|
|
n = Number(3) * n + Number(1);
|
||
|
|
}
|
||
|
|
#ifdef _DEBUG_GRAD
|
||
|
|
if (steps > 100) {
|
||
|
|
std::cout << "break" << std::endl;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
++steps;
|
||
|
|
}
|
||
|
|
std::cout << " steps = " << steps << " max = " << max << std::endl;
|
||
|
|
}
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
std::cout << "===FIB===" << std::endl;
|
||
|
|
std::cout << "F(1000) = " << fib(1000) << std::endl;
|
||
|
|
std::cout << "===FAC===" << std::endl;
|
||
|
|
std::cout << "1000! = " << factorial(1000) << std::endl;
|
||
|
|
std::cout << "===GRAD===" << std::endl;
|
||
|
|
grad(Number("7"));
|
||
|
|
grad(Number("256"));
|
||
|
|
grad(Number("1117065"));
|
||
|
|
grad(Number("4761963248413673697"));
|
||
|
|
grad(Number("90560792656972947582439785608972465789628974587264056284658721771"));
|
||
|
|
}
|