Discussion @ 1132. Square Root @ Timus Online Judge

muhammad if got ac it would be a great solution(must be<0.2sec)but i am frustrated with wa 2. [4] // Problem 1132. Square Root 11 Jul 2010 23:34

i think there must be some stupid mistake.My all tests pass it. please provide me good tests or please,kindly let me know the problem in the code:

[code deleted]

AC at last(.187 sec 121 kb)

very very stupid mistake.
if(x==n-x) just print x not x and n-x :P

Edited by author 12.07.2010 10:41

Edited by author 13.07.2010 18:43

SKYDOS [Vladimir SU] Re: I AM SURE IF GOT AC IT WOULD BE ONE OF THE BEST SOLUTIONS(MUST BE <0.2 SEC) BUT I AM FRUSTRATED WITH WA 2. // Problem 1132. Square Root 11 Jul 2010 23:43

dont use Caps Lock...

muhammad Re: if got ac it would be a great solution(must be<0.2sec)but i am frustrated with wa 2. // Problem 1132. Square Root 16 Jul 2010 17:46

now ac in .14 sec 278 kb

sklyack Re: if got ac it would be a great solution(must be<0.2sec)but i am frustrated with wa 2. // Problem 1132. Square Root 14 Apr 2011 20:44

muhammad wrote 11 July 2010 23:34

if(x==n-x)

It's possible only if n==2

esger Re: if got ac it would be a great solution(must be<0.2sec)but i am frustrated with wa 2. // Problem 1132. Square Root 3 Dec 2012 19:16

is it possible to happen x == n-x ??? if yes, then 2*x = n; but n is prime and is not divisible by 2.

Discussion of Problem 1132. Square Root