Cod sursa(job #2271440)
Utilizator | Data | 28 octombrie 2018 16:55:58 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<stdio.h>
using namespace std;
int v[20];
void back(int l,int k,int n){
int i;
if(l==k)
{
for(i=1;i<=k;i++)
printf("%d ",v[i]);
printf("\n");
}
else
{
for(i=v[l]+1;i<=n;i++)
{
v[l+1]=i;
back(l+1,k,n);
}
}
}
int main()
{
int n,k;
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d",&n,&k);
back(0,k,n);
}