Pagini recente » Cod sursa (job #579817) | Cod sursa (job #181739) | Cod sursa (job #2002310) | Cod sursa (job #1480705) | Cod sursa (job #2038277)
#include <iostream>
#include <cstdio>
using namespace std;
FILE *f = fopen("combinari.in", "r"),
*g = fopen("combinari.out", "w");
#define fs fscanf
#define fp fprintf
int n, v[100], kk;
bool verif(int k)
{
for(int i = 1; i < k; i ++)
{
if(v[i] >= v[k])
{
return 0;
}
}
return 1;
}
void afis()
{
for(int i = 1; i <= kk; i ++)
{
fp(g, "%d ", v[i]);
}
fp(g, "\n");
}
void bk(int k)
{
for(int i = 1; i <= n; i++)
{
v[k]=i;
if(verif(k))
{
if(k == kk)
{
afis();
}
else
bk(k+1);
}
else
continue;
}
}
int main()
{
fs(f, "%d%d", &n, &kk);
bk(1);
return 0;
}