Cod sursa(job #1238181)
Utilizator | Data | 5 octombrie 2014 21:54:27 | |
---|---|---|---|
Problema | Sortari2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include<fstream>
#define M 999017
using namespace std;
ifstream f("sortari2.in"); ofstream g("sortari2.out");
long long n,nr,i,p=1,F[2000];
int main()
{ f>>n;
F[0]=F[1]=1;
for(i=2;i<=2*n-2;++i) F[i]=(F[i-1]+F[i-2])%M;
for(i=2;i<=n;++i) p=(p*i)%M;
g<<(p-F[2*n-2]+M)%M<<'\n'; g.close(); return 0;
}