Pagini recente » Cod sursa (job #1259417) | Cod sursa (job #1160644) | Cod sursa (job #2189792) | Cod sursa (job #1436809) | Cod sursa (job #694748)
Cod sursa(job #694748)
#include<iostream>
#include<fstream>
using namespace std;
int K,n,x[10000];
ofstream g("permutari.out");
void afisare()
{
int i;
for(i=1;i<=n;i++)
g<<x[i]<<" ";
g<<endl;
}
int verific(int k)
{
int i,j,ok=1;
for(i=1;i<k;i++)
if(x[i]==x[k])
{
ok=0;
break;
}
return ok;
}
int main()
{
ifstream f("permutari.in");
f>>n
int i,j,k=1;
while(k>0)
if(k==n+1)
{
afisare();
k--;
}
else
if(x[k]<n)
{
x[k]++;
if(verific(k))
k++;
}
else
{
x[k]=0;
k--;
}
}