Cod sursa(job #2740921)
| Utilizator | Data | 14 aprilie 2021 19:34:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int ans[20];
void afis()
{
int i;
for(i=1; i<=k; i++)
fout << ans[i] << ' ';
fout << '\n';
}
void Back(int p)
{
int i;
for(i=ans[p-1]+1; i<=n; i++)
{
ans[p]=i;
if(p==k)
afis();
else
Back(p+1);
}
}
int main()
{
fin >> n >> k;
Back(1);
return 0;
}
