Cod sursa(job #1238585)
| Utilizator | Data | 7 octombrie 2014 11:29:08 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int a[17],n,k;
void afis()
{
for(int i=1;i<=n;i++)
if(a[i])fout<<i<<" ";
fout<<"\n";
}
int s=0;
void rez(int ind)
{
if(s>k)
return;
if(ind==n+1){
if(s==k)
afis();
}
else
{
a[ind]=1;
s++;
rez(ind+1);
s--;
a[ind]=0;
rez(ind+1);
}
}
int main()
{
fin>>n>>k;
rez(1);
fin.close();
fout.close();
return 0;
}
