Pagini recente » Cod sursa (job #856812) | Cod sursa (job #1037587) | Cod sursa (job #3352672) | Cod sursa (job #2662633) | Cod sursa (job #1497567)
#include<fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n;
int st[20];
int back(int k)
{
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]++;
bool valid = true;
for(int i=1; i < k; i++)
{
if(st[i] == st[k])
{
valid = false;
break;
}
}
if(valid)
back(k+1);
}
}
}
int main()
{
f >> n;
back(1);
return 0;
}