## Search found 6 matches

Sun May 28, 2006 7:25 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 23068
No problem, thank you any way. My formula and yours really comes to the same.
Sat May 27, 2006 4:49 pm
Forum: Volume 6 (600-699)
Topic: 623 - 500!
Replies: 187
Views: 44105

### 623; TLE; Explanation of Big Integer Multiplication

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 In...
Sat May 27, 2006 1:38 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 23068
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] -...
Sat May 27, 2006 12:48 am
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 23068

### 108; a little help, please

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...
Thu Mar 09, 2006 6:48 pm
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 67864
Oh, I can't beleve that i didn't see that. Thanks a lot man!
Mon Mar 06, 2006 10:41 pm
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 67864

### 10189 Minesweeper; Runtime Error

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. #incl...