Cod sursa(job #395156)
Utilizator | Data | 12 februarie 2010 12:15:30 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<cstdio>
const int N=1<<20;
int n,k,s[N];
void back(int l)
{
if (l==k)
{
for (int i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");
}
else
{
for (int i=s[l]+1;i<=n;i++)
{
s[l+1]=i;
back(l+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(0);
return 0;
}