Pagini recente » Cod sursa (job #1598691) | Cod sursa (job #2837917) | Cod sursa (job #2542721) | Diferente pentru problema/sn intre reviziile 10 si 20 | Cod sursa (job #1722072)
#include <cstdio>
#define MOD (1<<20)
int d[4];
int main(){
int n, i;
FILE *fin, *fout;
fin=fopen("12-perm.in", "r");
fout=fopen("12-perm.out", "w");
fscanf(fin, "%d", &n);
d[1]=1;
d[2]=2;
d[3]=6;
d[0]=12;
for(i=5; i<=n; i++) d[i&3]=(d[(i-1)&3]+d[(i-3)&3]+2*(i-1))&(MOD-1);
fprintf(fout, "%d\n", d[n&3]);
fclose(fin);
fclose(fout);
return 0;
}