Pagini recente » Cod sursa (job #1591535) | Cod sursa (job #2066632) | Cod sursa (job #2600516) | Cod sursa (job #1592653) | Cod sursa (job #1135012)
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,kk,x[101];
void afis()
{
int w=1;
for(int i=1;i<kk;i++)
for(int j=i+1;j<=kk;j++)
if(x[i] == x[j]||x[i]>x[j])
w=0;
if(w)
{for(int i=1;i<=kk;i++)
out<<x[i]<<' ';
out<<'\n';}
}
void buck(int k)
{
for(int i=1;i<=n;i++)
{
x[k]=i;
if(k==kk)
afis();
else buck(k+1);
}
}
int main()
{
in>>n>>kk;
buck(1);
out.close();
return 0;
}