Cod sursa(job #2629337)
Utilizator | Data | 20 iunie 2020 11:11:24 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int x[19], n, m;
void bacc(int k)
{
int i=1;
if(k>0) i=x[k-1]+1;
for(; i<=n; i++)
{
x[k]=i;
if(k==m-1)
{
for(int j=0; j<m; j++) out<<x[j]<<' ';
out<<'\n';
}
else bacc(k+1);
}
}
int main()
{
in>>n>>m;
bacc(0);
return 0;
}