OJ Board

Does anybody have any tricky data to 10535?


I know that my code is quite long. I added a lot of debugging data to it.
I have tried to rewrite my code a few times. But I still get WA.

[cpp]
#include <cstdio>
#include <set>
#include <map>
#include <math.h>
#include <assert.h>
#include <vector ...

This input is wrong.
Because "The shooter will never stand on a wall."

it means that abs(x) + abs(y) has to be as low as possible
if you have pairs:
(-1) (3) the sum is 4

(1) (-2) the sum is 3

that's why you choose second pair instead of first one.
If you have two pairs with equal sum then you take player in which x < y

so the correct time for this problem i P * T * (n_of_words)^2 ?

i have rewritten this algorithm to remove floating points and i got WA.
Then i found that in last lint there is bug
printf("%6.2f %17ld\n",x,r);
//
it should be printf("%6.2f %17lld\n",x,r);

I tried to use: printf("%lld,r); and printf("%I64d,r); to print long longer but it doesn't work on acm

int main()
{
long long r = 12345678901234LL;

printf("%lld,r);

}

I can't figure it out why i am getting WA
maybe it is IO problem?

[cpp]
#include <stdio.h>
#define MAXV 8000
#define NCOINS 11

int main( void ) {
int i, j, k;
int coins[] = { 1, 2, 4, 10, 20, 40, 100, 200, 400, 1000, 2000 };
unsigned long d[MAXV+1][NCOINS];
for(i = 0; i <= MAXV; ++i ...

thx, i now i understand it after a few months of trying

i completly don't understand this problem.
In case n = 5 k = 2 i =1
Why the order is 2,5,3,1?
Should it be 2,4,1,5 ?

How to use 64 bit integer in pascal?

Hi
Does anybody know how many times on average is c++ faster than java?
Is 2, 10, 100 or maybe 1000 times??

Hi
Why don't you use stl buildin next_permutation libiary?
for example
http://www.sgi.com/tech/stl/next_permutation.html

you could use string, but it doesn't work with c, c++ only:((

Is there any metod faster than O(N^2)?
I think that i can put all trees in table, and give them value
x + y + z, then sort them so I woulnd't have do in average case N * N compations, it should be in best case 20 times lover.

i think i don't undestand the problem
if missile hits a point
for example 1,1

all power plants in radius 1 will be destroyed??
etc 0,0 ; 0,1 ; 0,2; 1,0;1,1;1,2; 2,0; 2,1 ; 2,2 ???