欧拉计划第25题
作者:
brivia
,
2024-02-17 15:08:03
,
所有人可见
,
阅读 37
#include<bits/stdc++.h>
using namespace std;
vector<int> add(vector<int> A, vector<int> B)
{
vector<int> C;
int i = 0, j = 0, n = A.size(), m = B.size(), c = 0;
while (i < n && j < m)
{
c += A[i] + B[j];
C.push_back(c % 10);
c /= 10;
i ++;
j ++;
}
while (i < n)
{
c += A[i];
C.push_back(c % 10);
c /= 10;
i ++;
}
while (j < m)
{
c += B[j];
C.push_back(c % 10);
c /= 10;
j ++;
}
while (c)
{
C.push_back(c % 10);
c /= 10;
}
return C;
}
int main(void)
{
vector<int> A, B, C;
A.push_back(1);
B.push_back(1);
int n = 2;
while (B.size() < 1000)
{
C = add(A, B);
A = B;
B = C;
n ++;
}
cout << n << endl;
return 0;
}