Pagini recente » Cod sursa (job #1967863) | Borderou de evaluare (job #1504138) | Borderou de evaluare (job #2167186) | Cod sursa (job #323102) | Cod sursa (job #704276)
Cod sursa(job #704276)
#include<iostream>
#include<fstream>
using namespace std;
int n,k,a[20];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int afisare()
{
int i;
for(i=1;i<=k;i++)
{
fout<<a[i]<<" ";
}
fout<<endl;
return 0;
}
int back(int p)
{
int i,ok,j;
for(i=1;i<=k;i++)
{
a[i]=i;
}
ok=1;
while(ok)
{
if(ok)
{
afisare();
}
i=k;
while(i>0&&a[i]==n-k+i)
{
i--;
}
if(i==0) ok=0;
else
{
a[i]++;
for(j=i+1;j<=k;j++)
{
a[j]=a[j-1]+1;
}
}
}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}