Handle integer of order 10^37

#1

I was solving a problem where I need to multiply two numbers of order 10^18. So I wanted to know whether there is any way in C++ to handle a number of order 10^37.

#2

No we don’t have any direct way to handle such big numbers.
We use some trick or logic to handle them

  • represent number in array, i.e store individual digits of number as individual element of array
    eg : 100047 as arr[]={1,0,0,0,4,7} now we can use are usually basic operation.
  • we can also use modulus properties.

Note: it depends on the question which way we use to handle large numbers.
Example question to understand concept : small factorial on codechef. (this uses first way )

Hit like if you get it!
Cheers :stuck_out_tongue:
Happy coding