# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1054063 | juicy | 마스코트 (JOI13_mascots) | C++17 | 110 ms | 106728 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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N = 3e3 + 5, MD = 1e9 + 7;
int add(int a, int b) {
if ((a += b) >= MD) {
a -= MD;
}
return a;
}
int fact[N * N], dp[N][N], C[N][N];
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int r, c, n; cin >> r >> c >> n;
fact[0] = 1;
for (int i = 1; i <= r * c; ++i) {
fact[i] = (long long) fact[i - 1] * i % MD;
}
for (int i = 0; i <= max(r, c); ++i) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |