Cod sursa(job #3884)
Utilizator | Gigi Becali gigi_becali | Data | 29 decembrie 2006 11:51:36 |
---|---|---|---|
Problema | 12-Perm | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <cstdio>
#define mod 1048576
int main()
{
long long ti, ti1,ti2, ti3;
int n, i;
freopen("12perm.in", "r", stdin);
scanf("%d\n", &n);
if(n==1) {printf("1\n"); return 0;}
if(n==2) { printf("2\n"); return 0;}
if(n==3) { printf("6\n"); return 0;}
if(n==4) { printf("12\n"); return 0;}
ti1=12;
ti2=6;
ti3=2;
for(i=5;i<=n;i++)
{
ti=ti1+ti3+2*(i-2);
ti3=ti2;
ti2=ti1;
ti1=ti;
}
freopen("12perm.out", "w", stdout);
printf("%lld\n", ti%mod);
return 0;
}