Cod sursa(job #2049869)
| Utilizator | Data | 27 octombrie 2017 19:02:30 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#define NUM 20
int v[NUM];
int n, k;
using namespace std;
ofstream g("combinari.out");
void afisare()
{
for(int i = 1; i <= k; i++)
g << v[i] << " ";
g << '\n';
}
void backt(int a)
{
for(int i = v[a - 1] + 1; i <= n; i++)
{
v[a] = i;
if(a == k)
afisare();
else
backt(a + 1);
}
}
int main()
{
ifstream f("combinari.in");
f >> n >> k;
f.close();
backt(1);
g.close();
}
