Cod sursa(job #1592118)
Utilizator | Vlad Dumitru-Popescu depevlad | Data | 7 februarie 2016 00:56:02 |
---|---|---|---|
Problema | Sortari2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("sortari2.in");
ofstream out("sortari2.out");
const int N = 2010;
const int MOD = 999017;
int fib[N];
int main() {
int n, i, j, fact, sum;
in >> n;
fib[1] = fib[2] = 1;
for(i = 3; i <= 2*n - 1; i++) {
fib[i] = (fib[i - 1] + fib[i - 2]) % MOD;
}
for(fact = 1, i = 2; i <= n; i++) {
fact = 1LL * fact * i % MOD;
}
out << (fact + MOD - fib[2*n - 1]) % MOD << '\n';
return 0;
}