Pagini recente » Cod sursa (job #1999526) | Cod sursa (job #2285702) | Cod sursa (job #1030210) | Cod sursa (job #2892731) | Cod sursa (job #984039)
Cod sursa(job #984039)
#include <iostream>
#include<fstream>
using namespace std;
int s[20],k,n;
ifstream f("permutari.in");
ofstream g("permutari.out");
int bun()
{
int i;
for(i=1;i<k;i++)
if(s[k]==s[i])
return 0;
return 1;
}
int solutie()
{
if(n==k)
return 1;
else
return 0;
}
void afisare()
{
int i;
for(i=1;i<=n;i++)
g<<s[i]<<" ";
g<<endl;
}
void bkt()
{
k=1;
while(k>0)
{
if(s[k]<n)
{
s[k]++;
if(bun())
if(solutie())
afisare();
else
k++;
}
else
{
s[k]=0;
k--;
}
}
}
int main()
{
f>>n;
bkt();
f.close();
g.close();
return 0;
}