Cod sursa(job #1570155)
Utilizator | Data | 16 ianuarie 2016 11:15:00 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
using namespace std;
int x[100];
int main()
{
int n,k,i,gata=0,maxx[100],j;
bool ok;
cin>>n>>k;
for(i=1;i<=k;++i)
{x[i]=i;maxx[i]=n-i+1;}
while(!gata)
{
for(i=1;i<=k;++i)
cout<<x[i]<<' ';
cout<<'\n';
ok=0;
for(i=k;i>=1;--i)
if(x[i]<maxx[i])
{
++x[i];ok=1;
for(j=i+1;j<=k;++j)
x[j]=x[j-1]+1;
break;
}
if(!ok)
gata=1;
}
return 0;
}