OJ Board

No problem, thank you any way. My formula and yours really comes to the same.

Hello!
I have tryed to solve this problem, but without luck. The answer from the judge is always TLE, even though I use precalculation (I precalculate all factorials and store them in an array, then read the input and output the matching factorial from the array).
So my problem must be in the Big ...

Thank you for your reply. But it seams that you have made a mistake because you don't use p or q. :wink:
But never mind, I have found the formula. If anyone ever needs this:
If upper-right corner is [p][q] and the lower-left corner is [a] , then the sum of that rectangle is:
sum[a] - sum[a][q - 1 ...

Hello! I have read a lot of posts on this board about this problem, but I still cannot realy understand how to solve the problem.
I understand that, first, I should create another matrix which will at position [a] hold the sum of all the elements in the sub-matrix that has an upper-left corner in [0 ...

Oh, I can't beleve that i didn't see that. Thanks a lot man!

Hi!
I have just started programming in C++, and I found this easy problem. I have submited solutions for this problem a lot of times and always the answer from the judge is Runtime Error. And, also, it seams to me that for every test case I can think of the program works fine.
This is my code ...