- #1
trollcast
Gold Member
- 282
- 13
Hi,
I'm working my way through the project euler problems in c++ and I've got to one where you have to sum 100 numbers that are each 50 digits long to find the first 10 digits of the sum.
Obviously I could solve it by summing each of the figits in turn then work with them to deal with carry overs.
However I was wondering if there was a way I could write some code to implement something like Java's Big Int datatype?
I'm a bit of a noob with c++ and my google fu isn't working tonight so any links or help would be great.
I'm working my way through the project euler problems in c++ and I've got to one where you have to sum 100 numbers that are each 50 digits long to find the first 10 digits of the sum.
Obviously I could solve it by summing each of the figits in turn then work with them to deal with carry overs.
However I was wondering if there was a way I could write some code to implement something like Java's Big Int datatype?
I'm a bit of a noob with c++ and my google fu isn't working tonight so any links or help would be great.