Pagini recente » Cod sursa (job #834883) | Cod sursa (job #2504920) | Cod sursa (job #1983334) | Cod sursa (job #2004333) | Cod sursa (job #1250853)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x,j,i,a[20],n,l,k,p[20],s,h;
int main()
{
f>>n>>s;
for(i=1; i<=n; i++)
a[i]=i;
for(i=1; i<(1<<n); i++)
{
x=i;
h=0;
k=0;
for(j=1; j<=n; j++)
{
if(x%2==1)
{
h++;
p[++k]=a[j];
}
x/=2;
}
if(h==s)
{
for(l=1; l<=k; l++)
g<<p[l]<<" ";
g<<'\n';
}
}
return 0;
}