Cod sursa(job #1756140)
| Utilizator | Data | 11 septembrie 2016 22:28:08 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int f[101],x,k,i,m,j,ct;
void backt(int k)
{
int i;
if(k==m+1)
{
for(i=1;i<=m;i++)
printf("%d ",f[i]);
printf("\n");
return;
}
for(i=f[k-1]+1;i<=x;i++)
{
f[k]=i;
backt(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&x,&m);
backt(1);
return 0;
}
