|
|
back to boardif got ac it would be a great solution(must be<0.2sec)but i am frustrated with wa 2. 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 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. dont use Caps Lock... Re: if got ac it would be a great solution(must be<0.2sec)but i am frustrated with wa 2. now ac in .14 sec 278 kb Re: if got ac it would be a great solution(must be<0.2sec)but i am frustrated with wa 2. Posted by sklyack 14 Apr 2011 20:44 if(x==n-x) It's possible only if n==2 Re: if got ac it would be a great solution(must be<0.2sec)but i am frustrated with wa 2. Posted by esger 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. |
|
|