Pagini recente » Cod sursa (job #624883) | Cod sursa (job #2777951) | Cod sursa (job #463239) | Cod sursa (job #989541) | Cod sursa (job #1708157)
#include<iostream>
#include<fstream>
using namespace std;
int a[100], n,k;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afis()
{
for(int i=1;i<=k;i++)
g<<a[i]<<" ";
g<<endl;
}
int valid(int x)
{
for(int i=1;i<x;i++)
if(a[x]<=a[i])
return 0;
return 1;
}
void BK(int x)
{
for( int i=1;i<=n;i++)
{
a[x]=i;
if(valid(x)!=0)
if(k==x)
afis();
else
BK(x+1);
}
}
int main()
{
f>>n;
f>>k;
BK(1);
return 0;
}