Cod sursa(job #1004837)
Utilizator | Data | 3 octombrie 2013 18:35:09 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[20],K,N,p,j,i,nr,x;
int main()
{
f>>N>>K;
for(i=1;i<=1<<N;i++)
{
x=i; nr=0; p=1;
for(j=1;j<=N;j++)
{if(x%2==1){
nr++;
a[p]=j;
p++;
}
x/=2;}
if(nr==K)
{for(j=1;j<=K;j++)
g<<a[j]<<" ";
g<<'\n';}
}
return 0;
}