Cod sursa(job #2373552)
Utilizator | Data | 7 martie 2019 14:07:23 | |
---|---|---|---|
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, st[105];
void Back(int x)
{
for(int i=st[x-1]+1; i<=n; i++)
{
st[x]=i;
if(x==k)
{
for(int j=1; j<=x; j++)
fout << st[j] << ' ';
fout << '\n';
}
else
Back(x+1);
}
}
int main()
{
fin >> n >> k;
Back(1);
return 0;
}