Cod sursa(job #2460540)
| Utilizator | Data | 23 septembrie 2019 21:25:58 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
typedef unsigned short us;
us n, k, st[20], c[20];
void bt(short lvl)
{
for(us i = st[lvl-1] + 1; i <= n; i++)
{
st[lvl] = i;
if(lvl == k)
{
for(us i = 1; i <= k; i++)
fout << st[i] << " ";
fout << "\n";
}
else bt(lvl + 1);
}
}
int main()
{
fin >> n >> k;
bt(1);
return 0;
}
