Cod sursa(job #1473793)
| Utilizator | Data | 20 august 2015 11:06:37 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int a[19],b[19],n,k;
void combinari(int k,int lg,int maxi)
{
if(k-1 == maxi)
{
for(int i = 1; i <= maxi;i++)
fout<<a[i]<<" ";
fout<<'\n';
}
else
{
for(int i = 1; i <= lg; i++)
if(!b[i] && a[k-1] < i)
{
a[k] = i;
b[i] = 1; //o folosim
combinari(k+1,lg,maxi);
b[i] = 0;
}
}
}
int main()
{
fin>>n>>k;
combinari(1,n,k);
return 0;
}
