Cod sursa(job #2753230)
Utilizator | Data | 21 mai 2021 18:23:59 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,m;
void afiseaza(int x)
{
for(int j=1,k=1<<(n-1);j<=n;j++,k/=2)
{
if(k&x)
g<<j<<' ';
}
g<<'\n';
}
int main()
{
f>>n>>k;
m=(1<<n)-1;
for(int i=m;i>=1;i--)
if(__builtin_popcount(i)==k)
afiseaza(i);
return 0;
}