-
Notifications
You must be signed in to change notification settings - Fork 0
/
Problem 25.cpp
79 lines (74 loc) · 2.5 KB
/
Problem 25.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<vector>
using namespace std;
void multiply(int base);
void add(unsigned long long n);
#define ARRAYSIZE 8000
vector<unsigned long long> productA(1);
vector<unsigned long long> productB(1);
//const int productLength = ARRAYSIZE;
int main(){
long long digits;
cout << "Find first Fibo with X digits: ";
cin >> digits;
productA[0] = 1;
productB[0] = 1;
cout << productA[0] << endl;
cout << productB[0] << endl;
long long currentterm = 2;
while(productB.size() < digits){
vector<unsigned long long> tempSum(1);
tempSum.clear();
for(long i = 0; i< productB.size(); i++){
if (i >= productA.size()){
tempSum.push_back(productB[i]);
}else{
tempSum.push_back(productA[i] + productB[i]);
}
}
productA = productB;
productB = tempSum;
for (int pos = 0; pos < productA.size(); ++pos){//goes through digits
for (double y = 1; productA[pos] >= 10; ++y){//Carrys digits accordingly
if (y != 0){
//cout << pos << " "<< pos + y << " " << productA.size() << endl;
//system("PAUSE");
if(pos + (int)y > productA.size()-1){
//cout << "test";
productA.push_back (floor(productA [pos] / pow(10, y)));
productA[pos] -= floor(productA [pos] / pow(10, y)) * 10;
} else {
productA[pos + (int)y] += floor(productA [pos] / pow(10, y));
productA[pos] -= floor(productA [pos] / pow(10, y)) * 10;
}
}
}
}
for (int pos = 0; pos < productB.size(); ++pos){//goes through digits
for (double y = 1; productB[pos] >= 10; ++y){//Carrys digits accordingly
if (y != 0){
//cout << pos << " "<< pos + y << " " << productB.size() << endl;
//system("PAUSE");
if(pos + (int)y > productB.size()-1){
//cout << "test";
productB.push_back (floor(productB [pos] / pow(10, y)));
productB[pos] -= floor(productB [pos] / pow(10, y)) * 10;
} else {
productB[pos + (int)y] += floor(productB [pos] / pow(10, y));
productB[pos] -= floor(productB [pos] / pow(10, y)) * 10;
}
}
}
}
currentTerm++;
}
for(long i = productB.size() -1; i>= 0; i--){
cout << productB[i];
}
cout << endl << endl << endl;
cout << currentTerm << endl << productA.size() << endl << productB.size();
system("PAUSE");
return(0);
}