#Write an efficient program to find the hexadecimal equivalent of a given series of decimal number from n to m import sys import time f=open('c:\inputs\in5_5.txt','r') s=f.readline() i=s.index(",") n=int(s[0:i]) m=int(s[i+1:len(s)]) t1=time.clock() no_div=0 f1=open('out_15_sec5_5.txt','w') while(n<=m): sh="" shn=n while(shn>0): no_div=no_div+1 p=shn%16 shn=shn/16 if(p==10): p="A" elif(p==11): p="B" elif(p==12): p="C" elif(p==13): p="D" elif(p==14): p="E" elif(p==15): p="F" sh=sh+str(p) sh=sh[::-1] f1.write(sh) f1.write(",") n=n+1 mem=sys.getsizeof(n)+sys.getsizeof(m)+sys.getsizeof(no_div)+sys.getsizeof(p)+sys.getsizeof(shn)+sys.getsizeof(sh) t2=time.clock() t=t2-t1 f1.write("\nno. of additions=0\nno.of multiplications=0\nno. of divisions=%d \ntime=%f seconds\nmemory used=%d bytes"%(no_div,t,mem)) f1.close()