Pagini recente » Cod sursa (job #718546) | Cod sursa (job #2813253) | Cod sursa (job #1465670) | Statistici Cont Nou (contnounou) | Cod sursa (job #365314)
Cod sursa(job #365314)
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int i,j,ig,n,m,v[101];
int main()
{
in>>n>>m;
ig=0;
do
{
if(ig==0)
{
for(i=1;i<=m;i++) v[i]=i;
ig=1;
}
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;
}
if(i==0) ig=0;
}
if(ig!=0) for(i=1;i<=m;i++) out<<v[i]<<" ";
out<<"\n";
} while(ig==1);
in.close();
out.close();
return 0;
}