Pagini recente » Cod sursa (job #2071690) | Cod sursa (job #233128) | Cod sursa (job #1296224) | Cod sursa (job #1177246) | Cod sursa (job #1404024)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,v[30],p;
bool sol[30];
void afis()
{
for (int i = 1; i <= p; i++) g <<v[i]<<" "; g<<"\n";
}
int combinari(int k)
{
if (k == p) afis();
for(int i = v[k] +1; i <= n; i++)
{
v[k+1] = i;
combinari(k+1);
}
}
int main()
{
f>>n>>p;
combinari(0);
return 0;
}