Search:

hi frndz....

i was wondering that given
1<n<1000000 &
1<r<1000000

how do i efficiently find nCr (combination) for any given values of n & r.

please help with an efficient algorithm...

hi frndz...
here's a very small doubt that's been lingering for a while...

what is the meaning of finding an algorithm for a certain problem in constant space??
i dont understand the meaning of...

int fun(int(*)());

int main()
{
fun(main);
cout<<"in main"<<endl;
return 0;
}

fun(int (*p)())

its still not working yaar!!

dividing that no: by 16 gives a remainder that comes out in decimal form and not in a hexadecimal form. so i have to convert it into a hexadecimal form in order to...

thats ur call....nywayz Thanx...

cud u pls write me the code....??

hey, i am still unclear!!

let me show u a snippet....

/* int x;
x=0x4e2aff;
char arr[6];
*/
now what i want is to store these values at six locations in an array.
i.e

what i meant to say was...
the input can either be a hexadecimal form or in decimal form...

cant take it as an char**.
it has to be read in as an integer.

for ex:
if i take it from a console input its got to be...

int x;
cin>>x;// where input is 0x6a2eff

the constraint is that the input cannot be taken as a string. had that been the case, it would have been pretty simple.

but the input is only in the form of an integer.....

hi Guyz...
need some help here...
i want to input an integer but it can be either in hexadecimal form or in integer form.
the problem is that i would like to store that input in that particular...