Cod sursa(job #2206819)
Utilizator | Data | 23 mai 2018 21:17:03 | |
---|---|---|---|
Problema | Dame | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, k, st[10000];
void Afis()
{
for(int i = 1; i <= k; i++)
cout << st[i] << " ";
cout << '\n';
}
void BT(int p)
{
if(p == k+1)
Afis();
else
for(int i = st[p-1]+1; i <= n; i++)
{
st[p] = i;
BT(p+1);
}
}
int main()
{
cin >> n >> k;
BT(1);
return 0;
}