Cod sursa(job #2100489)
Utilizator | Iustinian Petrariu IustinPetrariu | Data | 5 ianuarie 2018 18:26:08 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#define nmax 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m;
int x[nmax],pus[nmax];
void afisare()
{
for(int i =1 ; i<= m ; i++)
fout<<x[i]<<" ";
fout<<'\n';
}
void bkt(int k)
{
for(int i = x[k-1]+1 ; i <= n ; i++)
{
x[k]=i;
//pus[i]=1;
if(k==m)afisare();
else bkt(k+1);
}
}
int main()
{
fin>>n>>m;
bkt(1);
return 0;
}