Cod sursa(job #1754534)
| Utilizator | Data | 8 septembrie 2016 13:59:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
using namespace std;
int *a,n,m;
void show(){
for(int i=1;i<=m;i++){
printf("%d ",a[i]);
}
printf("\n");
}
bool solve(int p){
if(p==m){show();return true;}
else{
for(int i=a[p]+1;i<=n;i++){
a[p+1]=i;
solve(p+1);
}
}
}
int main(){
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d",&n,&m);
a=(int*)malloc(sizeof(int*)*100000);
solve(0);
}
