Cod sursa(job #1266215)
| Utilizator | Data | 18 noiembrie 2014 14:57:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <cstdio>
using namespace std;
long s[20],n,k;
void back(long l)
{
long i;
if (k==l) {for (i=1;i<=k;i++) printf("%ld ",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("%ld%ld",&n,&k);
back(0);
return 0;
}
