Cod sursa(job #170476)
Utilizator | Data | 2 aprilie 2008 20:01:09 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int x[19];
int n, K;
ofstream fout("combinari.out");
void Back(int k)
{
int i;
if (k == K+1)
{
for (i = 1; i <= K; i++)
fout << x[i] << " ";
fout << "\n";
}
else
{
for (i = x[k-1]+1; i <= n; i++)
{
x[k] = i;
Back(k+1);
}
}
}
int main()
{
ifstream fin("combinari.in");
fin >> n >> K;
fin.close();
x[0] = 0;
Back(1);
fout.close();
return 0;
}