Cod sursa(job #1550754)
Utilizator | Data | 14 decembrie 2015 17:56:35 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int x[20],n,m;
void back(int k)
{
if(k==m+1)
{
for(int i=1;i<k;i++)
printf("%d ",x[i]);
printf("\n");
return;
}
for(x[k]=x[k-1]+1;x[k]<=n;x[k]++)
back(k+1);
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
back(1);
return 0;
}