Cod sursa(job #2478653)
Utilizator | Data | 22 octombrie 2019 15:26:22 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k;
int v[25];
void backTracking(int x)
{
if(x == k + 1)
{
for(int j = 1; j <= k ;j++)
g << v[j] << " ";
g << "\n";
}
int i = v[x - 1] + 1;
while(i <= n)
{
v[x] = i;
backTracking(x + 1);
i++;
}
}
int main() {
f >> n >> k;
backTracking(1);
}