# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9554 | ainu7 | On grid (kriii2_O) | C++98 | 80 ms | 2736 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int sum[302][302], num[300][300];
int best[300][300];
int main()
{
int R, C;
cin >> R >> C;
for (int i=0; i<R; i++) {
for (int j=0; j<C; j++) {
cin >> num[i][j];
// num[i][j] = rand() % 10 - 5;
// printf("%d ", num[i][j]);
}
// printf("\n");
}
// printf("\n");
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |