Cod sursa(job #2227158)
Utilizator | Data | 31 iulie 2018 13:33:51 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, k, power;
int main()
{
fin>>n>>k;
power = (1<<n)-1;
for ( int i = power; i >= 0; --i )
{
if ( __builtin_popcount(i) == k )
{
for ( int j = n-1; j >= 0; j-- )
if ( i&(1<<j) )
fout<<n-j<<" ";
fout<<'\n';
}
}
}