Cod sursa(job #983849)
| Utilizator | Data | 12 august 2013 20:29:32 | |
|---|---|---|---|
| Problema | 12-Perm | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <cassert>
#include <cstdio>
const int mod=(1<<20);
int n=0,i=0,sol=0,v[10];
int main()
{
assert(freopen("12perm.in","r",stdin));
assert(freopen("12perm.out","w",stdout));
v[1]=1;v[2]=2;v[3]=6;v[4]=12;
assert(scanf("%d",&n));
if (n<5)
sol=v[n];
else
for (i=5; i<=n; ++i)
{
v[5]=(v[4]+v[2]+2*(i-2))%mod;
v[1]=v[2];
v[2]=v[3];
v[3]=v[4];
v[4]=v[5];
}
printf("%d\n",sol);
return 0;
}
