Cod sursa(job #1398670)
Utilizator | Data | 24 martie 2015 12:43:38 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int n, i, j, nr, k;
ifstream f("combinari.in");
ofstream g("combinari.out");
int main()
{ f>>n>>k;
for (i=0; i<(1<<n); ++i)
{ nr=0;
for (j=0; (1<<j)<=i; ++j)
if ((1<<j)&i)
++nr;
if (nr==k)
{ for (j=0; (1<<j)<=i; ++j)
if ((1<<j)&i)
g<<(j+1)<<' ';
g<<'\n';
}
}
return 0;
}