Pagini recente » Cod sursa (job #2506770) | Cod sursa (job #247674) | Cod sursa (job #911585) | Cod sursa (job #2120368) | Cod sursa (job #2090685)
#include <bits/stdc++.h>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int st[10], n;
bitset < 10 > used;
void back (int k)
{
if(k>n)
{
for(int i=1; i<=n; i++)
out<<st[i]<<' ';
out<<'\n';
}
else
{
for(int i=1; i<=n; i++)
{
st[k]=i;
if(used.test(i)==false)
{
used.set(i);
back(k+1);
used.reset(i);
}
}
}
}
int main()
{
in>>n;
back(1);
return 0;
}