Pagini recente » Cod sursa (job #626826) | Cod sursa (job #723429) | Cod sursa (job #262499) | Cod sursa (job #2099180) | Cod sursa (job #1404096)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int a[25];
int main()
{
int n,k,i,vmax,j;
fin>>n>>k;
for(i=1;i<=k;i++) a[i] = i;
while(a[0]==0)
{
for(i=1;i<=k;i++) fout<<a[i]<<" ";
fout<<"\n";
vmax = n;
i = k;
while(a[i]==vmax)
{
vmax--;
i--;
}
a[i]++;
for(j = i+1; j <= k; j++)
a[j] = a[j-1] + 1;
}
fout.close();
return 0;
}