Cod sursa(job #918819)
| Utilizator | Data | 19 martie 2013 09:49:05 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int s[19],n,m;
void scrie(){
for(int i=1;i<=m;i++)
out<<s[i]<<" ";
out<<'\n';
}
void init (int k){
if(k==0)
s[k]=0;
else
s[k]==s[k-1];
}
void bkt(int k){
if(k==m+1) scrie();
else{
init(k);
while(s[k]<n-m+k)
{ s[k]++;
bkt(k+1);
}
}
}
int main(){
in>>n>>m;
bkt(1);
}
