Cod sursa(job #2333460)
| Utilizator | Data | 1 februarie 2019 09:41:16 | |
|---|---|---|---|
| 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, v[20], p = 0;
void Afisare()
{
for(int i = 1; i <= k; ++i)
g << v[i] << " ";
g << "\n";
}
void Back(int t)
{
for(int i = t; i <= n; ++i)
{
v[++p] = i;
if(p == k) Afisare();
Back(i+1);
--p;
}
}
int main()
{
f >> n >> k;
Back(1);
}