Cod sursa(job #1618357)
| Utilizator | Data | 27 februarie 2016 19:47:39 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int st[10],n;
void afis()
{
for(int i=1;i<=n;i++)
g<<st[i]<<" ";
g<<'\n';
}
void back(int k)
{
if(k>n) afis();
else
{
for(int i=1;i<=n;i++)
{
st[k]=i;
int q=1;
for(int j=1;j<k;j++)
if(st[k]==st[j]) q=0;
if(q==1) back(k+1);
}
}
}
int main()
{
f>>n;
back(1);
return 0;
}
