## Search found 9 matches

Thu Jun 02, 2005 8:11 am
Forum: Volume 107 (10700-10799)
Topic: 10707 - 2D-Nim
Replies: 15
Views: 20572

### Wrong Answer with storing as vector<pair< int, int>

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...
Sun May 29, 2005 4:51 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 21792

### Why AC

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).
Mon Jan 24, 2005 10:15 am
Forum: Volume 107 (10700-10799)
Topic: 10764 - Signed-digit numbers
Replies: 9
Views: 6145

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
Mon Jan 24, 2005 8:15 am
Forum: Volume 107 (10700-10799)
Topic: 10773 - Back to Intermediate Math
Replies: 41
Views: 16761

### Judge Solution Incorrect

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...
Wed Aug 04, 2004 8:43 pm
Forum: Off topic (General chit-chat)
Topic: donation
Replies: 2
Views: 1789

Wed Aug 04, 2004 8:38 pm
Forum: Volume 101 (10100-10199)
Topic: 10139 - Factovisors
Replies: 80
Views: 26285

### Square root sieve

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...
Wed Aug 04, 2004 8:18 pm
Forum: Volume 106 (10600-10699)
Topic: 10685 - Nature
Replies: 41
Views: 17667

### Wrong problem number

Just a small mistake.
The title of the post is 10865 instead of 10685
Sat Jul 17, 2004 4:55 pm
Forum: Volume 2 (200-299)
Topic: 255 - Correct Move
Replies: 17
Views: 4207

### Got it AC

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
Mon Mar 01, 2004 1:20 pm
Forum: Other words
Topic: Compiler / Interpreter ???
Replies: 11
Views: 3418

### Judge Compiler

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"