OJ Board

The time limit is now changed to 10s.
How can I make that??
In my mind, I have to use 2 loops, one for the x, and one for finding the root. If we can find the root, then y and z can be found.
However, the speed is extremely slow if N is 100000, since there are N*N iterations.
Please help...

Hi tatter:
I think i understand how you can the root...
but in term of speed, this is still slower.
how can i make it within 10s??
thanks

Hi tatter:

Can you please explain how your code works??
Thanks

I always got the wrong answer...
why??

[c]
#include <stdio.h>

void main()
{
int size;
int sum;
int max;
int A[101][101];
int B[101][101];

while(scanf("%d\n", &size) == 1)
{
sum = 0;
for(int i = 0; i <= 100; i++)
{
for(int j = 0; j <= 100; j++)
{
A [j] = 0;
B [j] = 0;
}
}
if(size ...