Correct me if I am wrong, but The answer to your question is given by yourself, it relies on the arbitrary precision arithmetic of Decimal module of python, which is doing all the work. and infact your solution is slower than the one given in the analysis. The given solution works in logarithmic time on t. In your solution you use exact sqrt function, which uses babylonian sqrt method, which I believe has a similar complexity, but on your desired precision (which is set to 10^100)
-- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msg/google-code/-/Sa2ZLAa5V2MJ. For more options, visit https://groups.google.com/groups/opt_out.
