Pagini recente » Cod sursa (job #144201) | Cod sursa (job #2728333) | Cod sursa (job #2696757) | Cod sursa (job #1052065) | Cod sursa (job #1589555)
#include <fstream>
using namespace std;
void print(ostream& g, int v[], int n)
{
for (int i = 1; i <= n; i++)
{
g << v[i] << " ";
}
g << "\n";
}
void back(int k, int n, int v[], ofstream& g)
{
if (k == n)
{
print(g, v, n);
}
else
{
for (int i = 1; i <= n; i++)
{
bool ok = true;
for (int j = 1; j <= k; j++)
{
if (v[j] == i)
{
ok = false;
}
}
if (ok)
{
v[k + 1] = i;
back(k + 1, n, v, g);
}
}
}
}
int main()
{
int N, v[10];
ifstream f("permutari.in");
f >> N;
f.close();
ofstream g("permutari.out");
back(0, N, v, g);
g.close();
return 0;
}