Pagini recente » Cod sursa (job #2746318) | Cod sursa (job #1956590) | Cod sursa (job #1754231) | Cod sursa (job #1566785) | Cod sursa (job #154501)
Cod sursa(job #154501)
#include<iostream>
#include<fstream>
#include<cstdio>
using namespace std;
int n,k,x[19],i;
int cck(int i)
{
for(int j=1;j<i;j++)
if (x[j+1]<=x[j]) return 0;
return 1;
}
int main()
{
freopen("combinari.in", "r",stdin);
freopen("combinari.out", "w",stdout);
scanf("%d %d", &n, &k);
i=1;x[i]=0;
while(i>0)
{
while(x[i]<n)
{
x[i]++;
if (cck(i))
if (i==k) {for(int j=1;j<=k;j++)
printf("%d ", x[j]);
printf("\n");
}
else {i++;x[i]=0;}
}
i--;
}
fclose(stdin);
fclose(stdout);
}