Cod sursa(job #2374449)
Utilizator | Data | 7 martie 2019 18:46:46 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,comb[19];
void afisare()
{
for(int i=1;i<=m;++i)
g<<comb[i]<<" ";
g<<'\n';
}
void generare(int k)
{
if(k==m+1)
afisare();
else
for(int i=comb[k-1]+1;i<=n-m+k;++i)
{
comb[k]=i;
generare(k+1);
}
}
int main()
{
f>>n>>m;
generare(1);
return 0;
}