Cod sursa(job #2300225)
| Utilizator | Data | 10 decembrie 2018 23:21:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N, K, s[20];
void bk(int poz)
{
if(poz == K+1)
{
for(int i=1; i<=K; i++)
fout<<s[i]<<' ';
fout << '\n';
return;
}
for(int i=s[poz-1]+1; i<=N; i++)
{
s[poz] = i;
bk(poz+1);
s[poz] = 0;
}
}
int main()
{
fin >> N >> K;
bk(1);
return 0;
}
