OJ Board

To compare two components, I am using something very similar to what Per has done. I perform all the 8 transformations on the matrix and store the coordinates in an array and sort the array. Now, I take the lexicographically least one. I keep getting WA :( Could someone see if I am overlooking somet...

Hi dootzky

your code does not see is the first element is > 0.
you have used br[p.q] > 0

The comma operator does not do anything. So its as if you see if the memory address of b[q][0] is > 0 which is a tautology. Thus, you basically run the function on every pair (i,j).

I checked my output with yours. It is the same
still i get WA.

As mentioned above, for negative numbers, i print a symmetric output (all digits same, only sign changed. I have also checked that 0 does not get printed as '0

could someone give me some advice

I kept getting WA when my code checked for `can't determine' like this: if (v>=u) printf ("can't determine\n"); then i changed it to if (v>=u || u==0 || v==0) printf ("can't determine\n"); and got AC :lol: isn't the first one correct? when v == 0 (the river is still), i can determine the time differ...

Please mail the admin about this.
They may be able to help you (help themselves )

You need not construct the sieve upto 2^31. It is enough if you construct a sieve to sqrt(2^31) and store the primes in an array. Now if the number is composite, one factor will surely be in the array so do whatever is required for each factor by looping through the array. and divide by the factor i...

Just a small mistake.
The title of the post is 10865 instead of 10685

I also checked all the inputs that eh had given. My program also was giving proper answer but gave WA when submitted. Then i found that the mistake was: when seeing the kings's move, i incremented king's pos without seeing if it wraps to the next row. May be that is the mistake in yours. Check it up

That's right

g++ version 3.2 and the newer g++ 3.3 have features not supported by judge.

Judge uses g++/gcc 2.96

luckily my institution uses the same compiler.

So in theory atleast I should get no "Compiler Error"