Cod sursa(job #560263)
| Utilizator | Data | 18 martie 2011 13:32:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
#define maxN 20
ofstream g("combinari.out");
int N, K, x[maxN];
void afisare ()
{
for (int i = 1; i <= K; ++ i)
g << x[i] << " ";
g << '\n';
}
void back (int k)
{
for (int i = 1; i <= N; ++ i)
{
x[k] = i;
if (x[k] > x[k - 1])
if (k == K)
afisare();
else
back (k + 1);
}
}
int main()
{
ifstream f("combinari.in");
f >> N >> K;
back (1);
return 0;
}
