Pagini recente » fmi-no-stress-2012/solutii/tamplar | fmi-no-stress-2012/solutii/tamplar | Monitorul de evaluare | fmi-no-stress-2012/solutii/vmin | Cod sursa (job #2078984)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int i,n,k,m,x[100];
inline void afis()
{
for(i=1;i<=m;i++)cout<<x[i]<<" ";
cout<<endl;
}
int cond(int k)
{
for(i=1;i<=k-1;i++)
if(x[k]<=x[i])return 0;
return 1;
}
void back()
{
k=1;
x[k]=0;
do
{
while(x[k]<n)
{
x[k]=x[k]+1;
if(cond(k))
if(k==m)afis();
else {k++;x[k]=0;}
}
k--;
}while(k>0);
}
int main()
{
cin>>n>>m;
back();
return 0;
}