OJ Board

My code runs okay on my computer and I really don't know why it got an RTE. I've tried to enlarge the array of my BigInt to 2500, and checked that no divide-by-zero will possibly happen. I think it's not the problem of array-index-out-of-bound because that should have caused a WA on my computer. I'd...

Since I didn't find any testcase with instructions beginning with 8 or 9, I made some and hope that will be helpful to those who make the same mistakes as I did. Input: 2 221 422 425 000 311 712 712 913 031 299 233 255 990 803 301 050 100 Output: 10 26 to williamxu: I didn't know if you've solved th...

I assumed N <= 5000 and got AC.

Thanks both of you. I've adapted my code, but still getting wrong answer. Help me, please. Input: 30 5 6 7 8 9 10 100 1000 1001 3333 3334 2555 4999 5000 7098 7099 7100 7111 7222 7777 8884 8999 9000 9001 9030 9025 9028 9998 9999 10000 Output: 2 3 4 2 1 2 1 2 3 3 3 3 4 2 3 3 4 4 3 3 2 4 2 2 3 1 2 3 4 ...

Another question:
I've seen at somewhere that this problem can be solved using DFS, but how can I use DFS without getting TLE?

And could someone explain the ideas of other solutions for me?
I think there are many better solutions above, but I can't understand them very well.

Thanks.

I got Compile Error, but my code works fine on my computer. Could somebody tell me what in my code would cause Compile Error, please? Thanks! Code deleted after Accepted! Note: Never use "void sort( iterator start, iterator end, StrictWeakOrdering cmp );" in c++ algorithm. It has caused me...

I can't find a board for Volume CXIV, so I put this here. Could somebody check for me if my answer below is right? Input: 10 10 100 1000 1001 2555 4999 5000 9998 9999 10000 Output: 2 1 5 3 5 5 2 3 4 1 If my answer for the above testcase is right, someone give me some more tricky testcase please. Tha...

I tried to solve this problem using Floyd-Warshall but getting wrong. I think there must be some logical mistake in my code, but I don't know where it is. This is part of my code. Somebody please give me some suggestion. Thank you! /* 1. M is zero. 2. In the beginning matrix[i][j] is set to 1 if i a...

To rafagiu:
Thanks for your testcase.
They did help me a lot!

By the way, in the last testcase, the n is 21.
I'd got confused by that case for some time, but it was really useful.

Thanks! I understand.

Here's my code.
I use the same method as problem 357.
I really don't know where could be wrong...
Thanks for checking it for me!

Would it be the reason of wrong answer?
Or there might be other errors in my code?

Please give me some more tricky test cases.
Thanks!

Thanks. I got Accepted. =)

txandi wrote: long long int total[MAX+1];

total[0]=1;
for(int i=0;i<5;i++)
{
...
}
...

Why isn't it necessary to set all the elements in 'total' to zero before using it?

Somebody help me!
I've tried all the test cases I could find on the board but still WA.
Could someone give me more critical test cases?

By the way is there any negetive numbers in the input or some test case like this?