Oh shoot! It looks like it just barely fits in a long int or whatever the 8 byte int type is. Man, it's pretty easy to see how large factorials can become!Originally Posted by Elkvis
This might also be a good lesson in how and why to use typedefs for this kind of thing.
But as for displaying, it might be easiest to just store all 20 factorial calculations in an array. Then you can simply iterate it and print as you go. Including the weird `std::cout << arr[0] << " " << arr[10] << "\n";` to get 2 columns.
