Cod sursa(job #544386)
| Utilizator | Data | 1 martie 2011 15:52:47 | |
|---|---|---|---|
| Problema | Sortari2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
const char iname[] = "sortari2.in";
const char oname[] = "sortari2.out";
const int maxn = 1005;
const int mod = 999017;
ifstream f(iname);
ofstream g(oname);
int a[maxn], s[maxn], i, n, rez;
int main() {
f >> n;
a[1] = 1;
s[1] = 1;
rez = 1;
for (i = 2; i <= n; ++i)
a[i] = (a[i - 1] + s[i - 1]) % mod, s[i] = (a[i] + s[i - 1]) % mod, rez = (rez * i) % mod;
rez -= a[n];
if (rez < 0)
rez += mod;
g << rez << "\n";
}
