Cod sursa(job #2102499)
| Utilizator | Data | 8 ianuarie 2018 22:23:07 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int s[25],n,Z;
void afisare()
{for(int i=1;i<=Z;i++) fout<<s[i]<<' ';
fout<<'\n';
}
int valid(int k)
{for(int i=1;i<k;i++) if(s[k]==s[i]) return 0;
return 1;
}
void generare(int k)
{for(int i=1;i<=n;++i)
{s[k]=i;
if(valid(k)) if(k==Z) afisare();
else generare(k+1);
}
}
int main()
{fin>>n>>Z;
generare(1);
return 0;
}
