Cod sursa(job #1841709)
Utilizator | Data | 5 ianuarie 2017 22:08:00 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int uz[20],n,k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int back(int l,int u)
{
int i;
if(l==k)
{for(int i=1;i<=n;i++)
if(uz[i])
fout<<i<<' ';
fout<<endl;}
else
{
for(i=u;i<=n;i++)
if(!uz[i])
{
uz[i]=1;
back(l+1,i+1);
uz[i]=0;
}
}
}
int main()
{
fin>>n;
fin>>k;
back(0,1);
return 0;
}