Pagini recente » Cod sursa (job #562790) | Cod sursa (job #2940559) | Cod sursa (job #527964) | Borderou de evaluare (job #1072026) | Cod sursa (job #1215972)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k;
int sir[100];
void combinari(int y)
{
for(int i = sir[y-1]+1; i <= n; i++)
{
sir[y] = i;
if (y < k) combinari(y+1);
if (y == k)
{
for (int j = 1; j <= y; j++)
g << sir[j] << " ";
g << "\n";
}
}
}
int main()
{
f >> n >> k;
combinari(1);
}