Cod sursa(job #2494810)
Utilizator | Data | 18 noiembrie 2019 15:11:18 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int n,k;
int v[137];
void bectrecc(int l)
{
if(l==k)
{
for(int i=1;i<=l;i++)
out<<v[i]<<' ';
out<<'\n';
}
else
{
for(int i=v[l]+1;i<=n;i++)
v[l+1]=i,bectrecc(l+1);
}
}
int main()
{
in>>n>>k;
bectrecc(0);
return 0;
}