Cod sursa(job #2108738)
Utilizator | Data | 18 ianuarie 2018 19:20:18 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, k, v[20], fr[20];
ifstream f("combinari.in");
ofstream g("combinari.out");
void backt(int nr)
{
if (nr==k+1)
{
for (int i=1; i<nr; i++)
g << v[i] <<' ';
g << endl;
return;
}
for (int i=v[nr-1]+1; i<=n; i++)
{
v[nr]=i;
backt(nr+1);
}
}
int main()
{
f >> n >> k;
backt(1);
return 0;
}