Cod sursa(job #1503300)
Utilizator | Data | 15 octombrie 2015 21:11:15 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int c[100],n,k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afisare(int p)
{
for(int i=1;i<=p;i++)
fout<<c[i]<<" ";
fout<<endl;
}
void bkt(int p)
{
for(int pval=c[p-1]+1;pval<=n;pval++)
{
c[p]=pval;
if(p==k) afisare(p);
else
bkt(p+1);
}
}
int main()
{
fin>>n>>k;
bkt(1);
return 0;
}