Cod sursa(job #613974)
| Utilizator | Data | 5 octombrie 2011 10:24:19 | |
|---|---|---|---|
| Problema | Combinari | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | bkt1_oct2011 | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n, sol[1000],k;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afisare(){
for(int i=1;i<=n;i++)
g<<sol[i]<<" ";
g<<"\n";
}
void bkt(int p){
if(p-1==n){
afisare();
return;
}
for(int i=1+sol[p-1];i<=n-k+p;i++){
sol[p]=i;
bkt(p+1);
}
}
int main(){
f>>n>>k;
bkt(1);
return 0;
}