# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826532 | detroiddh | Dijamant (COCI22_dijamant) | C++17 | 4 ms | 2004 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<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll maxn = 2003;
const ll mod = 1e9 + 7;
int m , n;
int table[maxn * 2 + 3][maxn * 2 + 3] , pfs[maxn * 2 + 3][maxn * 2 + 3];
void sub1()
{
int ans = 0;
for(int i = 1 ; i <= n + m - 1 ; ++i)
{
for(int j = 1 ; j <= n + m - 1 ; ++j)
{
pfs[i][j] = pfs[i - 1][j] + pfs[i][j - 1] - pfs[i - 1][j - 1] + table[i][j];
}
}
// for(int i = 1 ; i <= n + m - 1 ; ++i)
// {
// for(int j = 1 ; j <= n + m - 1 ; ++j)
// {
// cout<<table[i][j]<<" ";
// }
// cout<<'\n';
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |