Cod sursa(job #2104256)
Utilizator | Data | 11 ianuarie 2018 14:56:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, k, p, st[100];
void BT(int k)
{
for(int i = 1; i <= n; i++)
{
st[k] = i;
if(st[k] > st[k-1])
if( k == p)
{
for(int j = 1; j <= k; j++)
cout << st[j]<<" ";
cout << '\n';
}
else
BT(k+1);
}
}
int main()
{
cin >> n >> p;
BT(1);
return 0;
}