there is a problem to find first K digits of no. N^N , where N can be as
large as 10^9.
so, the algo goes like,
take fractional part(f) of Nlog10(N).
and temp=pow(10,f),
result =(long )10^k * temp.
I want to assure myself that f has enough fractional part precision so that
at most first 9 digits
I think it should depend on the underlying architecture, on how it stores
the floating data types
In case floats and double are implemented using IEEE 754, then floats have 8
bits for precision and double have 11 bits for precision. Normally the
exponents are biased, which means that for float it
I think it should depend on the underlying architecture, on how it stores
the floating data types
In case floats and double are implemented using IEEE 754, then floats have 8
bits for precision and double have 11 bits for precision. Normally the
exponents are biased, which means that for float it
Do u have to use only C++ ,cant u use scripting languages like
Pythonwhere precision is very good in Python..esp wen u use Si-Py
On Tue, Apr 13, 2010 at 10:10 PM, Himanshu Aggarwal lkml.himan...@gmail.com
wrote:
I think it should depend on the underlying architecture, on how it stores
On Sun, Apr 11, 2010 at 6:55 PM, GentLeBoY vikrantsing...@gmail.com wrote:
how to store fractional numbers with a fractional part having 25-30
digits after decimal place,
does long double has the same precision as double?.
1 more prob.
format specifier for long double is %lf and same for
correct me if I'm wrong but, float has a precision of around 8 digits. and
double 16 digits... if you want arbitrary precision floating point numbers,
try GNU BigNum library...
Anil
On Mon, Apr 12, 2010 at 9:54 PM, Himanshu Aggarwal
lkml.himan...@gmail.comwrote:
On Sun, Apr 11, 2010 at 6:55
how to store fractional numbers with a fractional part having 25-30
digits after decimal place,
does long double has the same precision as double?.
1 more prob.
format specifier for long double is %lf and same for double, so if i
write
long double a;
scanf(%lf,a);
a=a*2;
