Pagini recente » Cod sursa (job #1463900) | Cod sursa (job #508922) | Diferente pentru problema/weightgraph intre reviziile 21 si 22 | Cod sursa (job #1055913) | Cod sursa (job #1225150)
#include <cstdio>
using namespace std;
int v[20],n,m,k,i;
int main()
{
freopen("combinari.in", "r" ,stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d",&n,&m);
k=1;
while(k)
{
if(v[k]==0) v[k]=v[k-1]+1;
else v[k]++;
if(v[k]>n)
{
v[k]=0;
k--;
continue;
}
if(k==m)
{
for(i=1;i<=m;i++) printf("%d ",v[i]);
printf("\n");
}
else k++;
}
return 0;
}