Cod sursa(job #2376088)
| Utilizator | Data | 8 martie 2019 13:36:35 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,k,stiva[18];
void tipar(){for(int i=1;i<=m;i++)fout<<stiva[i]<<" ";fout<<'\n';}
void bt(int k)
{
for(int i=stiva[k-1]+1;i<=n;i++)
{
stiva[k]=i;
if(k==m) tipar();
else bt(k+1);
}
}
int main()
{///COMBINARI
fin>>n>>m;
bt(1);
return 0;
}
