Pagini recente » Cod sursa (job #411374) | Cod sursa (job #1299754) | Cod sursa (job #2883506) | Cod sursa (job #883267) | Cod sursa (job #1313893)
#include<fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int x[9],n;
int verific(int k)
{
int i=0;
for(i=1;i<k;i++)
if(x[i]==x[k])
return 0;
return 1;
}
void bkt(int k)
{
int i=0;
if(k==n+1)
{
{for(i=1;i<=n;i++)
g<<x[i]<<" ";
g<<"\n";
}
}
else
{
x[k]=0;
while(x[k]<n)
{
x[k]++;
if(verific(k)==1)
bkt(k+1);
}
}
}
int main()
{
f>>n;
bkt(1);
return 0;
}