Cod sursa(job #3120448)
Utilizator | Data | 7 aprilie 2023 00:54:37 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, p;
int v[20];
void afis(int k)
{
for(int i = 1; i<=k; i++)
{
g<<v[i]<<" ";
}
g<<endl;
}
void bk(int k)
{
for(int i = v[k-1] + 1; i<=n; i++)
{
v[k] = i;
if(k == p)
{
afis(k);
}
else
{
bk(k+1);
}
}
}
int main()
{
f>>n>>p;
v[0] = 0;
bk(1);
return 0;
}