Cod sursa(job #2477573)
Utilizator | Data | 20 octombrie 2019 18:23:26 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
std::ifstream cin("combinari.in");
std::ofstream cout("combinari.out");
int n,m;
int x[20];
///n=4 m=3
void show()
{
for(int i=1; i<=m; i++)
cout<<x[i]<<' ';
cout<<'\n';
}
void bkt(int poz)
{
for(int i=x[poz-1]+1; i<=n-m+poz; i++)
{
x[poz]=i;
if(poz==m) show();
else bkt(poz+1);
}
}
int main()
{
cin>>n>>m;
bkt(1);
return 0;
}