Pagini recente » Cod sursa (job #1484117) | Cod sursa (job #2195814) | Cod sursa (job #1669448) | Cod sursa (job #1533569) | Cod sursa (job #1908870)
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[100];
void afisare(int a[],int n)
{
int i;
for(i=1;i<=n;i++)
g<<a[i]<<' ';
g<<'\n';
}
void combinari(int i,int n,int k)
{
int valoareeee;
for(valoareeee=a[i-1]+1;valoareeee<=n-k+i;valoareeee++)
{
a[i]=valoareeee;
if(i<k)
combinari(i+1,n,k);
else
afisare(a,k);
}
}
int main()
{
int n,k;
f>>n>>k;
combinari(1,n,k);
return 0;
}