Cod sursa(job #2382929)
| Utilizator | Data | 18 martie 2019 20:19:24 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream inf("combinari.in");
ofstream outf("combinari.out");
int n, k;
vector<int> v;
void comb(int ,int );
int main()
{
inf>>n>>k;
for(int i=1; i<=n-k+1; i++)
comb(i, k-1);
return 0;
}
void comb(int val, int cat)
{
v.push_back(val);
if(cat==0)
{
for(auto it:v)
outf<<it<<' ';
outf<<'\n';
}
else
for(int x=val+1; x<=n; x++)
comb(x, cat-1);
v.pop_back();
}
