Cod sursa(job #2258572)
Utilizator | Data | 11 octombrie 2018 17:48:05 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n,p,x[20];
void bkt(int k)
{
if (k==p+1)
{
for (int i=1; i<=p; i++)
fout<<x[i]<<' ';
fout<<'\n';
return;
}
for (int v=x[k-1]+1; v<=n; v++)
{
x[k]=v;
bkt(k+1);
}
}
int main()
{
fin>>n>>p;
bkt(1);
return 0;
}