Cod sursa(job #1759916)
| Utilizator | Data | 19 septembrie 2016 23:43:30 | |
|---|---|---|---|
| Problema | Sortari2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <cstdio>
#define MOD 999017
#define MAXN 1000
int d[MAXN+1];
int main(){
int n, i, j, fact;
FILE *fin, *fout;
fin=fopen("sortari2.in", "r");
fout=fopen("sortari2.out", "w");
fscanf(fin, "%d", &n);
fact=1;
for(i=2; i<=n; i++) fact=fact*i%MOD;
d[1]=1;
for(i=2; i<=n; i++){
d[i]=2*d[i-1];
for(j=i-2; j>=0; j--) d[i]+=d[j];
d[i]%=MOD;
}
fprintf(fout, "%d\n", (fact-d[n]+MOD)%MOD);
fclose(fin);
fclose(fout);
return 0;
}
