Cod sursa(job #1970699)
Utilizator | Data | 19 aprilie 2017 15:44:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,x[9],viz[9];
void afis()
{
for(int i=1;i<=n;++i)
g<<x[i]<<" ";
g<<'\n';
}
void backt(int k)
{
for(int i=1;i<=n;++i)
if(!viz[i])
{
viz[i]=1;
x[k]=i;
if(k==n)
afis();
else
backt(k+1);
viz[i]=0;
}
}
int main()
{
f>>n;
backt(1);
return 0;
}