Cod sursa(job #3138606)
| Utilizator | Data | 20 iunie 2023 16:31:48 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[21],n,m;
void afis(int p)
{
for(int i=1; i<=p; i++)
fout<<st[i]<<" ";
fout<<'\n';
}
int solutie(int p)
{
return p==m;
}
void bk(int p)
{
for(int i=st[p-1]+1; i<=n; i++)
{
st[p]=i;
if(solutie(p))
afis(p);
if(p<m) bk(p+1);
}
}
int main()
{
fin>>n>>m;
bk(1);
}
