sorry bout that.. thanks
i want to print the double base representation of a number ie if my number is 38 i shud get 36 + 2 and for 655 i shud get 648 + 6 + 1. here's my...
thanks a million!!!:pleased:
i know it might sound stupid asking this but im stumped. how could i modify the binary search code so as to find an element in the array which is...
i want it to print the powers of 2 and 3 ie (2^i)*(3^j) with i and j from 0 to 64 ie the output shud be 1,2,3,4,6,8,9,12,15,16,18..... but i dont...
im writin this code to generate the powers of 2 n 3 ie (2^i)*(3^j) with i and j from 0 to 64 and since im using NTL i dont have to worry bout...
hey thanks... so u meant go backward from the maximum possible value right? well i tried this: if(j==0 || ULONG_MAX/pow(3,j)>pow(2,i)) {...
the first line shud've been thanks.
tcaseshanks.. but you know some of the answers are wrong, only a few though. its like this: my compiler is of 32 bits, and in my code im checking...
hey. sorry bout that. what i want to do is to print the different results of (2^i)*(3^j) with i and j both from 0 to 32, which will be something...
#include<iostream> #include<math.h> using namespace std; main() { int c,n,d; /*math.pow returns a double good idea to cast it to a u int, just...
im writing a code where im multiplying 2 and 3 with their powers, ie (2 ^ i) * ( 3 ^ j )..n if the resultant sum is greater than 32 bits then im...
hi ppl! i would like to know how to use a binary search tree to find the optimal double base representation of a decimal number for eg with...
hi there! n thanks for the warm welcome!
Separate names with a comma.
