Cod sursa(job #2477525)
Utilizator | Stan Flavius Stefan stan_flavius | Data | 20 octombrie 2019 16:03:29 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m;
int x[17];
void afisare(int k)
{
for(int i=1; i<=k; i++)
{
fout<<x[i]<<" ";
}
fout<<"\n";
}
void Back(int k)
{
for(int i=x[k-1]+1; i<=n-m+k; i++)
{
x[k]=i;
if(k==m) afisare(k);
else Back(k+1);
}
}
int main()
{
fin>>n>>m;
Back(1);
return 0;
}