6 years have passed. But anyway, maybe this will help someone, the test number 3 is N = 1

My AC solution returns
55555556 2

My answer is 26 53646707

Thank you "zxy_snow"

Spend some time for enum, cause i don't wanna to calculate in float variables. So fun!)

It must be added to the statement.

thank

Edited by author 09.10.2008 14:39

On test #9 my solution got the same problem.

Edited by author 14.11.2015 14:30

I got it!

[code deleted]

Edited by moderator 21.10.2019 23:03

At first sight, I strongly suggest you to avoid operating repeteadly with floating points, the little errors will accummulate, and WA comes to the order.

at second sight the logic is just not right. Look, I got the same algorithm that a dude with TLE at test9, but with a less complex break condition.

private static int sq(long A,long N){
    double aux= Math.sqrt( ((A*A)<<2) - (A<<2) + 1 + 8*N);
    int r = (int)aux;
    if ((double)r==aux)
        return r;
    else
        return -1;
    }
    public static void main (String[]args){
        Scanner s=new Scanner(System.in);
        int N= s.nextInt();
        long A=1,P=1,root=0;
        while (true){
            root= sq(A,N);
            if (root==-1)
                A++;
            else{
                P= (1-(A<<1)+root)/2;
                break;
            }
        }
        System.out.println(A+" "+(P));
    }