Search found 1 match

Go to advanced search

by foo
Thu May 17, 2012 10:02 pm
Forum: Volume 1 (100-199)
Topic: 113 - Power of Cryptography
Replies: 163
Views: 50516

113 precision

Hi,
I just did problem '113 - Power of Cryptography', using the simple pow(p, 1/n) technique.
Though I don't quite see how this can be correct, as <= p <= 10^101 .
Isn't this too big for a double? For ex in java:
double d = Double.parseDouble("4357186184021382204544");
System.out.println(d ...

Go to advanced search