Cod sursa(job #400585)
| Utilizator | Data | 21 februarie 2010 17:41:12 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int main()
{
short k = 1, a[20] = {}, N, K;
ifstream f1("combinari.in");
freopen("combinari.out", "w", stdout);
f1 >> N >> K;
while(k) {
if (k == K + 1) {
for (int i = 1; i <= K; ++i) printf("%d ", a[i]);
printf("\n");
--k;
}
if (!a[k]) a[k] = a[k - 1] + 1;
else ++a[k];
if (a[k] > (N - K + k)) a[k--] = 0;
else ++k;
}
f1.close();
}
