Cod sursa(job #1483095)
Utilizator | Data | 8 septembrie 2015 18:13:11 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k;
int v[20];
void rec(int poz)
{
if(poz == k + 1)
{
for(int i = 1; i <= k; i++)
out << v[i] << " ";
out << "\n";
return ;
}
for(int i = v[poz-1] + 1; i <= n; i++)
{
v[poz] = i;
rec(poz + 1);
}
}
int main() {
in >> n >> k;
rec(1);
return 0;
}