Cod sursa(job #1657316)
| Utilizator | Data | 20 martie 2016 13:20:06 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int n, k, t, v[19], i;
FILE* f;
int main()
{
f = fopen("combinari.in", "r");
fscanf(f, "%d%d", &n, &k);
f = freopen("combinari.out", "w", f);
t = 1;
v[0] = v[1] = 0;
while(t>0)
{
while(v[t] < n)
{
++v[t];
if(t == k)
{
for(i = 1; i<=k; ++i)
fprintf(f, "%d ", v[i]);
fprintf(f, "\n");
}
else
{
++t;
v[t] = v[t-1];
}
}
--t;
}
fclose(f);
return 0;
}