Pagini recente » Cod sursa (job #79791) | Cod sursa (job #2789249) | Cod sursa (job #2784141) | Cod sursa (job #1422476) | Cod sursa (job #2713477)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
long long a[20];
int n,k,fr[20];
void afisare()
{
for(int i=1;i<=k;i++)
{
g<<a[i]<<" ";
}
g<<"\n";
}
void Back(int nivel)
{
if(nivel==k+1)
{
afisare();
}
else
{
for(int i=1;i<=n;i++)
{
if(i>a[nivel-1] && fr[i]==0)
{
fr[i]++;
a[nivel]=i;
Back(nivel+1);
fr[i]=0;
}
}
}
}
int main()
{
f>>n;
f>>k;
Back(1);
return 0;
}