Cod sursa(job #897565)
| Utilizator | Data | 27 februarie 2013 21:14:56 | |
|---|---|---|---|
| Problema | Combinari | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.8 kb |
#include <stdio.h>
using namespace std;
bool c[100];
int main()
{
int n,k,n1,i,j,nr;
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
n1=0;
while(n1<n)
{
nr=0;
for(i=1;i<=n&&c[i]!=0;i++);
if(i==n+1)
n1=n;
else
{
c[i]=1;
for(j=i-1;j>=1;j--)
c[j]=0;
n1=0;
for(i=1;i<=n;i++)
if(c[i]==1)
nr++;
if(nr==k)
{
for(i=1;i<=n;i++)
if(c[i]==1)
{
printf("%d ",i);
}
printf("\n");
}
}
}
return 0;
}
