所以我正在学习C++.我已经获得了"C++编程语言"和"有效的C++",而且我正在运行Project Euler.问题1 ... dunzo.问题2 ......没那么多.我在VS328上使用Win32控制台应用程序.
什么是斐波纳契数列的所有偶数项的总和低于400万?
它没有工作,所以我减少到100的测试用例......
这是我写的......
// Problem2.cpp : Defines the entry point for the console application. // #include "stdafx.h" using namespace std; int _tmain(int argc, _TCHAR* argv[]) { cout << "Project Euler Problem 2:\n\n"; cout << "Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:\n\n"; cout << "1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...\n\n"; cout << "Find the sum of all the even-valued terms in the sequence which do not exceed four million.\n\n"; cout << "Answer: " << Solve(); } double Solve() { int FibIndex = 0; double result = 0.0; double currentFib = GenerateNthFibonacciNumber(FibIndex); while (currentFib < 100.0){ cout << currentFib << " " << (int)currentFib << " " << (int)currentFib % 2 << "\n"; if ((int)currentFib % 2 == 0){ result += currentFib; cout<<(int)currentFib; } currentFib = GenerateNthFibonacciNumber(++FibIndex); } return result; } double GenerateNthFibonacciNumber(const int n){ //This generates the nth Fibonacci Number using Binet's Formula const double PHI = (1.0 + sqrt(5.0)) / 2.0; return ((pow(PHI,n)-pow(-1.0/PHI,n)) / sqrt(5.0)); }
这是输出......
项目欧拉问题2:
Fibonacci序列中的每个新术语都是通过添加前两个术语生成的.从1和2开始,前10个术语将是:
1,2,3,5,8,13,21,34,55,89 ......
找出序列中所有偶数值的总和,不超过四百万.
0 0 0
1 1 1
1 1 1
2 2 0
3 3 1
5 5 1
8 8 0
13 13 1
21 21 1
34 34 0
55 54 0
89 89 1
答案:99
所以我有三列调试代码...从generate函数返回的数字,(int)generatedNumber和(int)generatedNumber%2
所以在我们的第11个学期
55,54,0
为什么(int)55 = 54?
谢谢
转换以int
截断数字 - 就像你打电话一样floor(currentFib)
.因此,即使currentFib
是54.999999
......(一个接近55的数字,它将在打印时被四舍五入),(int)currentFib
将产生54.
由于浮点舍入,55行计算类似于54.99999.将double转换为int会截断.99999.
在我的机器上,打印一列显示(currentFib-(int)currentFib)
错误,顺序为1.42109e-14.所以它更像是0.999999999999986.