#program to find factorial of position of first n Fibonacci primes import sys from time import clock try: input=open('in2_6.txt','r+') output=open('out_26_2_6.txt','w') except IOError: print "The file does not exist" memory=0 for row in input: n=int(row) start=clock() addi=0 memory=memory+sys.getsizeof(addi) memory=memory+sys.getsizeof(n) a=1 b=1 count=0 num=2 multi=0 memory=memory+sys.getsizeof(a)+sys.getsizeof(b)+sys.getsizeof(count)+sys.getsizeof(num)+sys.getsizeof(multi) while count!=n: flag=0 c=a+b addi=addi+1 a=b b=c num=num+1 addi=addi+1 k=int(b**0.5) memory=memory+sys.getsizeof(flag)+sys.getsizeof(c)+sys.getsizeof(k) for i in range(2,k+1,1): if b%i==0: flag=1 break if flag==0: count=count+1 addi=addi+1 fact=1 for i in range(num,0,-1): fact=fact*i multi=multi+1 start=clock()-start output.write(str(fact)) output.write("\n") memory=memory+sys.getsizeof(fact) output.write(" No of additions are "+str(addi)+"\n No of multipications are "+str(multi)+"\n Time consumed is "+str(start)+" secs""\n Memory consumed is "+str(memory)+" bytes") input.close() output.close()