Cod sursa(job #1905807)
Utilizator | Data | 6 martie 2017 11:00:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,a[20];
void afis()
{
int i;
for(i=1;i<=k;i++)
g<<a[i]<<' ';
g<<'\n';
}
void bkt(int i)
{int j;
for(j=a[i-1]+1;j<=n-k+i;j++)
{
a[i]=j;
if(i==k)
afis();
else
bkt(i+1);
}
}
int main()
{
f>>n>>k;
bkt (1);
return 0;
}