ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1132. Square Root

Weak Tests!!
Posted by данные 22 Dec 2008 20:45
Ah! I think I will get an TLE but got AC the First Time!
You can use brute-force for n=8k+1 and use simple math method for other cases!

Edited by author 22.12.2008 20:46

Edited by author 22.12.2008 20:46
Re: Weak Tests!!
Posted by Fyodor Menshikov 24 Dec 2008 12:02
Publish worst case for your solution please. Is it when k=100000, n is always 8k+1, prime near 32767?
Re: Weak Tests!!
Posted by данные 11 Jan 2009 07:11
Yes!
Re: Weak Tests!!
Posted by Fyodor Menshikov 11 Jan 2009 12:36
And how much time your program work on this test on Timus check server? You may estimate it by comparing time of your current program and the same program also calculating answers (without output) for 1000/10000 such n.

Edited by author 11.01.2009 12:38