Cod sursa(job #2121322)
| Utilizator | Data | 3 februarie 2018 16:01:52 | |
|---|---|---|---|
| Problema | Combinari | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,st[20],f[20];
void perm(int niv, int n, int m)
{
if(niv > m)
{
for(int i = 1; i <= n; i++)
fout<<st[i]<<" ";
fout<<'\n';
}
else
{
for(int i = st[niv - 1] + 1; i <= n; i++)
if(f[i] == 0)
{
st[niv] = i;
f[i] = 1;
perm(niv+1, n, m);
f[i] = 0;
}
}
}
int main()
{
fin >> n >> m;
perm(1,n,m);
return 0;
}
