Cod sursa(job #2452518)
Utilizator | Data | 31 august 2019 00:43:35 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,v[19];
void bkt(int poz)
{
if(poz==k)
{
for(int i=1; i<=k; i++)
out<<v[i]<<" ";
out<<'\n';
return;
}
for(int i=v[poz]+1; i<=n; i++)
{
v[poz+1]=i;
bkt(poz+1);
v[poz+1]=0;
}
}
int main()
{
in>>n>>k;
bkt(0);
return 0;
}