Cod sursa(job #190121)
Utilizator | Data | 20 mai 2008 06:02:56 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.15 kb |
#include<fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int main ()
{
int n,m,k,l,s,i,e;
fin>>n>>m;
int a[n];
s=0;
for(i=1;i<=n;i++)
s=s*2+1;
for(i=1;i<=s;i++)
{
for(k=0;k<=n;k++)
a[k]=0;
e=i;
k=1;
while(e)
{
a[k]=e%2;
k++;
e/=2;
}
for(k=1;k<=n;k++)
a[0]+=a[k];
if(a[0]==m)
{
for(k=1;k<=n;k++)
{
if(a[k]==1)
fout<<k<<" ";
}
fout<<"\n";
}
if(a[0]>m)
return 0;
}
//fout<<s;
return 0;
}