Cod sursa(job #2652031)
Utilizator | Data | 24 septembrie 2020 08:52:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout("combinari.out");
int n,st[20],k;
void bk (int p)
{
int j,i;
for (i=st[p-1]+1;i<=n;i++)
{
st[p]=i;
if (p==k)
{
for (j=1;j<=k;j++)
fout<<st[j]<<" ";
fout<<'\n';
}
else
bk(p+1);
}
}
int main()
{
fin>>n>>k;
bk(1);
return 0;
}