Pagini recente » Cod sursa (job #2827793) | Borderou de evaluare (job #2023275) | Cod sursa (job #912299) | Cod sursa (job #2128916) | Cod sursa (job #2087801)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,k,i,b[10001],s[10001];
void af(int n)
{
int i;
for(i=1;i<=n;i++)
g<<s[i]<<" ";
g<<'\n';
}
void bkt(int k)
{
int i;
if(k==n+1)
af(n);
else
{
for(i=1;i<=n;i++)
if (b[i]==0)
{
s[k]=i;
b[i]=1;
bkt(k+1);
b[i]=0;
}
}
}
int main()
{
f>>n;
bkt(1);
return 0;
}