int a = 1;变量
<<n位：在二进制数后面填上n个0，$(1 << n = 2^n)$
In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you have to determine the number of digits in the factorial of the number.
Update your browser to view this website correctly. Update my browser now