Cod sursa(job #1316166)
Utilizator | Data | 13 ianuarie 2015 16:36:51 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int s[100],n,m;
void tipar(){
for(int i=1;i<=m;i++)
out<<s[i]<<" ";
out<<endl;
}
void bkt(int k){
if(k==m+1)
tipar();
else{
s[k]=s[k-1];
while(s[k]<n){
s[k]++;
bkt(k+1);
}
}
}
int main()
{
in>>n>>m;
bkt(1);
return 0;
}