Cod sursa(job #2810131)
Utilizator | Data | 28 noiembrie 2021 16:41:20 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int sol[20];
void afisare(int n)
{
for(int i = 1; i <= n; ++i)
fout<<sol[i]<<' ';
fout<<'\n';
}
void combinari(int n, int k, int p)
{
for(int i = sol[k-1] + 1; i <= n; ++i)
{
sol[k] = i;
if(k == p)
afisare(p);
else
combinari(n, k + 1, p);
}
}
int main()
{
int n, p;
fin>>n>>p;
combinari(n, 1, p);
return 0;
}