Pagini recente » Cod sursa (job #861877) | Cod sursa (job #2311987) | Cod sursa (job #2883120) | Cod sursa (job #2258701) | Cod sursa (job #370219)
Cod sursa(job #370219)
#include<iostream>
#include<fstream>
using namespace std;
# define FIN "combinari.in"
# define FOUT "combinari.out"
int i,k,sol[20],ap[20],z,n,j,ok,K;
void print()
{
int i;
for (i = 1; i <= K; ++i) printf("%d ", sol[i]);
printf("\n");
}
/*int sort (int sol[])
{
ok = 1;
for(i=1;i<=k;i++)
for(j=i+1;j<=k;j++)
if (sol[i] > sol[j])
ok=0;
return ok;
} */
void back(int k)
{
int i;
for(i=sol[k-1]+1;i<=n;i++){
sol[k] = i;
if(k<K)
back(k+1);
else
print(); }
}
int main()
{
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
scanf("%d", &n);
scanf("%d", &K);
back(1);
return 0;
}