斐波那契数列（面向对象版）

class Fib{ private: int f, g; public: Fib(int n){ f = 1; g = 0; while (g < n) next(); } int get() { return g;} int next(){ g += f; f =

>>阅读原文<<