// Bjarne Stroustrup 1/15/2010
// Chapter 5 Exercise 11

/*
	write out Fibonacci numbers.
	Find the largest Fibonacci number that fits in an int

*/

#include "std_lib_facilities.h"	


/*
	Compute the series and note when the int overflows; the previous value was the largest that fit
*/


int main()
try
{
	int n = 1;
	int m = 2;

	while (n<m) {
			cout << n << '\n';
			int x = n+m;
			n = m;	// drop the lowest number
			m = x;	// add a new highest number
	}

	cout << "the largest Fibonacci number that fits in an int is " << n << '\n';

	keep_window_open("~");	// For some Windows(tm) setups
}
catch (runtime_error e) {	// this code is to produce error messages
	cout << e.what() << '\n';
	keep_window_open("~");	// For some Windows(tm) setups
}