Pagini recente » Cod sursa (job #2304783) | Cod sursa (job #684831) | Cod sursa (job #3187842) | Cod sursa (job #3181235) | Cod sursa (job #1607824)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,v[19];
void inapoi(int l)
{
int i;
if(l==k)
{
for(i=1;i<=k;i++)
{
g<<v[i]<<" ";
}
g<<"\n";
}
else
{
for(i=v[l]+1;i<=n;i++)
{
v[l+1]=i;
inapoi(l+1);
}
}
}
int main()
{
f>>n>>k;
/*for(i=1;i<=n;i++)
{
v[i]=i;
}*/
inapoi(0);
return 0;
}