Cod sursa(job #1590037)
| Utilizator | Data | 4 februarie 2016 17:38:59 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
int N,K;
int sol[20];
void print(){
for(int i = 1;i <= K;i++){
printf("%d ",sol[i]);
}
printf("\n");
}
void back(int s, int p){
if(p == K+1){
print();
}else{
for(int i = s;i <= N;i++){
sol[p] = i;
back(i+1, p+1);
}
}
}
int main()
{
int n,i;
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d",&N,&K);
back(1, 1);
return 0;
}
