Cod sursa(job #1697468)
Utilizator | Data | 2 mai 2016 10:27:21 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k, i, j, cont, a[20];
int main() {
in >> n >> k;
for(int i = 1; i < (1 << n); i++)
{
cont = 0;
for(int j = 0; j < n; j++)
if(i & (1 << j)) {
cont++;
a[cont]= j + 1;
}
if(cont == k) {
for(int i = 1; i <= k; i++) out << a[i] << ' ';
out << '\n';
}
}
}