Pagini recente » Cod sursa (job #1981174) | Cod sursa (job #1238650) | Cod sursa (job #334182) | Cod sursa (job #1171883) | Cod sursa (job #1497621)
#include<fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n;
int st[20];
int back(int k, int masca)
{
if(k == n+1)
{
for(int i=1;i<=n;i++)
g << st[i] << " ";
g << endl;
}
else
{
st[k] = 0;
while(st[k] < n)
{
st[k]++;
if((masca | (1 << st[k])) != masca)
back(k+1, masca | (1 << st[k]));
}
}
}
int main()
{
f >> n;
back(1, 0);
return 0;
}