Pagini recente » Cod sursa (job #2719507) | Cod sursa (job #2746765) | Cod sursa (job #1313196) | Clasament luni_ora_10 | Cod sursa (job #1798078)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[1000];
int main()
{ int n, k, i, ok=1, j;
fin>>n;
fin>>k;
for (i=1;i<=k;i++)
v[i]=i;
while (ok==1)
{ for (i=1;i<=k;i++)
fout<<v[i]<<' ';
fout<<'\n';
for (i=k;i>=1 && v[i]==n-k+i;i--);
if(i<1)
ok=0;
else
{ v[i]++;
for(j=i+1;j<=k;j++)
v[j]=v[j-1]+1;
}
}
return 0;
}