Cod sursa(job #542342)
Utilizator | Eugenie Daniel Posdarascu eudanip | Data | 26 februarie 2011 12:02:34 |
---|---|---|---|
Problema | Sortari2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Romanian Master in Mathematics and Sciences 2011, Ziua 2 | Marime | 0.6 kb |
#include<stdio.h>
#define MOD 999017
#define ll long long
int sol,d[1005],n;
int main ()
{
int i,j;
freopen("sortari2.in","r",stdin);
freopen("sortari2.out","w",stdout);
scanf("%d",&n);
d[0]=d[1]=1;
for(i=2;i<=n;i++)
{
d[i]=d[i-1];
for(j=1;j<=i-1;j++)
{
d[i]+=d[j];
if(d[i]>=MOD)
d[i]%=MOD;
}
}
sol=1;
for(i=2;i<=n;i++)
{
sol*=i;
sol%=MOD;
}
sol-=d[n];
if(sol<0)
sol+=MOD;
printf("%d\n",sol);
return 0;
}