Pagini recente » Cod sursa (job #2226256) | Cod sursa (job #2326675) | Cod sursa (job #2172755) | Cod sursa (job #292438) | Cod sursa (job #213797)
Cod sursa(job #213797)
#include <fstream.h>
void Back(int k);
int Ok(int k);
void Afisare();
int x[20], n;
ofstream fout("permutari.out");
int main()
{
ifstream fin("permutari.in");
fin >> n;
fin.close();
Back(1);
return 0;
}
void Back(int k)
{
for(int i = 1; i <= n; i++)
{
x[k] = i;
if(Ok(k))
if(k == n)
Afisare();
else Back(k + 1);
}
}
int Ok(int k)
{
for(int i = 1; i < k; i++)
if(x[i] == x[k]) return 0;
return 1;
}
void Afisare()
{
for(int i = 1; i <= n; i++)
fout << x[i]<< " ";
fout << '\n';
}