Cod sursa(job #2126039)
Utilizator | Data | 8 februarie 2018 23:39:32 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[25],i,j,n,m,k;
void bktr(int p,int k)
{
if(p==k+1)
{
for(i=1;i<p;i++)
g<<st[i]<<' ';
g<<'\n';
return;
}
for(int x=st[p-1]+1;x<=n;x++)
{
st[p]=x;
bktr(p+1,k);
}
}
int main()
{
f>>n>>k;
st[0]=0;
bktr(1,k);
}