Cod sursa(job #334328)
Utilizator | Data | 26 iulie 2009 11:44:31 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<cstdio>
using namespace std;
int n,k,s[19];
void back(int l)
{if(l==k)
{for(int i=1;i<=k;i++) printf("%d ",s[i]);printf("\n");
}
else
{for(int j=s[l]+1;j<=n;j++)
{s[l+1]=j;
back(l+1);
}
}
}
int main()
{freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(0);
return 0;
}