Cod sursa(job #1716623)
Utilizator | Data | 13 iunie 2016 10:52:43 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
int a[10001],n,k,i,j,s,x,y;
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
a[i]=i;
for(i=1;i<(1<<n);i++)
{
x=i; y=i; s=0;
for(j=1;j<=n;j++)
{
if(x%2==1) s++;
x/=2;
}
if(s==k){
for(j=1;j<=n;j++)
{
if(y%2==1) g<<a[j]<<" ";
y/=2;
}
g<<"\n";
}
}
return 0;
}