Cod sursa(job #1219777)
| Utilizator | Data | 15 august 2014 08:48:51 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("cambinari.out");
int N, K, V[20];
inline void Afisare()
{
for (int i=1; i<=N; i++)
fout << V[i] << ' ';
fout << '\n';
}
inline void Gen(int k)
{
if (k == K + 1)
{
Afisare();
}
else
{
for (int i=V[k-1] + 1; i<=N - K + k; i++)
{
V[k] = i;
Gen(k + 1);
}
}
}
int main()
{
fin >> N >> K;
Gen(1);
fout.close();
return 0;
}
