Pagini recente » Cod sursa (job #2164383) | Cod sursa (job #2652173) | Cod sursa (job #1945041) | Cod sursa (job #2131361) | Cod sursa (job #864992)
Cod sursa(job #864992)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int st[10],n;
void afis()
{
int e;
for (e=1;e<=n;e++)
g<<st[e]<<" ";
g<<'\n';
}
void back(int t)
{
int e,q=1;
if (t==n+1)
afis();
else if (t<=n)
{
st[t]=0;
while (st[t]<n)
{
st[t]++;
q=1;
for (e=1;e<t;e++)
if (st[e]==st[t])
{
q=0;
break;
}
if (q)
back(t+1);
}
}
}
int main ()
{
f>>n;
back(1);
}