Cod sursa(job #2570230)
Utilizator | Data | 4 martie 2020 15:40:01 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k;
int main()
{
f >> n >> k;
for(int i=1; i<(1<<n); i++)
{ int nr = 0;
for(int j=0; j<n; j++)
if((i & (1 << j)) != 0) nr++;
if(nr == k)
{ for(int j=0; j<n; j++)
if((i & (1 << j)) != 0) g << j+1 << ' ';
g << '\n';
}
}
return 0;
}