Pagini recente » Cod sursa (job #2549807) | Cod sursa (job #340312) | Istoria paginii runda/231/clasament | Cod sursa (job #2108065) | Cod sursa (job #2388096)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int t[10], n;
bool verifica()
{
for(int i = 1; i < n; ++i)
for(int j = i + 1; j <= n; ++j)
if(t[i] == t[j]) return 0;
return 1;
}
void permutari(int x)
{
for(int i = 1; i <= n; ++i)
{
t[x] = i;
if(x == n)
{
if(verifica())
{
for(int j = 1; j <= n; ++j) fout << t[j] << " ";
fout << "\n";
}
} else permutari(x + 1);
}
}
int main()
{
fin >> n;
permutari(1);
return 0;
}