Pagini recente » Cod sursa (job #2008138) | Cod sursa (job #3276987) | Cod sursa (job #2917745) | Cod sursa (job #2967592) | Cod sursa (job #1144981)
#include <fstream>
using namespace std;
int v[10];
int main()
{int k, i, n; bool as, ev;
ifstream in("permutari.in");
ofstream out("permutari.out");
in >> n;
k = 1;
while (k > 0)
{
as = 1; ev = 0;
while (as && !ev)
{
if (v[k] < n)
++v[k];
else
as = 0;
ev = 1;
for (i = 1; i < k; ++i)
if (v[i] == v[k])
{
ev = 0;
break;
}
}
if (as)
{
if (k == n)
{
out << v[1];
for (i = 2; i <= n; ++i)
out << ' ' << v[i];
out << '\n';
}
else
{
++k;
v[k] = 0;
}
}
else
--k;
}
return 0;
}