Pagini recente » Cod sursa (job #2979412) | Cod sursa (job #2509535) | Cod sursa (job #428313) | Cod sursa (job #1227195) | Cod sursa (job #3200282)
#include <bits/stdc++.h>
using namespace std;
ifstream in("12perm.in");
ofstream out("12perm.out");
const int maxn=5e6+5e5+5;
int n;
bool vis[maxn];
int ans=0;
void beck(int l, int last)
{
if(l==n+1)
{
ans++;
return;
}
if(last==-1)
{
for(int i=1;i<=n;i++)
{
if(!vis[i])
{
vis[i]=1;
beck(l+1,i);
vis[i]=0;
}
}
return;
}
for(int i=max(last-2,1);i<=min(last+2,n);i++)
{
if(!vis[i])
{
vis[i]=1;
beck(l+1,i);
vis[i]=0;
}
}
}
int main()
{
in>>n;
beck(1,-1);
out<<ans<<'\n';
return 0;
}