Pagini recente » Cod sursa (job #360874) | Cod sursa (job #3288003) | Cod sursa (job #2518324) | Cod sursa (job #586724) | Cod sursa (job #1131798)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,kk,a[100],fol[100],kkk=1,sum[1000],s;
void afisare()
{
for(int i=1;i<=kk;i++) g<<a[i]<<" ";
g<<"\n";
}
void back(int k)
{
int i;
if(k>kk) { afisare();}
else
{
for(i=1;i<=n;i++)
{
if(fol[i]==0 && i>a[k-1]) {a[k]=i;fol[i]=1;back(k+1);fol[i]=0;}
}
}
}
int main()
{
f>>n>>kk;
back(1);
return 0;
}