# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
682632 | Alex_tz307 | Anagramistica (COCI21_anagramistica) | C++17 | 10 ms | 14292 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;
const int mod = 1e9 + 7;
const int N = 2e3;
int dp[1 + N], C[1 + N][1 + N];
void addSelf(int &x, int y) {
x += y;
if (x >= mod) {
x -= mod;
}
}
int add(int x, int y) {
addSelf(x, y);
return x;
}
int mult(int x, int y) {
return (int64_t)x * y % mod;
}
void precalc(int n) {
for (int i = 0; i <= n; ++i) {
C[i][0] = 1;
for (int j = 1; j <= i; ++j) {
C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |