Pagini recente » Cod sursa (job #1204950) | Cod sursa (job #1342096) | Cod sursa (job #60986) | Cod sursa (job #3142925) | Cod sursa (job #1174997)
#include<fstream>
using namespace std;
int x[12],n,i,k;
int valid(int k)
{
int i;
for(i=1;i<k;i++)
if(x[i]==x[k])
return 0;
return 1;
}
int main()
{
ifstream f("permutari.in");
ofstream g("permutari.out");
f>>n;
for(i=1;i<=n;i++)
x[i]=0;
i=1;
do
{
do
{
x[i]++;
if(x[i]>n)
{
x[i]=0;
i--;
}
else
if(valid(i))
i++;
}while(i<=n&&i>0);
if(i>n)
{
for(i=1;i<=n;i++)
g<<x[i]<<" ";
i=n;
g<<"\n";
}
}while(i>0);
return 0;
}