Pagini recente » Cod sursa (job #2640276) | Cod sursa (job #2985158) | Cod sursa (job #3142422) | Cod sursa (job #2571603) | Cod sursa (job #3195471)
#include <fstream>
using namespace std;
int N,K, x[100];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afis()
{
for (int i = 1; i<=K; i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void back(int k )
{
if ( k == K +1)
afis();
else
{
for (int i = x[k-1]+1; i <= N; i++)
{
x[k] = i;
back(k+1);
}
}
}
int main()
{
fin>>N>>K;
back(1);
return 0;
}