Pagini recente » Cod sursa (job #2323794) | Cod sursa (job #177194) | Cod sursa (job #387333) | Cod sursa (job #2374651) | Cod sursa (job #914309)
Cod sursa(job #914309)
#include <problema bifata>
#include <fstream>
#define md (1<<20)-1
using namespace std;
ifstream f("12perm.in");
ofstream g("12perm.out");
int n,t2,t3,t1,i,aux;
int t[]={1,2,6,12};
int main()
{
f>>n;
if(n<=4)
{
g<<t[n-1];
goto stop;
}
for(i=5;i<=n;i++)
{
aux=(t[3]+t[1]+2*(i-2))&md;
t[1]=t[2];
t[2]=t[3];
t[3]=aux;
}
g<<t[3];
stop:
return 0;
}