OJ Board

What if an admin comes in, posts, and then deletes your post? =)

The scanf function requires the cstdio include.

Though, you should really never mix calls between scanf and cin (likewise for printf and cout).

alloc.h is not part of the standard libraries.

test.cpp: In function `int main()':
test.cpp:8: ANSI C++ forbids declaration `big' with no type

The first number is the number of elements.

I got:

There's probably no input where a knight starts at the same position as another knight. Not explicitly stated, but does seem to be an additional constraint.

The PE is more likely due to 'set#1'. I think they can turn case-sensitivity on a per problem basis, but not entirely certain of that.

naive O(N^6) is too slow.. though maybe if you memoize it some, it might be fast enough..

Yes, the input is fine with a long long. But some of the intermediate calculations probably went over 2^63-1.

10^18 doesn't work.

Floating point is inaccurate:

19 20
21
22
29 30
39 40
383
383
259 260
25
11111
1111111111111111111
11
88
99 100
7507507506
3803835948279 3803835948280
59169281361494714
517507628283924
6084072702
63072702753
999 1000
8764
6307
38641
2655
50766
63099 63100

[cpp]struct Foo { int key; int value; bool operator<(const Foo& foo) const { return key < foo.key; } }; priority_queue<Foo> myPriorityQueue;[/cpp] There are many other ones to do it, but usually it is just best to override the less than operator, which is the default for any ordered STL container.

You can always #define a macro to do it.. [c]#define myarray(a,b) realarray[a+20][b+20];[/c] Of course, it would be less efficient since it's doing a+20 and then another addition on the pointer itself, and you'd hafta write code like myarray(-1, -2) instead of myarray[-1][-2]. At least you get rid o...

What are the ASCII values of 0-9, A-Z, and a-z? That's your problem.

Why would the problem be different if multiset were used instead of set for N > 1?