The and (Python) of the factorial from 1 to n

Today in Baidu stroll some of the platform of CTF, accidentally found a programming problem, then, I just learned the Python knowledge to solve the problem

The description of the topic is this:

Calculates the 1!+2!+3!+...+6666! after five bits.

This calculation is very large, I still use the traditional method, let the computer calculate it

Here is the code:

1 #-*-coding:utf-8-*-2 #Calculate 1!+2!+3!+......+n!3 ImportSYS4 5 deffact (x):6result = 17      forIinchXrange (2,x+1):8Result *=I9     returnresultTen  One defEnd_result (n): ARESULT1 =0 -      forIinchXrange (1,n+1): -RESULT1 + =fact (i) the     returnRESULT1 -  - if __name__=='__main__': -num = Int (sys.argv[1]) +     PrintEnd_result (num)

Have to say that Python is powerful, so long data can be listed

The and (Python) of the factorial from 1 to n