Cod sursa(job #278830)
Utilizator | Data | 12 martie 2009 15:43:54 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream.h>
int n ,m,i,ig,j,v[101];
void main()
{cin>>n>>m;
do{if(ig==0){ig=1;
for(i=1;i<=m;i++)v[i]=i;}
else{for(i=m;i>=1;i--)if(v[i]<n-m+i){v[i]=v[i]+1;
for(j=i+1;j<=m;j++)v[j]=v[j-1]+1;
break;
} //uita-te in caiet
if(i==0)ig=0;
}
if(ig!=0){for(i=1;i<=m;i++)cout<<v[i]<<" ";
cout<<endl;
}
}while(ig==1);
}