I have a question.
When we find factorial of big numbers using recursion and C language the digits become huge to even fit in 64 bit or even unsigned long long int .
When we use python in other case we still get the answer with comparatively large numbers with the same recursion. ^ __ ^ How is that possible ? Help 
coz python has big integer integrated in its language and cpp havent.
integrated ?
well when I used type()
it was showing class int type.