Cod sursa(job #342269)
| Utilizator | Data | 21 august 2009 09:22:35 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int N,K;
int A[20];
int vis[20];
void back(int k) {
if (k == K) {
for (int i=0;i<K;++i) printf("%d ",A[i]);
printf("\n");
} else {
for (int i=A[k-1]+1;i<=N;++i) {
A[k] = i;
back(k + 1);
}
}
}
int main() {
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&N,&K);
for (int i=1;i<=(N-K+1);++i) {
A[0] = i;
back(1);
}
fclose(stdin);
fclose(stdout);
return 0;
}