Cod sursa(job #1466777)
| Utilizator | Data | 30 iulie 2015 13:12:46 | |
|---|---|---|---|
| Problema | Combinari | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int s[102],n, K, v[102];
void afis()
{
int k=0;
for(int i=1;i<=n;i++)
if(s[i])
k++;
if(k!=K)
return;
for(int i=1;i<=n;i++)
if(s[i])
g<<v[i]<<" ";
g<<'\n';
}
void bk(int k)
{
if(k>n)
{
afis();
return;
}
s[k]=0;
bk(k+1);
s[k]=1;
bk(k+1);
}
int main()
{
f>>n>>K;
for(int i=1;i<=n;i++)
v[i]=i;
bk(1);
return 0;
}
