Cod sursa(job #1621286)
| Utilizator | Data | 29 februarie 2016 18:06:52 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,x[20];
void bkt(int);
int main()
{
f>>n>>k;
bkt(1);
return 0;
}
void bkt(int p)
{
int i;
if(p==k+1)
{
for(i=1;i<=k;i++)
g<<x[i]<<' ';
g<<'\n';
return;
}
for(i=x[p-1]+1;i<=n;i++)
{
x[p]=i;
bkt(p+1);
}
}
