Cod sursa(job #1655093)
Utilizator | Data | 17 martie 2016 18:49:34 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,st[19],k;
void init()
{
f>>n>>k;
}
void afis(int p)
{
for(int i=1; i<=p; i++)
g<<st[i]<<" ";
g<<'\n';
}
int valid(int p)
{
if(p>1 && st[p]<=st[p-1])
return 0;
return 1;
}
void comb(int p)
{
for(int pval=1; pval<=n; pval++)
{
st[p]=pval;
if(valid(p))
if(p==k)
afis(p);
else
comb(p+1);
}
}
int main()
{
init();
comb(1);
return 0;
}