Pagini recente » Istoria paginii runda/balanganel/clasament | Cod sursa (job #437283) | Cod sursa (job #3273426) | Cod sursa (job #2042498) | Cod sursa (job #1740480)
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, p, sol[105];
void afisare()
{
for(int i=1; i<=p; ++i)
fout<<sol[i]<<" ";
fout<<"\n";
}
void back(int k)
{
if(k==p+1)
{
afisare();
return;
}
for(int i=sol[k-1]+1; i<=n-p+k; ++i)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
fin>>n>>p;
back(1);
return 0;
}