Cod sursa(job #635507)
| Utilizator | Data | 19 noiembrie 2011 12:33:12 | |
|---|---|---|---|
| Problema | Dirichlet | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | .com 2011 | Marime | 0.44 kb |
# include <cstdio>
const char *FIN = "dirichlet.in", *FOU = "dirichlet.out";
const int MAX = 1000005, MOD = 9999991;
int N, F[MAX], dp[MAX];
int main (void) {
fscanf (fopen (FIN, "r"), "%d", &N);
F[0] = 1;
for (int i = 1; i <= N; ++i)
F[i] = (F[i - 1] * i) % MOD;
dp[1] = 1;
for (int i = 2; i <= N; ++i)
dp[i] = (dp[i - 1] * (i - 1) + 1) % MOD;
fprintf (fopen (FOU, "w"), "%d", dp[N]);
}
