Cod sursa(job #1118755)
| Utilizator | Data | 24 februarie 2014 13:05:17 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,k,x[9];
void afis()
{
for(int i=1; i<=n; i++) g << x[i] << " ";
g << '\n';
}
int cont(int k)
{
for(int i=1; i<k; i++)
if(x[k] == x[i]) return 0;
return 1;
}
void back()
{
k = 1; x[k] = 0;
do
{
while(x[k] < n)
{
x[k] = x[k] + 1;
if(cont(k))
if(k == n) afis();
else x[++k] = 0;
}
k--;
}
while(k);
}
int main()
{
f >> n;
back();
g.close();
return 0;
}
