Cod sursa(job #2442946)
| Utilizator | Data | 25 iulie 2019 20:19:17 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int m,n;
int st[19];
void afisare(){
for(int i=1;i<=m;i++)
out<<st[i]<<" ";
out<<"\n";
}
void comb(int k,int m) {
if(k==m+1) afisare();
else {
for(int i=st[k-1]+1;i<=n;i++)
{
st[k] = i;
comb(k+1,m);
st[k]=0;
}
}
}
int main()
{
in>>n>>m;
comb(1,m);
return 0;
}
