Cod sursa(job #1043560)
Utilizator | Data | 28 noiembrie 2013 18:54:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int s[21],n,k;
void back(int l)
{
int i;
if (l==k)
{
for (i=1; i<=k; i++) printf("%d ",s[i]);
printf("\n");
}
else
{
for (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;
}