Mai intai trebuie sa te autentifici.
Cod sursa(job #268334)
Utilizator | Data | 1 martie 2009 07:56:30 | |
---|---|---|---|
Problema | 12-Perm | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<iostream.h>
#include<stdio.h>
#define c 1048576
FILE *f=fopen("12perm.in","r"),*g=fopen("12perm.out","w");
int main()
{//a mod 2^k <-> a & ((2^k)-1)
long x[]={0,1,2,6,12},i,n;
fscanf(f,"%ld",&n);
if(n<=4)
{
fprintf(g,"%d\n",x[n]);
}
else
{
for(i=5;i<=n;i++)
{
x[0]=x[4]+x[2]+2*(i-2);
//x[0]=(x[0])&((2^20)-1);
x[0]=x[0]%c;
x[2]=x[3];x[3]=x[4];x[4]=x[0];
}
fprintf(g,"%d\n",x[4]);
}
return 0;
}