Pagini recente » Cod sursa (job #2186171) | Cod sursa (job #2186064) | Cod sursa (job #1287570) | Cod sursa (job #1806765) | Cod sursa (job #1300326)
#include <fstream>
#include <iostream>
using namespace std;
int n, m, k, s[20];
void scrie(int n){
for(int i=1; i<=n; i++)
cout<<s[i]<<' ';
cout<<'\n';
}
int main()
{
ifstream cin ("combinari.in");
ofstream cout("combinari.out");
cin>>n>>m;
k=1;
s[k]=0;
while(k>0){
if(s[k]<n){
s[k]++;
if(k==m)
scrie(k);
else{
k++;
s[k]=s[k-1];
}
}
else
k--;
}
return 0;
}