division

I have made a program that divides numbers and then returns the number, But the thing is that when it returns the number it has a decimal like this: 2.0 But I want it to give me: 2 so is there anyway I can do this? Thanks in Advance! You can call int() on the end result: >>> int(2.0) 2 When a number as a decimal it is usually a float in Python. If you want to remove the decimal and keep it an integer ( int ). You can call the int() method on it like so... >>> int(2.0) 2 However, int rounds down so... >>> int(2.9) 2 If you want to round to the nearest integer you can use round : >>> round(2.9)

I have read this post on binary multiplication using two complement. but it is not very clear to me. Even I have difficulty understanding the wiki article on this. I want to know how to go about calculating multiplications of negative numbers: eg: -1 with -7 should give 7. A 4-bit, 2's complement of -1 is : 1111 A 4-bit, 2's complement of -7 is : 1001 some step-wise way of calculating the multiplication will be helpful. No article I came across talks about division. How to approach this? step 1: sign extend both integers to twice as many bits. This is safe to do, though may not always be

When I compile this code with VC++10: DWORD ran = rand(); return ran / 4096; I get this disassembly: 299: { 300: DWORD ran = rand(); 00403940 call dword ptr [__imp__rand (4050C0h)] 301: return ran / 4096; 00403946 shr eax,0Ch 302: } 00403949 ret which is clean and concise and replaced a division by a power of two with a logical right shift. Yet when I compile this code: int ran = rand(); return ran / 4096; I get this disassembly: 299: { 300: int ran = rand(); 00403940 call dword ptr [__imp__rand (4050C0h)] 301: return ran / 4096; 00403946 cdq 00403947 and edx,0FFFh 0040394D add eax,edx

I remember from assembly that integer division instructions yield both the quotient and remainder. So, in python will the built-in divmod() function be better performance-wise than using the % and // operators (suppose of course one needs both the quotient and the remainder)? q, r = divmod(n, d) q, r = (n // d, n % d) To measure is to know (all timings on a Macbook Pro 2.8Ghz i7): >>> import sys, timeit >>> sys.version_info sys.version_info(major=2, minor=7, micro=12, releaselevel='final', serial=0) >>> timeit.timeit('divmod(n, d)', 'n, d = 42, 7') 0.1473848819732666 >>> timeit.timeit('n // d,

I read here that remquo should return: If successful, returns the floating-point remainder of the division x/y as defined in std::remainder, and a value whose sign is the sign of x/y and whose magnitude is congruent modulo 2 n to the magnitude of the integral quotient of x/y , where n is an implementation-defined integer greater than or equal to 3 . Now clearly I've misunderstood all that techno-speak cause I thought that I was going to get back the fractional result of the division. Instead this operation: int quot; const float rem = remquo(7.0F, 4.0F, &quot); Sets quot to 2 and rem to -1.0 !