Questions on implementing function for fibonacci

[santiagoe]

I am in the middle of an assignment and cannot figure out what it is asking me to do. I have implemented a fibonacci function using recursion without problems, but have been asked to do this task

Implement the BigInt(unsigned long int) and BigInt(string input) constructors. Strings longer than a long will not be tested; OK to use an longs internally for now. If a negative string is given, set the BigInt to 0. Hint: strtol will convert a char* to a long int.

Implement Bigint::getAsDigits() and Bigint:getAsLong() member functions. It is OK if these are not in their final version. Storing the number as an long internally for lab is OK.

And do not understand exactly what to do, any help would be appreciated I can post code if needed as well. Thanks.

[kbw]

I take it you've been asked to create a BigInt class? The assignment is specifiying some requirements for that class.

[santiagoe]

Yes you are right, I have managed to solve it through some internet tutorials, thanks.